cs.LGNov 14, 2026

Multi-Objective Causal Bandits: Minimal Intervention Space and Policy-Level Learning

Authors: Muhammad Qasim Elahi, Mahsa Ghasemi, Murat Kocaoglu

Organizations: School of Electrical and Computer Engineering, Purdue University · School of Computer Science, Johns Hopkins University

Abstract

Many decision-making problems involve multiple objectives, where actions affect several performance metrics, fairness criteria, or safety constraints. We study multi-objective causal bandits with multiple reward nodes, where actions correspond to interventions on subsets of variables in a causal graph and performance is evaluated through Pareto optimality. Existing approaches to multi-objective bandits often rely on pairwise Pareto dominance or optimize a fixed scalarization. However, pairwise comparisons alone can fail to identify actions dominated by randomized policies, whose expected reward vectors lie in the convex hull of action-level rewards. Thus, an intervention may be suboptimal even if no single intervention dominates it, because it can be dominated by a randomized policy over other interventions. We formalize this policy-level phenomenon and show that it has consequences for both causal action-space reduction and online learning. First, we provide a necessary-and-sufficient graphical characterization of possibly Pareto- optimal minimal intervention sets. Our characterization yields a minimal, sound, and complete candidate intervention family from the graph alone, correcting prior formulations that may include intervention sets that are never Pareto-optimal under any compatible structural causal model. Second, over this reduced intervention space, we design an online UCB-style algorithm that eliminates actions using dominance tests against convex combinations of other actions, and prove logarithmic gap-dependent Pareto regret. Finally, we study constrained multi-objective causal bandits, where feasibility and optimality may be realized only with randomized policies, and develop an online UCB-style constrained bandit algorithm with sublinear regret and constraint-violation guarantees.

Figures & tables

Appendix figures & tables7 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. The Minimal Search Space for Conditional Causal Bandits

    Feb 10, 2025Francisco N. F. Q. Simoes, Itai Feigenbaum, Mehdi Dastani +1Multi-Armed BanditsCausal Bandits

  2. Generalizing Causal Decision-Making: Markov Equivalence, Transportability and Counterfactuals

    Nov 10, 2026Min Woo Park, Sanghack Leecausal transportabilityCausal Bandits

  3. Minimax Optimal Regret for Causal Logistic Bandits with Counterfactual Fairness

    Oct 1, 2026Junhyuk Huh, Seoungbin Bae, Dabeen LeeMulti-Armed BanditsMinimax Regret