Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Contextual Bandits with Stage-wise Constraints
Aldo Pacchiano, Mohammad Ghavamzadeh, Peter Bartlett
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 LC-LUCB instead of Safe-LTS | constrained contextual linear bandit · Star-convex action sets, d=3,5,10, safe action zero vector | regret | Improved |
| use LC-LUCB instead of Safe-LTS | constrained linear bandit · Unit-ball action set, d=5 and d=10 | regret | Improved |
| decrease cost threshold tau toward 0 | LC-LUCB · Star-convex action sets, tau 0.2, 0.5, 0.8 | regret | Hurt |
Closest papers by meaning
- Optimal Regret for Policy Optimization in Contextual Bandits (ICML 2026 · similarity 0.92)
- Second Order Bounds for Contextual Bandits with Function Approximation (ICLR 2025 · similarity 0.92)
- On the Minimax Regret for Contextual Linear Bandits and Multi-Armed Bandits with Expert Advice (NeurIPS 2024 · similarity 0.92)
- Catoni Contextual Bandits are Robust to Heavy-tailed Rewards (ICML 2025 · similarity 0.90)
- Triple-Optimistic Learning for Stochastic Contextual Bandits with General Constraints (ICML 2025 · similarity 0.90)
- Regret Bounds for Adversarial Contextual Bandits with General Function Approximation and Delayed Feedback (NeurIPS 2025 · 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.
