Complete Generic Identifiability in Cyclic LiNGAM with General Confounding
Sourced from the work of Daniele Tramontano, Jalal Etesami, Mathias Drton
§ Problem Statement
Setup
Let index observed variables . Consider the linear structural equation model with feedback
equivalently for each , where has zero diagonal and is invertible (so is well defined). Directed cycles in the observed graph are allowed: define on by iff .
This setup follows Tramontano et al. (2025).
Assume the disturbance vector is generated from latent exogenous noise as follows: there exist independent non-Gaussian random variables and measurable functions such that
Hence the joint law of may have arbitrary dependence (including higher-order confounding) induced by shared latent exogenous sources and nonlinear mixing. The observational input is only the joint law .
Fix a graphical model class specified by: which directed coefficients are structurally allowed/nonzero (the directed part), and which latent confounding patterns are structurally allowed (e.g., via latent nodes pointing to subsets of observed nodes, equivalently a latent-projection/hyperedge specification). For a directed edge parameter , say is generically identifiable in if there exists an exceptional set of parameter values of measure zero in the finite-dimensional structural parameters (at least the directed coefficients, and any finite-dimensional confounding-structure parameters if present) such that, outside that set, equality of observational laws implies equality of that coefficient: if then .
Unsolved Problem
Determine necessary and sufficient purely graphical conditions on under which each direct effect is generically identifiable from in this cyclic, non-Gaussian, generally confounded model class, and construct a decision procedure that, given and , decides identifiability of in time polynomial in the graph size.
§ Discussion
§ Significance & Implications
The paper's main theorem is for acyclic models; extending this to feedback systems would cover many equilibrium and dynamical applications. A full criterion would close a central gap between DAG-based identification and realistic systems with cycles. See Tramontano et al. (2025) for details.
§ Known Partial Results
Tramontano et al. (2025): This paper proves a necessary-and-sufficient criterion (with polynomial-time algorithm) for generic identifiability of direct effects in the acyclic case, and only explores a generalization to feedback loops.
§ References
Parameter identification in linear non-Gaussian causal models under general confounding
Daniele Tramontano, Jalal Etesami, Mathias Drton (2025)
Annals of Statistics (to appear)
📍 arXiv:2405.20856, Section 7 ("Cyclic Graphs"), concluding discussion on extending identifiability to feedback loops.
Source paper where this problem appears.