Safety by Design: Realized-Cost Constraints for Contextual Bandits with Continuous Actions
Not on the map. Why?
Abstract (arXiv)
Contextual bandits are a standard framework for sequential decision-making under uncertainty, with applications in clinical trials, dosage selection, recommendation systems, and autonomous systems. Safety is central in many of these applications, since a single unsafe decision in settings such as dosage selection or autonomous driving can have catastrophic consequences. A common way to model safety in bandit problems is to associate each action with both a reward signal and a cost signal, and to optimize reward subject to constraints on cost. Most existing safety-constrained bandit models enforce safety by requiring the expected cost of each action to remain below a prescribed threshold. However, this may be insufficient in heteroscedastic settings, where the chosen action affects not only the expected reward and cost, but also the variability of the observed outcomes. We study contextual bandits with one-dimensional continuous actions and stage-wise high-probability constraints on the realized cost. We propose High-Probability Constrained UCB, an optimistic-pessimistic algorithm that explores for reward while conservatively estimating the safe action set. For linear reward and cost models, we prove a tight tildeO(d√T) regret bound, and we extend the analysis to general function classes using the eluder dimension. Experiments show that enforcing realized-cost safety substantially reduces violations compared with expected-cost constrained baselines.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 21 of its 39 references that are in the map. First posted on arXiv 27 Aug 2026.
Builds on
21 of 39 references.
References · 21
- 2017Deep reinforcement learning from human preferencescited by 3,912
- 2023Safe RLHF: Safe Reinforcement Learning from Human Feedbackcited by 656
- 2016Fairness in Learning: Classic and Contextual Banditscited by 168
- 2013Bandits with Knapsackscited by 164
- 2020Safe Reinforcement Learning in Constrained Markov Decision Processescited by 115
- 2015Multi-armed Bandit Models for the Optimal Design of Clinical Trials: Benefits and Challengescited by 114
- 2024Exploratory Preference Optimization: Harnessing Implicit Q*-Approximation for Sample-Efficient RLHFcited by 106
- 2019Linear Stochastic Bandits Under Safety Constraintscited by 90
- 2019A Survey on Practical Applications of Multi-Armed and Contextual Banditscited by 45
- 2023Foundations of Reinforcement Learning and Interactive Decision Makingcited by 33
- 2019On Multi-Armed Bandit Designs for Dose-Finding Clinical Trialscited by 32
- 2020Efficient Contextual Bandits with Continuous Actionscited by 24
9 more
- 2018Low-Rank Bandit Methods for High-Dimensional Dynamic Pricingcited by 17
- 2024Contextual Bandits with Stage-wise Constraintscited by 12
- 2020Contextual Constrained Learning for Dose-Finding Clinical Trialscited by 9
- 2023Directional Optimism for Safe Linear Banditscited by 8
- 2023LLMs-augmented Contextual Banditcited by 8
- 2024Honor Among Bandits: No-Regret Learning for Online Fair Divisioncited by 7
- 2024Noise-Adaptive Confidence Sets for Linear Bandits and Application to Bayesian Optimizationcited by 6
- 2022Context Uncertainty in Contextual Bandits with Applications to Recommender Systemscited by 4
- 2023SPEED: Experimental Design for Policy Evaluation in Linear Heteroscedastic Banditscited by 3
Built on by
Not cited yet.