About Me
I pursue general theory and practical solutions for machine learning and complex systems.
Research
-
Pointwise Generalization in Deep Neural Networks
Journal submission under review.
-
Pointwise Complexity for Gaussian Fields: Upper Envelopes, Algorithmic Lower Bounds, and Separation
Preprint.
-
Bellman-sufficient Information Complexity
Preprint.
-
Working paper.
-
Finite-Time Minimax Bounds and an Optimal Lyapunov Policy in Queueing Control
Major Revision at Operations Research.
Stochastic Networks Conference Outstanding Poster Prize
-
Working paper.
-
Statistical Properties of Robust Learning under Distribution Shifts
In preparation for journal submission.
-
Autoregressive Learning in Joint KL: Sharp Oracle Bounds and Lower Bounds
Conference submission under review.
Spotlight (top 4.3%) in NeurIPS 2025 ML×OR Workshop.
-
On the Blessing of Pre-training in Weak-to-Strong Generalization
Conference submission under review.
-
On the Power of Adaptivity for ε-Best Arm Identification in Linear Bandits
Conference on Learning Theory (COLT) 2026.
-
In-Context Learning for Data-Driven Censored Inventory Control
Preprint.
-
Thompson Sampling for Repeated Newsvendor
Preprint.
-
Conference on Neural Information Processing Systems (NeurIPS) 2024.
Spotlight (top 2.5%)
Journal version under preparation.
-
Statistical Properties of Robust Satisficing
International Conference on Machine Learning (ICML) 2024.
INFORMS Undergraduate Operations Research Prize, Finalist
-
Bayesian Design Principles for Frequentist Sequential Learning
Journal of the ACM, 2025. Code
Short version in International Conference on Machine Learning (ICML) 2023.
ICML Outstanding Paper Award
INFORMS George Nicholson Student Paper Competition, First Place
Applied Probability Society Best Student Paper Award, Finalist
-
Towards Optimal Problem Dependent Generalization Error Bounds in Statistical Learning Theory
Mathematics of Operations Research, 2025.
Applied Probability Society Best Student Paper Award, Finalist
Towards Problem-dependent Optimal Learning Rates
Conference on Neural Information Processing Systems (NeurIPS) 2020.
Spotlight (top 4.1%)
-
Upper Counterfactual Confidence Bounds: a New Optimism Principle for Contextual Bandits
Under Revision at Journal of Machine Learning Research.
-
Acceleration of Primal-Dual Methods by Preconditioning and Simple Subproblem Procedures
Journal of Scientific Computing, 2021. Code
Education
-
Postdoc, Massachusetts Institute of Technology
College of Computing, LIDSAdvisor: Sasha Rakhlin
-
Doctor of Philosophy, Columbia University
Graduate School of Business, DROAdvisor: Assaf Zeevi
-
Bachelor of Science, Peking University
Department of Pure Mathematicswith highest honor
Students
I am fortunate to mentor a talented group of advisees:
- Shaojie Li
- Yujie Liu
- Yuzhe Yuan
- Zhiyi Li
- Chung Nguyen
- Yu Feng
I also appreciate the opportunity to work with visiting students and project mentees.