Prediction with expert advice under additive noise
Alankrita Bhatt, Victoria Kostina
Abstract
Prediction with expert advice serves as a fundamental model in online learning and sequential decision-making. However, in many real-world settings, this classical model proves insufficient as the feedback available to the decision-maker is often subject to noise, errors, or communication constraints. This paper provides fundamental limits on performance, quantified by the regret, in the case when the feedback is corrupted by an additive noise. Our general analysis achieves sharp regret bounds for canonical examples of such additive noise as the Gaussian distribution, the uniform distribution, and a general noise with a log-concave density. This analysis demonstrates how different noise characteristics affect regret bounds and identifies how the regret fundamentally scales as a function of the properties of the noise distribution.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 7323db9f-1a24-4dc7-b4b8-4f12822288e1Cited by top-tier papers1
Ask how each one uses itBuilds on3
- Smoothed Analysis of Online and Differentially Private LearningNika Haghtalab, Tim Roughgarden, Abhishek ShettyNeurIPS 2020 · 66 citations
- Prediction with Corrupted Expert AdviceIdan Amir, Idan Attias, Tomer Koren, Yishay Mansour et al.NeurIPS 2020 · 49 citations
- Smoothed Analysis of Sequential Probability AssignmentAlankrita Bhatt, Nika Haghtalab, Abhishek ShettyNeurIPS 2023 · 11 citations
Related papers
- On Optimal Robustness to Adversarial Corruption in Online Decision ProblemsShinji ItoNeurIPS 2021 · 28 citations
- Unconstrained Robust Online Convex OptimizationJiujia Zhang, Ashok CutkoskyICML 2025
- Online Linear Regression with Paid Stochastic FeaturesNadav Merlis, Kyoungseok Jang, Nicolò Cesa-BianchiAAAI 2026
- When Lower-Order Terms Dominate: Adaptive Expert Algorithms for Heavy-Tailed LossesAntoine Moulin, Emmanuel Esposito, Dirk van der HoevenNeurIPS 2025 · 1 citation
- Making Non-Stochastic Control (Almost) as Easy as StochasticMax SimchowitzNeurIPS 2020 · 44 citations
