SafeAdapt-Poker: Counterfactual Risk Calibration for Budgeted Adaptation under Opponent Shift
Not on the map. Why?
Abstract (arXiv)
Opponent histories can mislead after behavioral shifts. SafeAdapt-Poker formulates budgeted adaptation under opponent shift as a dual-counterfactual sequential-control problem using only information available before each decision. At each decision the controller asks two distinct questions: what local downside a deviation from the frozen anchor would induce under matched legal continuations, and what future adaptation value would be lost by consuming part of the remaining deviation budget now. The first question is answered by a monotone strategic-risk model over deviation intensity; the second by a paired budget-state continuation model that prices current budget consumption. The controller selects among support-preserving candidate deviations by trading immediate adaptation value against these two quantities, a pathwise cumulative-KL ledger bounds total anchor-relative deviation, and a finite family of frozen controllers is screened on complete paired calibration sessions before held-out interaction. A finite-candidate perturbation bound shows that the allocation objective degrades continuously with continuation-value estimation error. Evaluation covers exact-game exploitation and safety, four opponent shifts, local-risk calibration, delayed-opportunity allocation, direct opportunity-value estimation, value-error robustness, factorial mechanism attribution, budget sensitivity, abstract-HUNL cross-play, and player/time-held-out public-history behavior. On exact Leduc the full controller attains a matched weak-pool gain of +0.0718 with a worst-opponent delta of -0.0126, raises delayed-opportunity capture from 0.6318 under myopic allocation to 0.7841 under the same session budget, and reaches +42.7 mbb/hand in abstract-HUNL cross-play; the retained public-history screen reports 0.5820 action accuracy and 0.9277 log loss versus 0.5039 and 0.9778 for a public prior.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 26 of its 57 references that are in the map. First posted on arXiv 14 Oct 2026.
Builds on
26 of 57 references.
References · 26
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,926
- 2015Trust Region Policy Optimizationcited by 2,580
- 2021Decision Transformer: Reinforcement Learning via Sequence Modelingcited by 1,546
- 2021Offline Reinforcement Learning with Implicit Q-Learningcited by 1,293
- 2017Constrained Policy Optimizationcited by 983
- 2015Policy Distillationcited by 440
- 2019Beyond temperature scaling: Obtaining well-calibrated multiclass probabilities with Dirichlet calibrationcited by 364
- 2019SelectiveNet: A Deep Neural Network with an Integrated Reject Optioncited by 350
- 2018A Lyapunov-based Approach to Safe Reinforcement Learningcited by 297
- 2017DeepStack: Expert-Level Artificial Intelligence in No-Limit Pokercited by 233
- 2019OpenSpiel: A Framework for Reinforcement Learning in Gamescited by 186
14 more
- 2018A Survey and Critique of Multiagent Deep Reinforcement Learningcited by 177
- 2015Risk-Sensitive and Robust Decision-Making: a CVaR Optimization Approachcited by 170
- 2013Bandits with Knapsackscited by 164
- 2016Deep Reinforcement Learning from Self-Play in Imperfect-Information Gamescited by 158
- 2017Safe Policy Improvement with Baseline Bootstrappingcited by 144
- 2017Autonomous Agents Modelling Other Agents: A Comprehensive Survey and Open Problemscited by 131
- 2020Combining Deep Reinforcement Learning and Search for Imperfect-Information Gamescited by 114
- 2018Deep Counterfactual Regret Minimizationcited by 103
- 2017Safe and Nested Subgame Solving for Imperfect-Information Gamescited by 41
- 2013Solving Imperfect Information Games Using Decompositioncited by 29
- 2018Variance Reduction in Monte Carlo Counterfactual Regret Minimization (VR-MCCFR) for Extensive Form Games using Baselinescited by 25
- 2026Using Common Random Numbers for Simulation-based Planning with Rolloutscited by 5
- 2023PokerKit: A Comprehensive Python Library for Fine-Grained Multi-Variant Poker Game Simulationscited by 4
- 2023Recording and Describing Poker Handscited by 2
Built on by
Not cited yet.