ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2110.13876
  4. Cited By
Breaking the Moments Condition Barrier: No-Regret Algorithm for Bandits
  with Super Heavy-Tailed Payoffs

Breaking the Moments Condition Barrier: No-Regret Algorithm for Bandits with Super Heavy-Tailed Payoffs

26 October 2021
Han Zhong
Jiayi Huang
Lin F. Yang
Liwei Wang
ArXiv (abs)PDFHTML

Papers citing "Breaking the Moments Condition Barrier: No-Regret Algorithm for Bandits with Super Heavy-Tailed Payoffs"

6 / 6 papers shown
Title
Online Learning to Rank under Corruption: A Robust Cascading Bandits Approach
Online Learning to Rank under Corruption: A Robust Cascading Bandits Approach
Fatemeh Ghaffari
Siddarth Sitaraman
Xutong Liu
Xuchuang Wang
Mohammad Hajiesmaili
20
0
0
04 Nov 2025
Robust Offline Reinforcement learning with Heavy-Tailed Rewards
Robust Offline Reinforcement learning with Heavy-Tailed RewardsInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2023
Jin Zhu
Runzhe Wan
Zhengling Qi
Shuang Luo
C. Shi
OffRL
188
2
0
28 Oct 2023
Efficient Algorithms for Generalized Linear Bandits with Heavy-tailed
  Rewards
Efficient Algorithms for Generalized Linear Bandits with Heavy-tailed RewardsNeural Information Processing Systems (NeurIPS), 2023
Bo Xue
Yimu Wang
Yuanyu Wan
Jinfeng Yi
Lijun Zhang
130
9
0
28 Oct 2023
Towards Robust Offline Reinforcement Learning under Diverse Data
  Corruption
Towards Robust Offline Reinforcement Learning under Diverse Data Corruption
Rui Yang
Han Zhong
Jiawei Xu
Amy Zhang
Chong Zhang
Lei Han
Tong Zhang
OffRLOnRL
300
22
0
19 Oct 2023
Tackling Heavy-Tailed Rewards in Reinforcement Learning with Function
  Approximation: Minimax Optimal and Instance-Dependent Regret Bounds
Tackling Heavy-Tailed Rewards in Reinforcement Learning with Function Approximation: Minimax Optimal and Instance-Dependent Regret BoundsNeural Information Processing Systems (NeurIPS), 2023
Jiayi Huang
Han Zhong
Liwei Wang
Lin F. Yang
222
11
0
12 Jun 2023
Implicitly normalized forecaster with clipping for linear and non-linear
  heavy-tailed multi-armed bandits
Implicitly normalized forecaster with clipping for linear and non-linear heavy-tailed multi-armed banditsComputational Management Science (CMS), 2023
Yuriy Dorn
Kornilov Nikita
N. Kutuzov
A. Nazin
Eduard A. Gorbunov
Alexander Gasnikov
152
5
0
11 May 2023
1