Follow-the-Perturbed-Leader with Fr'echet-type Tail Distributions: Optimality in Adversarial Bandits and Best-of-Both-Worlds
Not on the map. Why?
Abstract (arXiv)
This paper studies the optimality of the Follow-the-Perturbed-Leader (FTPL) policy in both adversarial and stochastic K-armed bandits. Despite the widespread use of the Follow-the-Regularized-Leader (FTRL) framework with various choices of regularization, the FTPL framework, which relies on random perturbations, has not received much attention, despite its inherent simplicity. In adversarial bandits, there has been conjecture that FTPL could potentially achieve O(√KT) regrets if perturbations follow a distribution with a Fr'echet-type tail. Recent work by Honda et al. (2023) showed that FTPL with Fr'echet distribution with shape α=2 indeed attains this bound and, notably logarithmic regret in stochastic bandits, meaning the Best-of-Both-Worlds (BOBW) capability of FTPL. However, this result only partly resolves the above conjecture because their analysis heavily relies on the specific form of the Fr'echet distribution with this shape. In this paper, we establish a sufficient condition for perturbations to achieve O(√KT) regrets in the adversarial setting, which covers, e.g., Fr'echet, Pareto, and Student-t distributions. We also demonstrate the BOBW achievability of FTPL with certain Fr'echet-type tail distributions. Our results contribute not only to resolving existing conjectures through the lens of extreme value theory but also potentially offer insights into the effect of the regularization functions in FTRL through the mapping from FTPL to FTRL.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 8 of its 37 references that are in the map. First posted on arXiv 8 Mar 2024.
Builds on
8 of 37 references.
References · 8
- 2021Achieving Near Instance-Optimality and Minimax-Optimality in Stochastic and Adversarial Linear Bandits Simultaneouslycited by 48
- 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
- 2015First-order regret bounds for combinatorial semi-banditscited by 25
- 2019Connections Between Mirror Descent, Thompson Sampling and the Information Ratiocited by 23
- 2022Best-of-Both-Worlds Algorithms for Partial Monitoringcited by 19
- 2023Improved Best-of-Both-Worlds Guarantees for Multi-Armed Bandits: FTRL with General Regularizers and Multiple Optimal Armscited by 18
- 2022Adversarially Robust Multi-Armed Bandit Algorithm with Variance-Dependent Regret Boundscited by 12
Built on by
Citing papers per year: 2024: 2; 2025: 5; 2026: 2.
9 papers.
- 2024uniINF: Best-of-Both-Worlds Algorithm for Parameter-Free Heavy-Tailed MABscited by 7
- 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
- 2025Follow-the-Perturbed-Leader Approaches Best-of-Both-Worlds for the m-Set Semi-Bandit Problemscited by 2
- 2025Follow-the-Perturbed-Leader for Decoupled Bandits: Best-of-Both-Worlds and Practicalitycited by 1
- 2025Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problemscited by 0
- 2025Dopamine-driven synaptic credit assignment in neural networkscited by 0
- 2026Adaptive Learning Rates with Surrogate Probability for Follow-the-Perturbed-Leadercited by 0
- 2026Toward Optimal Second-Order Path-Length Guarantee for Adversarial Multi-Armed Banditscited by 0
- 2026Toward Optimal Second-Order Path-Length Guarantee for Adversarial Multi-Armed Bandits17 Aug 2026
- 2026Adaptive Learning Rates with Surrogate Probability for Follow-the-Perturbed-Leader4 Jun 2026
- 2025Dopamine-driven synaptic credit assignment in neural networks25 Oct 2025
- 2025Follow-the-Perturbed-Leader for Decoupled Bandits: Best-of-Both-Worlds and Practicality14 Oct 2025
- 2025Revisiting Follow-the-Perturbed-Leader with Unbounded Perturbations in Bandit Problems26 Aug 2025
- 2025Note on Follow-the-Perturbed-Leader in Combinatorial Semi-Bandit Problems14 Jun 2025
- 2025Follow-the-Perturbed-Leader Approaches Best-of-Both-Worlds for the m-Set Semi-Bandit Problems9 Apr 2025
- 2024uniINF: Best-of-Both-Worlds Algorithm for Parameter-Free Heavy-Tailed MABs4 Oct 2024
- 2024Optimism in the Face of Ambiguity Principle for Multi-Armed Bandits30 Sep 2024