Efficient Swap Regret Minimization in Combinatorial Bandits
cs.LG, math.OC, stat.ML
Submitted: 2026-02-02
Updated: 2026-02-02
Terminology
Sources
- What Doubling Tricks Can and Can't Do for Multi-Armed Bandits
- An efficient high-probability algorithm for Linear Bandits
- A Lower Bound on Swap Regret in Extensive-Form Games
- Matroid Bandits: Fast Combinatorial Optimization with Learning
Related papers
- 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
- (Mis)generalization of Helpful-Only Fine-tuning