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.
By Eric Rossetto, Alessandro Antonucci
arXiv:2607. 26357v1 Announce Type: new Abstract: The problem of learning the graphical Markov blanket (MB) of a variable from data has applications in many areas such as structure learning for Bayesian networks and Markov random fields, causal discovery, and feature selection.
By Loong Kuan Lee, Ragavi Krishnamoorthy, Nico Piatkowski
arXiv:2608.28991v1 Announce Type: cross
Abstract: Causal representation learning (CRL) aims to recover latent causal variables and their structural relations from high-dimensional observations. Exist...
By Haijie Xu, Chen Zhang
arXiv:2606. 19594v1 Announce Type: new Abstract: Causal abstractions formalize when a high-level structural causal model (SCM) captures the interventional behavior of a lower-level SCM.
By Th\'eo Saulus, Simon Lacoste-Julien, Dhanya Sridhar
arXiv:2401. 04890v2 Announce Type: replace-cross Abstract: This work introduces a novel principle for disentanglement we call mechanism sparsity regularization, which applies when the latent factors of interest depend sparsely on observed auxiliary variables and/or past latent factors.
By S\'ebastien Lachapelle, Pau Rodr\'iguez L\'opez, Yash Sharma, Katie Everett, R\'emi Le Priol, Alexandre Lacoste, Simon Lacoste-Julien
arXiv:2505. 15274v4 Announce Type: replace Abstract: Probabilities of causation (PoCs) are fundamental quantities for counterfactual analysis and personalized decision making.
By Xin Shu, Shuai Wang, Ang Li
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.
By Tobias Maringgele, Jalal Etesami
arXiv:2607. 11816v1 Announce Type: new Abstract: Causal discovery algorithms learn a network that describes the causal dependencies among random variables.
By Bijan Mazaheri, Jiaqi Zhang, Caroline Uhler
arXiv:2606. 10934v1 Announce Type: new Abstract: A common assumption holds that enough observational and interventional data, given to a strong enough predictor, suffices.
By Fabio Rovai
The paper investigates federated learning for linear non‑Gaussian acyclic models (LiNGAM), proposing the FedRCD family of algorithms that use higher‑order cumulants to enable privacy‑preserving causal discovery across distributed clients. It addresses limitations of existing federated methods, such as FedISHC’s failure under near‑symmetric noise, and introduces variants that balance communication rounds with algebraic noise handling. Experiments reveal that cumulant‑based federated approaches rank variables by a variance ladder induced by the DAG rather than by population asymmetry, and that marginal standardisation degrades performance while scale‑invariant DirectLiNGAM remains robust.
arXiv:2608. 12657v1 Announce Type: new Abstract: Probabilities of causation (PoCs) characterize individual causal responses that cannot be directly observed and therefore generally require partial identification.
By Xin Shu, Zhen Lei, Ang Li
arXiv:2607. 11508v1 Announce Type: cross Abstract: Causal discovery, the process of recovering underlying causal structures from observational data, is a fundamental pursuit across scientific disciplines.
By Jie Qiao, Ruichu Cai, Zijian Li, Weilin Chen, Pengfei Hua, Boyan Xu, Zhengming Chen, Zhifeng Hao, Peng Cui