Follow-the-Perturbed-Leader

Ask about this topic

Latest papers

CardsList

10 papers2 papers in the last four weeks, against 1 the four weeks before. 0.0% of all new papers.

  1. Nearly Linear-Time Follow-the-Perturbed-Leader for Weakly Observable Graph Bandits

    Nov 3, 2026Jongyeong Lee, Hyundam YooBest-of-Both-Worlds BanditsGraph Bandits

    Korea Institute of Science and Technology · Independent researcher

  2. Follow the Perturbed Leader for Linear Bandits: T\sqrt{T} Regret over General Action Sets

    Oct 13, 2026Chen-Yu WeiFollow-the-Perturbed-LeaderAdversarial Bandits

    University of Virginia

  3. Oracle-Efficient and Parameter-Free Agnostic Smoothed Online Learning

    Oct 7, 2026Sasha Voitovych, Adam Block, Alexander Rakhlin +1Follow-the-Perturbed-LeaderParameter-Free Online Learning

    MIT · Columbia University · Georgia Tech

  4. Oracle-Efficient Online Classification with Stochastic Inputs and Adversarial Outputs

    Sep 27, 2026Gon Buzaglo, Elad HazanFollow-the-Perturbed-LeaderBinary Classification

    Department of Computer Science, Princeton University · Google DeepMind

  5. Toward Simultaneously Optimal Regret in U-Calibration

    Jun 16, 2026Rafael Frongillo, Haipeng Luo, Nishant A. Mehta +1Follow-the-Perturbed-LeaderProbabilistic Forecasting

    University of Colorado Boulder · University of Southern California and Google Research · University of Victoria +1

  6. Adaptive Learning Rates with Surrogate Probability for Follow-the-Perturbed-Leader

    Jun 4, 2026Jongyeong Lee, Junya Honda, Shinji Ito +1Multi-Armed BanditsFollow-the-Perturbed-Leader

    Korea Institute of Science and Technology · Kyoto University · RIKEN AIP +2

  7. From Non-Convex to Strongly Convex: Curvature-Adaptive FTPL for Online Optimization

    Jun 1, 2026Moses Charikar, Chirag Pabbaraju, Ambuj TewariOnline Convex OptimizationFollow-the-Perturbed-Leader

    Stanford University. · University of Michigan, Ann Arbor.

  8. Online combinatorial optimization with stochastic decision sets and adversarial losses

    Apr 28, 2026Gergely Neu, Michal ValkoMulti-Armed BanditsFollow-the-Perturbed-Leader

    SequeL team, INRIA Lille – Nord Europe, France

  9. A Further Efficient Algorithm with Best-of-Both-Worlds Guarantees for mm-Set Semi-Bandit Problem

    Mar 12, 2026Botao Chen, Jongyeong Lee, Chansoo Kim +1Follow-the-Perturbed-LeaderBest-of-Both-Worlds Bandits

    Department of Systems Science Graduate School of Informatics, Kyoto University Kyoto, Japan · Computational Science Research Center Korea Institute of Science and Technology Seoul, Korea · Computational Science Research Center Korea Institute of Science and Technology & University of Science and Technology Seoul, Korea +1

  10. Self-Concordant Perturbations for Linear Bandits

    Oct 28, 2025Lucas Lévy, Jean-Lou Valeau, Arya Akhavan +1Multi-Armed BanditsFollow-the-Perturbed-Leader

    Ecole Polytechnique and University of Oxford · ENSAE Paris and University of Oxford · University of Oxford and Ecole Polytechnique +1