Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Information Directed Sampling for Sparse Linear Bandits
Botao Hao, Tor Lattimore, Wei Deng
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use sparse IDS instead of sparse TS | sparse linear bandit · Hard sparse linear bandit instance, d=10, s=2 | cumulative Bayesian regret | Improved |
| use sparse IDS instead of LinUCB, LinTS, IDS and ESTC | sparse linear bandit · Multivariate Gaussian action set, d=20, 40, 100, K=200 | cumulative Bayesian regret | Improved |
| use sparsity-aware ESTC instead of non-sparse algorithms | linear bandit baselines · Multivariate Gaussian action set | cumulative regret | Mixed |
Closest papers by meaning
- Sparse Optimistic Information Directed Sampling (NeurIPS 2025 · similarity 0.95)
- An Information-Theoretic Analysis for Thompson Sampling with Many Actions (NeurIPS 2018 · similarity 0.92)
- Bayesian Regret Minimization in Offline Bandits (ICML 2024 · similarity 0.91)
- Sparsity-Agnostic Linear Bandits with Adaptive Adversaries (NeurIPS 2024 · similarity 0.90)
- Geometry-Aware Approaches for Balancing Performance and Theoretical Guarantees in Linear Bandits (ICLR 2025 · similarity 0.89)
- Random Exploration in Bayesian Optimization: Order-Optimal Regret and Computational Efficiency (ICML 2024 · similarity 0.89)
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.
