Research map / Bandits and online learning / Multi-armed bandits
Almost Optimal Algorithms for Linear Stochastic Bandits with Heavy-Tailed Payoffs
Han Shao, Xiaotian Yu, Irwin King, Michael R Lyu
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use MENU instead of MoM | Linear stochastic bandits with heavy-tailed payoffs · Synthetic datasets S1 and S2 | cumulative payoffs | Improved |
| Use TOFU instead of CRT | Linear stochastic bandits with heavy-tailed payoffs · Synthetic datasets S3 and S4 | cumulative payoffs | Improved |
Closest papers by meaning
- No-Regret Algorithms for Heavy-Tailed Linear Bandits (ICML 2016 · similarity 0.92)
- Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards (NeurIPS 2025 · similarity 0.91)
- Stochastic Linear Bandits with Parameter Noise (ICML 2026 · similarity 0.91)
- Breaking the Moments Condition Barrier: No-Regret Algorithm for Bandits with Super Heavy-Tailed Payoffs (NeurIPS 2021 · similarity 0.91)
- Heavy-Tailed Linear Bandits: Huber Regression with One-Pass Update (ICML 2025 · similarity 0.89)
- Bayesian Regret Minimization in Offline Bandits (ICML 2024 · similarity 0.88)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
