{"title":"Dagma-DCE:可解释的非参数差异因果发现","authors":"Daniel Waxman;Kurt Butler;Petar M. Djurić","doi":"10.1109/OJSP.2024.3351593","DOIUrl":null,"url":null,"abstract":"We introduce \n<sc>Dagma-DCE</small>\n, an interpretable and model-agnostic scheme for differentiable causal discovery. Current non- or over-parametric methods in differentiable causal discovery use opaque proxies of “independence” to justify the inclusion or exclusion of a causal relationship. We show theoretically and empirically that these proxies may be arbitrarily different than the actual causal strength. Juxtaposed with existing differentiable causal discovery algorithms, \n<sc>Dagma-DCE</small>\n uses an interpretable measure of causal strength to define weighted adjacency matrices. In a number of simulated datasets, we show our method achieves state-of-the-art level performance. We additionally show that \n<sc>Dagma-DCE</small>\n allows for principled thresholding and sparsity penalties by domain-experts. The code for our method is available open-source at \n<uri>https://github.com/DanWaxman/DAGMA-DCE</uri>\n, and can easily be adapted to arbitrary differentiable models.","PeriodicalId":73300,"journal":{"name":"IEEE open journal of signal processing","volume":"5 ","pages":"393-401"},"PeriodicalIF":2.9000,"publicationDate":"2024-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10384714","citationCount":"0","resultStr":"{\"title\":\"Dagma-DCE: Interpretable, Non-Parametric Differentiable Causal Discovery\",\"authors\":\"Daniel Waxman;Kurt Butler;Petar M. Djurić\",\"doi\":\"10.1109/OJSP.2024.3351593\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce \\n<sc>Dagma-DCE</small>\\n, an interpretable and model-agnostic scheme for differentiable causal discovery. Current non- or over-parametric methods in differentiable causal discovery use opaque proxies of “independence” to justify the inclusion or exclusion of a causal relationship. We show theoretically and empirically that these proxies may be arbitrarily different than the actual causal strength. Juxtaposed with existing differentiable causal discovery algorithms, \\n<sc>Dagma-DCE</small>\\n uses an interpretable measure of causal strength to define weighted adjacency matrices. In a number of simulated datasets, we show our method achieves state-of-the-art level performance. We additionally show that \\n<sc>Dagma-DCE</small>\\n allows for principled thresholding and sparsity penalties by domain-experts. The code for our method is available open-source at \\n<uri>https://github.com/DanWaxman/DAGMA-DCE</uri>\\n, and can easily be adapted to arbitrary differentiable models.\",\"PeriodicalId\":73300,\"journal\":{\"name\":\"IEEE open journal of signal processing\",\"volume\":\"5 \",\"pages\":\"393-401\"},\"PeriodicalIF\":2.9000,\"publicationDate\":\"2024-01-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10384714\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE open journal of signal processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10384714/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE open journal of signal processing","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10384714/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
We introduce
Dagma-DCE
, an interpretable and model-agnostic scheme for differentiable causal discovery. Current non- or over-parametric methods in differentiable causal discovery use opaque proxies of “independence” to justify the inclusion or exclusion of a causal relationship. We show theoretically and empirically that these proxies may be arbitrarily different than the actual causal strength. Juxtaposed with existing differentiable causal discovery algorithms,
Dagma-DCE
uses an interpretable measure of causal strength to define weighted adjacency matrices. In a number of simulated datasets, we show our method achieves state-of-the-art level performance. We additionally show that
Dagma-DCE
allows for principled thresholding and sparsity penalties by domain-experts. The code for our method is available open-source at
https://github.com/DanWaxman/DAGMA-DCE
, and can easily be adapted to arbitrary differentiable models.