Causal Discovery on Higher-Order Interactions

• URL: http://arxiv.org/abs/2511.14206v1
• Date: Tue, 18 Nov 2025 07:35:00 GMT
• Title: Causal Discovery on Higher-Order Interactions
• Authors: Alessio Zanga, Marco Scutari, Fabio Stella,
• Abstract summary: Causal discovery combines data with knowledge provided by experts to learn the DAG representing the causal relationships between a given set of variables.<n>When data are scarce, bagging is used to measure our confidence in an average DAG obtained by aggregating bootstrapped DAGs.<n>We introduce a novel theoretical framework based on higher-order structures and describe a new DAG aggregation algorithm.
• Score: 2.0697105762666324
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Causal discovery combines data with knowledge provided by experts to learn the DAG representing the causal relationships between a given set of variables. When data are scarce, bagging is used to measure our confidence in an average DAG obtained by aggregating bootstrapped DAGs. However, the aggregation step has received little attention from the specialized literature: the average DAG is constructed using only the confidence in the individual edges of the bootstrapped DAGs, thus disregarding complex higher-order edge structures. In this paper, we introduce a novel theoretical framework based on higher-order structures and describe a new DAG aggregation algorithm. We perform a simulation study, discussing the advantages and limitations of the proposed approach. Our proposal is both computationally efficient and effective, outperforming state-of-the-art solutions, especially in low sample size regimes and under high dimensionality settings.

Related papers

• Analytic DAG Constraints for Differentiable DAG Learning [83.93320658222717]
  We develop a theory to establish a connection between analytic functions and DAG constraints.<n>We show that analytic functions from the set $f(x) = c_0 + sum_i=1inftyc_ixi | forall i > 0, c_i > 0; r = lim_irightarrow inftyc_i/c_i+1 > 0$ can be employed to formulate effective DAG constraints.
  arXiv  Detail & Related papers  (2025-03-24T23:51:35Z)
• Your Assumed DAG is Wrong and Here's How To Deal With It [4.262342157729123]
  We propose an efficient, gradient-based optimization method that provides bounds for causal queries over a collection of causal graphs.<n>Our approach aims at providing an easy-to-use and widely applicable rebuttal to the valid critique of What if your assumed DAG is wrong?'
  arXiv  Detail & Related papers  (2025-02-24T10:31:12Z)
• Causal Discovery via Bayesian Optimization [14.698661810621326]
  We propose DrBO (DAG recovery via Bayesian Optimization) to find high-scoring DAGs.<n>DrBO is computationally efficient and can find the accurate DAG in fewer trials and less time than existing state-of-the-art methods.
  arXiv  Detail & Related papers  (2025-01-25T00:19:38Z)
• Structural transfer learning of non-Gaussian DAG [24.11895013147964]
  Directed acyclic graph (DAG) has been widely employed to represent directional relationships among a set of collected nodes. It remains an open question how to pool the heterogeneous data together for better DAG structure reconstruction in the target study. We introduce a novel set of structural similarity measures for DAG and then present a transfer DAG learning framework.
  arXiv  Detail & Related papers  (2023-10-16T10:01:27Z)
• Discovering Dynamic Causal Space for DAG Structure Learning [64.763763417533]
  We propose a dynamic causal space for DAG structure learning, coined CASPER. It integrates the graph structure into the score function as a new measure in the causal space to faithfully reflect the causal distance between estimated and ground truth DAG.
  arXiv  Detail & Related papers  (2023-06-05T12:20:40Z)
• Truncated Matrix Power Iteration for Differentiable DAG Learning [47.69479930501961]
  We propose a novel DAG learning method with efficient truncated matrix power to approximate series-based DAG constraints. Empirically, our DAG learning method outperforms the previous state-of-the-arts in various settings.
  arXiv  Detail & Related papers  (2022-08-30T23:56:12Z)
• BCDAG: An R package for Bayesian structure and Causal learning of Gaussian DAGs [77.34726150561087]
  We introduce the R package for causal discovery and causal effect estimation from observational data. Our implementation scales efficiently with the number of observations and, whenever the DAGs are sufficiently sparse, the number of variables in the dataset. We then illustrate the main functions and algorithms on both real and simulated datasets.
  arXiv  Detail & Related papers  (2022-01-28T09:30:32Z)
• 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)
• Incorporating Causal Graphical Prior Knowledge into Predictive Modeling via Simple Data Augmentation [92.96204497841032]
  Causal graphs (CGs) are compact representations of the knowledge of the data generating processes behind the data distributions. We propose a model-agnostic data augmentation method that allows us to exploit the prior knowledge of the conditional independence (CI) relations. We experimentally show that the proposed method is effective in improving the prediction accuracy, especially in the small-data regime.
  arXiv  Detail & Related papers  (2021-02-27T06:13:59Z)
• On the Role of Sparsity and DAG Constraints for Learning Linear DAGs [16.97675762810828]
  We study the role of sparsity and DAG constraints for learning DAG models in the linear Gaussian and non-Gaussian cases. We propose a likelihood-based score function, and show that one only has to apply soft sparsity and DAG constraints to learn a DAG equivalent to the ground truth DAG.
  arXiv  Detail & Related papers  (2020-06-17T23:43:23Z)

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.