Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Learning in Generalized Linear Contextual Bandits with Stochastic Delays
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.
Closest papers by meaning
- Near-Optimal Stochastic Linear Bandits with Delay (NeurIPS 2026 · similarity 0.91)
- Contextual Linear Bandits with Delay as Payoff (ICML 2025 · similarity 0.90)
- Generalized Linear Bandits: Almost Optimal Regret with One-Pass Update (NeurIPS 2025 · similarity 0.90)
- Regret Bounds for Adversarial Contextual Bandits with General Function Approximation and Delayed Feedback (NeurIPS 2025 · similarity 0.90)
- Conservative Contextual Bandits: Beyond Linear Representations (ICLR 2025 · 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.