Follow-the-Regularized-Leader

Also known as FTRL

Ask about this topic

Momentum

1 paper in the last four weeks, down 75% on the four weeks before. 0.0% of all new papers.

Jul 13Week of Sep 28
View on map

Latest papers 15

All topics
CardsList

  1. Exact-Form Regret for Gradient Descent, Mirror Descent and Follow-the-Regularized-Leader

    Sep 8, 2026Ashkan Soleymani, Gabriele Farina, Patrick JailletGame TheoryGradient Descent

    MIT

  2. Constant regret in general games via higher-order optimism

    Sep 3, 2026Omar Abbadi, Rida Laraki, Panayotis MertikopoulosFollow-the-Regularized-LeaderRegret Minimization

    Univ. Mohammed VI Polytechnic, CMSIS, MCGT, 11103 Rabat, Morocco · Univ. Grenoble Alpes, CNRS, Inria, Grenoble INP, LIG, 38000 Grenoble, France

  3. Constant Individual Regret in General Games

    Aug 31, 2026Mingyang Liu, Gabriele Farina, Asuman OzdaglarGame TheoryFollow-the-Regularized-Leader

    LIDS, EECS, Massachusetts Institute of Technology

  4. Dec-BFTRL: Squre-Root Regret for Decentralized Online Upper-Linearizable Optimization under Separation Access with Application to Continuous Submodular Maximization

    Aug 31, 2026Yiyang Lu, Mohammad Pedramfar, Vaneet AggarwalSubmodular OptimizationFollow-the-Regularized-Leader

    Purdue University, West Lafayette, IN, USA · Mila - Quebec AI Institute/McGill University, Montreal, QC, Canada

  5. Online Convex Optimization with Dueling Feedback

    Aug 15, 2026Yiyang Lu, Hareshkumar Jadav, Mohammad Pedramfar +2Online Convex OptimizationFollow-the-Regularized-Leader

    Purdue University · IIT Indore · Mila - Quebec AI Institute/McGill University

  6. Dirichlet Follow-the-Leader Closes the Gap in Simultaneous Multiclass U-Calibration

    Aug 7, 2026Pahan DewasurendraProbabilistic ForecastingFollow-the-Regularized-Leader

    Johns Hopkins University

  7. Sublogarithmic Swap Regret in Multiplayer General-Sum Games via Hybrid Regularization

    Aug 4, 2026Taira TsuchiyaFollow-the-Regularized-LeaderRegret Minimization

    The University of Tokyo and RIKEN

  8. Revisiting Decentralized Online Convex Optimization with Compressed Communication

    Jul 2, 2026Hao Zhou, Xiaoyu Wang, Chang Yao +2Online Convex OptimizationFollow-the-Regularized-Leader

    School of Software Technology, Zhejiang University, Ningbo, China · State Key Laboratory of Blockchain and Data Security, Zhejiang University, Hangzhou, China

  9. Policy Optimization Achieves Data-Dependent Regret Bounds in MDPs with Unknown Transitions

    Jun 30, 2026Mingyi Li, Taira Tsuchiya, Kenji YamanishiRegret Minimization in RLMarkov Decision Processes

    Department of Mathematical Informatics, The University of Tokyo · Center for Advanced Intelligence Project, RIKEN

  10. Capacity-Constrained Online Convex Optimization with Delayed Feedback

    Jun 10, 2026Alexander Ryabchenko, Idan Attias, Daniel M. RoyOnline Convex OptimizationBandit Convex Optimization

    Department of Statistical Sciences, University of Toronto; Vector Institute. · Institute for Data, Econometrics, Algorithms, and Learning (IDEAL), hosted by UIC and TTIC.

  11. SEArch: Optimistic Policy Selection Between Scene Noise and Drift for UAV Radar Search

    May 31, 2026Noor Khial, Naram Mhaisen, Loay Ismail +1Multi-Armed BanditsNon-Stationary Bandits

    College of Engineering, Qatar University, Qatar · Faculty of Electrical Engineering, Mathematics, and Computer Science, Delft University of Technology, The Netherlands

  12. Data- and Variance-dependent Regret Bounds for Online Tabular MDPs

    Feb 2, 2026Mingyi Li, Taira Tsuchiya, Kenji YamanishiRegret Minimization in RLMarkov Decision Processes

    Department of Mathematical Informatics, The University of Tokyo, Tokyo, Japan · RIKEN AIP, Tokyo, Japan

  13. Self-Concordant Perturbations for Linear Bandits

    Oct 28, 2025Lucas Lévy, Jean-Lou Valeau, Arya Akhavan +1Multi-Armed BanditsExploration-Exploitation Tradeoff

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

  14. Best-of-Both Worlds for linear contextual bandits with paid observations

    Oct 8, 2025Nathan Boyer, Dorian Baudry, Patrick RebeschiniMulti-Armed BanditsFollow-the-Regularized-Leader

    ENS Paris-Saclay, France · Univ. Grenoble Alpes, Inria, CNRS, Grenoble INP, LIG, 38000 Grenoble, France · Department of Statistics, University of Oxford

  15. Online Learning: A Modern Introduction Using Convex Optimization

    Dec 31, 2019Francesco OrabonaOnline Convex OptimizationFollow-the-Regularized-Leader

    KAUST