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

Xiaofeng Shao

dblp:26/9200 · DBLP profile ↗
← Back
2ranked-venue papers
0as 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 · 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
Learning theory · 77% Probabilistic and Bayesian machine learning · 23%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models › conditional independence
conditional independence testing
0.912025
Testing Conditional Mean Independence Using Generative Neural Networks · ICML 2025
Machine learning › Learning theory
hypothesis testing
0.912025
Testing Conditional Mean Independence Using Generative Neural Networks · ICML 2025
Machine learning › Learning theory
high-dimensional statistics
0.712023
Two Sample Testing in High Dimension via Maximum Mean Discrepancy · J. Mach. Learn. Res. 2023
Machine learning › Learning theory › probability metric › integral probability metric
maximum mean discrepancy
0.712023
Two Sample Testing in High Dimension via Maximum Mean Discrepancy · J. Mach. Learn. Res. 2023
Machine learning › Learning theory › hypothesis testing
two-sample testing
0.712023
Two Sample Testing in High Dimension via Maximum Mean Discrepancy · J. Mach. Learn. Res. 2023

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

nonparametric estimation · 0.9deep generative neural network · 0.9bootstrap · 0.9u-statistic · 0.7studentized test statistic · 0.7laplacian kernel · 0.7gaussian kernel · 0.7
YearPublicationVenuePosition
2025 Testing Conditional Mean Independence Using Generative Neural Networks
abstract
Conditional mean independence (CMI) testing is crucial for statistical tasks including model determination and variable importance evaluation. In this work, we introduce a novel population CMI measure and a bootstrap-based testing procedure that utilizes deep generative neural networks to estimate the conditional mean functions involved in the population measure. The test statistic is thoughtfully constructed to ensure that even slowly decaying nonparametric estimation errors do not affect the asymptotic accuracy of the test. Our approach demonstrates strong empirical performance in scenarios with high-dimensional covariates and response variable, can handle multivariate responses, and maintains nontrivial power against local alternatives outside an $n^{-1/2}$ neighborhood of the null hypothesis. We also use numerical simulations and real-world imaging data applications to highlight the efficacy and versatility of our testing procedure.
Linjun Huang, Xiaofeng Shao
ICML4
2023 Two Sample Testing in High Dimension via Maximum Mean Discrepancy
abstract
Maximum Mean Discrepancy (MMD) has been widely used in the areas of machine learning and statistics to quantify the distance between two distributions in the $p$-dimensional Euclidean space. The asymptotic property of the sample MMD has been well studied when the dimension $p$ is fixed using the theory of U-statistic. As motivated by the frequent use of MMD test for data of moderate/high dimension, we propose to investigate the behavior of the sample MMD in a high-dimensional environment and develop a new studentized test statistic. Specifically, we obtain the central limit theorems for the studentized sample MMD as both the dimension $p$ and sample sizes $n,m$ diverge to infinity. Our results hold for a wide range of kernels, including popular Gaussian and Laplacian kernels, and also cover energy distance as a special case. We also derive the explicit rate of convergence under mild assumptions and our results suggest that the accuracy of normal approximation can improve with dimensionality. Additionally, we provide a general theory on the power analysis under the alternative hypothesis and show that our proposed test can detect difference between two distributions in the moderately high dimensional regime. Numerical simulations demonstrate the effectiveness of our proposed test statistic and normal approximation.
Hanjia Gao, Xiaofeng Shao
J. Mach. Learn. Res.2