Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Optimal Thompson Sampling strategies for support-aware CVaR bandits
Dorian Baudry, Romain Gautron, Emilie Kaufmann, Odalric Maillard
Read the paperCheck your idea against 137,217 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
- A Unifying Theory of Thompson Sampling for Continuous Risk-Averse Bandits (AAAI 2022 · similarity 0.89)
- Thompson Sampling Algorithms for Mean-Variance Bandits (ICML 2020 · similarity 0.89)
- Variance-Aware Feel-Good Thompson Sampling for Contextual Bandits (NeurIPS 2025 · similarity 0.89)
- Constrained Linear Thompson Sampling (NeurIPS 2025 · similarity 0.88)
- The Choice of Noninformative Priors for Thompson Sampling in Multiparameter Bandit Models (AAAI 2024 · similarity 0.88)
- Achieving adaptivity and optimality for multi-armed bandits using Exponential-Kullback Leibler Maillard Sampling (NeurIPS 2026 · similarity 0.87)
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.
