Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Huiyang Yi

dblp:410/3974 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 67% Trustworthy machine learning · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › causal inference
causal discovery
0.912025
The robustness of differentiable Causal Discovery in misspecified Scenarios · ICLR 2025
Machine learning › Probabilistic and Bayesian machine learning › causal inference › causal discovery
differentiable causal discovery
0.912025
The robustness of differentiable Causal Discovery in misspecified Scenarios · ICLR 2025
Machine learning › Trustworthy machine learning
robustness
0.912025
The robustness of differentiable Causal Discovery in misspecified Scenarios · ICLR 2025

Methods — techniques the papers use, named apart from their topics

structural intervention distance · 0.9structural hamming distance · 0.9
YearPublicationVenuePosition
2025 The robustness of differentiable Causal Discovery in misspecified Scenarios
abstract
Causal discovery aims to learn causal relationships between variables from targeted data, making it a fundamental task in machine learning. However, causal discovery algorithms often rely on unverifiable causal assumptions, which are usually difficult to satisfy in real-world data, thereby limiting the broad application of causal discovery in practical scenarios. Inspired by these considerations, this work extensively benchmarks the empirical performance of various mainstream causal discovery algorithms, which assume i.i.d. data, under eight model assumption violations. Our experimental results show that differentiable causal discovery methods exhibit robustness under the metrics of Structural Hamming Distance and Structural Intervention Distance of the inferred graphs in commonly used challenging scenarios, except for scale variation. We also provide the theoretical explanations for the performance of differentiable causal discovery methods. Finally, our work aims to comprehensively benchmark the performance of recent differentiable causal discovery methods under model assumption violations, and provide the standard for reasonable evaluation of causal discovery, as well as to further promote its application in real-world scenarios.
Huiyang Yi, Yanyan He, Duxin Chen, He Wang 0006, Wenwu Yu
ICLR1