Nearly Minimax-Optimal Regret for Linear Contextual Bandits with Arbitrary Adaptive Action Sets

arXiv:2609.15170 · cs.LG, cs.GT · Submitted 2026-09-14 · Read on arXiv

cs.LG, cs.GT

Submitted: 2026-09-14

Updated: 2026-09-14

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Regret — 50× in this paper · explained in 3 episodes
• Contextual Bandits — 18× in this paper · explained in 3 episodes
• Trace — 4× in this paper · explained in 2 episodes
• Minimax Regret — 2× in this paper · explained in 2 episodes
• Adaptation — 1× in this paper · explained in 1 episode
• Adaptivity — 1× in this paper · explained in 1 episode
• Regularization — 1× in this paper · explained in 3 episodes
• Reinforcement Learning — 1× in this paper · explained in 4 episodes

Sources

• Thompson Sampling for Contextual Bandits with Linear Payoffs

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: Local-Consistency Optimisation for Bayesian Neural Networks
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks