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

Wenqin Liu

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

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 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
2 papers
Probabilistic and Bayesian machine learning · 75% Generative modeling · 25%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › causal inference
causal discovery
0.912025
A Skewness-Based Criterion for Addressing Heteroscedastic Noise in Causal Discovery · ICLR 2025
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
density estimation
0.912025
MissScore: High-Order Score Estimation in the Presence of Missing Data · ICML 2025
Machine learning › Probabilistic and Bayesian machine learning
missing data
0.912025
MissScore: High-Order Score Estimation in the Presence of Missing Data · ICML 2025
Machine learning › Generative modeling › diffusion model
score-based generative model
0.912025
MissScore: High-Order Score Estimation in the Presence of Missing Data · ICML 2025

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

score matching · 1.7objective function derivation · 1.7missing data mechanism · 1.7skewness-based criterion · 0.9score function · 0.9
YearPublicationVenuePosition
2025 A Skewness-Based Criterion for Addressing Heteroscedastic Noise in Causal Discovery
abstract
Real-world data often violates the equal-variance assumption (homoscedasticity), making it essential to account for heteroscedastic noise in causal discovery. In this work, we explore heteroscedastic symmetric noise models (HSNMs), where the effect $Y$ is modeled as $Y = f(X) + \sigma(X)N$, with $X$ as the cause and $N$ as independent noise following a symmetric distribution. We introduce a novel criterion for identifying HSNMs based on the skewness of the score (i.e., the gradient of the log density) of the data distribution. This criterion establishes a computationally tractable measurement that is zero in the causal direction but nonzero in the anticausal direction, enabling the causal direction discovery. We extend this skewness-based criterion to the multivariate setting and propose \texttt{SkewScore}, an algorithm that handles heteroscedastic noise without requiring the extraction of exogenous noise. We also conduct a case study on the robustness of \texttt{SkewScore} in a bivariate model with a latent confounder, providing theoretical insights into its performance. Empirical studies further validate the effectiveness of the proposed method.
Yingyu Lin, Yuxing Huang, Wenqin Liu, Ignavier Ng, Kun Zhang 0001, Mingming Gong, Yi-An Ma, Biwei Huang
ICLR3
2025 MissScore: High-Order Score Estimation in the Presence of Missing Data
abstract
Score-based generative models are essential in various machine learning applications, with strong capabilities in generation quality. In particular, high-order derivatives (scores) of data density offer deep insights into data distributions, building on the proven effectiveness of first-order scores for modeling and generating synthetic data, unlocking new possibilities for applications. However, learning them typically requires complete data, which is often unavailable in domains such as healthcare and finance due to data corruption, acquisition constraints, or incomplete records. To tackle this challenge, we introduce MissScore, a novel framework for estimating high-order scores in the presence of missing data. We derive objective functions for estimating high-order scores under different missing data mechanisms and propose a new algorithm specifically designed to handle missing data effectively. Our empirical results demonstrate that MissScore accurately and efficiently learns the high-order scores from incomplete data and generates high-quality samples, resulting in strong performance across a range of downstream tasks.
Wenqin Liu, Haoze Hou, Erdun Gao, Biwei Huang, Qiuhong Ke, Howard D. Bondell, Mingming Gong
ICML1