Tutorials
Efficient Symbolic Computations for Identifying Causal Effects
arXiv:2604.20516v1 Announce Type: cross Abstract: Determining identifiability of causal effects from observational data under latent confounding is a central challenge in causal inference. For linear
arXiv:2604.20516v1 Announce Type: cross Abstract: Determining identifiability of causal effects from observational data under latent confounding is a central challenge in causal inference. For linear structural causal models, identifiability of causal effects is decidable through symbolic computation. However, standard approaches based on Grobner bases become computationally infeasible beyond small settings due to their doubly exponential complexity. In this work, we study how to practically use symbolic computation for deciding rational identifiability. In particular, we present an efficient algorithm that provably finds the lowest degree identifying formulas. For a causal effect of interest, if there exists an identification formula of a prespecified maximal degree, our algorithm returns such a formula in quasi-polynomial time.
Related
- MapPFN: Learning Causal Perturbation Maps in Context
- Transformers Learn Latent Mixture Models In-Context via Mirror Descent
- Data-driven Reachable Set Estimation with Tunable Adversarial and Wasserstein Distributional Guarantees
- PyEPO: A PyTorch-based End-to-End Predict-then-Optimize Library for Linear and Integer Programming
Source: arXiv cs.LG | 2026-04-23