Adaptive Learning Rates with Surrogate Probability for Follow-the-Perturbed-Leader
Not on the map. Why?
Abstract (arXiv)
Follow-the-regularized-leader framework has shown effectiveness and flexibility in online learning problems, where the choice of learning rates are known to be crucial. Recently, adaptive learning rates defined in terms of the arm-selection probabilities, obtained by solving convex optimization, have achieved improved best-of-both-worlds (BOBW) guarantees in various bandit problems. In contrast, BOBW guarantees for its computationally efficient alternative, follow-the-perturbed-leader (FTPL), remain relatively limited since its optimization-free nature ironically makes the design of adaptive, probability-dependent learning rates non-trivial. To address this challenge, we propose an adaptive learning rate for FTPL by introducing surrogate probability functions that can be computed only from the available quantities, without requiring the exact probabilities. Based on these learning rates with surrogate functions, we provide the BOBW guarantee for FTPL with Pareto perturbations for any shape parameter α >1, generalizing prior results restricted to specific choices of α=2. We further show the BOBW guarantees for FTPL with adaptive learning rates in the bandit problem with expert advices. Our approach preserves the computational simplicity of FTPL while enabling probability-dependent adaptivity, and the surrogate-based methodology may be of independent interest in other algorithmic frameworks beyond FTPL and learning rate designs.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 20 of its 37 references that are in the map. First posted on arXiv 4 Jun 2026.
Builds on
20 of 37 references.
References · 20
- 2018Tsallis-INF: An Optimal Algorithm for Stochastic and Adversarial Banditscited by 123
- 2018More Adaptive Algorithms for Adversarial Banditscited by 114
- 2014A Second-order Bound with Excess Lossescited by 91
- 2019Beating Stochastic and Adversarial Semi-bandits Optimally and Simultaneouslycited by 53
- 2017An Improved Parametrization and Analysis of the EXP3++ Algorithm for Stochastic and Adversarial Banditscited by 43
- 2023A Blackbox Approach to Best of Both Worlds in Bandits and Beyondcited by 29
- 2023Improved Best-of-Both-Worlds Guarantees for Multi-Armed Bandits: FTRL with General Regularizers and Multiple Optimal Armscited by 18
- 2022Adaptive Best-of-Both-Worlds Algorithm for Heavy-Tailed Multi-Armed Banditscited by 17
- 2015Importance weighting without importance weights: An efficient algorithm for combinatorial semi-banditscited by 15
- 2023Stability-penalty-adaptive follow-the-regularized-leader: Sparsity, game-dependency, and best-of-both-worldscited by 15
- 2024Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worldscited by 11
- 2019On the Optimality of Perturbations in Stochastic and Adversarial Multi-armed Bandit Problemscited by 10
8 more
- 2024Follow-the-Perturbed-Leader with Fr'echet-type Tail Distributions: Optimality in Adversarial Bandits and Best-of-Both-Worldscited by 9
- 2025Heavy-tailed Linear Bandits: Adversarial Robustness, Best-of-both-worlds, and Beyondcited by 4
- 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
- 2024Optimism in the Face of Ambiguity Principle for Multi-Armed Banditscited by 3
- 2025Revisiting Follow-the-Perturbed-Leader with Unbounded Perturbations in Bandit Problemscited by 3
- 2025Data-dependent Bounds with T-Optimal Best-of-Both-Worlds Guarantees in Multi-Armed Bandits using Stability-Penalty Matchingcited by 1
- 2025Follow-the-Perturbed-Leader for Decoupled Bandits: Best-of-Both-Worlds and Practicalitycited by 1
- 2026A Further Efficient Algorithm with Best-of-Both-Worlds Guarantees for m-Set Semi-Bandit Problemcited by 1
Built on by
Not cited yet.