<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/"
         xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
         xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
<ListRecords>
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"
           xmlns:dc="http://purl.org/dc/elements/1.1/"
           xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
           xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   	<dc:title>Assumption violations in causal discovery and the robustness of score matching</dc:title>
   	<dc:title>Advances in Neural Information Processing Systems</dc:title>
   	<dc:creator>Montagna, Francesco</dc:creator>
   	<dc:creator>Mastakouri, Atalanti A.</dc:creator>
   	<dc:creator>Eulig, Elias</dc:creator>
   	<dc:creator>Noceti, Nicoletta</dc:creator>
   	<dc:creator>Rosasco, Lorenzo</dc:creator>
   	<dc:creator>Janzing, Dominik</dc:creator>
   	<dc:creator>Aragam, Bryon</dc:creator>
   	<dc:creator>Locatello, Francesco ; https://orcid.org/0000-0002-4850-0683</dc:creator>
   	<dc:subject>ddc:000</dc:subject>
   	<dc:description>When domain knowledge is limited and experimentation is restricted by ethical,
financial, or time constraints, practitioners turn to observational causal discovery
methods to recover the causal structure, exploiting the statistical properties of their
data. Because causal discovery without further assumptions is an ill-posed problem,
each algorithm comes with its own set of usually untestable assumptions, some
of which are hard to meet in real datasets. Motivated by these considerations, this
paper extensively benchmarks the empirical performance of recent causal discovery
methods on observational iid data generated under different background conditions,
allowing for violations of the critical assumptions required by each selected approach. Our experimental findings show that score matching-based methods demonstrate surprising performance in the false positive and false negative rate of the
inferred graph in these challenging scenarios, and we provide theoretical insights
into their performance. This work is also the first effort to benchmark the stability of
causal discovery algorithms with respect to the values of their hyperparameters. Finally, we hope this paper will set a new standard for the evaluation of causal discovery methods and can serve as an accessible entry point for practitioners interested
in the field, highlighting the empirical implications of different algorithm choices.</dc:description>
   	<dc:publisher>Neural Information Processing Systems Foundation</dc:publisher>
   	<dc:date>2023</dc:date>
   	<dc:type>info:eu-repo/semantics/conferenceObject</dc:type>
   	<dc:type>doc-type:conferenceObject</dc:type>
   	<dc:type>text</dc:type>
   	<dc:type>http://purl.org/coar/resource_type/c_5794</dc:type>
   	<dc:identifier>https://research-explorer.ista.ac.at/record/14954</dc:identifier>
   	<dc:identifier>https://research-explorer.ista.ac.at/download/14954/22701</dc:identifier>
   	<dc:source>Montagna F, Mastakouri AA, Eulig E, et al. Assumption violations in causal discovery and the robustness of score matching. In: &lt;i&gt;37th Conference on Neural Information Processing Systems&lt;/i&gt;. Vol 36. Neural Information Processing Systems Foundation; 2023. doi:&lt;a href=&quot;https://doi.org/10.52202/075280-2050&quot;&gt;10.52202/075280-2050&lt;/a&gt;</dc:source>
   	<dc:language>eng</dc:language>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/doi/10.52202/075280-2050</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/e-issn/1049-5258</dc:relation>
   	<dc:relation>info:eu-repo/semantics/altIdentifier/arxiv/2310.13387</dc:relation>
   	<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
</oai_dc:dc>
</ListRecords>
</OAI-PMH>
