Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Thompson Sampling for Multinomial Logit Contextual Bandits
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use Thompson sampling (TS-MNL variants) instead of the UCB method for MNL contextual bandits | MNL contextual bandit · synthetic MNL instances | cumulative expected regret | Helped |
| add optimistic sampling (M samples) to Gaussian-approximation TS-MNL (ablation) | TS-MNL · synthetic and MovieLens MNL bandits | cumulative expected regret | Helped |
Closest papers by meaning
- Tractable Multinomial Logit Contextual Bandits with Non-Linear Utilities (NeurIPS 2025 · similarity 0.92)
- Contextual Multinomial Logit Bandits with General Value Functions (NeurIPS 2024 · similarity 0.91)
- Nearly Minimax Optimal Regret for Multinomial Logistic Bandit (NeurIPS 2024 · similarity 0.91)
- Variance-Aware Feel-Good Thompson Sampling for Contextual Bandits (NeurIPS 2025 · similarity 0.90)
- Feel-Good Thompson Sampling for Contextual Bandits: a Markov Chain Monte Carlo Showdown (NeurIPS 2025 · similarity 0.90)
- The Choice of Noninformative Priors for Thompson Sampling in Multiparameter Bandit Models (AAAI 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.