mlsanityData to 7 Oct 2026

Follow-the-Perturbed-Leader with Fr'echet-type Tail Distributions: Optimality in Adversarial Bandits and Best-of-Both-Worlds

arXiv 2403.05134 ↗First posted 8 Mar 2024stat.ML cs.LGcited by 9

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

  1. 2021Achieving Near Instance-Optimality and Minimax-Optimality in Stochastic and Adversarial Linear Bandits Simultaneouslycited by 48
  2. 2017An Improved Parametrization and Analysis of the EXP3++ Algorithm for Stochastic and Adversarial Banditscited by 43
  3. 2023A Blackbox Approach to Best of Both Worlds in Bandits and Beyondcited by 29
  4. 2015First-order regret bounds for combinatorial semi-banditscited by 25
  5. 2019Connections Between Mirror Descent, Thompson Sampling and the Information Ratiocited by 23
  6. 2022Best-of-Both-Worlds Algorithms for Partial Monitoringcited by 19
  7. 2023Improved Best-of-Both-Worlds Guarantees for Multi-Armed Bandits: FTRL with General Regularizers and Multiple Optimal Armscited by 18
  8. 2022Adversarially Robust Multi-Armed Bandit Algorithm with Variance-Dependent Regret Boundscited by 12

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 2; 2025: 5; 2026: 2.

9 papers.