Causality: an algorithmic framework and a computational complexity perspective
Causality: an algorithmic framework and a computational complexity perspective
批准号:
273587939
负责人:
Professor Dr. Maciej Liskiewicz
金额:
$0.0万
依托单位国家:
德国
项目类别:
Research Grants
财政年份:
2016
资助国家:
德国
项目状态:
已结题
起止时间:
2015-12-31 至 2021-12-31
中文摘要
点击翻译按钮获取中文摘要
英文摘要
Establishing cause-effect relationships is a fundamental goal of empirical science, and finding the causes of diseases, economic crises, or other complex phenomena is of great importance for policy-making. Such causal inference typically requires combining observed and interventional data with existing knowledge. The structural approach to causal inference, developed over the past decades by Judea Pearl and others, allows researchers to model complex causal relationships, reason about their implications, and estimate causal effects of interest. In this approach, causal knowledge is encoded using directed or partially directed graphs, which is an intuitive representation that is readable by non-specialists.The graphical causal modeling approach currently receives substantial attention in Epidemiology, Sociology and other disciplines, but is not yet widely applied. An important barrier to its application is of algorithmic nature: Several key results of structural causality are either not general, i.e. do not apply for certain types of inputs, or are proved non-constructively, such that efficient algorithms to find solutions are lacking. In collaboration with scientists from application areas, we have identified several problems of real-world importance that require more general and/or more efficient solutions. The goal of this proposal is to study those problems from an algorithmic and computational complexity perspective.Our main focus will be on questions concerning identification and estimation of causal effects, with a secondary focus on learning possible causal structures from data. The graphical language used in structural causal modeling allows us to apply discrete- and graph-algorithmic techniques as well as advanced methods of computational complexity theory. While we expect to obtain some negative outcomes like NP-hardness results, the main goal is to provide effective algorithms, and with our collaborators we aim to feed our positive algorithmic results back into the application areas in the form of working software packages.
期刊论文(5)
专著(0)
科研奖励(0)
会议论文
登录
查看更多内容
DOI:
10.1609/aaai.v35i13.17448
发表时间:
2020-12
期刊:
ArXiv
影响因子:
--
作者:
[Marcel Wienöbst;Max Bannach;M. Liskiewicz]
通讯作者:
Marcel Wienöbst;Max Bannach;M. Liskiewicz
Separators and Adjustment Sets in Markov Equivalent DAGs
马尔可夫等效 DAG 中的分隔符和调整集
DOI:
10.1609/aaai.v30i1.10424
发表时间:
2016
期刊:
影响因子:
--
作者:
[Benito van der Zander, Maciej Liśkiewicz]
通讯作者:
Maciej Liśkiewicz
DOI:
10.1016/j.artint.2018.12.006
发表时间:
2018-02
期刊:
Artif. Intell.
影响因子:
--
作者:
[Benito van der Zander;M. Liskiewicz;J. Textor]
通讯作者:
Benito van der Zander;M. Liskiewicz;J. Textor
DOI:
10.1609/aaai.v34i06.6593
发表时间:
2020
期刊:
ArXiv
影响因子:
--
作者:
[Marcel Wienöbst, Maciej Liśkiewicz]
通讯作者:
Maciej Liśkiewicz
海外基金