ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1810.10895
  4. Cited By
Almost Optimal Algorithms for Linear Stochastic Bandits with
  Heavy-Tailed Payoffs

Almost Optimal Algorithms for Linear Stochastic Bandits with Heavy-Tailed Payoffs

25 October 2018
Han Shao
Xiaotian Yu
Irwin King
Michael R. Lyu
ArXivPDFHTML

Papers citing "Almost Optimal Algorithms for Linear Stochastic Bandits with Heavy-Tailed Payoffs"

4 / 4 papers shown
Title
Catoni Contextual Bandits are Robust to Heavy-tailed Rewards
Catoni Contextual Bandits are Robust to Heavy-tailed Rewards
Chenlu Ye
Yujia Jin
Alekh Agarwal
Tong Zhang
163
0
0
04 Feb 2025
Model Selection in Contextual Stochastic Bandit Problems
Model Selection in Contextual Stochastic Bandit Problems
Aldo Pacchiano
My Phan
Yasin Abbasi-Yadkori
Anup B. Rao
Julian Zimmert
Tor Lattimore
Csaba Szepesvári
152
94
0
03 Mar 2020
A Scale Free Algorithm for Stochastic Bandits with Bounded Kurtosis
A Scale Free Algorithm for Stochastic Bandits with Bounded Kurtosis
Tor Lattimore
49
19
0
27 Mar 2017
Bandits with heavy tail
Bandits with heavy tail
Sébastien Bubeck
Nicolò Cesa-Bianchi
Gábor Lugosi
170
290
0
08 Sep 2012
1