Dynamic Regret Minimization

Overview

Dynamic regret measures an online learner’s cumulative loss against a comparator that can change its decisions over time, often quantified by its number of switches or total path length. Methods include restarting or aggregating online learners, tracking switching experts, adapting to gradient or parameter variation, and detecting changes; bandit settings add the challenge of learning from limited feedback. These ideas are studied in online convex optimization, multi-armed and linear bandits, reinforcement learning, and control, with evaluations often comparing regret across different kinds of drift and comparator movement. A central tension is adapting quickly to consequential changes without overreacting to noise or harmless shifts, especially when the amount of change is unknown and feedback is costly.

Latest papers

CardsList

53 papers11 papers in the last four weeks, down 8% on the four weeks before. 0.1% of all new papers.

  1. Bandit Online Submodular Minimisation Using Zeroth-Order Oracles

    Nov 17, 2026Amir Ali Farzin, Philipp Braun, Iman ShamesOnline Submodular OptimizationSubmodular Optimization

  2. Dynamic Optimistic Constrained OCO with Memory via Delay Equivalence

    Nov 5, 2026Mohammed Abdullah, George Iosifidis, Salah Eddine Elayoubi +1Online Convex OptimizationDynamic Regret Minimization

  3. Regret Bounds for Market Making with Persistent Orders

    Nov 4, 2026Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni +2Algorithmic TradingDynamic Regret Minimization

  4. When Is Tracking Affordable? A Movement-Budget Feasibility Threshold for Dynamic Regret

    Nov 2, 2026Ridham PatelDynamic Regret MinimizationOnline Convex Optimization

  5. Pricing Today, Shaping Tomorrow: Contextual Dynamic Pricing in Purchase-Driven Evolving Systems

    Oct 31, 2026Jinjiang Zou, Yang Li, Zemin ZhengContextual Dynamic PricingDynamic Pricing

  6. Optimal Contextual Pricing in Non-Stationary Environments

    Oct 29, 2026Yiding Feng, Alireza RezaeimoghadamContextual Dynamic PricingDynamic Pricing

  7. Strongly Adaptive Online Learning with Time-Varying Movement Costs

    Oct 23, 2026Andrew Jacobsen, Emmanuel Esposito, Hao Qiu +1Online Convex OptimizationDynamic Regret Minimization

  8. The Price of Current-Effect Inference in Nonstationary Multi-Armed Bandits

    Oct 21, 2026Sharan Sahu, Martin T. WellsNon-Stationary BanditsDynamic Regret Minimization

  9. Minimax-Optimal Predictive Flow Matching under Distribution Drift

    Oct 20, 2026Aadithya Srikanth, Vaneet AggarwalFlow MatchingDynamic Regret Minimization

  10. A Simple and Unified Method for Gradient-Variation Regret

    Oct 19, 2026Hang Yu, Peng ZhaoOnline LearningDynamic Regret Minimization

  11. Variance-Aware Non-Stationary Bandits:All-Budget Regret Bounds and Adaptation Costs

    Oct 19, 2026Xiaojin ZhangMulti-Armed BanditsNon-Stationary Bandits

  12. Detection Augmented Learning In Non-Stationary Bandit Environments

    Oct 19, 2026Argyrios Gerogiannis, Yu-Han Huang, Subhonmesh Bose +1Non-Stationary BanditsDynamic Regret Minimization

  13. Revisiting Smoothed Online Learning: Competitive Ratio, Dynamic Regret with Switching Cost, and Best of Both Worlds

    Oct 17, 2026Lijun Zhang, Linzhe He, Wei Jiang +1Competitive AnalysisOnline Convex Optimization

  14. Data Reuse in Non-Stationary Learning

    Oct 7, 2026Tomer Gafni, Garud Iyengar, Assaf ZeeviStatistical Learning TheoryDynamic Regret Minimization

  15. Logarithmic Regret via Passive Change Detection in Piecewise-Stationary Self-Tuning Regulation

    Oct 7, 2026A. Ch. Madhusudanarao, Rahul SinghAdaptive ControlDynamic Regret Minimization

  16. Dynamic Minimax Regret Optimization for Robust LLM Post-Training

    Oct 5, 2026Chengbo Zang, Haoyu Dong, Mehmet Kerem Turkcan +3Group Distributionally Robust OptimizationDynamic Regret Minimization

  17. Universal Dynamic Portfolios

    Sep 28, 2026Yu-Jie Zhang, Yu-Xiang Wang, Peng Zhao +1Online Convex OptimizationDynamic Regret Minimization

  18. On the Relation Between Interval Regret and Dynamic Regret

    Sep 28, 2026Yi-Han Wang, Peng Zhao, Zhi-Hua ZhouOnline Convex OptimizationDynamic Regret Minimization

  19. ASTRA: ADMM-Accelerated Topology Reconfiguration for Dynamic Satellite Constellations

    Sep 27, 2026João Norberto, Ricardo Ferreira, Cláudia SoaresDynamic Regret MinimizationWireless Communications

  20. Dynamic Regret in Online Convex Optimization with Indicator Switching Costs

    Sep 24, 2026Naram Mhaisen, George IosifidisOnline Convex OptimizationDynamic Regret Minimization

  21. From Switching to Dynamic Regret: A Simple Reduction via Unbiased Random Sequences

    Sep 17, 2026Yibo Wang, Wenhao Yang, Sifan Yang +3Online Convex OptimizationDynamic Regret Minimization

  22. Sharper Regret Bounds for Time-Varying Gaussian Process Bandits with Constant Exploration

    Aug 19, 2026Matthias Mandl, Hanne KekkonenGaussian Process BanditsBayesian Optimization

  23. Online Learning of Scale Parameters in Score-Driven Filters

    Aug 10, 2026Fabrizio Lillo, Giulia Livieri, Gianluca PalmariDynamic Regret MinimizationOnline Mirror Descent