TSLiNGAM: DirectLiNGAM under heavy tails

• URL: http://arxiv.org/abs/2308.05422v1
• Date: Thu, 10 Aug 2023 08:34:46 GMT
• Title: TSLiNGAM: DirectLiNGAM under heavy tails
• Authors: Sarah Leyder, Jakob Raymaekers and Tim Verdonck
• Abstract summary: We propose TSLiNGAM, a new method for identifying the DAG of a causal model based on observational data. TSLiNGAM builds on DirectLiNGAM, a popular algorithm which uses simple OLS regression for identifying causal directions between variables. It performs significantly better on heavy-tailed and skewed data and demonstrates a high small-sample efficiency.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: One of the established approaches to causal discovery consists of combining directed acyclic graphs (DAGs) with structural causal models (SCMs) to describe the functional dependencies of effects on their causes. Possible identifiability of SCMs given data depends on assumptions made on the noise variables and the functional classes in the SCM. For instance, in the LiNGAM model, the functional class is restricted to linear functions and the disturbances have to be non-Gaussian. In this work, we propose TSLiNGAM, a new method for identifying the DAG of a causal model based on observational data. TSLiNGAM builds on DirectLiNGAM, a popular algorithm which uses simple OLS regression for identifying causal directions between variables. TSLiNGAM leverages the non-Gaussianity assumption of the error terms in the LiNGAM model to obtain more efficient and robust estimation of the causal structure. TSLiNGAM is justified theoretically and is studied empirically in an extensive simulation study. It performs significantly better on heavy-tailed and skewed data and demonstrates a high small-sample efficiency. In addition, TSLiNGAM also shows better robustness properties as it is more resilient to contamination.

Related papers

• Linear-LLM-SCM: Benchmarking LLMs for Coefficient Elicitation in Linear-Gaussian Causal Models [28.281361951823765]
  We introduce Linear-LLM-SCM, a plug-and-play benchmarking framework for evaluating large language models (LLMs)<n>We show challenges in such benchmarking tasks, namely, strongity in the results in some of the models and susceptibility to DAG misspecification via spurious edges in the continuous domains.<n>We also open-source the benchmarking framework so that researchers can utilize their DAGs and any off-the-shelf LLMs plug-and-play for evaluation in their domains effortlessly.
  arXiv  Detail & Related papers  (2026-02-10T20:49:01Z)
• Estimating Causal Effects in Gaussian Linear SCMs with Finite Data [14.222953715948272]
  Estimating causal effects from observational data remains a fundamental challenge in causal inference.<n>This paper focuses on estimating causal effects in Gaussian Linear Structural Causal Models (GL-SCMs)<n>We present a novel EM-based estimation that can learn identifiable causal effects parameters and estimate causal effects from finite observational samples.
  arXiv  Detail & Related papers  (2026-01-08T07:37:10Z)
• 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)
• Multi-View Causal Discovery without Non-Gaussianity: Identifiability and Algorithms [59.15672758767244]
  Causal discovery is a difficult problem that typically relies on strong assumptions on the data-generating model, such as non-Gaussianity.<n>Here, we leverage this multi-view structure to achieve causal discovery with weak assumptions.<n>We propose several multi-view causal discovery algorithms, inspired by single-view algorithms.
  arXiv  Detail & Related papers  (2025-02-27T14:06:14Z)
• Robust Time Series Causal Discovery for Agent-Based Model Validation [5.430532390358285]
  This study proposes a Robust Cross-Validation (RCV) approach to enhance causal structure learning for ABM validation. We develop RCV-VarLiNGAM and RCV-PCMCI, novel extensions of two prominent causal discovery algorithms. The proposed approach is then integrated into an enhanced ABM validation framework.
  arXiv  Detail & Related papers  (2024-10-25T09:13:26Z)
• LoSAM: Local Search in Additive Noise Models with Mixed Mechanisms and General Noise for Global Causal Discovery [2.4305626489408465]
  Local search in additive noise models, LoSAM, is a topological ordering for learning a unique DAG in ANMs with mixed causal mechanisms and general noise distributions.<n>We prove consistency and criteria, ensuring scalability and sample efficiency.
  arXiv  Detail & Related papers  (2024-10-15T16:28:55Z)
• Induced Covariance for Causal Discovery in Linear Sparse Structures [55.2480439325792]
  Causal models seek to unravel the cause-effect relationships among variables from observed data. This paper introduces a novel causal discovery algorithm designed for settings in which variables exhibit linearly sparse relationships.
  arXiv  Detail & Related papers  (2024-10-02T04:01:38Z)
• Learning linear acyclic causal model including Gaussian noise using ancestral relationships [6.340689966560241]
  LiNGAM assumes linearity and continuous non-Gaussian disturbances for the causal model. The PC algorithm makes no assumptions other than the faithfulness to the causal model. We propose an algorithm for learning the distribution-equivalence patterns of a linear causal model with a lower time complexity.
  arXiv  Detail & Related papers  (2024-08-31T11:07:15Z)
• Enabling Causal Discovery in Post-Nonlinear Models with Normalizing Flows [6.954510776782872]
  Post-nonlinear (PNL) causal models stand out as a versatile and adaptable framework for modeling causal relationships. We introduce CAF-PoNo, harnessing the power of the normalizing flows architecture to enforce the crucial invertibility constraint in PNL models. Our method precisely reconstructs the hidden noise, which plays a vital role in cause-effect identification.
  arXiv  Detail & Related papers  (2024-07-06T07:19:21Z)
• Redefining the Shortest Path Problem Formulation of the Linear Non-Gaussian Acyclic Model: Pairwise Likelihood Ratios, Prior Knowledge, and Path Enumeration [0.0]
  The paper proposes a threefold enhancement to the LiNGAM-SPP framework. The need for parameter tuning is eliminated by using the pairwise likelihood ratio in lieu of kNN-based mutual information. The incorporation of prior knowledge is then enabled by a node-skipping strategy implemented on the graph representation of all causal orderings.
  arXiv  Detail & Related papers  (2024-04-18T05:59:28Z)
• Learning Latent Structural Causal Models [31.686049664958457]
  In machine learning tasks, one often operates on low-level data like image pixels or high-dimensional vectors. We present a tractable approximate inference method which performs joint inference over the causal variables, structure and parameters of the latent Structural Causal Model.
  arXiv  Detail & Related papers  (2022-10-24T20:09:44Z)
• Relational Reasoning via Set Transformers: Provable Efficiency and Applications to MARL [154.13105285663656]
  A cooperative Multi-A gent R einforcement Learning (MARL) with permutation invariant agents framework has achieved tremendous empirical successes in real-world applications. Unfortunately, the theoretical understanding of this MARL problem is lacking due to the curse of many agents and the limited exploration of the relational reasoning in existing works. We prove that the suboptimality gaps of the model-free and model-based algorithms are independent of and logarithmic in the number of agents respectively, which mitigates the curse of many agents.
  arXiv  Detail & Related papers  (2022-09-20T16:42:59Z)
• Amortized Inference for Causal Structure Learning [72.84105256353801]
  Learning causal structure poses a search problem that typically involves evaluating structures using a score or independence test. We train a variational inference model to predict the causal structure from observational/interventional data. Our models exhibit robust generalization capabilities under substantial distribution shift.
  arXiv  Detail & Related papers  (2022-05-25T17:37:08Z)
• 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)
• Estimation of Bivariate Structural Causal Models by Variational Gaussian Process Regression Under Likelihoods Parametrised by Normalising Flows [74.85071867225533]
  Causal mechanisms can be described by structural causal models. One major drawback of state-of-the-art artificial intelligence is its lack of explainability.
  arXiv  Detail & Related papers  (2021-09-06T14:52:58Z)
• CASTLE: Regularization via Auxiliary Causal Graph Discovery [89.74800176981842]
  We introduce Causal Structure Learning (CASTLE) regularization and propose to regularize a neural network by jointly learning the causal relationships between variables. CASTLE efficiently reconstructs only the features in the causal DAG that have a causal neighbor, whereas reconstruction-based regularizers suboptimally reconstruct all input features.
  arXiv  Detail & Related papers  (2020-09-28T09:49:38Z)

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.