Follow the Leader If You Can, Hedge If You Must
Not on the map. Why?
Abstract (arXiv)
Follow-the-Leader (FTL) is an intuitive sequential prediction strategy that guarantees constant regret in the stochastic setting, but has terrible performance for worst-case data. Other hedging strategies have better worst-case guarantees but may perform much worse than FTL if the data are not maximally adversarial. We introduce the FlipFlop algorithm, which is the first method that provably combines the best of both worlds. As part of our construction, we develop AdaHedge, which is a new way of dynamically tuning the learning rate in Hedge without using the doubling trick. AdaHedge refines a method by Cesa-Bianchi, Mansour and Stoltz (2007), yielding slightly improved worst-case guarantees. By interleaving AdaHedge and FTL, the FlipFlop algorithm achieves regret within a constant factor of the FTL regret, without sacrificing AdaHedge's worst-case guarantees. AdaHedge and FlipFlop do not need to know the range of the losses in advance; moreover, unlike earlier methods, both have the intuitive property that the issued weights are invariant under rescaling and translation of the losses. The losses are also allowed to be negative, in which case they may be interpreted as gains.
Key facts. Cited by 69 papers in the map (data through 13 Oct 2026). First posted on arXiv 3 Jan 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 16; 2022: 10; 2023: 9; 2024: 11; 2025: 10; 2026: 13.
69 papers.
Sort:
By area:
- 2021Online Learning with Optimism and Delaycited by 33
- 2021On Optimal Robustness to Adversarial Corruption in Online Decision Problemscited by 20
- 2021Efficient Pure Exploration for Combinatorial Bandits with Semi-Bandit Feedbackcited by 19
- 2021Online Double Oraclecited by 18
- 2021A/B/n Testing with Control in the Presence of Subpopulationscited by 17
- 2022Adaptive Best-of-Both-Worlds Algorithm for Heavy-Tailed Multi-Armed Banditscited by 17
- 2021Off-policy Confidence Sequencescited by 15
- 2021Scale Free Adversarial Multi Armed Banditscited by 12
- 2022Adversarially Robust Multi-Armed Bandit Algorithm with Variance-Dependent Regret Boundscited by 12
- 2021Dealing With Misspecification In Fixed-Confidence Linear Top-m Identificationcited by 11
- 2023Best-of-three-worlds Analysis for Linear Bandits with Follow-the-regularized-leader Algorithmcited by 11
- 2024Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worldscited by 11
38 more
- 2024Conformal online model aggregationcited by 11
- 2022Exploiting the Curvature of Feasible Sets for Faster Projection-Free Online Learningcited by 10
- 2022Optimistic No-regret Algorithms for Discrete Cachingcited by 10
- 2025Adaptive Prediction-Powered AutoEval with Reliability and Efficiency Guaranteescited by 10
- 2021Minimax Optimal Quantile and Semi-Adversarial Regret via Root-Logarithmic Regularizerscited by 8
- 2022A Regret-Variance Trade-Off in Online Learningcited by 7
- 2022Adaptive Oracle-Efficient Online Learningcited by 7
- 2023Banker Online Mirror Descent: A Universal Approach for Delayed Online Bandit Learningcited by 7
- 2023Accelerated Rates between Stochastic and Adversarial Online Convex Optimizationcited by 7
- 2022Online Learning to Transport via the Minimal Selection Principlecited by 6
- 2024Adaptive Online Experimental Design for Causal Discoverycited by 5
- 2024Conformal Distributed Remote Inference in Sensor Networks Under Reliability and Communication Constraintscited by 5
- 2025Gradient-Variation Online Adaptivity for Accelerated Optimization with H"older Smoothnesscited by 5
- 2021Conic Blackwell Algorithm: Parameter-Free Convex-Concave Saddle-Point Solvingcited by 4
- 2021Robust Online Convex Optimization in the Presence of Outlierscited by 4
- 2021Isotuning With Applications To Scale-Free Online Learningcited by 4
- 2022Solving optimization problems with Blackwell approachabilitycited by 4
- 2025Valid Selection among Conformal Setscited by 4
- 2025Universal Dynamic Regret and Constraint Violation Bounds for Constrained Online Convex Optimizationcited by 4
- 2021Sequential Ski Rental Problemcited by 3
- 2023Improved Algorithms for Adversarial Bandits with Unbounded Lossescited by 3
- 2023Optimal Exploration is no harder than Thompson Samplingcited by 3
- 2024A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of Theta(T2/3) and its Application to Best-of-Both-Worldscited by 3
- 2022Online Learning with Bounded Recallcited by 2
- 2023Policy Optimization via Adv2: Adversarial Learning on Advantage Functionscited by 2
- 2024Scale-free Adversarial Reinforcement Learningcited by 2
- 2025Follow-the-Perturbed-Leader Approaches Best-of-Both-Worlds for the m-Set Semi-Bandit Problemscited by 2
- 2025Constrained Pareto Set Identification with Bandit Feedbackcited by 2
- 2026Prediction with Expert Advice: Anytime Regret with Many Experts Matches the Fixed-Time Constantcited by 2
- 2021Model Compression for Dynamic Forecast Combinationcited by 1
- 2021Best-Case Lower Bounds in Online Learningcited by 1
- 2021Scale-Free Adversarial Multi-Armed Bandit with Arbitrary Feedback Delayscited by 1
- 2022Choosing Answers in varepsilon-Best-Answer Identification for Linear Banditscited by 1
- 2023Online Resource Allocation: Bandits feedback and Advice on Time-varying Demandscited by 1
- 2023No-Regret Caching with Noisy Request Estimatescited by 1
- 2024An Online Gradient-Based Caching Policy with Logarithmic Complexity and Regret Guaranteescited by 1
- 2024Tracking solutions of time-varying variational inequalitiescited by 1
- 2025Efficient and Optimal No-Regret Caching under Partial Observationcited by 1
50 most cited of 69 All 69 (JSON)
- 2026Which LLM to pick? Online Active Model Selection for Large Language Models1 Oct 2026
- 2026Parameter-Free Interval-Dynamic Regret under Heavy-Tailed Noise30 Sep 2026
- 2026FOCUS: Fixed-Confidence Online Causal Learning Using Sequential Adaptive Interventions26 Sep 2026
- 2026Prediction with Expert Advice: Anytime Regret with Many Experts Matches the Fixed-Time Constant23 Sep 2026
- 2026Online Adaptive Kernel Mixing for Gaussian Process Decision Making17 Sep 2026
- 2026Parameter-Free Dynamic Regret under Heavy-Tailed Noise29 Jul 2026
- 2026Online Convex Optimization with Sublinear Noisy Probes12 Jun 2026
- 2026Agile Online Model Selection: Resolving Adaptation Lag via Safeguarded Large Learning Rates26 May 2026
- 2026Instance-Adaptive Online Multicalibration10 May 2026
- 2026Online Localized Conformal Prediction6 May 2026
- 2026Gradient-Variation Regret Bounds for Unconstrained Online Learning13 Apr 2026
- 2026Learning Safely Without Knowing the World:COMPASS-Hedge22 Mar 2026
38 more
- 2026Adaptive Quality-Diversity Trade-offs for Large-Scale Batch Recommendation2 Feb 2026
- 2025Gradient-Variation Online Adaptivity for Accelerated Optimization with H"older Smoothness4 Nov 2025
- 2025Universal Dynamic Regret and Constraint Violation Bounds for Constrained Online Convex Optimization2 Oct 2025
- 2025Valid Selection among Conformal Sets25 Jun 2025
- 2025Constrained Pareto Set Identification with Bandit Feedback9 Jun 2025
- 2025Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget3 Jun 2025
- 2025When Lower-Order Terms Dominate: Adaptive Expert Algorithms for Heavy-Tailed Losses2 Jun 2025
- 2025Adaptive Prediction-Powered AutoEval with Reliability and Efficiency Guarantees24 May 2025
- 2025Follow-the-Perturbed-Leader Approaches Best-of-Both-Worlds for the m-Set Semi-Bandit Problems9 Apr 2025
- 2025Efficient and Optimal No-Regret Caching under Partial Observation4 Mar 2025
- 2025Online Algorithm for Aggregating Experts' Predictions with Unbounded Quadratic Loss11 Jan 2025
- 2024State-free Reinforcement Learning27 Sep 2024
- 2024Conformal Distributed Remote Inference in Sensor Networks Under Reliability and Communication Constraints12 Sep 2024
- 2024Narrowing the Gap between Adversarial and Stochastic MDPs via Policy Optimization8 Jul 2024
- 2024Tracking solutions of time-varying variational inequalities20 Jun 2024
- 2024A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of Theta(T2/3) and its Application to Best-of-Both-Worlds30 May 2024
- 2024Adaptive Online Experimental Design for Causal Discovery19 May 2024
- 2024An Online Gradient-Based Caching Policy with Logarithmic Complexity and Regret Guarantees2 May 2024
- 2024Conformal online model aggregation22 Mar 2024
- 2024Scale-free Adversarial Reinforcement Learning1 Mar 2024
- 2024Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds1 Mar 2024
- 2024The SMART approach to instance-optimal online learning27 Feb 2024
- 2023Policy Optimization via Adv2: Adversarial Learning on Advantage Functions25 Oct 2023
- 2023Optimal Exploration is no harder than Thompson Sampling9 Oct 2023
- 2023Improved Algorithms for Adversarial Bandits with Unbounded Losses3 Oct 2023
- 2023No-Regret Caching with Noisy Request Estimates5 Sep 2023
- 2023Best-of-three-worlds Analysis for Linear Bandits with Follow-the-regularized-leader Algorithm13 Mar 2023
- 2023Accelerated Rates between Stochastic and Adversarial Online Convex Optimization6 Mar 2023
- 2023Achieving Better Regret against Strategic Adversaries13 Feb 2023
- 2023Online Resource Allocation: Bandits feedback and Advice on Time-varying Demands8 Feb 2023
- 2023Banker Online Mirror Descent: A Universal Approach for Delayed Online Bandit Learning25 Jan 2023
- 2022Adaptive Oracle-Efficient Online Learning17 Oct 2022
- 2022Optimistic No-regret Algorithms for Discrete Caching15 Aug 2022
- 2022Adversarially Robust Multi-Armed Bandit Algorithm with Variance-Dependent Regret Bounds14 Jun 2022
- 2022Choosing Answers in varepsilon-Best-Answer Identification for Linear Bandits9 Jun 2022
- 2022A Regret-Variance Trade-Off in Online Learning6 Jun 2022
- 2022Online Learning with Bounded Recall28 May 2022
- 2022Exploiting the Curvature of Feasible Sets for Faster Projection-Free Online Learning23 May 2022
50 newest of 69 All 69 (JSON)
- 2024Scale-free Adversarial Reinforcement Learningcited by 2
- 2024State-free Reinforcement Learningcited by 0
- 2024State-free Reinforcement Learning27 Sep 2024
- 2024Scale-free Adversarial Reinforcement Learning1 Mar 2024
- 2021Online Learning with Optimism and Delaycited by 33
- 2021On Optimal Robustness to Adversarial Corruption in Online Decision Problemscited by 20
- 2021Efficient Pure Exploration for Combinatorial Bandits with Semi-Bandit Feedbackcited by 19
- 2021Online Double Oraclecited by 18
- 2021A/B/n Testing with Control in the Presence of Subpopulationscited by 17
- 2022Adaptive Best-of-Both-Worlds Algorithm for Heavy-Tailed Multi-Armed Banditscited by 17
- 2021Off-policy Confidence Sequencescited by 15
- 2021Scale Free Adversarial Multi Armed Banditscited by 12
- 2022Adversarially Robust Multi-Armed Bandit Algorithm with Variance-Dependent Regret Boundscited by 12
- 2021Dealing With Misspecification In Fixed-Confidence Linear Top-m Identificationcited by 11
- 2023Best-of-three-worlds Analysis for Linear Bandits with Follow-the-regularized-leader Algorithmcited by 11
- 2024Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worldscited by 11
12 most cited of 67 All 67 (JSON)
- 2026Which LLM to pick? Online Active Model Selection for Large Language Models1 Oct 2026
- 2026Parameter-Free Interval-Dynamic Regret under Heavy-Tailed Noise30 Sep 2026
- 2026FOCUS: Fixed-Confidence Online Causal Learning Using Sequential Adaptive Interventions26 Sep 2026
- 2026Prediction with Expert Advice: Anytime Regret with Many Experts Matches the Fixed-Time Constant23 Sep 2026
- 2026Online Adaptive Kernel Mixing for Gaussian Process Decision Making17 Sep 2026
- 2026Parameter-Free Dynamic Regret under Heavy-Tailed Noise29 Jul 2026
- 2026Online Convex Optimization with Sublinear Noisy Probes12 Jun 2026
- 2026Agile Online Model Selection: Resolving Adaptation Lag via Safeguarded Large Learning Rates26 May 2026
- 2026Instance-Adaptive Online Multicalibration10 May 2026
- 2026Online Localized Conformal Prediction6 May 2026
- 2026Gradient-Variation Regret Bounds for Unconstrained Online Learning13 Apr 2026
- 2026Learning Safely Without Knowing the World:COMPASS-Hedge22 Mar 2026
12 newest of 67 All 67 (JSON)