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

Evaluating Stochastic Seeding Strategies in Networks: The Hájek Estimator of the Difference Between Two Seeding Strategies Is Consistent and Asymptotically NormalResearch Paper

An experiment may compare two ways to select initial participants in a social network. Each selected seed set can lead to a different outcome, and the experiment observes only the outcome for the seed set actually selected. Chin, Eckles and Ugander study how known selection probabilities let observations from one experimental design estimate the outcomes of…

7 thms2 active usersReviewed
🏆Completed
Operations Research·Captain: mikedeng1

The Internet of Things and Information Fusion: Who Talks to Who?: With Known Asymmetric Qualities Each Sensor Has Exactly One Long-Run Contact on Every Sample PathResearch Paper

Networks of autonomous sensors — machines on a factory floor, vehicles, devices in the Internet of Things — each measure a common environment with their own noise and can improve their estimates by asking other sensors for theirs. Communication capacity is limited, so each sensor must decide whom to ask, and the answer it receives is useful only to the…

5 thms2 active usersReviewed
Machine LearningOperations Research·Captain: mikedeng1

Minimax-Optimal Policy Learning Under Unobserved Confounding: Minimizing the Worst-Case Empirical Regret Attains the Population Minimax Regret up to an Explicit n^(-1/2) TermResearch Paper

Personalized decisions in medicine, marketing and public policy are increasingly learned from observational data: records of who received which treatment and how it turned out. Standard policy-learning methods assume unconfoundedness, that treatment assignment depends only on observed covariates. When an unobserved factor influences both the treatment and…

10 thms2 active usersReviewed
ProbabilityQuantum Information·Captain: mikedeng1

Predicting Many Properties of a Quantum System from Very Few Measurements: Median of Means over Classical Shadows Predicts M Linear Properties to Error ε with Probability 1 − δResearch Paper

Characterizing the state ρ\rhoρ of an nnn-qubit device is a basic task in quantum computing and simulation. Full quantum state tomography reconstructs ρ\rhoρ completely, but it needs a number of measurements exponential in nnn (Haah et al., 2017; O'Donnell–Wright, 2016). In practice one usually wants only a list of properties, such as the expectation values …

11 thms2 active usersReviewed
🏆Completed
Operations ResearchStochastic Systems·Captain: mikedeng1

Experimental Design in Two-Sided Platforms: An Analysis of Bias: In Demand-Constrained Markets the Naive Customer-Side Estimator Is Unbiased and the Listing-Side Estimator Is Generically BiasedResearch Paper

Online marketplaces such as lodging, ride-hailing and freelancing platforms test changes to their product (a new ranking, a new fee display, a new photo layout) with randomized experiments. In a two-sided marketplace these experiments are subject to interference: treated and control units compete for the same scarce supply or demand, so the outcome of one…

11 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Calibration of Distributionally Robust Empirical Optimization Models: The Worst-Case Sensitivity of the Expected Reward Equals Its Variance Divided by φ''(1)Research Paper

Distributionally robust optimization (DRO) guards a data-driven decision against misspecification of the model that generated the data. In its penalized form, the decision maker replaces the sample-average problem max⁡xEPn[f(x,Y)]\max_x \mathbb E_{\mathbb P_n}[f(x,Y)]maxx​EPn​​[f(x,Y)], where Pn\mathbb P_nPn​ is the empirical distribution of the data Y1,…,YnY_1,\dots,Y_nY1​,…,Yn​, by

7 thms2 active usersReviewed
Machine LearningProbability·Captain: mikedeng1

A Robust Spectral Clustering Algorithm for Sub-Gaussian Mixture Models with Outliers 1: Robust-LP Inlier Error ≤ Cn²·max{exp(−Δ²min/64σ²max), log nmin/nmin} with Probability ≥ 1 − 2r/nminResearch Paper

Clustering points drawn from a mixture of well-separated distributions is a basic problem of unsupervised learning. Practical data sets also contain outliers, points that belong to no cluster and may be placed anywhere. Srivastava, Sarkar and Hanasusanto (arXiv:1912.07546v3; Operations Research 71(1), 2023) propose a robust spectral clustering algorithm. It…

16 thms2 active usersReviewed
🏆Completed
Linear algebraMachine Learning·Captain: mikedeng1

A Robust Spectral Clustering Algorithm for Sub-Gaussian Mixture Models with Outliers 2: Spectral Rounding Without Outliers Gives Σ|S_k|/n_k ≤ 64(2+ε)‖X⁰ − X̂‖₁/n²minResearch Paper

Spectral clustering recovers group labels from a similarity matrix: compute its leading eigenvectors, embed each point as a row of the eigenvector matrix, and cluster the rows with k-means. It is a standard last step of convex-relaxation methods for clustering, which first estimate a clustering matrix XXX (with Xij=1X_{ij} = 1Xij​=1 when iii and jjj belong to the same…

8 thms2 active usersReviewed
Operations ResearchProbabilityRandom Matrix Theory·Captain: mikedeng1

The Risk of Expected Utility Under Parameter Uncertainty I: Closed-Form Out-of-Sample Utility Variance of the Shrinkage Mean-Variance PortfolioResearch Paper

A portfolio chosen from historical returns can look attractive in the data used to construct it and deliver a different result when evaluated under the population return distribution. The gap is driven by estimation error in both the mean return and covariance matrix. A mean of future utility values describes average performance, but it does not describe…

22 thms2 active usersReviewed
Machine LearningOperations ResearchProbability·Captain: mikedeng1

Subset Selection with Shrinkage: Sparse Linear Modeling When the SNR Is Low V: When the SNR Is Low, Best Subset Selection Has Prediction Error at Least of Order σ²γ²k log(ep/k)Research Paper

Best subset selection fits a linear model by least squares using at most kkk of ppp available predictors. It is the classical ℓ0\ell_0ℓ0​-constrained estimator of sparse regression. Mixed-integer optimization now computes it for problems with thousands of variables (Bertsimas, King & Mazumder 2016), so its statistical behaviour matters in practice. Simulations in Has…

8 thms2 active usersReviewed
🏆Completed
Graph TheoryLinear OptimizationOperations Research+1·Captain: mikedeng1

Linear Programming and Community Detection 7: The LP Relaxation Fails w.h.p. in the Logarithmic-Degree SBMResearch Paper

The stochastic block model (SBM) is the standard benchmark for community detection: a random graph whose vertices are split into hidden communities, with denser connections inside a community than across. For two equal communities, the best possible estimator of the hidden partition is the minimum bisection problem, which is NP-hard in the worst case. Its…

10 thms2 active usersReviewed
Machine LearningReinforcement Learning·Captain: mikedeng1

Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model 3: Plug-In Policy Evaluation Is ε-Accurate w.p. 1−δ Once N ≥ c₀log(|S|log(e/(1−γ))/δ)/((1−γ)³ε²)Research Paper

Policy evaluation asks for the value of a fixed decision rule in a Markov decision process whose transition probabilities are unknown. It is the inner loop of policy iteration, the subroutine behind actor-critic methods, and the question an operator faces before deploying a policy in an inventory, queueing or routing system that can only be simulated. The…

17 thms2 active usersReviewed
Machine LearningReinforcement Learning·Captain: mikedeng1

Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model 1: The Perturbed Model-Based Planner Is ε-Optimal w.p. 1−δ Once N ≥ c₀log(|S||A|/((1−γ)εδ))/((1−γ)³ε²)Research Paper

A generative model lets a planner request independent next-state samples for any state-action pair. This is a useful idealization for studying how many simulator calls are needed before a policy computed from an estimated model performs well in the true environment. Li, Wei, Chi, and Chen show that a small independent perturbation of the rewards lets a…

15 thms2 active usersReviewed
Machine LearningReinforcement Learning·Captain: mikedeng1

Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model 4: Finite-Horizon Model-Based Planning Is ε-Optimal w.p. 1−δ Once N ≥ c₀H³log(H|S||A|/δ)/ε²Research Paper

Reinforcement learning with a generative model (a simulator) is a basic way to measure how many samples planning needs. A learner may query, for any state sss, action aaa and step hhh, a fresh next state drawn from the unknown transition law Ph(⋅∣s,a)P_h(\cdot\mid s,a)Ph​(⋅∣s,a), and must output a near-optimal policy. Model-based planning is the simplest approach: estimate each…

10 thms2 active usersReviewed
ProbabilityQuantum Information·Captain: mikedeng1

Direct Fidelity Estimation from Few Pauli Measurements 2: A Unit Vector Nearly Orthogonal to 2^{cd} Given States With Every Non-Identity Pauli Expectation ≤ √(72π³)·√(log d)/√dResearch Paper

Quantum state tomography reconstructs an unknown ddd-dimensional quantum state from measurements on many copies of it. For nnn qubits, d=2nd = 2^nd=2n, so the number of copies a tomography procedure needs grows exponentially in nnn, and lower bounds on that number decide how far experiments can scale. In many experiments the only measurements available are Pauli…

11 thms2 active usersReviewed
🏆Completed
Graph TheoryInformation TheoryProbability·Captain: mikedeng1

Partial Recovery in the Graph Alignment Problem I: If D(P‖Q)/α = o(log n/n), No Algorithm Recovers a Fraction α of a Correlated Erdős–Rényi AlignmentResearch Paper

Graph alignment asks for the correspondence between the vertices of two graphs that are noisy copies of each other with hidden labels. It arises in the de-anonymization of social networks, where an anonymized friendship graph is matched against a public one (Narayanan–Shmatikov 2009), and in computational biology, where protein–protein interaction networks…

8 thms2 active usersReviewed
CombinatoricsGraph TheoryProbability·Captain: mikedeng1

Partial Recovery in the Graph Alignment Problem II: Under Explicit Sparsity Conditions with nqs Above a Constant, Some Algorithm Recovers a Fraction α of the AlignmentResearch Paper

Graph alignment asks for the correspondence between the vertex sets of two graphs that are noisy copies of each other. It underlies the de-anonymisation of social networks, where an anonymised graph is matched to a public one (Narayanan, Shmatikov 2009), the comparison of protein–protein interaction networks across species, and matching problems in computer…

12 thms2 active usersReviewed
Bandit AlgorithmsOperations ResearchProbability·Captain: mikedeng1

Balancing Optimal Large Deviations in Ranking and Selection: The BOLD Allocation Learns the Large Deviations Optimality Conditions With Probability OneResearch Paper

Ranking and selection asks which of MMM simulated alternatives has the largest mean, when each simulation run returns one noisy sample and the simulation budget is limited. A large literature allocates the budget using the large-deviations analysis of Glynn and Juneja (2004): for a static allocation in which alternative xxx receives a fixed fraction αx\alpha_xαx​ of…

10 thms2 active usersReviewed
ProbabilityRandom Matrix Theory·Captain: mikedeng1

Change-Point Detection in Dynamic Networks with Missing Links II: At a Known Time the Matrix CUSUM Test Has Level α and Type II Error ≤ β Above Energy 4√2(1+ϵ)(ω_n/T)^{1/2} + C log(n/(α∧β))/√TResearch Paper

Networks observed over time, such as communication graphs, contact networks and financial exposure graphs, often change structure abruptly. Change-point detection asks whether the law of the network changed during the observation window. In practice not every pair of nodes is observed at every time: links are missing because of sampling, privacy or…

9 thms2 active usersReviewed
🏆Completed
Linear OptimizationOperations Research·Captain: mikedeng1

Reducing Marketplace Interference Bias Via Shadow Prices 1: In a Symmetric Experiment the Shadow-Price Estimator Is No More Biased Than the RCT Estimator in the Fluid LimitResearch Paper

Online marketplaces (ride hailing, delivery, freelancing, retail supply chains) test changes to their product with randomized controlled trials: a fraction ρ\rhoρ of the arriving customers is treated, the rest is kept as control, and the difference in outcomes is scaled up to estimate what would happen if everybody were treated. In a market with limited…

8 thms2 active usersReviewed
Bandit AlgorithmsMachine LearningOperations Research·Captain: mikedeng1

Online Learning and Decision-Making under Generalized Linear Model with High-Dimensional Data: The G-MCP-Bandit Algorithm Has Expected Cumulative Regret at Most Rmax(T0 + |K|) + C log(T + 1)Research Paper

Personalized decisions — which drug to prescribe, which product to recommend, which price to quote — are made one user at a time, from user features observed on arrival, and the effect of each decision is learned only from the users it was applied to. This is the contextual (covariate) bandit. In electronic records and online platforms the feature vector is…

10 thms2 active usersReviewed
Optimal TransportProbability·Captain: mikedeng1

Global Sensitivity Analysis via Optimal Transport 3: The Partition Estimator of an OT-Based Sensitivity Measure Converges Under Weak Convergence of the Joint LawsResearch Paper

Global sensitivity analysis asks how much of the uncertainty in a model output YYY is due to an input XXX. Borgonovo, Figalli, Plischke and Savaré (Management Science, 2025) propose a family of indicators built on optimal transport: the expected optimal transport cost between the marginal law of YYY and the law of YYY conditioned on the information carried by XXX.…

12 thms2 active usersReviewed
🏆Completed
Linear algebra·Captain: LG

Local Distance Network (H0DN 2026): generalized least squares behind the H0 consensusResearch Paper

The Hubble constant H0H_0H0​ is the present expansion rate of the Universe. Its value measured locally with distance-ladder methods disagrees with the value inferred from the early Universe under the standard Λ\LambdaΛCDM model (the Hubble tension). The H0DN Collaboration (A&A 708, A166, 2026) combined geometric distances, Cepheids, the tip of the red giant…

15 thms2 active usersReviewed
🏆Completed
Mathematical Physics·Captain: LG

Freedman–Madore 2023: Quantifying the Hubble TensionResearch Paper

The Hubble constant H0H_0H0​ is the present expansion rate of the universe. It is the slope of Hubble's law v=H0 dv = H_0\, dv=H0​d, which relates a galaxy's recession velocity vvv (km s−1^{-1}−1) to its distance ddd (Mpc). Two families of measurements currently disagree. Local, distance-ladder measurements calibrated with Cepheid variables give H0≈73H_0 \approx 73H0​≈73 km s−1^{-1}−1 Mpc−1^{-1}−1 (SH…

12 thms2 active usersReviewed
🏆Completed
Probability·Captain: LG

Zipf's Law: the Zipf Distribution, its Infinite Extension and Related LawsTextbook

Zipf's law is the empirical observation that when a set of measured values is sorted in decreasing order, the value of the nnn-th entry is often approximately inversely proportional to nnn. Its best-known instance is word frequency in natural language: in the Brown Corpus the most frequent word, "the", accounts for nearly 7%7\%7% of all word occurrences, the…

19 thms2 active usersReviewed
PreviousPage 17 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