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

Foundations of Machine Learning V: Kernel Methods and the Representer TheoremTextbook

Linear methods like SVMs work only when the classes are linearly separable, but most real data is not. Chapter 6 shows how to get non-linear decision boundaries for free: replace the input space's inner product with a kernel KKK that implicitly computes an inner product in a (possibly very high- or infinite-dimensional) feature space, without ever explicitly…

7 thms5 active usersReviewed
🏆Completed
Machine LearningProbabilityRandom Matrix Theory·Captain: mikedeng1

High-Dimensional Probability IV: Norms of Random Matrices with Sub-gaussian EntriesTextbook

Random matrices with independent entries appear whenever a system is measured through many noisy, roughly independent channels: shot noise in a sensor array, edges in an Erdős–Rényi-type random graph, or the design matrix of a linear model with independent covariates. A basic question about any such matrix AAA is how far it can stretch a vector — its operator…

12 thms5 active users
🏆Completed
Markov ChainProbabilityReinforcement Learning·Captain: mikedeng1

Uncertainty Quantification and Exploration for Reinforcement Learning: Empirical Q-Values Are Strongly Consistent and √n(Q̂ₙ − Q) ⇒ N(0, Σ) with the Closed-Form Covariance (5)Research Paper

A reinforcement-learning agent that learns a Markov decision process (MDP) from data ends up with point estimates of the Q-values: the long-run discounted reward of taking an action in a state and acting optimally afterwards. Point estimates say nothing about their own reliability. Choosing between two actions whose estimated values differ by a small…

10 thms4 active usersReviewed
🏆Completed
Quantum InformationRepresentation Theory·Captain: mikedeng1

Parallel Treatment of Estimation of SU(2) and Phase Estimation: with a Reference System, n = 2d − 1 Uses of an Unknown SU(2) Matrix Reach Worst-Case Error sin²(π/(2d+2)), so n²·Error → π²Research Paper

Two parties who do not share a reference frame can align one by sending quantum systems through an unknown rotation. Mathematically, a device applies an unknown matrix g∈SU(2)g\in\mathrm{SU}(2)g∈SU(2) to each of nnn qubits, and the task is to estimate ggg from one measurement on the output. How fast the smallest achievable error falls with nnn is a basic question of quantum…

11 thms4 active usersReviewed
🏆Completed
Operations ResearchProbabilityReinforcement Learning·Captain: mikedeng1

Correcting for Interference in Experiments: A Case Study at Douyin: In Absorbing MDPs the Differences-in-Qs Estimator Has Bias at Most T_abs³ · r_max · δ²Research Paper

A creator-side experiment on a short-video platform may assign treatment to individual videos while measuring outcomes over a viewer's whole session. A treated video can alter what the viewer watches next, so its effect may persist beyond the immediate reward. The paper studies this form of interference using a Markov decision process and asks how well data…

10 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Value-Based Clinical Trials: Selecting Recruitment Rates and Trial Lengths in Different Regulatory Contexts: The Optimal Sample Size Grows as the Square Root of the Post-Adoption PopulationResearch Paper

Classical sample-size calculations for a clinical trial fix a significance level and a power and solve for the number of patients. They do not ask what the trial is for. A value-based design asks instead: given what it costs to recruit patients and what a better adoption decision is worth to the patients treated after the trial, how long should the trial…

13 thms4 active usersReviewed
🏆Completed
Bandit AlgorithmsOperations ResearchOptimization+1·Captain: Shuze Chen

Multi-armed Bandit Allocation Indices X: Jobs and Targets, Location–Scale Invariance and Semi-Markov Sampling ProcessesTextbook

A bandit sampling process models a population from which values are drawn one at a time: the values are independent with a distribution f(⋅∣θ)f(\cdot \mid \theta)f(⋅∣θ) whose parameter θ\thetaθ is unknown, the decision maker holds a prior on θ\thetaθ and updates it by Bayes' theorem, and each draw earns a reward. When several such populations compete for the same sampling…

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

Assessing Algorithmic Fairness with Unobserved Protected Class Using Data Combination: The Partial Identification Set of Demographic Disparity Is the Closed Interval with Fréchet–Hoeffding EndpointsResearch Paper

An auditor may need to measure whether a decision rule approves members of one protected group more often than members of another. The decision, the relevant outcome, and useful proxy variables may be observed in a primary dataset, while protected class and the same proxies are observed in a separate auxiliary dataset. There is no record linking the two…

8 thms4 active usersReviewed
🏆Completed
Machine LearningOperations Research·Captain: mikedeng1

Subset Selection with Shrinkage: Sparse Linear Modeling When the SNR Is Low VI: A BIC-Type Choice of the Model Size Yields Oracle Inequalities for the Expected Prediction ErrorResearch Paper

Best subset selection fits a linear model using at most kkk of ppp available predictors: it minimizes the residual sum of squares ∥y−Xβ∥2\|y-X\beta\|^2∥y−Xβ∥2 over all β\betaβ with at most kkk nonzero coordinates. It is the classical benchmark for sparse regression, and mixed-integer optimization has made it computable at scales that used to be out of reach (Bertsimas, King &…

15 thms4 active usersReviewed
🏆Completed
ProbabilityQuantum Information·Captain: mikedeng1

Direct Fidelity Estimation from Few Pauli Measurements 1: ⌈1/(ε²δ)⌉ Importance-Sampled Pauli Measurements Estimate tr(ρσ) Within 2ε With Probability ≥ 1 − 2δResearch Paper

Experiments that prepare many-body entangled states (GHZ, W, stabilizer, cluster and matrix product states) need a way to check that the device produced the intended state. Full quantum state tomography answers the question but its cost grows with the dimension d=2nd = 2^nd=2n of an nnn-qubit system: a reconstruction needs on the order of d2d^2d2 measurement settings.…

15 thms4 active usersReviewed
🏆Completed
AnalysisOperations ResearchProbability·Captain: mikedeng1

Scores for Multivariate Distributions and Level Sets II: The Level Set Score (S′)^Γ Is Consistent for the α Level Set {f_Y ∗ w ≥ α}Research Paper

A forecaster who issues a probability distribution for a multivariate quantity, such as the joint demand at several locations or the joint returns of several assets, is often judged not on the whole distribution but on a region it implies: the set of outcomes whose cumulative probability, or smoothed density, exceeds a threshold. Such level sets are the…

14 thms4 active users
🏆Completed
Bandit AlgorithmsOperations ResearchProbability·Captain: mikedeng1

The (Surprising) Sample Optimality of Greedy Procedures for Large-Scale Ranking and Selection 3: The Explore-First Greedy Procedure Is Consistent with a Budget Linear in kResearch Paper

Ranking and selection (R&S) asks which of kkk simulated systems has the largest mean performance when every observation is costly. It is a basic tool of simulation optimization: choosing a staffing level, an inventory policy or a network design from a large catalogue of candidates that can only be evaluated by noisy simulation. In the fixed-budget formulation…

18 thms4 active usersReviewed
🏆Completed
Bandit AlgorithmsOperations ResearchProbability·Captain: mikedeng1

The (Surprising) Sample Optimality of Greedy Procedures for Large-Scale Ranking and Selection 2: Under the Slippage Configuration with a Common Variance the Greedy PCS Lower Bound Is TightResearch Paper

Ranking and selection (R&S) asks how to spend a fixed budget of simulation runs on kkk competing system designs so that the design with the largest mean performance is identified with high probability. When kkk runs into the thousands or millions, the relevant question is how the total budget must grow with kkk. Li, Fan and Hong (arXiv:2303.02951v3, published in M…

16 thms4 active usersReviewed
🏆Completed
Graph TheoryProbability·Captain: mikedeng1

Change-Point Detection in Dynamic Networks with Missing Links I: Changes of Energy of Order (ω_n/T)^{1/2} at a Known Time Cannot Be Detected by Any Level-α Test with Type II Error Below βResearch Paper

Networks observed over time — contact networks, communication graphs, brain connectivity recorded in sessions, trade networks — often change their structure abruptly at an unknown or suspected moment. Detecting such a change point from a sequence of snapshots is a basic statistical task, and in practice the snapshots are incomplete: some pairs of nodes are…

10 thms4 active usersReviewed
🏆Completed
Bandit AlgorithmsOperations ResearchProbability·Captain: mikedeng1

The (Surprising) Sample Optimality of Greedy Procedures for Large-Scale Ranking and Selection 1: On a Budget Linear in k the Greedy Procedure Keeps the PCS Bounded Away from ZeroResearch Paper

Ranking and selection (R&S) is the problem of identifying, by simulation, the alternative with the largest mean performance among kkk candidates, when each alternative can only be observed with noise. It is a basic tool of simulation optimization, with roots in Bechhofer's indifference-zone formulation (Bechhofer 1954). Cloud and parallel computing have made…

12 thms4 active usersReviewed
🏆Completed
Experimental DesignOperations ResearchProbability·Captain: mikedeng1

Pigeonhole Design: Balancing Sequential Experiments from an Online Matching Perspective 1: With T^η Uniform Pigeonholes on [0,1] the Expected Discrepancy Is O(T^(1/2−η/2) + T^(η/2)(log T)^(1/2))Research Paper

Online platforms run controlled experiments in which subjects (users, sessions, sellers) arrive one at a time and must be assigned to control or treatment on arrival, before later subjects are seen. A good design makes the two groups look alike in their observed covariates, because covariate imbalance inflates the variance of treatment-effect estimates.…

14 thms4 active usersReviewed
🏆Completed
Linear algebraMachine LearningNumerical Analysis+2·Captain: mikedeng1

An Introduction to Matrix Concentration Inequalities III: A Matrix Sampling Estimator Satisfies E‖R̄ₙ − B‖ ≤ √(2m₂(R)log(d₁ + d₂)/n) + 2L log(d₁ + d₂)/(3n)Textbook

Matrix approximation replaces a large or complicated matrix with a random matrix that is easier to store or compute. Averaging independent realizations improves accuracy while retaining the structure of each realization. Examples in Tropp's monograph include sparse approximations and randomized matrix products. The practical question is how the number of…

8 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Recovering Best Statistical Guarantees via the Empirical Divergence-Based Distributionally Robust Optimization 1: Empirical Burg-Ball DRO Bounds Cover E[h(x;ξ)] with Probability Tending to 1 − αResearch Paper

Stochastic programs and chance-constrained models in operations research contain expectations of the form

14 thms4 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Sparse Regression at Scale: Branch-and-Bound rooted in First-Order Optimization 3: The Big-M Relaxation Is at Least as Strong as PR(∞) for M ≤ ½√(λ0/λ2) and at Most as Strong for M ≥ √(λ0/λ2)Research Paper

Best subset selection with a ridge term, the ℓ0ℓ2\ell_0\ell_2ℓ0​ℓ2​-regularized least squares problem

20 thms4 active users
🏆Completed
Information TheoryMachine LearningProbability·Captain: mikedeng1

Information-Theoretic Analysis of Generalization Capability of Learning Algorithms III: The Gibbs Algorithm Has Excess Risk at Most (1/β)log(1/Q(wₒ)) + β/(2n) (Corollary 2)Research Paper

Statistical learning algorithms fit hypotheses to data that are available during training, while their performance is judged on new data. A rule that minimizes training loss can fit peculiarities of the sample, so its training loss and population loss need not agree. Xu and Raginsky study this difference through information quantities associated with the…

10 thms4 active usersReviewed
🏆Completed
Information TheoryMachine LearningProbability·Captain: mikedeng1

Information-Theoretic Analysis of Generalization Capability of Learning Algorithms I: The Expected Generalization Error Is at Most √(2σ²I(S;W)/n) (Theorem 1)Research Paper

A learning algorithm trained on a finite sample generalizes when its empirical risk on that sample is close to its risk on fresh data. Classical guarantees come from uniform convergence over the hypothesis class (VC dimension, Rademacher complexity) or from algorithmic stability, such as uniform stability (Bousquet and Elisseeff, 2002) and on-average…

7 thms4 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Bootstrap Robust Prescriptive Analytics 2: The Entropic Robust Nadaraya-Watson Budget Equals inf{α : ν log Σ D·exp((L−α)w/ν) + rν ≤ 0}Research Paper

Data-driven decision making with side information ("prescriptive analytics") chooses a decision zzz after observing a context x=x0x = x_0x=x0​, using a training set of past pairs (x,y)(x, y)(x,y). A common recipe estimates the conditional expected cost E[L(z,y)∣x=x0]\mathbb E[L(z, y) \mid x = x_0]E[L(z,y)∣x=x0​] with a local learning method, such as Nadaraya–Watson kernel regression or nearest neighbours,…

11 thms4 active usersReviewed
🏆Completed
Information TheoryOperations ResearchProbability·Captain: mikedeng1

Bootstrap Robust Prescriptive Analytics 3: Any Distance Exceeding the Bootstrap Distance Near Some D Loses the Disappointment Rate −rResearch Paper

Data-driven decision making estimates the cost of a decision from training data and then optimizes that estimate. The optimized estimate is biased downwards: the decision that looks best on the training data tends to disappoint on fresh data. Distributionally robust optimization counters this by optimizing the worst case of the estimate over all…

9 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Bootstrap Robust Prescriptive Analytics 1: The Entropic Robust Budget Is Broken on Bootstrap Data with Probability at Most Σⱼ exp(−n·max{r, rⱼⁿ})Research Paper

Prescriptive analytics chooses a decision zzz from data after observing a context x0x_0x0​: a retailer sets an order quantity after seeing the weather forecast, a hospital schedules staff after seeing the day of the week. A common recipe estimates the expected cost of each decision from the training observations closest to x0x_0x0​ (nearest neighbours, or a…

12 thms4 active usersReviewed
🏆Completed
Machine LearningProbabilityTheoretical Computer Science·Captain: mikedeng1

A Learning Theory Approach to Non-Interactive Database Privacy 1: The Net Mechanism Is (α, δ)-Useful for Every Class of Counting Queries with Error Governed by Its VC-DimensionResearch Paper

A data curator holds a database of nnn individual records and wants to publish something from which many statistics can be computed, while guaranteeing differential privacy: no single record should noticeably change what is published (Dwork, McSherry, Nissim, Smith 2006). Interactive mechanisms answer queries one at a time and add noise to each answer, so…

16 thms4 active usersReviewed
PreviousPage 3 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