Adversarial Online Learning with noise
Not on the map. Why?
Abstract (arXiv)
We present and study models of adversarial online learning where the feedback observed by the learner is noisy, and the feedback is either full information feedback or bandit feedback. Specifically, we consider binary losses xored with the noise, which is a Bernoulli random variable. We consider both a constant noise rate and a variable noise rate. Our main results are tight regret bounds for learning with noise in the adversarial online learning model.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 22 Oct 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 1; 2023: 0; 2024: 2; 2025: 1.
7 papers.
- 2021Learning-to-learn non-convex piecewise-Lipschitz functionscited by 15
- 2022Learning on the Edge: Online Learning with Stochastic Feedback Graphscited by 12
- 2024A CMDP-within-online framework for Meta-Safe Reinforcement Learningcited by 12
- 2024Non-stochastic Bandits With Evolving Observationscited by 4
- 2021Adaptive Sampling for Heterogeneous Rank Aggregation from Noisy Pairwise Comparisonscited by 3
- 2021Online Learning with Uncertain Feedback Graphscited by 2
- 2025Asymptotically-Optimal Gaussian Bandits with Side Observationscited by 0
- 2025Asymptotically-Optimal Gaussian Bandits with Side Observations15 May 2025
- 2024Non-stochastic Bandits With Evolving Observations27 May 2024
- 2024A CMDP-within-online framework for Meta-Safe Reinforcement Learning26 May 2024
- 2022Learning on the Edge: Online Learning with Stochastic Feedback Graphs9 Oct 2022
- 2021Adaptive Sampling for Heterogeneous Rank Aggregation from Noisy Pairwise Comparisons8 Oct 2021
- 2021Learning-to-learn non-convex piecewise-Lipschitz functions19 Aug 2021
- 2021Online Learning with Uncertain Feedback Graphs15 Jun 2021