Research map / Bandits and online learning / Contextual bandits and Thompson sampling
Small Total-Cost Constraints in Contextual Bandits with Knapsacks, with Application to Fairness
Evgenii E Chzhen, Christophe Giraud, Zhen LI, Gilles Stoltz
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 a fixed large dual step size gamma=0.01 in the budget-controlling strategy (ablation) | Box B strategy · Rideshare fairness simulation, tau=10^-7 | budget control | Hurt |
| larger fixed step sizes trade average cost against reward (ablation) | Box B strategy · Rideshare fairness simulation | average reward vs cost | Mixed |
| adaptive doubling over step-size regimes (gamma 0.01, 0.02, 0.04) instead of one fixed step size | Box C meta-strategy · Rideshare fairness simulation | tuning of gamma | Improved |
Closest papers by meaning
- On Stochastic Contextual Bandits with Knapsacks in Small Budget Regime (ICLR 2025 · similarity 0.92)
- No-Regret is not enough! Bandits with General Constraints through Adaptive Regret Minimization (ICML 2025 · similarity 0.89)
- High-dimensional Linear Bandits with Knapsacks (ICML 2024 · similarity 0.89)
- Contextual Decision-Making with Knapsacks Beyond the Worst Case (NeurIPS 2024 · similarity 0.88)
- Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints (NeurIPS 2024 · similarity 0.88)
- Greedy Algorithms for Structured Bandits: A Sharp Characterization of Asymptotic Success / Failure (NeurIPS 2025 · similarity 0.88)
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.
