Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Online Algorithm for Unsupervised Sequential Selection with Contextual Information
Arun Verma, Manjesh Kumar Hanawal, Csaba Szepesvari, Venkatesh Saligrama
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 |
|---|---|---|---|
| increase CWD strength xi from Instance 2 to Instance 4 (via arm costs) (ablation) | contextual USS algorithm · Synthetic dataset | cumulative regret | Improved |
| instance where contexts do not satisfy weak dominance (Instance 1) (ablation) | contextual USS algorithm · Synthetic dataset | cumulative regret | Hurt |
| give the learner true labels (supervised feedback) instead of disagreement feedback (ablation) | contextual USS algorithm · Synthetic Instance 3 | cumulative regret | Improved |
Closest papers by meaning
- Model Selection for Contextual Bandits (NeurIPS 2019 · similarity 0.90)
- Contextual Bandits with Large Action Spaces: Made Practical (ICML 2022 · similarity 0.90)
- Nonparametric Stochastic Contextual Bandits (AAAI 2018 · similarity 0.90)
- Contextual Bandits for Unbounded Context Distributions (ICML 2025 · similarity 0.90)
- High Probability Bound for Cross-Learning Contextual Bandits with Unknown Context Distributions (ICML 2025 · similarity 0.89)
- Active Context Selection Improves Simple Regret in Contextual Bandits (NeurIPS 2026 · 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.
