Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Revisiting Matrix Sketching in Linear Bandits: Achieving Sublinear Regret via Dyadic Block Sketching
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
- Geometry-Aware Approaches for Balancing Performance and Theoretical Guarantees in Linear Bandits (ICLR 2025 · similarity 0.88)
- Dimension-Free Adaptive Subgradient Methods with Frequent Directions (ICML 2025 · similarity 0.87)
- Matrix Product Sketching via Coordinated Sampling (ICLR 2025 · similarity 0.87)
- Optimal Batched Linear Bandits (ICML 2024 · similarity 0.87)
- Batched Stochastic Linear Bandits with 1-Bit Communication Constraints (NeurIPS 2026 · similarity 0.86)
- Linear Bandits with Partially Observable Features (ICML 2025 · similarity 0.86)
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.