Introduction
In many real-world applications of bandit optimization, such as clinical trials or online advertising, exploration can be inherently risky. While standard bandit algorithms aim to maximize cumulative reward, they often ignore instantaneous safety constraints. This paper addresses the problem of stage-wise conservative linear stochastic bandits, where the learner must ensure that the expected reward of any chosen action never falls below a fixed fraction of a known baseline. Unlike previous work focusing on cumulative safety, this "stage-wise" approach ensures that every single decision meets a minimum safety threshold.
Proposed Algorithms: SCLTS and SCLUCB
The authors introduce two novel algorithms: Stage-wise Conservative Linear Thompson Sampling (SCLTS) and Stage-wise Conservative Linear UCB (SCLUCB). Both algorithms leverage confidence ellipsoids to maintain an estimate of the unknown reward parameter $\theta_*$.
The Core Mechanism
- Confidence Regions: The learner maintains a set that contains $\theta_*$ with high probability.
- Estimated Safe Set: At each iteration, the algorithm identifies actions guaranteed to be safe for all parameters within the confidence ellipsoid.
- Randomized Conservative Exploration: A key innovation is the use of a randomized conservative action—a convex combination of the baseline action and a random noise vector—when uncertainty is high. This allows for informative exploration while strictly adhering to safety constraints.
Theoretical and Numerical Results
A significant theoretical contribution is the proof that these algorithms play the sub-optimal baseline action only $O(\log T)$ times, a substantial improvement over the $O(\sqrt{T})$ required by previous methods like SEGE. Furthermore, SCLUCB achieves a regret bound of $O(d\sqrt{T} \log T)$, matching the performance of standard linear bandits that operate without safety constraints.
Numerical simulations confirm these theoretical findings. As shown in the regret plots, SCLTS and SCLUCB significantly outperform the SEGE algorithm in terms of cumulative regret and convergence speed. The proposed framework is also versatile, capable of handling variations such as bandit-feedback constraints or unknown baseline reward sequences.
Crucially, the algorithms maintain safety throughout the learning process. The expected reward consistently stays above the predefined safety threshold (indicated by the red dashed line), even during the initial exploration phase.
Conclusion and Future Directions
SCLTS and SCLUCB provide a robust framework for safe exploration in linear bandit problems. By reducing the reliance on sub-optimal baseline actions and providing tight regret bounds, they bridge the gap between theoretical safety and practical performance. Future work includes extending these principles to Generalized Linear Bandits and handling non-linear safety constraints.
Summary updated