Regret Bounds for Quantum Linear Bandits
cs.LG
Submitted: 2026-11-11
Updated: 2026-11-11
Terminology
Sources
- Nearly Minimax-Optimal Regret for Linear Contextual Bandits with Arbitrary Adaptive Action Sets
- Quantum Multi-Armed Bandits and Linear Bandits: Lower Bounds and Algorithms
- Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities
- Quantum Heavy-tailed Bandits
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