Scaling up Greedy Causal Search for Continuous Variables

07/28/2015
by   Joseph D. Ramsey, et al.
0

As standardly implemented in R or the Tetrad program, causal search algorithms used most widely or effectively by scientists have severe dimensionality constraints that make them inappropriate for big data problems without sacrificing accuracy. However, implementation improvements are possible. We explore optimizations for the Greedy Equivalence Search that allow search on 50,000-variable problems in 13 minutes for sparse models with 1000 samples on a four-processor, 16G laptop computer. We finish a problem with 1000 samples on 1,000,000 variables in 18 hours for sparse models on a supercomputer node at the Pittsburgh Supercomputing Center with 40 processors and 384 G RAM. The same algorithm can be applied to discrete data, with a slower discrete score, though the discrete implementation currently does not scale as well in our experiments; we have managed to scale up to about 10,000 variables in sparse models with 1000 samples.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/17/2021

Improving Accuracy of Permutation DAG Search using Best Order Score Search

The Sparsest Permutation (SP) algorithm is accurate but limited to about...
research
04/11/2023

KGS: Causal Discovery Using Knowledge-guided Greedy Equivalence Search

Learning causal relationships solely from observational data provides in...
research
06/05/2019

Gradient-Based Neural DAG Learning

We propose a novel score-based approach to learning a directed acyclic g...
research
01/23/2013

A Hybrid Anytime Algorithm for the Constructiion of Causal Models From Sparse Data

We present a hybrid constraint-based/Bayesian algorithm for learning cau...
research
12/22/2020

Algorithms for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference

Identifying cause-effect relation among variables is a key step in the d...
research
07/18/2022

CausNet : Generational orderings based search for optimal Bayesian networks via dynamic programming with parent set constraints

Finding a globally optimal Bayesian Network using exhaustive search is a...

Please sign up or login with your details

Forgot password? Click here to reset