DeepAI
Log In Sign Up

Improving Accuracy and Scalability of the PC Algorithm by Maximizing P-value

10/03/2016
by   Joseph Ramsey, et al.
0

A number of attempts have been made to improve accuracy and/or scalability of the PC (Peter and Clark) algorithm, some well known (Buhlmann, et al., 2010; Kalisch and Buhlmann, 2007; 2008; Zhang, 2012, to give some examples). We add here one more tool to the toolbox: the simple observation that if one is forced to choose between a variety of possible conditioning sets for a pair of variables, one should choose the one with the highest p-value. One can use the CPC (Conservative PC, Ramsey et al., 2012) algorithm as a guide to possible sepsets for a pair of variables. However, whereas CPC uses a voting rule to classify colliders versus noncolliders, our proposed algorithm, PC-Max, picks the conditioning set with the highest p-value, so that there are no ambiguities. We combine this with two other optimizations: (a) avoiding bidirected edges in the orientation of colliders, and (b) parallelization. For (b) we borrow ideas from the PC-Stable algorithm (Colombo and Maathuis, 2014). The result is an algorithm that scales quite well both in terms of accuracy and time, with no risk of bidirected edges.

READ FULL TEXT

page 1

page 2

page 3

page 4

05/06/2018

FASK with Interventional Knowledge Recovers Edges from the Sachs Model

We report a procedure that, in one step from continuous data with minima...
06/12/2019

Estimation of the Shapley value by ergodic sampling

The idea of approximating the Shapley value of an n-person game by rando...
07/10/2020

On Distributed Listing of Cliques

We show an Õ(n^p/(p+2))-round algorithm in the model for listing of K_p ...
08/25/2021

On the number of edges of separated multigraphs

We prove that the number of edges of a multigraph G with n vertices is a...
08/30/2018

The number of crossings in multigraphs with no empty lens

Let G be a multigraph with n vertices and e>4n edges, drawn in the plane...
07/28/2020

On Accuracy and Coherence with Infinite Opinion Sets

There is a well-known equivalence between avoiding accuracy dominance an...