Lean 4 formalizations for high-dimensional probability, random matrices, concentration inequalities, and matrix Bernstein bounds.
-
Updated
Jun 22, 2026 - Lean
Lean 4 formalizations for high-dimensional probability, random matrices, concentration inequalities, and matrix Bernstein bounds.
Python scripts from paper Optimal cleaning for singular values of cross-covariance matrices, by Florent Benaych-Georges, Jean-Philippe Bouchaud, Marc Potters (see https://arxiv.org/abs/1901.05543)
Official repository of our work "A Law of Data Reconstruction for Random Features (and Beyond)" accepted at ICLR 2026
Add a description, image, and links to the high-dimensional-probability topic page so that developers can more easily learn about it.
To associate your repository with the high-dimensional-probability topic, visit your repo's landing page and select "manage topics."