Consistency Guarantees for Greedy Permutation-Based Causal Inference Algorithms

Consistency Guarantees for Greedy Permutation-Based Causal Inference Algorithms

<jats:title>Summary</jats:title> <jats:p>Directed acyclic graphical models are widely used to represent complex causal systems. Since the basic task of learning such a model from data is NP-hard, a standard approach is greedy search over the space of directed acycli...

Full description

Bibliographic Details
Main Authors: Solus, L, Wang, Y, Uhler, C
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Article
Language:English
Published: Oxford University Press (OUP) 2022
Online Access:https://hdl.handle.net/1721.1/143915

Internet

https://hdl.handle.net/1721.1/143915

Similar Items