Search arXivSearch

arXiv · 2601.20405

A Distributional Perspective on Pearl's Causal Hierarchy: From Marginal to Joint and Individualized Potential Outcomes

Abstract

Pearl's causal hierarchy is a foundational lens for formulating causal questions and is most often discussed within the framework of structural causal models. We recast the hierarchy in potential outcomes language and make its information ordering operational at the level of causal estimands. Specifically, we classify an estimand according to whether it requires marginal potential outcome distributions, their joint distribution or nested cross-world quantities, or individual-level counterfactual outcomes. We apply this criterion systematically to a broad range of estimands, including cases whose classification depends on the formulation of the scientific question. We then clarify what additional assumptions are needed when an estimand depends not only on the marginal distributions of potential outcomes, but also on their unobserved joint distribution. In particular, randomization identifies the marginals, whereas monotonicity, copula restrictions, rank preservation, and partial identification restrict or characterize the remaining uncertainty about the joint distribution. The resulting framework provides a practical map from a scientific question to an estimand, the probabilistic object it requires, and the assumptions needed for identification.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Peng Wu, Linbo Wang. 2026-07-28. A Distributional Perspective on Pearl's Causal Hierarchy: From Marginal to Joint and Individualized Potential Outcomes. https://arxiv.org/abs/2601.20405

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

See You at the Posterior Line: Learning Bayesian Modeling Through a Car Racing Game

We present an interactive classroom activity designed to address a central challenge in teaching introductory Bayesian statistics: how to formalize subjective knowledge and available information into prior distributions and then update them with empirical data. Role-playing as data analysts for a racing team, students evaluate candidate tires by converting qualitative engineering reports into prior distributions, collecting primary data via a virtual racing game, and using a Beta-Binomial model to inform team strategy. This discovery-based exercise allows small groups to observe directly how different prior choices and sample data jointly shape posterior inference. Student feedback ($n=32$) highlights high enjoyment, engagement and improved conceptual clarity. Open-access materials to implement the activity are provided, alongside recommendations for adapting it to other teaching contexts.

stat.OT

Why is Regularization Underused? An Empirical Study on Trust and Adoption of Statistical Methods

Statistical practice does not automatically follow methodological innovation. Regularization methods, widely advocated to reduce overfitting and stabilize inference, are readily available in modern software, but are not consistently used by data analysts. We investigate this implementation gap in a large-scale empirical study of trust in, and acceptance of, regularization techniques, based on $N = 606$ data analysts. Drawing on measurement frameworks from technology acceptance research, we survey practitioners and embed a randomized experiment to test whether written recommendation of regularization methods increases trust or intended use. We find no evidence of such an effect. Instead, adoption intentions are strongly associated with analysts' perceptions of ease of implementation and practical benefit, such as improved bias control or interpretability. Perceived social norms also emerge as a central driver. These results indicate that uptake of statistical methodology depends less on formal recommendations than on usability, perceived utility, and community practice.

stat.OT

Exact analysis of a split--merge queue with latent Erlang-factor dependent subtask times

This paper studies a two-server split--merge queue with positively dependent subtask service times modeled through a latent-factor bivariate Erlang construction. An exact characterization of the split--merge completion time is obtained, including explicit formulas for its first two moments and the resulting mean waiting time. Under fixed marginal service-time distributions, independence is shown to stochastically increase the completion time and hence overestimate mean waiting time. Numerical illustrations show that this benchmark gap can be substantial.

stat.OT