Mingyue Xu
Mingyue Xu is a computer scientist whose work connects learning theory and statistics with questions about how machine learning generalizes. She earned degrees in mathematics at Shanghai Jiao Tong University and data science at Columbia before joining Purdue's computer science graduate program in 2023. Her early papers explored distributed statistical inference and dimension reduction; with Steve Hanneke, she classified universal learning rates for empirical risk minimization at NeurIPS 2024 and COLT 2025. In 2026, she, Gal Vardi and Itay Safran proved that grokking can occur in ridge regression, and ICML gave their paper an Outstanding Paper Honorable Mention. She is a fourth-year PhD student at Purdue, advised by Steve Hanneke.
Timeline
-
2021–2022
Mathematics and data science degrees
She earns a B.S. in mathematics at Shanghai Jiao Tong University in 2021 and an M.S. in data science at Columbia University in 2022.
-
2023
A graduate student at Purdue
She joins Purdue's Department of Computer Science as a graduate student in fall 2023.
-
2023
Distributed sparse inference
With Jiyuan Tu, Weidong Liu, and Xiaojun Mao, she coauthors a 2023 study of distributed semi-supervised sparse statistical inference. Its method uses a multi-round distributed debiased estimator that combines labeled and unlabelled data.
-
2023–2025
Smoothed gradients for dimension reduction
She and Gan Yuan, Samory Kpotufe, and Daniel Hsu submit a 2023 paper on sufficient dimension reduction for multi-index models. It shows that estimating the expected smoothed gradient outer product can achieve a fast parametric convergence rate; the work appears in the SIAM Journal on Mathematics of Data Science in 2025.
-
2024
Four learning rates for ERM
At NeurIPS 2024, she and Steve Hanneke show that empirical risk minimization in the realizable case has four possible universal learning rates. The paper classifies which concept classes fall into each rate.
-
2025
Agnostic learning rates
At COLT 2025, she and Steve Hanneke show that agnostic empirical risk minimization has three possible universal learning rates: exponential, super-root, or arbitrarily slow.
-
2026
Grokking in ridge regression
In 2026, she, Gal Vardi, and Itay Safran prove that gradient descent with weight decay can produce grokking in over-parameterized ridge regression. Their work shows that hyperparameter tuning can control the delay, and ICML gives the paper an Outstanding Paper Honorable Mention.
-
As of October 2026
A Purdue computer science PhD
As of October 2026, she is a fourth-year PhD student in computer science at Purdue University, advised by Steve Hanneke. Her work focuses on foundations of machine learning.
Career
Education
- 2022Columbia UniversityM.S. in Data Science
- 2021Shanghai Jiao Tong UniversityB.S. in Mathematics
- Purdue UniversityPhD student
Sources and credits
Photo: We have no published photo of Mingyue Xu yet. Send us a free-licensed photo.
- Mingyue Xu - Department of Computer Science - Purdue University
- Distributed Semi-Supervised Sparse Statistical Inference
- Efficient Estimation of the Central Mean Subspace via Smoothed Gradient Outer Products
- Mingyue Xu | Computer Science PhD Student
- Universal Rates of Empirical Risk Minimization
- Universal Rates of ERM for Agnostic Learning
- To Grok Grokking: Provable Grokking in Ridge Regression
- Announcing the ICML 2026 Awards – ICML Blog
