Research map / Bandits and online learning / Contextual bandits and Thompson sampling
High-dimensional Contextual Bandit Problem without Sparsity
Junpei Komiyama, Masaaki Imaizumi
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 AEtC (adaptive explore-then-commit with interpolating estimator) instead of ESTC, LinUCB, DR Lasso Bandit | AEtC · DGP 1 and DGP 3 (heavy-tailed eigenvalues) | accumulated regret | Improved |
| use AEtC instead of other methods | AEtC · DGP 2 (exponentially decaying eigenvalues) | accumulated regret | No clear effect |
| use AEtC instead of LinUCB | AEtC · DGP 4 (non-benign equicorrelated covariance) | accumulated regret | No clear effect |
Closest papers by meaning
- Universal and data-adaptive algorithms for model selection in linear contextual bandits (ICML 2022 · similarity 0.91)
- Model Selection for Contextual Bandits (NeurIPS 2019 · similarity 0.91)
- High-dimensional Linear Bandits with Knapsacks (ICML 2024 · similarity 0.91)
- Active Context Selection Improves Simple Regret in Contextual Bandits (NeurIPS 2026 · similarity 0.90)
- Fast and Sample Efficient Multi-Task Representation Learning in Stochastic Contextual Bandits (ICML 2024 · similarity 0.89)
- Contextual Bandits for Unbounded Context Distributions (ICML 2025 · 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.
