Rehearsal Learning for Avoiding Undesired Future
Tian Qin, Tian-Zuo Wang, Zhi-Hua Zhou
Abstract
Machine learning (ML) models have been widely used to make predictions. Instead of a predictive statement about future outcomes, in many situations we want to pursue a decision: what can we do to avoid the undesired future if an ML model predicts so? In this paper, we present a rehearsal learning framework, in which decisions that can persuasively avoid the happening of undesired outcomes can be found and recommended. Based on the influence relation, we characterize the generative process of variables with structural rehearsal models, consisting of a probabilistic graphical model called rehearsal graphs and structural equations, and find actionable decisions that can alter the outcome by reasoning under a Bayesian framework. Moreover, we present a probably approximately correct bound to quantify the associated risk of a decision. Experiments validate the effectiveness of the proposed rehearsal learning framework and the informativeness of the bound.
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.
Cited by top-tier papers10
- Avoiding Undesired Future with Minimal Cost in Non-Stationary EnvironmentsWen-Bo Du, Tian Qin, Tian-Zuo Wang, Zhi-Hua ZhouNeurIPS 2024 · 6 citations
- An Efficient Maximal Ancestral Graph Listing AlgorithmTian-Zuo Wang, Wen-Bo Du, Zhi-Hua ZhouICML 2024 · 4 citations
- Structural Causal Bandits under Markov EquivalenceMin Woo Park, Andy Arditi, Elias Bareinboim, Sanghack LeeNeurIPS 2025 · 3 citations
- Gradient-Based Nonlinear Rehearsal Learning with Multivariate AlterationsTian Qin, Tian-Zuo Wang, Zhi-Hua ZhouAAAI 2025 · 3 citations
- Counterfactual Structural Causal BanditsMin Woo Park, Sanghack LeeICLR 2026 · 1 citation
Builds on10
- DiBS: Differentiable Bayesian Structure LearningLars Lorch, Jonas Rothfuss, Bernhard Schölkopf, Andreas KrauseNeurIPS 2021 · 144 citations
- Causal Bandits with Unknown Graph StructureYangyi Lu, Amirhossein Meisami, Ambuj TewariNeurIPS 2021 · 53 citations
- Dynamic Causal Bayesian OptimizationVirginia Aglietti, Neil Dhir, Javier González, Theodoros DamoulasNeurIPS 2021 · 40 citations
- Efficient Contextual Bandits with Continuous ActionsMaryam Majzoubi, Chicheng Zhang, Rajan Chari, Akshay Krishnamurthy et al.NeurIPS 2020 · 39 citations
- Sampling-Based Robust Control of Autonomous Systems with Non-Gaussian NoiseThom S. Badings, Alessandro Abate, Nils Jansen, David Parker et al.AAAI 2022 · 33 citations
Related papers
- Variance-Reduced Long-Term Rehearsal Learning with Quadratic Programming ReformulationWen-Bo Du, Tian Qin, Tian-Zuo Wang, Zhi-Hua ZhouNeurIPS 2025 · 1 citation
- Enabling Optimal Decisions in Rehearsal Learning under CARE ConditionWen-Bo Du, Hao-Yi Lei, Lue Tao, Tian-Zuo Wang et al.ICML 2025
- Personal Insights for Altering Decisions of Tree-based Ensembles over TimeNave Frost, Naama Boer, Daniel Deutch, Tova MiloVLDB 2020 · 7 citations
- On Measuring Influence in Avoiding Undesired FutureLue Tao, Tian-Zuo Wang, Yuan Jiang, Zhi-Hua ZhouICLR 2026
- Hedging as Reward Augmentation in Probabilistic Graphical ModelsDebarun Bhattacharjya, Radu MarinescuNeurIPS 2022
