Concomitant DAG Learning: On the Roles of Noise Adaptivity, Sparsity, and Non-negativity

• URL: http://arxiv.org/abs/2605.23537v1
• Date: Fri, 22 May 2026 12:00:00 GMT
• Title: Concomitant DAG Learning: On the Roles of Noise Adaptivity, Sparsity, and Non-negativity
• Abstract summary: Directed acyclic graphs (DAGs) enable principled reasoning about cause-effect interactions in complex systems.<n>Most classical structure identification approaches face two key obstacles: the challenge of enforcing acyclicity, and identifiability challenges arising from latent or heterogeneous noise.<n>This tutorial offers an overview of recent signal processing and advances that address these issues by recasting DAG structure learning as a continuous, score-based estimation problem.
• Score: 14.977112037008224
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Directed acyclic graphs (DAGs) constitute a central modeling tool to enable principled reasoning about cause-effect interactions in complex systems. However, since the causal structure underlying a group of variables is often unknown and interventions may be infeasible or ethically challenging to implement, there is a need to address the task of inferring DAGs from observational data. However, most classical structure identification approaches face two key obstacles: the combinatorial challenge of enforcing acyclicity, which severely limits scalability, and identifiability challenges arising from latent confounding or heterogeneous noise. This tutorial offers an overview of recent signal processing and optimization advances that address these issues by recasting DAG structure learning as a continuous, score-based estimation problem over adjacency matrices. We begin with a didactic introduction to structural equation models and the formulation of causal graph recovery, followed by a historical survey of score-based methods ranging from early combinatorial search schemes and greedy heuristics to modern continuous frameworks that leverage smooth characterizations of acyclicity. Building on this foundation, we describe concomitant DAG estimation methods that jointly infer sparse causal structure and exogenous noise levels, improving robustness under heteroscedasticity and distribution shifts by rendering the estimator noise adaptive. All in all, the tutorial introduces readers to challenges and opportunities for signal processing research at the crossroads of causal inference, high-dimensional statistics, and scalable graph learning, while outlining emerging directions including online, nonlinear, and neural causal discovery.

Related papers

• Deep Gaussian Processes on Directed Acyclic Graphs [11.74273181198187]
  Many real-world processes can be represented as compositions of functions along a directed acyclic graph (DAG)<n>These functions are partially observed across the DAG, with noisy and heterogeneously sampled measurements.<n>We theoretically study their prior-collapse behaviour, and the effect of graph topology and intermediate observations on information preservation.<n>We offer a structured variational approximation that retains graph dependencies, preserves compositional uncertainty, and captures the explaining-away behaviour of colliders.
  arXiv  Detail & Related papers  (2026-07-10T17:41:11Z)
• TabCausal: Pretraining Across Causal Environments for Tabular Causal Discovery [47.81267771630766]
  Causal discovery foundation models (CDFMs) seek to amortize this problem by mapping a dataset directly to a causal graph in a single forward pass.<n>We propose TabCausal, a data-driven CDFM trained with broad causal pretraining over diverse graph priors.
  arXiv  Detail & Related papers  (2026-05-29T11:05:43Z)
• PACER: Acyclic Causal Discovery from Large-Scale Interventional Data [8.724450642752103]
  PACER is a scalable framework for causal discovery that guarantees acyclicity by construction.<n>It supports a unified likelihood-based treatment of observational and interventional data.<n>It matches or exceeds state-of-the-art methods on protein signaling and large-scale genetic perturbation benchmarks.
  arXiv  Detail & Related papers  (2026-05-14T19:26:53Z)
• Topology Identification and Inference over Graphs [61.06365536861156]
  Topology identification and inference of processes evolving over graphs arise in timely applications involving brain, transportation, financial, power, as well as social and information networks.<n>This chapter provides an overview of graph topology identification and statistical inference methods for multidimensional data.
  arXiv  Detail & Related papers  (2025-12-11T00:47:09Z)
• Causal Discovery for Linear DAGs with Dependent Latent Variables via Higher-order Cumulants [7.808674222118538]
  Existing methods assume mutually independent latent confounders or cannot properly handle models with causal relationships among observed variables.<n>We propose a novel algorithm that identifies causal DAGs in LvLiNGAM, allowing causal structures among latent variables, among observed variables, and between the two.
  arXiv  Detail & Related papers  (2025-10-16T15:15:20Z)
• Anomaly Detection and Generation with Diffusion Models: A Survey [51.61574868316922]
  Anomaly detection (AD) plays a pivotal role across diverse domains, including cybersecurity, finance, healthcare, and industrial manufacturing.<n>Recent advancements in deep learning, specifically diffusion models (DMs), have sparked significant interest.<n>This survey aims to guide researchers and practitioners in leveraging DMs for innovative AD solutions across diverse applications.
  arXiv  Detail & Related papers  (2025-06-11T03:29:18Z)
• Generalized Criterion for Identifiability of Additive Noise Models Using Majorization [7.448620208767376]
  We introduce a novel identifiability criterion for directed acyclic graph (DAG) models. We demonstrate that this criterion extends and generalizes existing identifiability criteria. We present a new algorithm for learning a topological ordering of variables.
  arXiv  Detail & Related papers  (2024-04-08T02:18:57Z)
• Causal Temporal Regime Structure Learning [49.77103348208835]
  We present CASTOR, a novel method that concurrently learns the Directed Acyclic Graph (DAG) for each regime.<n>We establish the identifiability of the regimes and DAGs within our framework.<n>Experiments show that CASTOR consistently outperforms existing causal discovery models.
  arXiv  Detail & Related papers  (2023-11-02T17:26:49Z)
• Order-based Structure Learning with Normalizing Flows [7.972479571606131]
  Estimating causal structure of observational data is a challenging search problem that scales super-exponentially with graph size. Existing methods use continuous relaxations to make this problem computationally tractable but often restrict the data-generating process to additive noise models (ANMs) We present Order-based Structure Learning with Normalizing Flows (OSLow), a framework that relaxes these assumptions using autoregressive normalizing flows.
  arXiv  Detail & Related papers  (2023-08-14T22:17:33Z)
• Heteroscedastic Causal Structure Learning [2.566492438263125]
  We tackle the heteroscedastic causal structure learning problem under Gaussian noises. By exploiting the normality of the causal mechanisms, we can recover a valid causal ordering. The result is HOST (Heteroscedastic causal STructure learning), a simple yet effective causal structure learning algorithm.
  arXiv  Detail & Related papers  (2023-07-16T07:53:16Z)
• Scalable Intervention Target Estimation in Linear Models [52.60799340056917]
  Current approaches to causal structure learning either work with known intervention targets or use hypothesis testing to discover the unknown intervention targets. This paper proposes a scalable and efficient algorithm that consistently identifies all intervention targets. The proposed algorithm can be used to also update a given observational Markov equivalence class into the interventional Markov equivalence class.
  arXiv  Detail & Related papers  (2021-11-15T03:16:56Z)
• 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)
• Disentangling Observed Causal Effects from Latent Confounders using Method of Moments [67.27068846108047]
  We provide guarantees on identifiability and learnability under mild assumptions. We develop efficient algorithms based on coupled tensor decomposition with linear constraints to obtain scalable and guaranteed solutions.
  arXiv  Detail & Related papers  (2021-01-17T07:48:45Z)

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.