Graph Distance Based on Cause-Effect Estimands with Latents

• URL: http://arxiv.org/abs/2510.25037v1
• Date: Tue, 28 Oct 2025 23:38:43 GMT
• Title: Graph Distance Based on Cause-Effect Estimands with Latents
• Authors: Zhufeng Li, Niki Kilbertus,
• Abstract summary: We propose a graph distance measure for acyclic directed mixed graphs (ADMGs) based on the downstream task of cause-effect estimation under unobserved confounding.<n>We analyze the behavior of the measure under different graph perturbations and compare it against existing distance metrics.
• Score: 9.762906025971565
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Causal discovery aims to recover graphs that represent causal relations among given variables from observations, and new methods are constantly being proposed. Increasingly, the community raises questions about how much progress is made, because properly evaluating discovered graphs remains notoriously difficult, particularly under latent confounding. We propose a graph distance measure for acyclic directed mixed graphs (ADMGs) based on the downstream task of cause-effect estimation under unobserved confounding. Our approach uses identification via fixing and a symbolic verifier to quantify how graph differences distort cause-effect estimands for different treatment-outcome pairs. We analyze the behavior of the measure under different graph perturbations and compare it against existing distance metrics.

Related papers

• Causal Graph Learning via Distributional Invariance of Cause-Effect Relationship [54.575090553659074]
  We develop an algorithm that efficiently uncovers causal relationships with quadratic complexity in the number of observational variables.<n>Our experiments on a varied benchmark of large-scale datasets show superior or equivalent performance compared to existing works.
  arXiv  Detail & Related papers  (2026-02-03T10:26:16Z)
• Characterization and Learning of Causal Graphs from Hard Interventions [24.950078575332398]
  Causal discovery involves linking conditional independence (CI) invariances in observational data to corresponding graphical constraints via d-separation.<n>We propose a set of graphical constraints that are fundamentally linked to Pearl's do-calculus within the framework of hard interventions.<n>We also propose a learning algorithm to integrate multiple datasets from hard interventions, introducing new rules.
  arXiv  Detail & Related papers  (2025-05-02T06:20:08Z)
• Adaptive Online Experimental Design for Causal Discovery [9.447864414136905]
  Causal discovery aims to uncover cause-and-effect relationships encoded in causal graphs. We focus on data interventional efficiency and formalize causal discovery from the perspective of online learning. We propose a track-and-stop causal discovery algorithm that adaptively selects interventions from the graph separating system.
  arXiv  Detail & Related papers  (2024-05-19T13:26:33Z)
• Separation-based distance measures for causal graphs [15.37737222790121]
  State-of-the-art causal discovery methods do not output single causal graphs, but rather their equivalence classes (MECs)<n>We propose additional measures of distance that capture the difference in separations distances are not fit to assess.<n>We complement our theoretical analysis with toy examples and empirical experiments that highlight the differences to existing comparison metrics.
  arXiv  Detail & Related papers  (2024-02-07T15:36:53Z)
• Nonparametric Partial Disentanglement via Mechanism Sparsity: Sparse Actions, Interventions and Sparse Temporal Dependencies [58.179981892921056]
  This work introduces a novel principle for disentanglement we call mechanism sparsity regularization. We propose a representation learning method that induces disentanglement by simultaneously learning the latent factors. We show that the latent factors can be recovered by regularizing the learned causal graph to be sparse.
  arXiv  Detail & Related papers  (2024-01-10T02:38:21Z)
• A continuous Structural Intervention Distance to compare Causal Graphs [5.477914707166288]
  The distance is based on embedding intervention distributions over each pair of nodes. We show theoretical results which we validate with numerical experiments on synthetic data.
  arXiv  Detail & Related papers  (2023-07-31T07:20:26Z)
• Causally-guided Regularization of Graph Attention Improves Generalizability [69.09877209676266]
  We introduce CAR, a general-purpose regularization framework for graph attention networks. Methodname aligns the attention mechanism with the causal effects of active interventions on graph connectivity. For social media network-sized graphs, a CAR-guided graph rewiring approach could allow us to combine the scalability of graph convolutional methods with the higher performance of graph attention.
  arXiv  Detail & Related papers  (2022-10-20T01:29:10Z)
• Graph Self-supervised Learning with Accurate Discrepancy Learning [64.69095775258164]
  We propose a framework that aims to learn the exact discrepancy between the original and the perturbed graphs, coined as Discrepancy-based Self-supervised LeArning (D-SLA) We validate our method on various graph-related downstream tasks, including molecular property prediction, protein function prediction, and link prediction tasks, on which our model largely outperforms relevant baselines.
  arXiv  Detail & Related papers  (2022-02-07T08:04:59Z)
• Joint inference of multiple graphs with hidden variables from stationary graph signals [19.586429684209843]
  We introduce a joint graph topology inference method that models the influence of the hidden variables. Under the assumptions that the observed signals are stationary on the sought graphs, the joint estimation of multiple networks allows us to exploit such relationships.
  arXiv  Detail & Related papers  (2021-10-05T21:31:36Z)
• Deconfounded Score Method: Scoring DAGs with Dense Unobserved Confounding [101.35070661471124]
  We show that unobserved confounding leaves a characteristic footprint in the observed data distribution that allows for disentangling spurious and causal effects. We propose an adjusted score-based causal discovery algorithm that may be implemented with general-purpose solvers and scales to high-dimensional problems.
  arXiv  Detail & Related papers  (2021-03-28T11:07:59Z)
• Hyperbolic Graph Embedding with Enhanced Semi-Implicit Variational Inference [48.63194907060615]
  We build off of semi-implicit graph variational auto-encoders to capture higher-order statistics in a low-dimensional graph latent representation. We incorporate hyperbolic geometry in the latent space through a Poincare embedding to efficiently represent graphs exhibiting hierarchical structure.
  arXiv  Detail & Related papers  (2020-10-31T05:48:34Z)
• Multilayer Clustered Graph Learning [66.94201299553336]
  We use contrastive loss as a data fidelity term, in order to properly aggregate the observed layers into a representative graph. Experiments show that our method leads to a clustered clusters w.r.t. We learn a clustering algorithm for solving clustering problems.
  arXiv  Detail & Related papers  (2020-10-29T09:58:02Z)

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.