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
Quantum InformationTheoretical Computer Science·Captain: iris

Shadow bootstrapping: Nearly minimal-setting pure-state tomography with shallow Clifford measurementsResearch Paper

Quantum state tomography produces a classical description of an unknown quantum state from measurements on copies of it. For an nnn-qubit pure state ∣ψ⟩∈Cd|\psi\rangle \in \mathbb C^d∣ψ⟩∈Cd, d=2nd = 2^nd=2n, the optimal number of copies for infidelity 1−∣⟨ψ^∣ψ⟩∣2≤ϵ1 - |\langle\hat\psi|\psi\rangle|^2 \le \epsilon1−∣⟨ψ^​∣ψ⟩∣2≤ϵ at constant failure probability is Θ(d/ϵ)\Theta(d/\epsilon)Θ(d/ϵ), and it is already…

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

Efficient Private and Robust StatisticsResearch Paper

A differentially private estimator has an output law that barely changes when one sample is swapped. A robust estimator stays accurate when a small fraction of its samples has been replaced by an adversary. Both requirements limit the influence of individual samples, so they look compatible, and information-theoretic algorithms achieving both exist.…

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

Optimally learning mixtures of arbitrarily many GaussiansResearch Paper

A mixture of kkk Gaussians is learned, in the classical sense, by estimating its parameters or its density. Both tasks need a number of samples that grows with kkk: with identity covariances and weights 1/k1/k1/k, Ω(k)\Omega(k)Ω(k) samples are needed just to see every component, and density estimation needs Ω(kn/ε2)\Omega(kn/\varepsilon^2)Ω(kn/ε2) samples (SOAJ14). When kkk is unbounded or…

26 thms3 active usersReviewed
Quantum Information·Captain: iris

Shallow shadows: Expectation estimation using low-depth random Clifford circuits: the state-dependent shadow norm at any depth d is ‖O‖²_LS + tr(σÕ), with ‖O‖²_LS = Σ_λ β_λ²/t_λ,dResearch Paper

Classical shadows (Huang, Kueng and Preskill, arXiv:2002.08953) estimate many expectation values tr⁡(Oρ)\operatorname{tr}(O\rho)tr(Oρ) of an unknown nnn-qubit state ρ\rhoρ from few copies. Each copy is rotated by a random unitary and measured in the computational basis, and the outcome is inverted through a linear map, the measurement channel. The number of copies needed…

30 thms3 active usersReviewed
Linear OptimizationOperations ResearchProbability·Captain: iris

Rank-One Boolean Tensor Factorization and the Multilinear Polytope: The Flower LP Recovers the Planted Rank-One Tensor w.h.p. Under Semi-Random Corruption When p<rw/(1+2rw)p < r_w/(1 + 2r_w)p<rw​/(1+2rw​)Research Paper

Boolean tensor factorization writes a binary data tensor as a Boolean combination of a few binary rank-one tensors. It is used in data mining for binary relational data (subject–relation–object triples, user–item–context records) and in latent-structure discovery, where the factors are read directly as sets of rows, columns and slices. Even its rank-one…

26 thms3 active usersReviewed
Information TheoryQuantum Information·Captain: iris

Introduction to quantum Fisher information: the quantum Fisher information matrix of every standard operator monotone function is monotone under completely positive trace-preserving mapsResearch Paper

In classical statistics the Fisher information of a parametric family of probability distributions bounds how well its parameter can be estimated (the Cramér–Rao inequality), and it can only decrease when the data are processed by a Markov kernel. Quantum estimation theory, quantum metrology and information geometry need the analogue for families of density…

14 thms3 active usersReviewed
Bandit AlgorithmsProbability·Captain: iris

Multi-armed Bandit Experimental Design: Online Decision-making and Adaptive Inference: EXP3EG Estimates Every Treatment Effect Within 4(2+2K2(1+e2))log⁡(2/δ)/t1−α4(2+2K^2(1+e^2))\log(2/δ)/\sqrt{t^{1-α}}4(2+2K2(1+e2))log(2/δ)/t1−α​ with Probability 1−δ1-δ1−δResearch Paper

An online experiment has two audiences. The experimenter who cares about welfare wants to stop assigning people to inferior treatments as quickly as possible; the statistician wants an accurate estimate of how much better one treatment is than another. A multi-armed bandit policy serves the first and starves the second: an arm that is played rarely is…

12 thms3 active usersReviewed
Operations ResearchOptimizationProbability·Captain: iris

Data-Driven Sample Average Approximation with Covariate Information: The Empirical Residuals-Based SAA Is Consistent and Asymptotically OptimalResearch Paper

Many decisions under uncertainty are taken after observing side information. A retailer orders stock knowing the season and the weather forecast; a grid operator commits generation knowing the time of day and the wind forecast. The decision maker wants to solve the conditional stochastic program

11 thms3 active usersReviewed
Bandit AlgorithmsMachine LearningOperations Research·Captain: iris

Rate-Optimal Bayesian Simple Regret in Best Arm Identification: Two-Stage Exploration Has Bayesian Simple Regret at Most Copt/T′+o(1/T)C_{\mathrm{opt}}/T' + o(1/T)Copt​/T′+o(1/T)Research Paper

A clinical trial, an A/B test or a simulation study often ends with one decision: which treatment to adopt. Multi-armed bandit theory calls this best arm identification. When the arm means are fixed, the frequentist simple regret after TTT pulls decays exponentially at each instance, with a rate that degenerates as the gap closes. A practitioner who has a…

39 thms3 active usersReviewed
Operations ResearchProbabilityStochastic Systems·Captain: iris

Diffusion Approximations for a Class of Sequential Experimentation Problems: The Optimal Stopping Value of the Belief Diffusion Is the Maximum of the Closed-Form Two-Action ValuesResearch Paper

A firm about to launch a product, a platform choosing which items to display, or a regulator testing a treatment must pick one action from a finite menu while uncertain about which of two states of the world holds. Before committing, it can run experiments, each of which shifts its belief. Experimenting has a cost in time, modelled by discounting, and the…

30 thms3 active usersReviewed
Algorithmic Game TheoryOperations ResearchReinforcement Learning·Captain: iris

Model-Based Reinforcement Learning for Offline Zero-Sum Markov Games: VI-LCB-Game Returns an ε-Nash Policy Pair with Probability 1−δ from c₁·C⋆_clipped·S(A+B)·log(N/δ)/((1−γ)³ε²) Offline SamplesResearch Paper

Many sequential decision problems with two adversaries are modelled as zero-sum Markov games (Shapley, 1953; Littman, 1994): two players act simultaneously in a shared state, one maximizes and the other minimizes the same discounted reward. In applications such as games, security and robust control, interaction with the system is expensive or unsafe, and…

19 thms3 active usersReviewed
Markov ChainOperations ResearchProbability·Captain: iris

Unbiased Time-Average Estimators for Markov Chains: the Debiased Estimator f̂ₖ Is Unbiased and Square-Integrable with T̂ₖVar(f̂ₖ) ≤ kVar(fₖ) + 8610ν̄(0)²max(q, √((b′(k)−b(k))/k))Research Paper

Steady-state means of Markov chains are estimated by simulation throughout operations research and statistics: queue lengths and waiting times in stochastic networks, posterior expectations in Markov chain Monte Carlo, volumes of convex bodies. The standard estimator is a time average of one long run after a burn-in period. It is biased, because the chain…

31 thms3 active usersReviewed
Machine LearningProbability·Captain: iris

Adversarial Robustness for Latent Models: Revisiting the Robust-Standard Accuracies Tradeoff: The Bayes-Optimal Classifier's Boundary Risk Vanishes in the Latent Gaussian Mixture ModelResearch Paper

Classifiers that reach high accuracy on test data can often be fooled by perturbations of the input that are small in some norm. Training a classifier to resist such perturbations (adversarial training) typically lowers its accuracy on unperturbed data, and part of the literature argues that this robust–standard accuracy tradeoff is unavoidable: for some…

21 thms3 active usersReviewed
Machine LearningProbability·Captain: iris

Finite-Time High-Probability Bounds for Polyak–Ruppert Averaged Iterates of Linear Stochastic Approximation: Under i.i.d. Noise the p-th Moment Error Is ≲ √(p Tr Σε/n) + ‖ε‖∞(p/n^{3/4} + p²/n)Research Paper

Linear stochastic approximation (LSA) solves a linear system Aˉθ=bˉ\bar{\mathbf A}\theta=\bar{\mathbf b}Aˉθ=bˉ when only noisy observations of the matrix and of the right-hand side are available. It is the linear core of temporal-difference learning with linear function approximation, of stochastic gradient descent on least squares, and of many online estimation…

15 thms3 active usersReviewed
Bandit AlgorithmsMachine LearningReinforcement Learning·Captain: iris

Foundations of Reinforcement Learning XII: E2D Regret Is at Most the Decision-Estimation Coefficient Times T Plus γ·EstSqTextbook

In a structured bandit a learner repeatedly picks a decision πt\pi^tπt from a possibly huge or continuous set Π\PiΠ and observes a noisy reward with mean f⋆(πt)f^\star(\pi^t)f⋆(πt), where f⋆f^\starf⋆ belongs to a known class F\mathcal FF of functions Π→R\Pi\to\mathbb RΠ→R. The optimal regret depends on F\mathcal FF in ways that are hard to predict: optimism (UCB) and posterior sampling…

27 thms3 active usersReviewed
Machine LearningReinforcement Learning·Captain: iris

Foundations of Reinforcement Learning VII: Empirical Risk Minimization over a Finite Class Has Expected Excess Risk ≲ √(log|F|/T), and ≲ log|F|/T for Well-Specified Square LossTextbook

Interactive decision making rests on estimation: an agent that acts well must fit a model to past data and rely on it for data not yet seen. The lecture notes of Foster and Rakhlin (arXiv:2312.16730) therefore open with statistical learning, the passive problem in which the learner does not influence the data. It isolates generalization and function…

20 thms3 active usersReviewed
Probability·Captain: iris

Underdogs and One-Hit Wonders: When Is Overcoming Adversity Impressive?: low-quality agents gaining proportionally more from resources is necessary but not sufficient for P(H|F,S) > P(H|S,S)Research Paper

Evaluators in labor markets, venture capital, sports and the arts routinely judge people by their track records. A common intuition holds that two successes are better evidence of talent than one. Another, equally common intuition celebrates the underdog: the agent who succeeds after an initial failure, against the odds. Denrell, Liu and Maslach (Management…

14 thms3 active usersReviewed
Information TheoryQuantum Information·Captain: iris

Distinguishability and Accessible Information in Quantum Theory II: keeping the expert honest forces the logarithmic payoffTextbook

A forecaster, an economist or any expert who sells a probability distribution cannot be checked directly: a single outcome of an experiment never reveals whether the reported distribution was the expert's true state of knowledge. The only safeguard is to pay according to a scheme under which lying does not pay in expectation. This is the problem of keeping…

10 thms3 active usersReviewed
Operations ResearchOptimization·Captain: Shuze Chen

Technical Note—Joint Learning and Optimization of Multi-Product Pricing with Finite Resource Capacity and Unknown Demand Parameters: Rate-optimal regret of PSCResearch Paper

A seller offering several products often shares resources across those products. A room-night can support several travel packages; a seat can serve several itineraries. Selling one product changes what remains available for future customers. When the seller does not know how purchase probabilities respond to prices, each decision also determines what can be…

12 thms3 active usersReviewed
Markov ChainProbabilityReinforcement Learning·Captain: mikedeng1

Offline Estimation of Controlled Markov Chains: Minimaxity and Sample Complexity: Under Geometric Mixing the Empirical Estimator Is ε-Accurate After Order dT/ε² Samples, and This Rate Is MinimaxResearch Paper

Offline reinforcement learning and off-policy evaluation start from a single logged trajectory of a controlled system. The policy that generated the log is often unknown, history-dependent and not stationary. Model-based methods first estimate the transition probabilities of the system from this log, then plan or evaluate policies in the estimated model (Aga…

14 thms3 active usersReviewed
Machine LearningOperations Research·Captain: mikedeng1

A Statistical Learning Approach to Personalization in Revenue Management: High-Probability Revenue Gap Bound for Decisions from the ℓ1-Constrained Logit Maximum Likelihood EstimateResearch Paper

Retailers and platforms increasingly set prices and choose which products to display per customer, using observed customer attributes (location, device, purchase history). The decision rule is usually built in two steps: fit a choice model to historical transactions, then optimize prices and assortments as if the fitted model were the truth. Chen, Owen,…

10 thms3 active usersReviewed
Operations ResearchOptimal TransportProbability·Captain: mikedeng1

Sample Out-of-Sample Inference Based on Wasserstein Distance: The Rescaled SOS Profile Function for Means Converges in Distribution to an Explicit Dimension-Dependent LimitResearch Paper

Stress testing and data-driven decision making often combine two samples: observations X1,…,XnX_1,\dots,X_nX1​,…,Xn​ of the quantity of interest and additional scenarios Y1,…,YmY_1,\dots,Y_mY1​,…,Ym​ (stress scenarios supplied by a regulator, or unlabeled data). Blanchet and Kang (arXiv:1605.01340v4, 2020; later in Operations Research, 2021) propose to measure how far the empirical…

14 thms3 active usersReviewed
Bandit AlgorithmsOperations ResearchProbability·Captain: mikedeng1

Bayesian Sequential Learning for Clinical Trials of Multiple Correlated Medical Interventions: The cPDE Allocation Policy Is Asymptotically ConsistentResearch Paper

A clinical trial that compares several treatments for the same condition must decide, patient by patient, which treatment the next patient receives. When the treatments are related (doses of one drug, drugs of one class), an outcome observed on one arm is informative about the others, and a good allocation rule should exploit that correlation. Chick, Gans…

20 thms3 active users
Operations ResearchOptimization·Captain: mikedeng1

The Risk of Expected Utility Under Parameter Uncertainty II: The Robust Shrinkage Intensity Lies Between the Variance-Minimizing and Mean-Maximizing Intensities and Tends to OneResearch Paper

An investor selecting a portfolio from estimated returns faces two distinct outcomes: the average utility the chosen rule delivers across possible historical samples, and the variation of that utility from one sample to another. A portfolio rule can perform well on average while being sensitive to the particular observations used to estimate it. Lassance,…

9 thms3 active users
Graph TheoryLinear OptimizationOperations Research+1·Captain: mikedeng1

Linear Programming and Community Detection 6: The LP Relaxation Fails w.h.p. in the Very Dense and Dense SBM Above Explicit ThresholdsResearch Paper

Community detection asks for a hidden partition of the nodes of a graph from its edges. Its simplest probabilistic benchmark is the two-community stochastic block model (SBM), in which the minimum bisection problem is the maximum a posteriori estimator. That problem is NP-hard, so convex relaxations are used in its place, and the question is when a…

15 thms3 active usersReviewed
PreviousPage 3 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