Combining Adversarial Guarantees and Stochastic Fast Rates in Online Learning

20 May 2016

Papers citing "Combining Adversarial Guarantees and Stochastic Fast Rates in Online Learning"

28 / 28 papers shown

Title
When Lower-Order Terms Dominate: Adaptive Expert Algorithms for Heavy-Tailed Losses Antoine Moulin Emmanuel Esposito Dirk van der Hoeven 57 0 0 02 Jun 2025
Online conformal prediction with decaying step sizes Anastasios Nikolas Angelopoulos Rina Foygel Barber Stephen Bates 235 27 0 02 Feb 2024
Exponential Stochastic Inequality Peter Grünwald M. F. Pérez-Ortiz Zakaria Mhammedi 59 1 0 27 Apr 2023
Modifying Squint for Prediction with Expert Advice in a Changing Environment Thom Neuteboom T. Erven 64 1 0 14 Sep 2022
Simultaneously Learning Stochastic and Adversarial Bandits under the Position-Based Model Chengju Chen Canzhe Zhao Shuai Li 37 5 0 12 Jul 2022
A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with Feedback Graphs Chloé Rouyer Dirk van der Hoeven Nicolò Cesa-Bianchi Yevgeny Seldin 90 17 0 01 Jun 2022
Online Learning with Bounded Recall Jon Schneider Kiran Vodrahalli 68 1 0 28 May 2022
PAC-Bayes, MAC-Bayes and Conditional Mutual Information: Fast rate bounds that handle general VC classes Peter Grünwald Thomas Steinke Lydia Zakynthinou 78 30 0 17 Jun 2021
Sequential Ski Rental Problem Anant Shah A. Rajkumar 24 3 0 13 Apr 2021
MetaGrad: Adaptation using Multiple Learning Rates in Online Learning T. Erven Wouter M. Koolen Dirk van der Hoeven ODL 107 23 0 12 Feb 2021
Impossible Tuning Made Possible: A New Expert Algorithm and Its Applications Liyu Chen Haipeng Luo Chen-Yu Wei 115 45 0 01 Feb 2021
Stochastic Online Convex Optimization. Application to probabilistic time series forecasting Olivier Wintenberger AI4TS 103 8 0 01 Feb 2021
Risk-Monotonicity in Statistical Learning Zakaria Mhammedi 128 8 0 28 Nov 2020
Relaxing the I.I.D. Assumption: Adaptively Minimax Optimal Regret via Root-Entropic Regularization Blair Bilodeau Jeffrey Negrea Daniel M. Roy 24 11 0 13 Jul 2020
Generalization Bounds via Information Density and Conditional Information Density Fredrik Hellström G. Durisi 130 67 0 16 May 2020
Malicious Experts versus the multiplicative weights algorithm in online prediction Erhan Bayraktar H. Vincent Poor Xin Zhang 68 9 0 18 Mar 2020
Prediction with Corrupted Expert Advice I Zaghloul Amir Idan Attias Tomer Koren Roi Livni Yishay Mansour 69 40 0 24 Feb 2020
Fast Rates for Online Prediction with Abstention Gergely Neu Nikita Zhivotovskiy 74 16 0 28 Jan 2020
PAC-Bayes Un-Expected Bernstein Inequality Zakaria Mhammedi Peter Grünwald Benjamin Guedj 72 47 0 31 May 2019
Lipschitz Adaptivity with Multiple Learning Rates in Online Learning Zakaria Mhammedi Wouter M. Koolen T. Erven 87 36 0 27 Feb 2019
Beating Stochastic and Adversarial Semi-bandits Optimally and Simultaneously Julian Zimmert Haipeng Luo Chen-Yu Wei 244 82 0 25 Jan 2019
On the optimality of the Hedge algorithm in the stochastic regime Jaouad Mourtada Stéphane Gaïffas 72 53 0 05 Sep 2018
Efficient online algorithms for fast-rate regret bounds under sparsity Pierre Gaillard Olivier Wintenberger 46 10 0 23 May 2018
Best of many worlds: Robust model selection for online supervised learning Vidya Muthukumar Mitas Ray A. Sahai Peter L. Bartlett OffRL 72 8 0 22 May 2018
Fast Rates of ERM and Stochastic Approximation: Adaptive to Error Bound Conditions Mingrui Liu Xiaoxuan Zhang Lijun Zhang Rong Jin Tianbao Yang 86 25 0 11 May 2018
The Many Faces of Exponential Weights in Online Learning Dirk van der Hoeven T. Erven W. Kotłowski OffRL 77 50 0 21 Feb 2018
Fast Rates for General Unbounded Loss Functions: from ERM to Generalized Bayes Peter Grünwald Nishant A. Mehta 227 73 0 01 May 2016
MetaGrad: Multiple Learning Rates in Online Learning T. Erven Wouter M. Koolen ODL 121 98 0 29 Apr 2016