Causal Identification under Markov Equivalence

Amin JABER, Jiji ZHANG, Elias BAREINBOIM

Research output: Book Chapters | Papers in Conference ProceedingsConference paper (refereed)Researchpeer-review

1 Scopus Citations

Abstract

Assessing the magnitude of cause-and-effect relations is one of the central challenges found throughout the empirical sciences. The problem of identification of causal effects is concerned with determining whether a causal effect can be computed from a combination of observational data and substantive knowledge about the domain under investigation, which is formally expressed in the form of a causal graph. In many practical settings, however, the knowledge available for the researcher is not strong enough so as to specify a unique causal graph. Another line of investigation attempts to use observational data to learn a qualitative description of the domain called a Markov equivalence class, which is the collection of causal graphs that share the same set of observed features. In this paper, we marry both approaches and study the problem of causal identification from an equivalence class, represented by a partial ancestral graph (PAG). We start by deriving a set of graphical properties of PAGs that are carried over to its induced subgraphs. We then develop an algorithm to compute the effect of an arbitrary set of variables on an arbitrary outcome set. We show that the algorithm is strictly more powerful than the current state of the art found in the literature.
Original languageEnglish
Title of host publicationProceedings of the Thirty-Fourth Conference (2018) : Uncertainty in Artificial Intelligence
PublisherAssociation for Uncertainty in Artificial Intelligence (AUAI)
Pages978-987
ISBN (Print)9780996643139
Publication statusPublished - Aug 2018
Event34th Conference on Uncertainty in Artificial Intelligence - Monterey, United States
Duration: 6 Aug 201810 Aug 2018
http://auai.org/uai2018/accepted.php#top

Conference

Conference34th Conference on Uncertainty in Artificial Intelligence
Abbreviated titleUAI2018
CountryUnited States
CityMonterey
Period6/08/1810/08/18
Internet address

Fingerprint

Equivalence classes

Bibliographical note

We thank Sanghack Lee and the reviewers for all the feedback provided. Bareinboim and Jaber are supported in parts by grants from NSF IIS-1704352 and IIS1750807 (CAREER). Zhang is supported in part by the Research Grants Council of Hong Kong under the General Research Fund LU13600715.

Cite this

JABER, A., ZHANG, J., & BAREINBOIM, E. (2018). Causal Identification under Markov Equivalence. In Proceedings of the Thirty-Fourth Conference (2018) : Uncertainty in Artificial Intelligence (pp. 978-987). Association for Uncertainty in Artificial Intelligence (AUAI).
JABER, Amin ; ZHANG, Jiji ; BAREINBOIM, Elias. / Causal Identification under Markov Equivalence. Proceedings of the Thirty-Fourth Conference (2018) : Uncertainty in Artificial Intelligence. Association for Uncertainty in Artificial Intelligence (AUAI), 2018. pp. 978-987
@inproceedings{5e8aaf8b80e046caadaca1d4ee21a9bc,
title = "Causal Identification under Markov Equivalence",
abstract = "Assessing the magnitude of cause-and-effect relations is one of the central challenges found throughout the empirical sciences. The problem of identification of causal effects is concerned with determining whether a causal effect can be computed from a combination of observational data and substantive knowledge about the domain under investigation, which is formally expressed in the form of a causal graph. In many practical settings, however, the knowledge available for the researcher is not strong enough so as to specify a unique causal graph. Another line of investigation attempts to use observational data to learn a qualitative description of the domain called a Markov equivalence class, which is the collection of causal graphs that share the same set of observed features. In this paper, we marry both approaches and study the problem of causal identification from an equivalence class, represented by a partial ancestral graph (PAG). We start by deriving a set of graphical properties of PAGs that are carried over to its induced subgraphs. We then develop an algorithm to compute the effect of an arbitrary set of variables on an arbitrary outcome set. We show that the algorithm is strictly more powerful than the current state of the art found in the literature.",
author = "Amin JABER and Jiji ZHANG and Elias BAREINBOIM",
note = "We thank Sanghack Lee and the reviewers for all the feedback provided. Bareinboim and Jaber are supported in parts by grants from NSF IIS-1704352 and IIS1750807 (CAREER). Zhang is supported in part by the Research Grants Council of Hong Kong under the General Research Fund LU13600715.",
year = "2018",
month = "8",
language = "English",
isbn = "9780996643139",
pages = "978--987",
booktitle = "Proceedings of the Thirty-Fourth Conference (2018) : Uncertainty in Artificial Intelligence",
publisher = "Association for Uncertainty in Artificial Intelligence (AUAI)",

}

JABER, A, ZHANG, J & BAREINBOIM, E 2018, Causal Identification under Markov Equivalence. in Proceedings of the Thirty-Fourth Conference (2018) : Uncertainty in Artificial Intelligence. Association for Uncertainty in Artificial Intelligence (AUAI), pp. 978-987, 34th Conference on Uncertainty in Artificial Intelligence, Monterey, United States, 6/08/18.

Causal Identification under Markov Equivalence. / JABER, Amin; ZHANG, Jiji; BAREINBOIM, Elias.

Proceedings of the Thirty-Fourth Conference (2018) : Uncertainty in Artificial Intelligence. Association for Uncertainty in Artificial Intelligence (AUAI), 2018. p. 978-987.

Research output: Book Chapters | Papers in Conference ProceedingsConference paper (refereed)Researchpeer-review

TY - GEN

T1 - Causal Identification under Markov Equivalence

AU - JABER, Amin

AU - ZHANG, Jiji

AU - BAREINBOIM, Elias

N1 - We thank Sanghack Lee and the reviewers for all the feedback provided. Bareinboim and Jaber are supported in parts by grants from NSF IIS-1704352 and IIS1750807 (CAREER). Zhang is supported in part by the Research Grants Council of Hong Kong under the General Research Fund LU13600715.

PY - 2018/8

Y1 - 2018/8

N2 - Assessing the magnitude of cause-and-effect relations is one of the central challenges found throughout the empirical sciences. The problem of identification of causal effects is concerned with determining whether a causal effect can be computed from a combination of observational data and substantive knowledge about the domain under investigation, which is formally expressed in the form of a causal graph. In many practical settings, however, the knowledge available for the researcher is not strong enough so as to specify a unique causal graph. Another line of investigation attempts to use observational data to learn a qualitative description of the domain called a Markov equivalence class, which is the collection of causal graphs that share the same set of observed features. In this paper, we marry both approaches and study the problem of causal identification from an equivalence class, represented by a partial ancestral graph (PAG). We start by deriving a set of graphical properties of PAGs that are carried over to its induced subgraphs. We then develop an algorithm to compute the effect of an arbitrary set of variables on an arbitrary outcome set. We show that the algorithm is strictly more powerful than the current state of the art found in the literature.

AB - Assessing the magnitude of cause-and-effect relations is one of the central challenges found throughout the empirical sciences. The problem of identification of causal effects is concerned with determining whether a causal effect can be computed from a combination of observational data and substantive knowledge about the domain under investigation, which is formally expressed in the form of a causal graph. In many practical settings, however, the knowledge available for the researcher is not strong enough so as to specify a unique causal graph. Another line of investigation attempts to use observational data to learn a qualitative description of the domain called a Markov equivalence class, which is the collection of causal graphs that share the same set of observed features. In this paper, we marry both approaches and study the problem of causal identification from an equivalence class, represented by a partial ancestral graph (PAG). We start by deriving a set of graphical properties of PAGs that are carried over to its induced subgraphs. We then develop an algorithm to compute the effect of an arbitrary set of variables on an arbitrary outcome set. We show that the algorithm is strictly more powerful than the current state of the art found in the literature.

M3 - Conference paper (refereed)

SN - 9780996643139

SP - 978

EP - 987

BT - Proceedings of the Thirty-Fourth Conference (2018) : Uncertainty in Artificial Intelligence

PB - Association for Uncertainty in Artificial Intelligence (AUAI)

ER -

JABER A, ZHANG J, BAREINBOIM E. Causal Identification under Markov Equivalence. In Proceedings of the Thirty-Fourth Conference (2018) : Uncertainty in Artificial Intelligence. Association for Uncertainty in Artificial Intelligence (AUAI). 2018. p. 978-987