Overview

Regret minimization measures the cost of learning over time by comparing decisions with a benchmark, often the best fixed action or strategy chosen in hindsight. In bandits, UCB, Thompson sampling, and explore-then-commit balance information gathering with reward; in online optimization, Hedge, follow-the-regularized-leader, and mirror descent adapt to incoming losses. In games, counterfactual regret minimization and swap-regret methods help find equilibria, while dynamic-regret methods track changing comparators. Many classic settings have tight regret bounds, but guarantees still depend sharply on feedback, assumptions about adversaries or nonstationarity, and the chosen objective, such as cumulative versus final-decision quality.

Latest papers

CardsList

125 papers13 papers in the last four weeks, down 13% on the four weeks before. 0.1% of all new papers.

  1. Online Linear Programming with Batching

    Aug 1, 2024Haoran Xu, Peter W. Glynn, Yinyu YeRegret MinimizationSequential Decision Making

  2. Satisficing Regret Minimization in Bandits: Constant Rate and Light-Tailed Distribution

    Jun 10, 2024Qing Feng, Tianyi Ma, Ruihao ZhuMulti-Armed BanditsRegret Minimization

  3. Calibrated Stackelberg Games: Learning Optimal Commitments Against Calibrated Agents

    Jun 5, 2023Nika Haghtalab, Chara Podimata, Kunhe YangImperfect-Information GamesGame Theory

  4. Hierarchical Deep Counterfactual Regret Minimization

    May 27, 2023Jiayu Chen, Xudong Wu, Zhekai Wang +1Imperfect-Information GamesHierarchical RL

  5. Robust Budget Pacing with a Single Sample

    Feb 3, 2023Santiago Balseiro, Rachitesh Kumar, Vahab Mirrokni +2Sample ComplexityOnline Advertising