Latent Confounded Causal Discovery via Lie Bracket Geometry

• URL: http://arxiv.org/abs/2606.19610v1
• Date: Wed, 17 Jun 2026 21:31:16 GMT
• Title: Latent Confounded Causal Discovery via Lie Bracket Geometry
• Abstract summary: This paper introduces two causal discovery algorithms under latent confounding.<n>BRIDGE and Spectral Kan-Do Flow Matching learn intervention fields and factors latent curvature spectrally.<n>A detailed set of experiments show that both algorithms are capable of discovering causal models with latent confounders.
• Score: 1.3295383263113112
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recent work on Kan-Do-Calculus (KDC) has established that the boundary between passive observation and active intervention in causal inference is a category-theoretic bi-adjunction, with interventions modeled by left Kan extensions and conditioning by right Kan extensions. This paper introduces two causal discovery algorithms under latent confounding, building on the information-geometric and categorical consequences of KDC. In smooth statistical settings, Radon-Nikodym derivatives between observational and interventional measures induce local causal vector fields; failures of these fields to close under Lie brackets become computable Frobenius residuals, which we interpret as witnesses of failed visible integrability and possible latent or unmodeled structure. Our first algorithm, BRIDGE (Bracket Residuals for Interventional Discovery and Geometric Estimation), combines an interventional density or Radon-Nikodym-ratio engine with a geometric screen that proposes a high-recall family of admissible arrows, identifies non-closing visible pairs as latent-obstruction candidates, and passes the reduced family to downstream score-based or differentiable discovery routines. The second algorithmic contribution, Spectral Kan-Do Flow Matching (SKFM), learns amortized intervention fields and factors latent curvature spectrally, exposing the direct Lie-space endpoint toward which BRIDGE points. A detailed set of experiments show that both algorithms are capable of discovering causal models with latent confounders while collapsing the super-exponential space of possible DAGs by many orders of magnitude. This paper introduces a new paradigm in causal discovery, where latent structure is inferred directly from the geometry of intervention-induced flows.

Related papers

• Causal Ensemble Agent: Hierarchical Causal Discovery with LLM-guided Expert Reweighting [95.24017293537025]
  Causal Ensemble Agent (CEA) is a novel framework that aggregates structural insights from statistical discovery experts across different graph levels.<n>CEA achieves the strongest overall performance across a wide range of causal discovery methods.
  arXiv  Detail & Related papers  (2026-06-09T09:09:07Z)
• Scalable Contrastive Causal Discovery under Unknown Soft Interventions [3.165716101116899]
  We propose a scalable causal discovery model for paired observational and interventional settings with shared underlying causal structure and unknown soft interventions.<n> Experiments on synthetic data demonstrate improved causal structure recovery, generalization to unseen graphs with held-out causal mechanisms, and scalability to larger graphs.
  arXiv  Detail & Related papers  (2026-03-03T18:16:16Z)
• Large-Scale Bayesian Causal Discovery with Interventional Data [0.0]
  Inferring causal relationships among a set of variables in the form of a directed acyclic graph (DAG) is an important but notoriously challenging problem.<n>We propose Interventional Bayesian Causal Discovery (IBCD), an empirical Bayesian framework for causal discovery with interventional data.
  arXiv  Detail & Related papers  (2025-10-02T01:16:04Z)
• Design of Experiment for Discovering Directed Mixed Graph [6.3850400710838615]
  We study the problem of experimental design for accurately identifying the causal graph structure of a simple structural causal model (SCM)<n>The presence of cycles renders it impossible to recover the graph skeleton using observational data alone.<n>We develop two classes of algorithms, i.e., bounded and unbounded, that can recover all causal edges except for double adjacent bidirected edges.
  arXiv  Detail & Related papers  (2025-09-02T02:24:55Z)
• Addressing pitfalls in implicit unobserved confounding synthesis using explicit block hierarchical ancestral sampling [1.7037247867649157]
  We show that state-of-the-art protocols have two distinct issues that hinder unbiased sampling from the complete space of causal models.<n>We propose an improved explicit modeling approach for unobserved confounding, leveraging block-hierarchical ancestral generation of ground truth causal graphs.
  arXiv  Detail & Related papers  (2025-03-12T09:38:40Z)
• Linear Causal Representation Learning from Unknown Multi-node Interventions [29.21757873428357]
  It is established that given sufficiently diverse interventional environments, identifiability up to ancestors is possible using only soft interventions.<n>Remarkably, these guarantees match the best-known results for more restrictive single-node interventions.
  arXiv  Detail & Related papers  (2024-06-09T23:56:49Z)
• Learning Linear Causal Representations from Interventions under General Nonlinear Mixing [52.66151568785088]
  We prove strong identifiability results given unknown single-node interventions without access to the intervention targets. This is the first instance of causal identifiability from non-paired interventions for deep neural network embeddings.
  arXiv  Detail & Related papers  (2023-06-04T02:32:12Z)
• Score-based Causal Representation Learning with Interventions [54.735484409244386]
  This paper studies the causal representation learning problem when latent causal variables are observed indirectly. The objectives are: (i) recovering the unknown linear transformation (up to scaling) and (ii) determining the directed acyclic graph (DAG) underlying the latent variables.
  arXiv  Detail & Related papers  (2023-01-19T18:39:48Z)
• BaCaDI: Bayesian Causal Discovery with Unknown Interventions [118.93754590721173]
  BaCaDI operates in the continuous space of latent probabilistic representations of both causal structures and interventions. In experiments on synthetic causal discovery tasks and simulated gene-expression data, BaCaDI outperforms related methods in identifying causal structures and intervention targets.
  arXiv  Detail & Related papers  (2022-06-03T16:25:48Z)
• Effect Identification in Cluster Causal Diagrams [51.42809552422494]
  We introduce a new type of graphical model called cluster causal diagrams (for short, C-DAGs) C-DAGs allow for the partial specification of relationships among variables based on limited prior knowledge. We develop the foundations and machinery for valid causal inferences over C-DAGs.
  arXiv  Detail & Related papers  (2022-02-22T21:27:31Z)
• BCD Nets: Scalable Variational Approaches for Bayesian Causal Discovery [97.79015388276483]
  A structural equation model (SEM) is an effective framework to reason over causal relationships represented via a directed acyclic graph (DAG) Recent advances enabled effective maximum-likelihood point estimation of DAGs from observational data. We propose BCD Nets, a variational framework for estimating a distribution over DAGs characterizing a linear-Gaussian SEM.
  arXiv  Detail & Related papers  (2021-12-06T03:35:21Z)
• Learning Neural Causal Models with Active Interventions [83.44636110899742]
  We introduce an active intervention-targeting mechanism which enables a quick identification of the underlying causal structure of the data-generating process. Our method significantly reduces the required number of interactions compared with random intervention targeting. We demonstrate superior performance on multiple benchmarks from simulated to real-world data.
  arXiv  Detail & Related papers  (2021-09-06T13:10:37Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.