paper-with-me

홈 › Papers

backShift: Learning causal cyclic graphs from unknown shift interventions

2015-06-08 · NeurIPS 2015 12 · Dominik Rothenhäusler, Christina Heinze, Jonas Peters, Nicolai Meinshausen

We propose a simple method to learn linear causal cyclic models in the presence of latent variables. The method relies on equilibrium data of the model recorded under a specific kind of interventions ("shift interventions"). The location and strength of these interventions do not have to be known and can be estimated from the data. Our method, called backShift, only uses second moments of the data and performs simple joint matrix diagonalization, applied to differences between covariance matrices. We give a sufficient and necessary condition for identifiability of the system, which is fulfilled almost surely under some quite general assumptions if and only if there are at least three distinct experimental settings, one of which can be pure observational data. We demonstrate the performance on some simulated data and applications in flow cytometry and financial time series. The code is made available as R-package backShift.

📄 PDF Abstract BibTeX arXiv:1506.02494

Code (1)

christinaheinze/backShift

Tasks

Time SeriesTime Series Analysis

Similar Papers 제목 키워드 기반

Cyclic Counterfactuals under Shift-Scale Interventions

2025-10-28 · Saptarshi Saha, Dhruv Vansraj Rathore, Utpal Garain arxiv

Most counterfactual inference frameworks traditionally assume acyclic structural causal models (SCMs), i.e. directed acyclic graphs (DAGs). However, many real-world systems (e.g. biological systems) contain feedback loop…

Inference of Causal Effects when Control Variables are Unknown

2020-12-15 · Ludvig Hult, Dave Zachariah

Conventional methods in causal effect inferencetypically rely on specifying a valid set of control variables. When this set is unknown or misspecified, inferences will be erroneous. We propose a method for inferring aver…

valid

Root Cause Analysis of Outliers in Unknown Cyclic Graphs

2025-10-08 · Daniela Schkoda, Dominik Janzing arxiv

We study the propagation of outliers in cyclic causal graphs with linear structural equations, tracing them back to one or several "root cause" nodes. We show that it is possible to identify a short list of potential roo…

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

2026-05-22 · Gonzalo Mateos, Samuel Rey, Hamed Ajorlou, Mariano Tepper arxiv

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 …

Causal InferenceGraph Learning

Lower Bounds on the Size of Markov Equivalence Classes

2025-06-26 · Erik Jahn, Frederick Eberhardt, Leonard J. Schulman

Causal discovery algorithms typically recover causal graphs only up to their Markov equivalence classes unless additional parametric assumptions are made. The sizes of these equivalence classes reflect the limits of what…

Causal Discovery