atlas

Research map / Bandits and online learning / Online convex optimization and games

Revisiting Follow-the-Perturbed-Leader with Unbounded Perturbations in Bandit Problems

NeurIPS 2025 · Bandits and online learning › Online convex optimization and games · approach: Best-of-both-worlds bandit algorithms · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Revisits FTRL-FTPL duality to give BOBW guarantees for FTPL with asymmetric unbounded Fréchet-type (incl. Laplace-Pareto hybrid) perturbations, and studies whether symmetric Fréchet perturbations can match 1/2-Tsallis entropy, finding positive results only for K=2.

Problem

FTPL policies for multi-armed bandits lag FTRL in analysis: prior BOBW results for FTPL required nonnegative perturbations with monotone f/F, excluding unbounded/asymmetric and hybrid perturbations, and it was unclear whether symmetric Fréchet perturbations (matching 1/2-Tsallis entropy for K=2) can

Approach

Relaxes the monotone f/F condition by showing that when the left tail of the perturbation is lighter than the right tail (tail index beta >= alpha+2), the stability analysis still goes through; applies this to unimodal asymmetric Fréchet/Laplace-Pareto perturbations, and numerically links 1/2-Tsallis entropy to a symmetric Fréchet perturbation, showing BOBW for K=2 but a counterexample for K>=3.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use asymmetric unbounded Fréchet-type perturbations with α>1 and β≥α+2FTPL · Adversarial and stochastic MAB with a unique optimal armregret: \gO(\sqrt{KT}) adversarial regret; when α=2, \sum_i \gO(\log T / \Delta_i) stochastic regretHelped
Use Laplace-Pareto hybrid perturbationsFTPL · Adversarial MABregret: \mathrm{Reg}(T) \leq 49.25\sqrt{KT} + \gO(\sqrt{K} + K\log T)Helped
Use Laplace-Pareto hybrid perturbationsFTPL · Stochastic MAB with a unique optimal armregret: \mathrm{Reg}(T) \leq \sum_{i\ne i^*} \frac{(60m+m^{-1})^2 \log T}{0.035 \Delta_i} + (\frac{2K}{27}+e^2)\log(T+1) + \ThetHelped
Use symmetric Pareto perturbations with shape 2FTPL · Adversarial and stochastic MAB, K=2regret: \gO(\sqrt{KT}) adversarial regret; \gO(\log T/\Delta_{i: i\ne i^*}) stochastic regretHelped
Extend symmetric Fréchet-type perturbations with tail indices 2 from K=2 to K≥3FTPL standard BOBW analysis · Multi-armed bandits, K≥3standard BOBW analysis condition: \frac{-\phi_i'(\lambda)}{\phi_i^{3/2}(\lambda)} \geq \tilde{\Omega}(\frac{c+2}{K\sqrt{K}}) \qq{and} \frac{-\phi_i'(\lambHurt

Surprising findings

Limitations

Experimental setup

Metrics: regret bound (adversarial) regret bound (stochastic) ratio -phi'/phi^{3/2} boundedness

Baselines: Exp3 FTPL with Gumbel perturbations FTRL with 1/2-Tsallis entropy FTPL with nonnegative Fréchet perturbations

Builds on: FTPL with Fréchet-type perturbations (Honda et al.) FTRL-FTPL equivalence (discrete choice theory) Tsallis-INF Exp3

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy