Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Scalable Representation Learning in Linear Contextual Bandits with Constant Regret Guarantees
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Leveraging Good Representations in Linear Contextual Bandits (ICML 2021 · similarity 0.93)
- Impact of Representation Learning in Linear Bandits (ICLR 2021 · similarity 0.93)
- Fast and Sample Efficient Multi-Task Representation Learning in Stochastic Contextual Bandits (ICML 2024 · similarity 0.92)
- Near-Optimal Representation Learning for Linear Bandits and Linear RL (ICML 2021 · similarity 0.92)
- Beyond task diversity: provable representation transfer for sequential multitask linear bandits (NeurIPS 2024 · similarity 0.89)
- An Improved Algorithm for Adversarial Linear Contextual Bandits via Reduction (NeurIPS 2025 · similarity 0.88)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.