AI4SLT: Empirical Processes in Lean 4 for Formal Statistical Learning Theory
Not on the map. Why?
Abstract (arXiv)
We present the first comprehensive Lean 4 formalization of statistical learning theory (SLT) grounded in empirical process theory. Our en-to-end formal infrastructure implement the missing contents in latest Lean library, including a complete development of Gaussian Lipschitz concentration, Dudley's entropy integral theorem for sub-Gaussian processes, and an application to least-squares (sparse) regression with a sharp rate. The project was carried out using a human-AI collaborative workflow, in which humans design proof strategies and AI agents execute tactical proof construction, leading to the human-verified Lean 4 toolbox for SLT. Beyond implementation, the formalization process exposes and resolves implicit assumptions and missing details in standard SLT textbooks, enforcing a granular, line-by-line understanding of the theory. This work establishes a reusable formal foundation and opens the door for future developments in machine learning theory. The code is provided in https://github.com/YuanheZ/lean-stat-learning-theory.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 11 of its 29 references that are in the map. First posted on arXiv 2 Feb 2026.
Builds on
11 of 29 references.
References · 11
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
- 2019Benign Overfitting in Linear Regressioncited by 544
- 2019The generalization error of random features regression: Precise asymptotics and double descent curvecited by 410
- 2020Benign overfitting in ridge regressioncited by 152
- 2022The merged-staircase property: a necessary and nearly sufficient condition for SGD learning of sparse functions on two-layer neural networkscited by 141
- 2021Intermediate Layer Optimization for Inverse Problems using Deep Generative Modelscited by 70
- 2025Dynamical Decoupling of Generalization and Overfitting in Large Two-Layer Networkscited by 21
- 2025Survey on Algorithms for multi-index modelscited by 15
- 2025Towards Formalizing Reinforcement Learning Theory: A Robbins-Siegmund Approachcited by 5
- 2024Formalization of Complexity Analysis of the First-order Algorithms for Convex Optimizationcited by 2
Built on by
Citing papers per year: 2026: 4.
4 papers.
- 2026VALG: An Agentic System for ML Theory Researchcited by 1
- 2026MathlibPR: Pull Request Merge-Readiness Benchmark for Formal Mathematical Librariescited by 0
- 2026CausalSmith: A Formally Grounded, Self-Improving Agentic Framework for Automated Research in Causal Inferencecited by 0
- 2026GenLimitLib: A Formal Library for Language Generation in the Limit and AI-Assisted Mathematical Researchcited by 0
- 2026GenLimitLib: A Formal Library for Language Generation in the Limit and AI-Assisted Mathematical Research29 Sep 2026
- 2026VALG: An Agentic System for ML Theory Research13 Aug 2026
- 2026CausalSmith: A Formally Grounded, Self-Improving Agentic Framework for Automated Research in Causal Inference24 Jul 2026
- 2026MathlibPR: Pull Request Merge-Readiness Benchmark for Formal Mathematical Libraries8 May 2026