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
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
Machine LearningProbabilityTheoretical Computer Science·Captain: mikedeng1

Foundations of Machine Learning III: Structural Risk Minimization and Model SelectionTextbook

Chapters 2 and 3 bound the estimation error of a hypothesis chosen from a fixed hypothesis set HHH, but the choice of HHH itself is left open: a richer HHH lowers the approximation error (how close HHH comes to the Bayes classifier) at the price of a looser generalization bound, and a poorer HHH does the reverse. Chapter 4 is the book's answer to this trade-off. It…

16 thms4 active users
🏆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
🏆Completed
Machine LearningOperations ResearchOptimization·Captain: Shuze Chen

Matrix Completion has No Spurious Local MinimumResearch Paper

Matrix completion — recovering a low-rank matrix M=ZZ⊤M = ZZ^\topM=ZZ⊤ from a small random subset of its entries — powers recommender systems and collaborative filtering. In practice it is solved by running (stochastic) gradient descent on the non-convex objective

14 thms4 active users
Machine LearningProbabilityTheoretical Computer Science·Captain: Shuze Chen

Posterior Sampling in Gaussian Mixture Models Beyond the Clusterability ThresholdResearch Paper

Bayesian mixture models are the standard probabilistic description of clustering: each data point carries a hidden label saying which component generated it, and the scientific object is the posterior over labels given the data. In practice the posterior is explored with Gibbs samplers and related Markov chains, which are known to get trapped between label…

21 thms3 active usersReviewed
Graph TheoryMachine LearningProbability·Captain: Shuze Chen

Supervised Learning with Hidden CorrespondencesResearch Paper

In many data sets the correspondence between inputs and labels is lost or only partly known: records are linked across databases without a shared identifier, labels are released only in aggregate over bags of examples, or a privacy mechanism shuffles them. The learner then sees inputs X1,…,XnX_1,\dots,X_nX1​,…,Xn​ and labels Y1,…,YnY_1,\dots,Y_nY1​,…,Yn​ together with a graph of plausible…

24 thms3 active usersReviewed
Machine LearningProbabilityTheoretical Computer Science·Captain: Shuze Chen

Testable Sanitization via Boundary GeometryResearch Paper

A classifier trained or supplied by an untrusted party may contain a backdoor: a hidden rule that changes its label on inputs perturbed in a way only the adversary knows. Under cryptographic assumptions such backdoors can be undetectable even with white-box access to the model (Goldwasser, Kim, Vaikuntanathan, Zamir 2022), so testing a black-box model for…

17 thms3 active usersReviewed
Machine LearningProbabilityTheoretical Computer Science·Captain: Shuze Chen

A General Approach to Polynomial-Time Truncated Learning via Low-Degree MomentsResearch Paper

Truncated statistics asks what can be learned about a distribution from samples that are only observed when they fall in a set SSS. The question goes back to Galton (1898) and Pearson and Lee (1908), and it arises whenever data are censored by a measuring device, a selection rule or a threshold. For the multivariate Gaussian with a known truncation set,…

18 thms3 active usersReviewed
Machine LearningProbability·Captain: Shuze Chen

Minimax Rates for Estimation of Average Treatment Effects in Observational StudiesResearch Paper

Estimating the average treatment effect (ATE) from observational data is a central task of causal inference in medicine, economics and the social sciences. Without randomization, treatment and outcome may both depend on the covariates, and the effect is identified only under unconfoundedness and overlap (Rosenbaum and Rubin 1983). Standard estimators first…

21 thms3 active usersReviewed
Machine LearningProbabilityTheoretical Computer Science·Captain: iris

Optimal Private Gaussian Multi-samplingResearch Paper

A private sampler receives a dataset of nnn records drawn from an unknown distribution PPP and releases new records that look like draws from PPP, while satisfying differential privacy (DP) with respect to the input dataset. Releasing samples instead of estimated parameters lets a downstream user run any procedure on the synthetic records without a further…

29 thms3 active usersReviewed
ProbabilityTheoretical Computer Science·Captain: iris

Optimal Robust Community DetectionResearch Paper

The stochastic block model is the standard random-graph model of community structure, studied in algorithms, statistics and statistical physics. In its sparse two-community form, every vertex carries a hidden label ±1\pm1±1, and edges are slightly more (or less) likely inside a community than across. The basic question is how well the labels can be recovered…

37 thms3 active usersReviewed
Machine LearningProbability·Captain: Shuze Chen

Geometrically Constrained Learning II: Agnostic Proper Learning of Lipschitz FunctionsResearch Paper

A predictor can have small average error and still change sharply between nearby inputs. A Lipschitz constraint controls this behavior at every pair of points: a 1-Lipschitz function changes by at most the Euclidean distance between its inputs. Learning a predictor that itself satisfies this constraint is called proper learning. The distinction matters when…

23 thms3 active usersReviewed
Information TheoryProbability·Captain: iris

High Confidence Yields Outlier Robustness: Consequences in Computational Hardness, Privacy, and ReplicabilityResearch Paper

Statistical estimation has two classical notions of reliability that grew up in separate literatures. A high-confidence estimator succeeds with probability 1−β1-\beta1−β for a very small failure probability β\betaβ, on i.i.d. samples from any distribution of a broad family, often a heavy-tailed one; sub-Gaussian mean estimation is the standard example (Catoni 2012;…

18 thms3 active usersReviewed
Machine LearningProbability·Captain: mikedeng1

Private Dimension-Free Mean Estimation is Impossible Without the CovarianceResearch Paper

Differential privacy (Dwork, McSherry, Nissim, Smith 2006) bounds how much one person's record can change the distribution of an algorithm's output. Privacy has a cost in accuracy, and Gaussian mean estimation is the standard setting for measuring it: given nnn samples from N(μ,Σ)N(\mu,\Sigma)N(μ,Σ) in Rd\mathbb R^dRd, estimate μ\muμ in Euclidean distance.

17 thms3 active usersReviewed
🏆Completed
Linear algebraOperations ResearchProbability·Captain: mikedeng1

Low-Rank Denoising for Predict-then-OptimizeResearch Paper

A predict-then-optimize pipeline estimates unknown costs and passes the estimate to an optimizer. In shortest-path problems, edge costs can come from noisy measurements or simulation replications. Averaging more replications reduces noise, but costs across different instances may also share structure: several edges can vary together. A projection estimator k…

6 thms3 active usersReviewed
🏆Completed
Machine LearningProbability·Captain: mikedeng1

Is Randomness Necessary for Adaptive Data Analysis?Research Paper

A dataset is often reused to answer questions chosen after seeing earlier answers. Each answer can influence the next question, so the usual guarantee for one question fixed in advance does not automatically extend to the resulting interaction. Adaptive data analysis asks what a mechanism can reliably reveal about a population from a single finite sample in…

14 thms3 active usersReviewed
PreviousPage 7 of 24Next

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