mlsanityData to 13 Oct 2026

Follow the Leader If You Can, Hedge If You Must

arXiv 1301.0534 ↗First posted 3 Jan 2013cs.LG stat.MLcited by 69

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

Cited by year (2026 to 13 Oct)

Citing papers per year: 2021: 16; 2022: 10; 2023: 9; 2024: 11; 2025: 10; 2026: 13.

69 papers.

Sort:

By area:

  1. 2021Online Learning with Optimism and Delaycited by 33
  2. 2021On Optimal Robustness to Adversarial Corruption in Online Decision Problemscited by 20
  3. 2021Efficient Pure Exploration for Combinatorial Bandits with Semi-Bandit Feedbackcited by 19
  4. 2021Online Double Oraclecited by 18
  5. 2021A/B/n Testing with Control in the Presence of Subpopulationscited by 17
  6. 2022Adaptive Best-of-Both-Worlds Algorithm for Heavy-Tailed Multi-Armed Banditscited by 17
  7. 2021Off-policy Confidence Sequencescited by 15
  8. 2021Scale Free Adversarial Multi Armed Banditscited by 12
  9. 2022Adversarially Robust Multi-Armed Bandit Algorithm with Variance-Dependent Regret Boundscited by 12
  10. 2021Dealing With Misspecification In Fixed-Confidence Linear Top-m Identificationcited by 11
  11. 2023Best-of-three-worlds Analysis for Linear Bandits with Follow-the-regularized-leader Algorithmcited by 11
  12. 2024Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worldscited by 11
38 more
  1. 2024Conformal online model aggregationcited by 11
  2. 2022Exploiting the Curvature of Feasible Sets for Faster Projection-Free Online Learningcited by 10
  3. 2022Optimistic No-regret Algorithms for Discrete Cachingcited by 10
  4. 2025Adaptive Prediction-Powered AutoEval with Reliability and Efficiency Guaranteescited by 10
  5. 2021Minimax Optimal Quantile and Semi-Adversarial Regret via Root-Logarithmic Regularizerscited by 8
  6. 2022A Regret-Variance Trade-Off in Online Learningcited by 7
  7. 2022Adaptive Oracle-Efficient Online Learningcited by 7
  8. 2023Banker Online Mirror Descent: A Universal Approach for Delayed Online Bandit Learningcited by 7
  9. 2023Accelerated Rates between Stochastic and Adversarial Online Convex Optimizationcited by 7
  10. 2022Online Learning to Transport via the Minimal Selection Principlecited by 6
  11. 2024Adaptive Online Experimental Design for Causal Discoverycited by 5
  12. 2024Conformal Distributed Remote Inference in Sensor Networks Under Reliability and Communication Constraintscited by 5
  13. 2025Gradient-Variation Online Adaptivity for Accelerated Optimization with H"older Smoothnesscited by 5
  14. 2021Conic Blackwell Algorithm: Parameter-Free Convex-Concave Saddle-Point Solvingcited by 4
  15. 2021Robust Online Convex Optimization in the Presence of Outlierscited by 4
  16. 2021Isotuning With Applications To Scale-Free Online Learningcited by 4
  17. 2022Solving optimization problems with Blackwell approachabilitycited by 4
  18. 2025Valid Selection among Conformal Setscited by 4
  19. 2025Universal Dynamic Regret and Constraint Violation Bounds for Constrained Online Convex Optimizationcited by 4
  20. 2021Sequential Ski Rental Problemcited by 3
  21. 2023Improved Algorithms for Adversarial Bandits with Unbounded Lossescited by 3
  22. 2023Optimal Exploration is no harder than Thompson Samplingcited by 3
  23. 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
  24. 2022Online Learning with Bounded Recallcited by 2
  25. 2023Policy Optimization via Adv2: Adversarial Learning on Advantage Functionscited by 2
  26. 2024Scale-free Adversarial Reinforcement Learningcited by 2
  27. 2025Follow-the-Perturbed-Leader Approaches Best-of-Both-Worlds for the m-Set Semi-Bandit Problemscited by 2
  28. 2025Constrained Pareto Set Identification with Bandit Feedbackcited by 2
  29. 2026Prediction with Expert Advice: Anytime Regret with Many Experts Matches the Fixed-Time Constantcited by 2
  30. 2021Model Compression for Dynamic Forecast Combinationcited by 1
  31. 2021Best-Case Lower Bounds in Online Learningcited by 1
  32. 2021Scale-Free Adversarial Multi-Armed Bandit with Arbitrary Feedback Delayscited by 1
  33. 2022Choosing Answers in varepsilon-Best-Answer Identification for Linear Banditscited by 1
  34. 2023Online Resource Allocation: Bandits feedback and Advice on Time-varying Demandscited by 1
  35. 2023No-Regret Caching with Noisy Request Estimatescited by 1
  36. 2024An Online Gradient-Based Caching Policy with Logarithmic Complexity and Regret Guaranteescited by 1
  37. 2024Tracking solutions of time-varying variational inequalitiescited by 1
  38. 2025Efficient and Optimal No-Regret Caching under Partial Observationcited by 1

50 most cited of 69 All 69 (JSON)