Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Efficient Frameworks for Generalized Low-Rank Matrix Bandit Problems
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
- Low-Rank Bandits via Tight Two-to-Infinity Singular Subspace Recovery (ICML 2024 · similarity 0.92)
- Efficient Low-Rank Matrix Estimation, Experimental Design, and Arm-Set-Dependent Low-Rank Bandits (ICML 2024 · similarity 0.90)
- Generalized Linear Bandits with Limited Adaptivity (NeurIPS 2024 · similarity 0.88)
- Generalized Linear Bandits: Almost Optimal Regret with One-Pass Update (NeurIPS 2025 · similarity 0.88)
- Fast and Sample Efficient Multi-Task Representation Learning in Stochastic Contextual Bandits (ICML 2024 · similarity 0.87)
- Leveraging Offline Data in Linear Latent Contextual Bandits (ICML 2025 · similarity 0.87)
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.