arXiv:2606. 19361v1 Announce Type: cross Abstract: Identification conditions describe the computability of a target query or parameter of interest as a function of the type and amount of information available.
The paper tackles selecting a cost‑constrained set of experiments that most effectively tighten bounds on a partially identifiable causal query. It formalizes this as the NP‑hard max‑potency problem, introduces efficient graphical pruning rules to reduce the search space, and demonstrates the approach on synthetic graphs and real NHANES data to estimate the effect of physical activity on diabetes.
The paper presents a method for partially identifying counterfactual queries without requiring a fully specified causal graph. By exploiting the topological ordering implied by the query itself, the authors transform the identification problem into a linear programming task, enabling bounds on arbitrary counterfactual and nested counterfactual queries. They demonstrate the tightness of these bounds and illustrate the approach on several case studies, showing its usefulness even when causal knowledge is incomplete.
The paper introduces a model‑agnostic inference framework for partially identified causal effects that leverages covariate information without requiring discrete covariates or accurate conditional distribution estimates. Using duality theory for optimal transport, the method delivers uniformly valid inference in randomized experiments, is doubly robust in observational settings, achieves asymptotic unbiasedness when nuisance parameters converge semiparametrically, and allows multiplier‑bootstrap selection of covariates and models while remaining computationally efficient. Empirical applications show the approach consistently narrows identified sets and confidence intervals without imposing extra structural assumptions.
arXiv:2608. 06427v1 Announce Type: new Abstract: Generative models can reproduce an observational distribution while encoding an incorrect causal structure.
arXiv:2606. 21185v2 Announce Type: replace-cross Abstract: There is a precise sense in which drawing causal inferences from observational data is hard, even when identifiability is assumed.
arXiv:2605. 13430v3 Announce Type: replace-cross Abstract: Selection bias is pervasive in observational studies.
arXiv:2608. 15645v1 Announce Type: new Abstract: Transporting a causal conclusion from a source study population to a target one is a fundamental problem in causal inference.
CausalProfiler is a synthetic benchmark generator designed to evaluate causal machine learning (Causal ML) methods more rigorously and transparently. It randomly samples causal models, data, queries, and ground truths based on explicit design choices across observation, intervention, and counterfactual reasoning levels, providing coverage guarantees and transparent assumptions. The authors demonstrate its utility by testing several state‑of‑the‑art methods under diverse conditions, both within and outside the identification regime, highlighting the insights CausalProfiler can reveal.
arXiv:2606. 23741v1 Announce Type: cross Abstract: Causal reasoning, which encompasses the discovery of causal structures and the inference of causal effects, is fundamental to data-driven decision making.
arXiv:2510. 16703v3 Announce Type: replace-cross Abstract: The classical notion of causal effect identifiability is defined in terms of treatment and outcome variables.
The paper introduces Probabilistic Causal Impact (PCI), a framework that blends actual causality (AC) with Pearl’s probability of necessity and sufficiency to provide tractable, causally grounded explanations. PCI reframes explainability as an estimation problem on a probabilistic causal model, enabling efficient approximation via Monte Carlo sampling. The authors evaluate PCI on synthetic and real-world data, demonstrating consistency with AC, scalability, and applicability to complex continuous systems and large-scale causal machine learning models.
The paper addresses causal discovery in Directed Acyclic Graphs where nodes are either ordinal (modeled with an ordered logit) or follow a one‑parameter exponential family distribution. It proves that the direction of edges between such nodes is identifiable for generic parameter values, extending prior Ordinal‑Poisson results. The authors also propose a score‑based exhaustive search and a masked continuous optimization method using DAGMA, and demonstrate through simulations that these approaches recover orientations that are otherwise unidentifiable under classical structural equation models.