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
Machine LearningOperations ResearchProbability·Captain: mikedeng1

Offline Multi-Action Policy Learning: Generalization and Optimization 1: Cross-Fitted AIPW Policy Learning Has Regret O_p(κ(Π)√(V*/n)) Even with Slowly Converging Nuisance EstimatesResearch Paper

Many decisions are made by assigning one of several actions to an individual on the basis of observed features: which of ddd drugs to prescribe, which of several promotions to show, which job-training programme to offer. Experimentation is often costly or unethical, while historical records of past assignments and their outcomes are plentiful. Offline policy…

9 thms3 active usersReviewed
ProbabilityRandom Matrix Theory·Captain: mikedeng1

Change-Point Detection in Dynamic Networks with Missing Links III: The Dyadic-Grid Matrix CUSUM Test Detects an Unknown Change Time Above Energy 4(1+ϵ)(6ω_n/T)^{1/2} + C log(4n log₂T/(α∧β))/√TResearch Paper

Many networks are recorded as a sequence of snapshots: contact networks in epidemiology, communication graphs, brain connectivity measured over time, trade or transport links. A basic statistical question is whether the law generating the snapshots changed at some point. Two features make the question hard in practice. The networks are often sparse, so each…

12 thms3 active usersReviewed
Experimental DesignOperations ResearchProbability·Captain: mikedeng1

Pigeonhole Design: Balancing Sequential Experiments from an Online Matching Perspective 3: For p ≥ 2 Continuous Covariates, Expected Discrepancy O(T^(1−φ) + T^((p−1)φ)), with (log T)^(3/2) at p = 2Research Paper

Online platforms run randomized experiments on subjects (users, sessions, orders) that arrive one at a time and must be assigned to a control or a treatment group on arrival, before later subjects are seen. The precision of a treatment-effect estimate depends on how similar the two groups are in their observed covariates. When the groups are badly balanced,…

12 thms3 active usersReviewed
Operations ResearchProbability·Captain: mikedeng1

Achieving Efficiency in Black-Box Simulation of Distribution Tails with Self-Structuring Importance Samplers: The Self-Structuring Importance Sampler Is Logarithmically EfficientResearch Paper

Many operational risk questions ask for a small probability pu=P(L(X)≥u)p_u=P(L(X)\ge u)pu​=P(L(X)≥u): the chance that the cost LLL of a decision, evaluated at a random scenario X∈RdX\in\mathbb R^dX∈Rd, exceeds a large threshold uuu. Examples are large delays in project networks or vehicle routing, large portfolio credit losses, and failures in engineered systems. Plain Monte Carlo needs on…

17 thms3 active usersReviewed
Machine LearningOperations ResearchOptimal Transport·Captain: mikedeng1

Finite-Sample Guarantees for Wasserstein Distributionally Robust Optimization: Breaking the Curse of Dimensionality 3: Under T₂(τ), W₂-Robust Loss at Radius ρ̃ₙ Bounds True Loss up to 4r⋆+2εₙ+ħρ̃ₙ²Research Paper

Wasserstein distributionally robust optimization (Wasserstein DRO) replaces the empirical loss EPn[f]\mathbb E_{\mathbb P_n}[f]EPn​​[f] of a decision by its worst case over all distributions within Wasserstein distance ρ\rhoρ of the empirical distribution Pn\mathbb P_nPn​. It is used in operations research (newsvendor, portfolio selection) and machine learning (adversarially…

15 thms3 active usersReviewed
Machine LearningOperations ResearchOptimal Transport·Captain: mikedeng1

Finite-Sample Guarantees for Wasserstein Distributionally Robust Optimization: Breaking the Curse of Dimensionality 2: Under T₁(τ), W₁-Robust Loss at Radius 2√(τt/n)+√(4r⋆+2/n) Bounds the True LossResearch Paper

Wasserstein distributionally robust optimization (DRO) replaces the empirical loss EPn[f]\mathbb E_{\mathbb P_n}[f]EPn​​[f] of a decision or model fff by its worst case over all distributions within a Wasserstein distance ρ\rhoρ of the empirical distribution Pn\mathbb P_nPn​. It is used in operations research (newsvendor, portfolio and inventory problems) and in machine learning…

13 thms3 active usersReviewed
Machine LearningProbability·Captain: mikedeng1

Learning without Concentration: Least-Squares ERM in a Convex Class Is Within 2 max{α_N(γ, δ/4), βN(τQ{F−F}(2τ)/16)} of f* in L₂ under a Small-Ball ConditionResearch Paper

Least-squares regression over a class of functions is the basic problem of statistical learning theory: given an i.i.d. sample (Xi,Yi)i=1N(X_i,Y_i)_{i=1}^N(Xi​,Yi​)i=1N​ from an unknown joint law, select a function in a class FFF whose prediction error E(f(X)−Y)2\mathbb E(f(X)-Y)^2E(f(X)−Y)2 is close to the best possible in FFF. The standard analysis of empirical risk minimization (ERM) compares empirical…

11 thms3 active usersReviewed
Markov ChainProbability·Captain: mikedeng1

Spectral Gaps for a Metropolis–Hastings Algorithm in Infinite Dimensions III: The L²-Spectral Gap of Random Walk Metropolis for a Gaussian Target Vanishes Faster Than Any Power of the DimensionResearch Paper

Bayesian inverse problems and conditioned diffusions lead to probability measures on function spaces, and these are sampled in practice through finite-dimensional approximations on Rm\mathbb R^mRm with mmm large. A Markov chain Monte Carlo method is useful in this setting only if its convergence rate does not deteriorate as the discretisation is refined. Random…

12 thms3 active usersReviewed
Machine LearningProbability·Captain: mikedeng1

Certifying Some Distributional Robustness with Principled Adversarial Training 2: The Empirical Robustness Level E_P̂ₙ[c(T_γ(θ;Z),Z)] Concentrates Uniformly over ΘResearch Paper

Neural networks trained by empirical risk minimization are sensitive to small adversarial perturbations of their inputs. Distributionally robust optimization addresses this by training against the worst distribution in a neighbourhood of the data distribution. Sinha, Namkoong, Volpi and Duchi (arXiv:1710.10571v5, ICLR 2018) take the neighbourhood to be a…

10 thms3 active usersReviewed
Bandit AlgorithmsMachine LearningProbability·Captain: mikedeng1

Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis: Bernoulli Thompson Sampling Has Regret (1+ε)Σ Δ_a(ln T + ln ln T)/K(μ_a, μ*) + CResearch Paper

Thompson Sampling is the oldest bandit algorithm: Thompson proposed it in 1933 for allocating patients between two treatments (Thompson 1933). It keeps a posterior distribution over the unknown mean reward of every action, draws one sample from each posterior, and plays the action whose sample is largest. It is simple, widely used, and in experiments…

17 thms3 active usersReviewed
Convex OptimizationLinear algebraMachine Learning·Captain: mikedeng1

Nuclear-Norm Penalization and Optimal Rates for Noisy Low-Rank Matrix Completion 2: If λ ≥ 3‖M‖∞ on a Linear Subspace, a Sharp Oracle Inequality with the Restricted Constant μ₅(A)Research Paper

Estimating a large matrix that is approximately low rank from a few noisy linear measurements is a basic problem of high-dimensional statistics. It covers matrix completion (recovering a ratings table from a small sample of entries), multi-task regression and quantum state tomography. The standard estimator penalizes the nuclear norm, the sum of the…

14 thms3 active usersReviewed
Graph TheoryProbability·Captain: mikedeng1

Random Graphs with a Given Degree Sequence 3: With Probability 1 − C(L)n⁻² the β-Model MLE Exists, Is Unique, and Is Within C(L)√(log n/n) of βResearch Paper

Network data often come as a single observed graph, and the simplest summary of a graph is its degree sequence, the list of the numbers of neighbours of its vertices. A statistical model in which the degree sequence is a sufficient statistic is an exponential family on graphs, and the simplest such family is the β-model: each vertex iii carries a parameter …

10 thms3 active usersReviewed
Machine LearningProbability·Captain: mikedeng1

Fast Rates for Support Vector Machines Using Gaussian Kernels 1: Under Tsybakov and Geometric Noise, Gaussian-Kernel SVMs Reach Excess Risk Cx²n^{−β+ε} with Probability 1 − e^{−x}Research Paper

Support vector machines classify observations by choosing a real-valued function from a reproducing kernel Hilbert space and using its sign as the predicted label. The Gaussian kernel is widely used because it gives a flexible class of functions, but that flexibility alone does not explain how quickly classification error approaches the best possible error…

11 thms3 active usersReviewed
Machine LearningOptimizationProbability·Captain: mikedeng1

Learning Models with Uniform Performance via Distributionally Robust Optimization 1: The Plug-In Cressie–Read Robust Risk Concentrates at Rate n^(−1/(k*∨2))·√(t + log n) (Theorem 2)Research Paper

A model trained to minimize its average loss EP0[ℓ(θ;X)]\mathbb E_{P_0}[\ell(\theta;X)]EP0​​[ℓ(θ;X)] can perform poorly on subpopulations that are rare under the training distribution P0P_0P0​. Distributionally robust optimization replaces the average loss by its worst case over all distributions QQQ close to P0P_0P0​ in an fff-divergence, which upweights the tail of the loss and controls…

12 thms3 active usersReviewed
Convex OptimizationInformation TheoryOptimization+1·Captain: mikedeng1

I-Divergence Geometry of Probability Distributions and Minimization Problems 2: Under Moment Constraints the I-Projection Exists at Every Interior Point and Has Exponential-Family DensityResearch Paper

Given a reference probability distribution RRR and a set E\mathcal EE of probability distributions, the minimum discrimination information problem asks for the member of E\mathcal EE closest to RRR in Kullback–Leibler divergence. It is the basis of Kullback's information-theoretic approach to statistics (Kullback 1959), of the maximum-entropy principle of…

10 thms3 active usersReviewed
Probability·Captain: mikedeng1

The Tight Constant in the Dvoretzky–Kiefer–Wolfowitz Inequality I: P(√n sup(F − F̂ₙ) > λ) ≤ exp(−2λ²) for λ ≥ min(√(log 2/2), 1.0841 n^(−1/6))Research Paper

The Kolmogorov–Smirnov statistics measure how far the empirical distribution of a sample lies from a hypothesised distribution. They are the standard goodness-of-fit test for continuous data, and their tail probabilities are the basic tool for confidence bands around a distribution function. A test is only usable at a fixed sample size if those tail…

23 thms3 active usersReviewed
Bandit AlgorithmsOperations ResearchProbability·Captain: mikedeng1

Optimal Dynamic Assortment Planning with Demand Learning: The Separation-Based Policy Has Regret at Most κ₁⌈N/C⌉ log T + K̄₁Research Paper

A retailer who can display only a limited number of products must decide which assortment to show each arriving customer, without knowing how attractive each product is. Offering a product reveals how often it is bought, but offering a poor product costs revenue. This exploration–exploitation trade-off arises in fast fashion, where the selling season is…

13 thms3 active usersReviewed
Machine LearningReinforcement Learning·Captain: mikedeng1

Foundations of Reinforcement Learning V: General Decision Making and the Decision-Estimation Coefficient Lower BoundTextbook

Online decision-making problems — multi-armed bandits, contextual bandits, structured bandits, and episodic reinforcement learning — look superficially different but share a common shape: a learner repeatedly acts, observes feedback, and is scored by regret against the best action in hindsight. Foster, Kakade, Qian and Rakhlin's Foundations of Reinforcement…

20 thms3 active users
ProbabilityQuantum InformationTheoretical Computer Science·Captain: iris

Testing State and Unitary DesignsResearch Paper

Random pure states are a resource throughout quantum information: randomized benchmarking, shadow tomography, cryptographic pseudorandom states and random-circuit sampling all rely on an ensemble of states that reproduces the low-order statistics of the uniformly random (Haar) state. An ensemble with this property up to order ttt is a state ttt-design. Designs…

46 thms2 active usersReviewed
Machine LearningProbabilityTheoretical Computer Science·Captain: Shuze Chen

Understanding Model Misspecification in Low-Rank Distributions: Tolerant Testing and Agnostic LearningResearch Paper

Sequence models such as hidden Markov models, tensor trains and autoregressive language models define laws on strings of length TTT over a finite alphabet. A common measure of their complexity is the distribution rank: the largest rank of the matrices that pair every history with every future. Low-rank laws can be learned efficiently from conditional samples…

20 thms2 active usersReviewed
Machine LearningProbabilityTheoretical Computer Science·Captain: Shuze Chen

Sublinear Sample Size Suffices for Learning Mixtures of Gaussians up to IsometryResearch Paper

Learning a mixture of Gaussians from samples is a central problem of statistics and learning theory. For mixtures of kkk spherical Gaussians in Rd\mathbb R^dRd, proper density estimation in total variation needs Θ~(kd/ε2)\tilde\Theta(kd/\varepsilon^2)Θ~(kd/ε2) samples (Ashtiani, Ben-David, Harvey, Liaw, Mehrabian, Plan, J. ACM 2020), and the linear dependence on ddd cannot be…

21 thms2 active usersReviewed
Machine LearningQuantum InformationTheoretical Computer Science·Captain: iris

Agnostic Product Mixed State Tomography via Robust StatisticsResearch Paper

Quantum state tomography asks for a classical description of an unknown state ρ\rhoρ from measurements on copies of it. Learning a general nnn-qubit state needs exponentially many copies, so one asks instead for the best approximation within a simple class. The agnostic version makes no assumption on ρ\rhoρ: the learner must compete with opt\mathrm{opt}opt, the…

32 thms2 active usersReviewed
Machine LearningQuantum Information·Captain: iris

Finding Gaussian Structure in Bosonic StatesResearch Paper

Bosonic systems (optical modes, microwave cavities, motional modes of trapped ions) are described by states on Fock space, and the Gaussian states are the ones that standard optical hardware prepares most easily: squeezed, coherent and thermal states. They are fully described by a mean vector and a covariance matrix, and they can be learned from…

40 thms2 active usersReviewed
Machine LearningProbabilityTheoretical Computer Science·Captain: Shuze Chen

Achieving the Optimal Abstention Rate for Learning with Distribution ShiftResearch Paper

A classifier trained on one distribution is often deployed on data drawn from another. When nothing is assumed about the shift, no guarantee is possible on every test point, but a learner may abstain: it predicts on some test points and declines the rest. The question is then how few points it must decline while keeping its error low on the points it…

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

Data-Dependent Probability Estimation via Sample AmplificationResearch Paper

A statistician observes nnn independent draws S=(X1,…,Xn)S=(X_1,\dots,X_n)S=(X1​,…,Xn​) from an unknown distribution DDD on a finite domain [d]={1,…,d}[d]=\{1,\dots,d\}[d]={1,…,d}, and is then asked about an event, or more generally a [0,1][0,1][0,1]-valued query, chosen by looking at the same sample. Such data-dependent questions arise whenever a dataset is explored before it is analysed: adaptive data analysis,…

22 thms2 active usersReviewed
PreviousPage 4 of 10Next

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