Kaifeng Lyu
Also known as 吕凯风
Kaifeng Lyu is a machine learning theorist who studies how neural networks train and how to make language-model safety last, and he is a co-author of a 2025 ICLR Outstanding Paper on shallow safety alignment. He founded the Universal Online Judge in 2014, graduated from Tsinghua's Yao Class in 2019, and earned a computer science PhD at Princeton in 2024 under Sanjeev Arora. His papers cover margin maximization in homogeneous networks in 2019, sharpness reduction under normalization in 2022, and grokking in 2023, and a postdoctoral post at UC Berkeley's Simons Institute preceded his move home to Tsinghua. He is an assistant professor at Tsinghua's Institute for Interdisciplinary Information Sciences, where his research covers machine learning theory, AI safety and alignment, and optimization.
- Now at
- Tsinghua University
- Badges
Timeline
-
2014
Founding Universal Online Judge
He founds the Universal Online Judge (UOJ) in 2014, a popular online judge system in China. UOJ tests traditional and non-traditional programming problems from the Olympiad in Informatics.
-
2019
Yao Class degree at Tsinghua
He graduates in 2019 with a B.Eng. in computer science from the Yao Class at Tsinghua University.
-
2019
Margin maximization in neural networks
In June 2019, he and Jian Li post a paper on gradient descent in homogeneous neural networks with ReLU or LeakyReLU activations. They show that once the training loss falls below a threshold, a smoothed version of the normalized margin increases over time.
-
2022
Sharpness reduction with normalization
With Zhiyuan Li and Sanjeev Arora, he posts a paper in June 2022 on normalization layers and generalization. Their analysis suggests that normalization together with weight decay encourages gradient descent to reduce the sharpness of the loss surface.
-
2023
Explaining grokking in theory
In November 2023, he posts a paper with Jikai Jin, Zhiyuan Li, Simon S. Du, Jason D. Lee and Wei Hu on grokking. They prove that training can stay at a kernel predictor for a long time before a sharp transition to min-norm or max-margin predictors changes test accuracy.
-
2024
Princeton PhD and Simons postdoc
He earns a computer science PhD from Princeton University in 2024, advised by Sanjeev Arora. He works as a postdoctoral researcher at the Simons Institute for the Theory of Computing at UC Berkeley before joining Tsinghua.
-
2025
An ICLR Outstanding Paper
He is one of eight authors of a paper on the depth of safety alignment in language models, named an Outstanding Paper at ICLR 2025. The paper describes shallow safety alignment, in which alignment adapts a model's output mainly over its first few tokens.
-
Since 2025
Assistant professor at Tsinghua
He joins the Institute for Interdisciplinary Information Sciences at Tsinghua University in 2025 as an assistant professor. His research covers machine learning theory, AI safety and alignment, and optimization, and he teaches the course Large Language Models from Scratch: Theory and Practice in 2025 and 2026.
Career
- Since 2025Tsinghua UniversityAssistant Professor
- University of California, BerkeleyPostdoctoral Researcher
Education
- 2024Princeton UniversityPhD
- 2019Tsinghua UniversityB.Eng.
Sources and credits
Photo: We have no published photo of Kaifeng Lyu yet. Send us a free-licensed photo.
- Kaifeng Lyu
- Kaifeng Lyu | Simons Institute for the Theory of Computing
- Gradient Descent Maximizes the Margin of Homogeneous Neural Networks
- Understanding the Generalization Benefit of Normalization Layers: Sharpness Reduction
- Dichotomy of Early and Late Phase Implicit Biases Can Provably Induce Grokking
- Kaifeng Lyu (Chinese homepage)
- Safety Alignment Should Be Made More Than Just a Few Tokens Deep
- Announcing the Outstanding Paper Awards at ICLR 2025


