CSPI-MT: Calibrated Safe Policy Improvement with Multiple Testing for Threshold Policies
Brian M. Cho, Ana-Roxana Pop, Kyra Gan, Sam Corbett-Davies, Israel Nir, Ariel Evnine, Nathan Kallus
Abstract
When modifying existing policies in high-risk settings, it is often necessary to ensure with high certainty that the newly proposed policy improves upon a baseline, such as the status quo. In this work, we consider the problem of safe policy improvement, where one only adopts a new policy if it is deemed to be better than the specified baseline with at least a pre-specified probability. We focus on threshold policies, a ubiquitous class of policies with applications in economics, healthcare, and digital advertising. Existing methods rely on potentially underpowered safety checks and limit the opportunities for finding safe improvements, so too often they must revert to the baseline to maintain safety. We overcome these issues by leveraging the most powerful safety test in the asymptotic regime and allowing for multiple candidates to be tested for improvement over the baseline. We show that in adversarial settings, our approach controls the rate of adopting a policy worse than the baseline to the pre-specified error level, even in moderate sample sizes. We present CSPI and CSPI-MT, two novel algorithms for selecting cutoff(s) to maximize the policy improvement from baseline. We demonstrate through both synthetic and external datasets that our approaches improve both the detection rates of safe policies and the realized improvement, particularly under stringent safety requirements and low signal-to-noise conditions.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 6092eb0d-d4ea-4248-a38b-2a418b46806bCited by top-tier papers1
Ask how each one uses itBuilds on1
Related papers
- Scalable Safe Policy Improvement via Monte Carlo Tree SearchAlberto Castellini, Federico Bianchi, Edoardo Zorzi, Thiago D. Simão et al.ICML 2023 · 9 citations
- Multi-Objective SPIBB: Seldonian Offline Policy Improvement with Safety Constraints in Finite MDPsHarsh Satija, Philip S. Thomas, Joelle Pineau, Romain LarocheNeurIPS 2021 · 30 citations
- Stage-wise Conservative Linear BanditsAhmadreza Moradipari, Christos Thrampoulidis, Mahnoosh AlizadehNeurIPS 2020 · 37 citations
- Scalable Safe Policy Improvement for Factored Multi-Agent MDPsFederico Bianchi, Edoardo Zorzi, Alberto Castellini, Thiago D. Simão et al.ICML 2024 · 3 citations
- Strategies for Safe Multi-Armed Bandits with Logarithmic Regret and RiskTianrui Chen, Aditya Gangrade, Venkatesh SaligramaICML 2022 · 18 citations
