Minimax Alternating Regret for the Experts Problem and Online Convex Optimization

arXiv:2608.25182 · stat.ML, cs.LG · Submitted 2026-08-25 · Read on arXiv

stat.ML, cs.LG

Submitted: 2026-08-25

Updated: 2026-08-25

Terminology

• Regret — 87× in this paper · explained in 3 episodes
• Loss Function — 9× in this paper · explained in 2 episodes
• Alternation — 4× in this paper · explained in 1 episode
• Score Function — 3× in this paper · explained in 4 episodes
• Action Space — 2× in this paper · explained in 1 episode
• Convergence Guarantees — 2× in this paper · explained in 3 episodes
• Nash Equilibrium — 2× in this paper · explained in 2 episodes
• Regularization — 2× in this paper · explained in 3 episodes
• Generalization — 1× in this paper · explained in 13 episodes
• Minimax Regret — 1× in this paper · explained in 2 episodes

Sources

• Solving Large Imperfect Information Games Using CFR+

Related papers

• Behavior of prediction performance metrics with rare events
• Optimal Estimation of Generic Dynamics by Path-Dependent Neural Jump ODEs
• A Posterior-Dynamics Framework for Imaging Inverse Problems with Pretrained Diffusion Priors
• One Permutation Is All You Need: Fast, Deterministic Feature Importance and Model Stress-Testing
• Online Conformal Prediction for Non-Exchangeable Panel Data
• Deep Time-Series Forecasting in 10 Years: A Survey