A new algorithm for robust causal discovery in small sample sizes.
problem Limited data leads to weak conditional independence tests in causal discovery.
method Proposes a k-PC algorithm that bounds conditioning set size for robust causal discovery. result The k-PC algorithm enables more robust causal discovery in small sample sizes. New causal distances improve evaluation of causal discovery algorithms.
problem Evaluating causal discovery algorithms using graphical distances is limited.
method Defined causal distances based on causal distributions rather than graphical structure.
result Improved evaluation of causal discovery algorithms on synthetic and real-world datasets.
Novel graphical models for time series with latent confounders improve causal inference.
problem Causal relationships and independencies in multivariate time series with unobserved confounders.
method Introduced a novel class of graphical models and characterized their properties.
result Novel graphs provide stronger causal inferences without additional assumptions.
Improved method for unbiased causal discovery in presence of unobserved confounding.
problem Unbiased data synthesis for causal discovery algorithms in the presence of unobserved confounding.
method Explicit block-hierarchical ancestral sampling to address limitations of implicit parameterization.
result Our approach fully covers the space of causal models, including those generated by implicit parameterization.
Paper characterizes causal graphs from hard interventions and proposes a learning algorithm.
problem Discovering causal structure from hard interventions and observational data.
method Proposes graphical constraints and a learning algorithm based on do-calculus.
result Characterizes interventional equivalence classes of causal graphs with latent variables.
New methods for scalable causal discovery from complex data.
problem Learning causal structures from nonlinear, continuous or mixed data.
method BF-BIC score and BF-LRT test for scalable causal discovery.
result BF-BIC score and BF-LRT test enable scalable causal discovery with competitive accuracy and runtime.
A new method predicts causal relationships without joint data.
problem Falsifying causal discovery algorithms without ground truth.
method Leave-One-Variable-Out (LOVO) prediction for causal graphs.
result LOVO method correlates prediction error with causal algorithm accuracy.
We study 'meta-dependence' in conditional independence tests across different empirical distributions.
problem Understanding the breakdown of conditional independence properties in finite data.
method Geometric intuition and information projections to measure meta-dependence between conditional independences.
result We provide a measure of meta-dependence that consolidates findings across synthetic and real-world data.
New algorithms learn polytree structures from data.
problem Learning causal graphs from non-Gaussian data.
method Combines Chow-Liu algorithm with edge orientation schemes.
result Established high-dimensional consistency results.
Reinterprets Granger causality with causal Bayesian networks and Reichenbach's principles.
problem Lack of a rigorous causal foundation in Granger causality.
method Reinterpreting Granger causality through Reichenbach's principles and causal Bayesian networks, implementing as c-GC.
result c-GC provides a more principled framework for causal discovery in observational datasets.
Python toolbox for causal structure learning from data.
problem Causal structure learning from data.
method Generates data from simulators or real-world datasets, learns causal structure, evaluates graphs, and includes gradient-based methods.
result Convenience and efficiency in causal discovery with GPU acceleration.
Proposes KAR for nonlinear causal discovery using kernel methods.
problem Learning causal relationships in nonlinear settings.
method Kernel anchor regression (KAR) with improved three-stage nonparametric regression.
result KAR outperforms existing methods in nonlinear causal discovery.
We develop a method to learn abstract causal graphs from interventional data.
problem Estimating causal models at fine granularity is impractical or undesirable.
method Novel graphical identifiability results and an efficient algorithm.
result Directly learns abstract causal graphs from interventional data.
Perfect adaptation in systems is identified and tested using graphical tools.
problem Identifying perfect adaptation in dynamical systems.
method Causal ordering algorithm and graphical representations of dynamical systems.
result Sufficient graphical and testing conditions for perfect adaptation.
Improves causal graph learning on dependent binary data.
problem Challenges in learning causal graphical models from dependent binary data.
method Decorrelation-based approach using latent utility model and EM-like algorithm.
result Significant improvement in accuracy of causal graph learning.
New algorithm identifies causal relationships from graphs, even with selection bias.
problem Identifying causal relationships from graphs with selection bias.
method Developed a measure-theoretic version of Pearl's causal calculus and a sound, complete identification algorithm.
result General measure-theoretic version of causal calculus allows for identification of causal relationships under selection bias.
The paper tackles causal rule discovery from observational data.
problem Challenges in inferring causal effects from observational data due to confounding factors and high variance.
method Measures causal effect from observational data, providing graphical criteria and a conservative estimator.
result Proposes an efficient algorithm that maximises the estimator and discovers meaningful causal rules.
Bayesian method for causal discovery from unknown general interventions.
problem Learning causal DAGs from unknown interventions that modify parent sets.
method Bayesian approach with MCMC for approximating posterior DAGs and intervention targets.
result Bayesian method can identify DAGs and intervention targets up to equivalence classes.
New algorithm for learning causal structures with disjoint cycles in linear non-Gaussian models.
problem Learning causal structures with cycles in linear non-Gaussian models.
method Characterizing when graphs determine the same model, using quadratic and cubic polynomial relations, and a strategy of decorrelating cycles and multivariate regression.
result Consistent and computationally efficient algorithm for learning causal structures with disjoint cycles.
Discover causal structure from mixtures of DAGs using latent variable algorithms.
problem Discover causal structure from distributions arising from mixtures of DAGs.
method Causal structure discovery algorithms such as FCI for latent variables.
result Recover a 'union' of the component DAGs and identify varying conditional distributions.
New method scores DAGs by identifying unobserved confounding.
problem Unobserved confounding complicates causal discovery.
method Score-based causal discovery algorithm that accounts for unobserved confounding.
result Sparse linear Gaussian DAGs can be recovered from observed data.
Local discovery method uncovers direct unfairness in complex systems.
problem Identifying causal pathways of unfairness in complex domains.
method Local discovery for direct discrimination (LD3) method.
result LD3 returns a valid adjustment set (VAS) for assessing unfairness.
AnomalyCD discovers anomaly causes in large systems with binary flags, reducing computational burden.
problem Learning graphical causal models from large-scale binary anomaly data is computationally expensive.
method AnomalyCD uses anomaly data-aware causality testing, sparse data compression, and edge pruning.
result AnomalyCD reduces computation overhead and improves accuracy on binary anomaly datasets.
New PCstar algorithm discovers causal structure of max-linear Bayesian networks.
problem Discovering causal structure in max-linear Bayesian networks due to non-faithfulness.
method PC algorithm modified with C∗-separation assumptions. result PCstar algorithm can orient additional edges not possible with standard PC algorithm.
Proposes a method to identify causal relationships using background knowledge.
problem Identifying causal relationships in the presence of background knowledge.
method Learning local structure using all types of causal background knowledge (direct, non-ancestral, ancestral). Criteria for identifying causal relationships based on local structure.
result Effective and efficient method for local structure learning and causal relationship identification.
New method controls latent variables in graphical models to improve causal inference and prediction.
problem Uncertainty in causal relationships due to unobserved confounders.
method Iteratively derives proxies for latent variables from model residuals.
result Improves structural inference and prediction performance of causal models.
Causal processes in biomedicine may contain cycles, evolve over time or differ between populations. However, many graphical models cannot accommodate these conditions. We propose to model causation using a mixture of directed cyclic graphs (DAGs), where the joint distribution in a population follows a DAG at any single…
Dynamic Structural Causal Models handle time-dependent systems with cycles and latent confounding.
problem Representing and analyzing systems of Stochastic Differential Equations (SDEs) with DSCMs.
method Define time-splitting and subsampling operations to analyze DSCMs of SDEs, and apply existing causal discovery algorithms to time-series data.
result DSCMs provide a graphical Markov property for SDEs and enable identification of time-dependent causal effects.
ENCOD learns causal graphs efficiently without acyclicity constraints.
problem Learning causal graphical models from observational and interventional data.
method ENCOD uses optimization of edge likelihoods with separate orientation parameters.
result ENCOD efficiently recovers large graphs (hundreds of nodes) without acyclicity constraints.
Develops a new method for learning non-parametric DAGs using RKHS.
problem Challenges of learning non-parametric causal models with large combinatorial search space.
method Uses reproducing kernel Hilbert spaces (RKHS) and sparsity-inducing regularization terms based on partial derivatives to enforce acyclicity.
result Shows improved performance through simulations and data analyses.
Develops a framework for causal structure learning using both interventional and observational data.
problem Lack of identifiability of causal structures with only observational data.
method Bilevel polynomial optimization (Bloom) framework for causal structure discovery from interventional and observational data.
result Bloom framework provides convergence and optimality guarantees, surpassing other learning algorithms in experiments.
We characterize distributional equivalence in latent-variable models with cycles.
problem Lack of an equivalence characterization for latent-variable causal models with cycles.
method Established graphical criterion for distributional equivalence and developed edge rank constraints.
result First equivalence characterization without structural assumptions for latent-variable models with cycles.
DDCD uses diffusion models to learn causal structures from noisy data.
problem Scalability and stability issues in high-dimensional causal structure learning.
method Adaptive k-hop acyclicity constraint and denoising score matching objective of diffusion models.
result DDCD achieves competitive performance on synthetic and real-world data.
Graphical causal models are an important tool for knowledge discovery because they can represent both the causal relations between variables and the multivariate probability distributions over the data. Once learned, causal graphs can be used for classification, feature selection and hypothesis generation, while reveal…
An important task in data analysis is the discovery of causal relationships between observed variables. For continuous-valued data, linear acyclic causal models are commonly used to model the data-generating process, and the inference of such models is a well-studied problem. However, existing methods have significant …
New method identifies causal structure in count data using cumulants and path analysis.
problem Challenges in discovering causal structure from count data, especially due to non-identifiability.
method Poisson Branching Structural Causal Model (PB-SCM) with path analysis using high-order cumulants.
result Causal order is identifiable under specific conditions in PB-SCM using cumulant information.
Paper develops a method to learn causal networks with non-invertible functions.
problem Identifying causal relationships from observational data with non-invertible functional relationships.
method Proposes a test for non-invertible bivariate causal models and develops a method to incorporate this test in structure learning of DAGs.
result Our algorithms outperform existing DAG learning methods in identifying causal graphical structures.
New method prevents invalid inference after causal discovery.
problem Invalid inference after causal discovery.
method Developed tools for valid post-causal-discovery inference.
result Our method provides reliable coverage while achieving more accurate causal discovery.
New framework uses background knowledge to speed up causal discovery.
problem Scalable causal discovery for large datasets.
method Utilizes background knowledge during causal discovery process.
result Background knowledge reduces computational requirements and improves structure quality.
Differentiable causal discovery methods perform robustly under model violations.
problem Causal discovery algorithms struggle with real-world data due to unverifiable causal assumptions.
method Benchmarked differentiable causal discovery methods under eight model assumption violations.
result Differentiable causal discovery methods exhibit robust performance under Structural Hamming Distance and Structural Intervention Distance metrics.
Paper estimates non-causal graphical models using covariance extension and transportation distance.
problem Estimating non-causal graphical models with smoothing relations.
method Proposes a covariance extension problem and uses transportation distance to minimize error with white noise.
result Solution is a double-sided autoregressive non-causal graphical model.
This work investigates the intersection property of conditional independence. It states that for random variables A,B,C and X we have that X independent of A given B,C and X independent of B given A,C implies X independent of (A,B) given C. Under the assumption that the joint distribution has a co…
Study tackles causal structure learning in linear models with unobserved variables and measurement error.
problem Challenges of unobserved common causes and measurement error in causal structure learning.
method Introduces LV-SEM-ME model with four types of variables and characterizes identifiability under separability condition.
result Establishes form of identification robustness for target effect in broader LV-SEM-ME model.
Proposes LLM-DCD for improved causal discovery from data.
problem Challenges in discovering causal relationships from observational data.
method Uses LLM to initialize DCD optimization, incorporating priors.
result Higher accuracy on benchmark datasets compared to state-of-the-art.
Project infinite time series graphs to finite marginal models using number theory.
problem Handling infinite time series graphs for causal inference.
method Projection method using number theory to find common ancestors in infinite graphs.
result Developed algorithm to project infinite graphs to finite marginal models.
Python library for causal discovery from observational data.
problem Revealing causal relations from observational data.
method Comprehensive collection of causal discovery methods in Python.
result Ease of use for non-specialists and modular building blocks for developers.
Proposes a new condition to estimate latent variable causal graphs from observed data.
problem Estimating causal structures when observed variables are not the underlying causal variables.
method Introduces Generalized Independent Noise (GIN) condition and a recursive learning algorithm.
result Shows that GIN helps locate latent variables and identify their causal structure.
KEEL improves causal discovery with fuzzy knowledge and complex data.
problem Challenges in causal discovery due to prior knowledge, domain inconsistencies, and small sample sizes.
method Weakly-supervised fuzzy knowledge and data co-driven causal discovery method (KEEL).
result KEEL outperforms state-of-the-art methods in accuracy, robustness, and computational efficiency.