Research map / Bandits and online learning / Contextual bandits and Thompson sampling
PAC-Bayes Bounds for Bandit Problems: A Survey and Experimental Comparison
Hamish Flynn, David Reeb, Melih Kandemir, Jan Peters
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
- Fast Rates for Bandit PAC Multiclass Classification (NeurIPS 2024 · similarity 0.88)
- Bayesian Regret Minimization in Offline Bandits (ICML 2024 · similarity 0.88)
- Local Anti-Concentration Class: Logarithmic Regret for Greedy Linear Contextual Bandit (NeurIPS 2024 · similarity 0.87)
- Robustly Improving Bandit Algorithms with Confounded and Selection Biased Offline Data: A Causal Approach (AAAI 2024 · similarity 0.87)
- Contextual Bandits for Unbounded Context Distributions (ICML 2025 · similarity 0.87)
- On Interpolating Experts and Multi-Armed Bandits (ICML 2024 · 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.
