Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression
Aleksandrs Slivkins, Xingyu Zhou, Karthik Abinav Sankararaman, Dylan J. Foster
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
- Linear Contextual Bandits with Knapsacks (NeurIPS 2016 · similarity 0.95)
- On Stochastic Contextual Bandits with Knapsacks in Small Budget Regime (ICLR 2025 · similarity 0.93)
- An Asymptotically Optimal Primal-Dual Incremental Algorithm for Contextual Linear Bandits (NeurIPS 2020 · similarity 0.92)
- High-dimensional Linear Bandits with Knapsacks (ICML 2024 · similarity 0.92)
- No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization (ICML 2025 · similarity 0.91)
- On the Minimax Regret for Contextual Linear Bandits and Multi-Armed Bandits with Expert Advice (NeurIPS 2024 · similarity 0.90)
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.
