Optimistic Hedge in General-Sum Games: Fundamental Limits and Regret Bounds via Temporal Approximation
cs.LG, cs.GT
Submitted: 2026-11-04
Updated: 2026-11-04
Terminology
Sources
- Constant regret in general games via higher-order optimism
- Near-Optimal No-Regret Learning in General Games
- A Horizon-Independent Regret Bound for Optimistic Hedge in General-Sum Games
- Constant Individual Regret in General Games
- Constant Swap Regret in General-Sum Games via Two-Scale Higher-Order Optimism
- Multiplicative Optimism for Constant Regret in Games
- Faster Rates for No-Regret Learning in General Games via Cautious Optimism
Related papers
- A Physics-Regulated Neural Framework for Learning 3D Grain Growth Dynamics
- FlexMoE: Learning One-for-All Multi-Budget Expert Pruning for Flexible MoE Deployment
- OptiMind: Improving Small Language Models for Optimization Modeling through Formulation Guidance and Multi-Turn Learning
- Staying in the Sweet Spot: Boost Reasoning Evolution via Responsive Rollout Difficulty Manipulation
- Examining the Impact of Data and Training Methods on Emergent and Subliminal Misalignment
- Rethinking Black-Box On-Policy Distillation: A Rubric-based Analysis