Journal article icon

Journal article

Faster algorithms for Markov equivalence

Abstract:

Maximal ancestral graphs (MAGs) have many desirable properties; in particular they can fully describe conditional independences from directed acyclic graphs (DAGs) in the presence of latent and selection variables. However, different MAGs may encode the same conditional independences, and are said to be \emph{Markov equivalent}. Thus identifying necessary and sufficient conditions for equivalence is essential for structure learning. Several criteria for this already exist, but in this paper w...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publication website:
http://proceedings.mlr.press/v124/hu20a.html

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Statistics
Role:
Author
ORCID:
0000-0001-6420-9477
More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Statistics
Oxford college:
Jesus College
Role:
Author
ORCID:
0000-0002-9341-1313
Publisher:
Journal of Machine Learning Research Publisher's website
Pages:
739-748
Series:
Proceedings of Machine Learning Research
Series number:
124
Publication date:
2020-06-08
Acceptance date:
2020-05-14
Event title:
36th Conference on Uncertainty in Artificial Intelligence (UAI)
Event location:
Virtual event
Event website:
http://www.auai.org/uai2020/
Event start date:
2020-08-03T00:00:00Z
Event end date:
2020-08-06T00:00:00Z
ISSN:
2640-3498
Language:
English
Keywords:
Pubs id:
1176178
Local pid:
pubs:1176178
Deposit date:
2021-05-12

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP