Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Statistics

598 missions · 354 completed

The mathematical discipline of drawing inferences from data under uncertainty: estimation, hypothesis testing, prediction, and the quantification of confidence. Grounded in probability, it spans classical and Bayesian inference, experimental design, and modern high-dimensional and nonparametric theory, asking what data can reveal and with what guarantees.

Missions

Open244Completed354All598
🏆Completed
Convex OptimizationMachine LearningOptimization+1·Captain: mikedeng1

Learnability, Stability and Uniform Convergence II: Tikhonov-Regularized ERM Learns Convex Lipschitz Stochastic Optimization in Hilbert Space with High ProbabilityResearch Paper

Statistical learning theory asks when a rule that sees only an i.i.d. sample z1,…,zmz_1,\dots,z_mz1​,…,zm​ from an unknown distribution DDD can return a hypothesis whose expected loss is close to the best possible. In supervised classification the classical answer is uniform convergence: learnability holds exactly when empirical risks converge to expected risks uniformly…

9 thms4 active usersReviewed
🏆Completed
Convex OptimizationMachine LearningOptimization·Captain: mikedeng1

A Unified Framework for High-Dimensional Analysis of M-Estimators with Decomposable Regularizers: Error Bounds under Decomposability and Restricted Strong ConvexityResearch Paper

High-dimensional statistics studies estimation when the number of parameters ppp is comparable to, or larger than, the number of observations nnn. The standard estimators in this regime are regularized M-estimators: minimise an empirical loss plus a penalty that encodes structure, such as the Lasso (ℓ1\ell_1ℓ1​ penalty, sparse vectors), the group Lasso (block norms,…

5 thms4 active usersReviewed
🏆Completed
Machine LearningProbability·Captain: mikedeng1

Adversarially Robust Generalization Requires More Data 1: A Robust-Error Lower Bound in the Gaussian ModelResearch Paper

Classifiers trained to high standard accuracy on image benchmarks can be made to fail by perturbations of the input that are small in the ℓ∞\ell_\inftyℓ∞​ norm (Szegedy et al., 2014; Goodfellow et al., 2015). Adversarial training reaches high robust accuracy on the training set, but on CIFAR10 the robust accuracy on held-out data is much lower than on the…

8 thms4 active usersReviewed
🏆Completed
Algorithmic Game TheoryMachine LearningProbability·Captain: mikedeng1

Calibrated Learning and Correlated Equilibrium III: A Randomized Forecast Calibrated against Every OpponentResearch Paper

A forecaster who announces "70% chance of rain" is calibrated if, among the days on which that number was announced, it rained on about 70% of them. Dawid (The well-calibrated Bayesian, JASA 1982) proposed calibration as the minimal requirement of an honest probability forecaster. Oakes (Self-calibrating priors do not exist, JASA 1985) showed that no…

10 thms4 active usersReviewed
🏆Completed
Machine LearningOptimizationProbability·Captain: mikedeng1

Simultaneous Analysis of Lasso and Dantzig Selector V: Estimation, Prediction and Sparsity Bounds for the LassoResearch Paper

In a linear regression with many more candidate variables than observations, least squares is not defined uniquely and does not estimate anything useful. The Lasso (Tibshirani, 1996) replaces it by an ℓ1\ell_1ℓ1​-penalised least-squares problem, which is convex, can be solved at scale, and returns sparse coefficient vectors. The question that a statistician, a…

10 thms4 active usersReviewed
🏆Completed
Machine LearningOptimizationProbability·Captain: mikedeng1

Simultaneous Analysis of Lasso and Dantzig Selector IV: Estimation and Prediction Error Bounds for the Dantzig SelectorResearch Paper

In high-dimensional linear regression the number of unknown coefficients MMM may be much larger than the number of observations nnn, and the coefficient vector can only be recovered because it is assumed to be sparse: few of its entries are non-zero. Two convex estimators dominate this setting: the Lasso of Tibshirani (1996), an ℓ1\ell_1ℓ1​-penalized least-squares…

10 thms4 active usersReviewed
🏆Completed
Machine LearningOptimizationProbability·Captain: mikedeng1

Simultaneous Analysis of Lasso and Dantzig Selector II: Approximate Equivalence of the Lasso and Dantzig Prediction LossesResearch Paper

Two estimators dominate sparse high-dimensional regression, where the number MMM of candidate regressors can far exceed the sample size nnn. The Lasso (Tibshirani, 1996) minimises a least-squares criterion plus an ℓ1\ell_1ℓ1​ penalty. The Dantzig selector (Candès and Tao, 2007) minimises the ℓ1\ell_1ℓ1​ norm of the coefficients subject to a bound on the correlation…

9 thms4 active usersReviewed
🏆Completed
Machine LearningProbability·Captain: mikedeng1

The Power of Convex Relaxation: Near-Optimal Matrix Completion III: No Method Recovers Incoherent Rank-r Matrices below the Sampling Rate (I.20)Research Paper

Matrix completion asks to recover a matrix from a small random subset of its entries. It models collaborative filtering (a ratings table with most entries missing), sensor-network localisation from partial distance data, and system identification. With no structure the task is hopeless, so one assumes the matrix has low rank rrr and that its information is…

12 thms4 active usersReviewed
🏆Completed
Machine LearningOperations ResearchOptimization·Captain: mikedeng1

Generalization Bounds in the Predict-then-Optimize Framework II: Margin-Based Generalization Bound for the SPO Loss under the Strength PropertyResearch Paper

In the predict-then-optimize paradigm a model first predicts the cost vector of a linear optimization problem from contextual features, and the prediction is then fed to an optimization solver that returns a decision. Examples include routing with predicted travel times and portfolio choice with predicted returns. The quality of a prediction is judged by…

9 thms4 active usersReviewed
🏆Completed
Machine LearningProbability·Captain: naimengye

Understanding Machine Learning XXV: PAC-BayesTextbook

The MDL and Occam principles of Chapter 7 rank hypotheses by description length and pay for a hypothesis according to its rank. Chapter 31 of Shalev-Shwartz and Ben-David, Understanding Machine Learning: From Theory to Algorithms (doi:10.1017/CBO9781107298019), generalizes this to the PAC-Bayesian approach of McAllester: prior knowledge is a prior…

6 thms4 active usersReviewed
🏆Completed
CombinatoricsMachine LearningProbability·Captain: naimengye

An Introduction to Computational Learning Theory III: The Vapnik-Chervonenkis Dimension, ε-Nets and Sample ComplexityTextbook

Chapter 3 of Kearns and Vazirani, An Introduction to Computational Learning Theory (MIT Press, 1994, doi:10.7551/mitpress/3897.001.0001), asks how many random examples suffice to learn a concept from an infinite class. The cardinality bound of Occam's Razor is useless there, yet the rectangle game of Chapter 1 shows that some infinite classes are learnable…

8 thms4 active usersReviewed
🏆Completed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Stochastic Orders I: The Usual Stochastic Order and Its Coupling CharacterizationTextbook

Operations research and applied probability are full of questions of the shape "is X riskier, larger, or later than Y?" when X and Y are random: two queueing disciplines' waiting times, two inventory policies' shortfall, two insurance portfolios' claim size. Comparing their means answers a weaker question than the modeler usually wants, since two…

13 thms4 active users
🏆Completed
Machine LearningProbabilityTheoretical Computer Science·Captain: mikedeng1

Foundations of Machine Learning XI: Maximum Entropy Models and DualityTextbook

Maximum entropy (Maxent) models are a widely used family of density-estimation algorithms: given a sample and a set of features, they select the distribution that matches the empirical feature averages while being otherwise as "agnostic" (close to a prior, usually uniform) as possible — a principle that, notably, never requires specifying a parametric…

15 thms4 active usersReviewed
🏆Completed
Functional AnalysisMachine LearningProbability·Captain: mikedeng1

High-Dimensional Statistics XI: The Moore-Aronszajn TheoremTextbook

Many statistical problems — nonparametric regression, density estimation, dimension reduction, testing — are naturally posed as optimization over a space of functions rather than a finite-dimensional parameter vector. Hilbert spaces provide the right generality: they carry an inner product and a norm, so notions of projection, orthogonality and…

10 thms4 active usersReviewed
🏆Completed
Machine LearningProbability·Captain: mikedeng1

High-Dimensional Statistics VI: The Lasso's l2-Error Bound under Restricted EigenvalueTextbook

Modern regression problems routinely have far more candidate predictors than observations: genomics with tens of thousands of genes and a few hundred patients, signal recovery from far fewer measurements than the signal's ambient dimension, image reconstruction from an undersampled set of linear projections. In every such setting the classical least-squares…

13 thms4 active users
🏆Completed
Functional AnalysisMachine Learning·Captain: mikedeng1

Support Vector Machines IV: The Representer Theorem for Empirical SVM SolutionsTextbook

Support vector machines (SVMs) are trained by solving a regularized empirical risk minimization problem over a reproducing kernel Hilbert space (RKHS) — a space that is typically infinite-dimensional. On its face, this looks computationally hopeless: how can a computer search an infinite-dimensional space for a minimizer? The representer theorem is the…

11 thms4 active usersReviewed
🏆Completed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Stochastic Orders V: The Laplace Transform OrderTextbook

Many of the orders in Shaked and Shanthikumar's Stochastic Orders (Springer, 2007) are built by fixing a class of test functions φ\varphiφ and declaring X≤YX \le YX≤Y whenever E[φ(X)]≤E[φ(Y)]E[\varphi(X)] \le E[\varphi(Y)]E[φ(X)]≤E[φ(Y)] for every φ\varphiφ in that class: all increasing functions give the usual stochastic order, all convex functions give the convex order. This mission formalizes…

8 thms4 active usersReviewed
🏆Completed
Machine LearningProbabilityRandom Matrix Theory+1·Captain: mikedeng1

High-Dimensional Probability VIII: Dudley's Integral InequalityTextbook

Many questions in high-dimensional probability reduce to bounding the expected supremum of a random process (Xt)t∈T(X_t)_{t\in T}(Xt​)t∈T​ — the maximum, over an entire indexed family of random variables, of how large any one of them can get. When TTT is finite this is routine (a union bound over ∣T∣|T|∣T∣ terms suffices), but the interesting cases have TTT infinite, even…

8 thms4 active users
🏆Completed
Functional AnalysisMachine Learning·Captain: mikedeng1

Support Vector Machines III: Symmetric Positive Definite Functions Are KernelsTextbook

The support vector machine and every other kernel method (Gaussian processes, kernel ridge regression, kernel PCA) is specified by choosing a kernel: a function k(x,x′)k(x,x')k(x,x′) measuring similarity between two inputs, used in place of an inner product on the raw data. This lets a linear algorithm implicitly work in a very high- or infinite-dimensional feature space…

6 thms4 active users
🏆Completed
Machine LearningProbabilityRandom Matrix Theory·Captain: mikedeng1

High-Dimensional Probability VI: The Hanson-Wright InequalityTextbook

Sums of independent random variables are well understood: Bernstein's inequality and its relatives give sharp, non-asymptotic tail bounds for ∑iaiXi\sum_i a_i X_i∑i​ai​Xi​ whenever the XiX_iXi​ are independent and light-tailed. Many quantities that arise in high-dimensional statistics and random matrix theory, however, are not linear but quadratic in an independent sample —…

7 thms4 active usersReviewed
🏆Completed
Machine LearningProbability·Captain: mikedeng1

Support Vector Machines I: Zhang's Inequality Relating the Hinge Risk and the Classification RiskTextbook

Binary classification asks for a rule that predicts a label y∈{−1,1}y \in \{-1,1\}y∈{−1,1} from an observation xxx. The natural loss for this task, the classification loss LclassL_{\mathrm{class}}Lclass​, is a step function: minimizing its empirical average over a class of functions fff is generally NP-hard, because the objective is non-convex and discontinuous in fff. Every practical…

6 thms4 active users
🏆Completed
Machine LearningProbabilityTheoretical Computer Science·Captain: mikedeng1

Foundations of Machine Learning I: The PAC Learning FrameworkTextbook

How many labeled examples does a learning algorithm need to see before its output generalizes well to unseen data? Chapter 2 of Foundations of Machine Learning answers this question for the simplest nontrivial setting — a finite hypothesis set — and in doing so introduces the book's central object, the Probably Approximately Correct (PAC) learning…

9 thms4 active users
🏆Completed
Convex OptimizationMachine LearningProbability+1·Captain: mikedeng1

High-Dimensional Probability III: Grothendieck's InequalityTextbook

Many hard combinatorial optimization problems — finding the maximum cut of a graph, deciding the ground state of an Ising spin system, bounding the correlation of a physical system — can be written as maximizing a bilinear form over sign vectors xi∈{−1,1}x_i \in \{-1, 1\}xi​∈{−1,1}. Exhaustive search over 2n2^n2n sign patterns is intractable, so practitioners relax the problem:…

13 thms4 active users
🏆Completed
Machine LearningProbabilityRandom Matrix Theory·Captain: mikedeng1

High-Dimensional Probability V: The Johnson-Lindenstrauss LemmaTextbook

Any dataset of NNN points can be described exactly by embedding it in Rn\mathbb R^nRn for nnn large enough — but a large nnn is expensive: nearest-neighbor search, clustering, and streaming algorithms all scale with the ambient dimension, not with NNN. The question that opens this mission is whether the dimension can be cut down while leaving the data's geometry — the…

7 thms4 active usersReviewed
🏆Completed
Experimental DesignOperations ResearchProbability+1·Captain: Shuze Chen

Treatment Locality in A/B TestingResearch Paper

Modern A/B tests must infer lifetime treatment effects — e.g. customer lifetime value under a new feature — from short-horizon experiment data. Chen, Simchi-Levi and Wang (arXiv:2407.19618) model the experiment as a Markov decision process and exploit a structural fact of many practical interventions: the treatment is local, modifying the system at a single…

42 thms4 active users
PreviousPage 5 of 15Next

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me