Prediction with expert advice under additive noise
Alankrita Bhatt, Victoria Kostina
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper3
- Smoothed Analysis of Online and Differentially Private LearningNika Haghtalab, Tim Roughgarden, Abhishek ShettyNeurIPS 2020 · 被引用 66 次
- Prediction with Corrupted Expert AdviceIdan Amir, Idan Attias, Tomer Koren, Yishay Mansour 等NeurIPS 2020 · 被引用 49 次
- Smoothed Analysis of Sequential Probability AssignmentAlankrita Bhatt, Nika Haghtalab, Abhishek ShettyNeurIPS 2023 · 被引用 11 次
相关 Paper
- On Optimal Robustness to Adversarial Corruption in Online Decision ProblemsShinji ItoNeurIPS 2021 · 被引用 28 次
- 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 次
- Making Non-Stochastic Control (Almost) as Easy as StochasticMax SimchowitzNeurIPS 2020 · 被引用 44 次
