arxiv
PublishedSeptember 15, 2026 at 4:00 AM
Nearly Minimax-Optimal Regret for Linear Contextual Bandits with Arbitrary Adaptive Action Sets
Publisher summary· verbatim
arXiv:2609.15170v1 Announce Type: new Abstract: We study stochastic linear contextual bandits with arbitrary action menus that may depend on the fixed parameter and the interaction history. We establish matching upper and lower bounds, up to logarithmic factors. Let $d$ be the dimension, $K$ be the
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivSelective Amortization of Full-Budget Counterfactual Reasoning for Visual Token Communication12harxivMIND the Gap: A Geographic Implicit Neural Representation with Adjustable Spatial Scale12harxivConformal Prediction under Exponential-Tilt Joint Shift12harxivProvable Quantum-Classical Separation for Continuous Gibbs Sampling12hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗