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
Linear algebraMachine Learning·Captain: mikedeng1

SYN-DIGITS: A Synthetic Control Framework for Calibrated Digital Twin Simulation: Error Bound for Ridge Fit-and-Transfer on a New QuestionResearch Paper

Large language models are increasingly used as digital twins of survey respondents: a model is prompted with a persona and asked to answer the same questionnaire a human would. The appeal is cost and speed, since a new question can be "fielded" to thousands of simulated respondents in minutes. The obstacle is fidelity. Large language models exhibit…

8 thms3 active usersReviewed
🏆Completed
Bandit AlgorithmsMachine LearningOperations Research+1·Captain: mikedeng1

The Fragility of Optimized Bandit Algorithms: Optimized Bandit Algorithms Have Truncated Cauchy Regret TailsResearch Paper

The stochastic multi-armed bandit is the basic model of sequential decision-making under uncertainty: in each round an algorithm chooses one of KKK arms, observes a random reward from that arm's distribution, and tries to play the best arm as often as possible. Since Lai and Robbins (1985) the standard of quality has been the expected regret, and an algorithm…

14 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
🏆Completed
Experimental DesignOperations ResearchOptimization·Captain: mikedeng1

Correlated Cluster-Based Randomized Experiments: Robust Variance Minimization: The Optimal Independent Block Randomization Experiment Is Asymptotically Optimal at Rate O(√(w₁²/Σwᵢ²))Research Paper

Online platforms run randomized experiments on users who interact with each other. When the treatment of one user affects the outcome of another, comparing treated and control users is biased. A standard remedy is cluster-based randomization: users are grouped into clusters with few edges between them, and whole clusters are assigned to treatment or control…

11 thms3 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

Lagrangian Inference for Ranking Problems: Asymptotic Normality of the Lagrangian Debiased EstimatorResearch Paper

Ranking from pairwise comparisons is used in sports ratings, recommendation systems, crowdsourcing and web search. The most widely used parametric model is the Bradley–Terry–Luce (BTL) model (Bradley and Terry 1952; Luce 1959), in which item kkk carries a score θk\theta_kθk​ and item iii beats item jjj with probability eθi/(eθi+eθj)e^{\theta_i}/(e^{\theta_i}+e^{\theta_j})eθi​/(eθi​+eθj​). The…

7 thms3 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

Monte Carlo Estimation of CoVaR: Asymptotic Normality and the n^(-1/3) Rate of the Batching EstimatorResearch Paper

CoVaR is the measure of systemic risk proposed by Adrian and Brunnermeier (AER 2016): the β-quantile of one institution's loss YYY given that another loss XXX (a bank, a market index) sits exactly at its own α-quantile, its value-at-risk. Regulators and risk managers compute it from simulation models of portfolios, where the joint law of (X,Y)(X, Y)(X,Y) is available…

13 thms3 active usersReviewed
🏆Completed
Machine LearningOperations ResearchOptimization·Captain: mikedeng1

Stochastic Optimization Forests: the approximate risk criterion consistently approximates the oracle splitting criterion as the region to split shrinksResearch Paper

In contextual stochastic optimization a decision z∈Rdz\in\mathbb R^dz∈Rd is chosen after observing features X∈RpX\in\mathbb R^pX∈Rp, and the ideal policy solves, for each feature value,

9 thms3 active usersReviewed
🏆Completed
Bandit AlgorithmsOperations Research·Captain: mikedeng1

Robust Learning of Consumer Preferences: the Myopic Tracking Policy is worst-case asymptotically optimal for identifying the top-ranked productResearch Paper

A company that is about to launch a product often has several candidate versions of it (designs, packagings, feature bundles) and wants to know which one consumers like best. A common way to find out is to ask: show an arriving consumer a few versions and record which one they pick. Each such query costs time and money, and consumer answers are noisy, so…

22 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

The Privacy Paradox and Optimal Bias–Variance Trade-offs in Data Acquisition: The Minimax-Optimal Allocation Rule Is Constant Then Inversely Proportional to the Square Root of the Virtual CostResearch Paper

Data marketplaces buy personal data from many individuals to estimate population statistics. Two features set such pricing apart from an ordinary procurement auction. First, each data owner has a private cost of sharing, so the buyer must design a menu of payments that elicits these costs truthfully. Second, data are correlated across people: an individual…

13 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
🏆Completed
Convex OptimizationOperations ResearchOptimization+1·Captain: Shuze Chen

Modeling, Measuring and Managing Risk VII: Dual Representation of Minimal Loss Deviation FunctionalsTextbook

A deviation functional measures how far a random profit YYY spreads around its mean: the variance, the standard deviation, the mean absolute deviation from the median, and the average value-at-risk deviation are the standard examples in portfolio selection and in risk-averse stochastic programming. Pflug and Römisch, Modeling, Measuring and Managing Risk (Worl…

6 thms3 active usersReviewed
🏆Completed
Machine LearningOperations ResearchOptimization·Captain: mikedeng1

Accelerated MM Algorithms for Ranking Scores Inference from Comparison Data: Rescaled MM for Bradley–Terry MAP Estimation Contracts the Log-Posterior Gap at a Rate Set by Algebraic ConnectivityResearch Paper

Paired-comparison data (which of two items a user clicked, which of two players won a game, which of two products a respondent preferred) are summarised by ranking scores, one real number per item. The Bradley–Terry model (Bradley and Terry, 1952) is the standard statistical model for such scores, and its parameters are estimated by maximum likelihood or by…

14 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization+1·Captain: mikedeng1

Distributionally Robust Inverse Covariance Estimation: The Wasserstein Shrinkage Estimator: Without Sparsity Information the Robust Estimator Is a Closed-Form Shrinkage of the Sample EigenvaluesResearch Paper

The precision matrix X=Σ−1X=\Sigma^{-1}X=Σ−1 of a Gaussian random vector ξ∈Rp\xi\in\mathbb R^pξ∈Rp encodes its conditional independence structure: Xij=0X_{ij}=0Xij​=0 exactly when ξi\xi_iξi​ and ξj\xi_jξj​ are independent given the other coordinates. Estimating it is a basic step in Gaussian graphical models, portfolio selection and linear discriminant analysis. The textbook estimator, the…

14 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
🏆Completed
Machine LearningOperations Research·Captain: mikedeng1

Subset Selection with Shrinkage: Sparse Linear Modeling When the SNR Is Low IV: ℓ1-Regularized Best Subset Selection Satisfies Slow-Rate and Fast-Rate Oracle InequalitiesResearch Paper

Best subset selection fits a linear predictor using at most kkk of ppp available columns. Its explicit limit on the number of selected variables makes the model easy to interpret, but the search can still fit noise: among many subsets of the same size, one can align unusually well with a noisy response. Mazumder, Radchenko and Dedieu study this effect in Subset…

9 thms3 active usersReviewed
🏆Completed
Machine LearningOperations Research·Captain: mikedeng1

Subset Selection with Shrinkage: Sparse Linear Modeling When the SNR Is Low III: ℓ2-Regularized Best Subset Selection Satisfies Slow-Rate and Fast-Rate Oracle InequalitiesResearch Paper

Best subset selection fits a linear model using at most kkk of ppp available predictors, choosing the kkk that minimize the residual sum of squares. Mixed-integer optimization made it computable at moderate scale (Bertsimas, King & Mazumder, 2016), which reopened the statistical question of when it should be used. Empirical comparisons (Hastie, Tibshirani &…

8 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Subset Selection with Shrinkage: Sparse Linear Modeling When the SNR Is Low I: The Discrete First-Order Algorithm Is a Descent Method Whose Successive Steps Shrink at Rate O(1/M)Research Paper

Best subset selection fits a linear model y≈Xβy\approx X\betay≈Xβ using at most kkk of the ppp available features: it minimizes the residual sum of squares subject to the sparsity constraint ∥β∥0≤k\|\beta\|_0\le k∥β∥0​≤k, where ∥β∥0\|\beta\|_0∥β∥0​ counts the nonzero coordinates of β\betaβ. Mazumder, Radchenko and Dedieu (arXiv:1708.03288v4; Operations Research, 2023) show that best subsets…

7 thms3 active usersReviewed
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
🏆Completed
CombinatoricsGraph TheoryLinear Optimization+2·Captain: mikedeng1

Linear Programming and Community Detection 5: The LP Relaxation Recovers the Planted Bisection w.h.p. in the Very Dense SBM When p − q > 1/2Research Paper

The stochastic block model (SBM), introduced by Holland, Laskey and Leinhardt (1983), is the standard random model for networks with community structure, and the basic benchmark for community-detection algorithms (Abbe 2018). In its two-community form the nodes are split into two equal halves, edges inside a half appear with probability ppp, and edges across…

12 thms3 active usersReviewed
🏆Completed
EconomicsProbability·Captain: mikedeng1

Quantifying the Impact of Impact Investing I: Mean and Variance of an Impact-Ranked Portfolio's Excess Return under IID Bivariate-Normal Impact Factors and AlphasResearch Paper

Impact investing selects securities by a non-financial characteristic: an ESG rating, a carbon-intensity metric, a "sin stock" flag. A recurring question in finance is whether such a selection costs or earns the investor anything, and by how much. Lo and Zhang (SSRN 3944367; Management Science, doi:10.1287/mnsc.2022.01168) give a closed-form answer in a…

8 thms3 active usersReviewed
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
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Design and Analysis of Switchback Experiments 1: With m-Period Carryover and T = nm, n ≥ 4, the Unique Minimax-Optimal Regular Design Flips Fair Coins at 1, 2m+1, 3m+1, …, (n−2)m+1Research Paper

Online platforms such as ride-hailing, delivery and advertising marketplaces routinely test new pricing or matching policies on a single market. Randomizing over users is often impossible there: every rider and driver in a city shares one supply pool, so treating some users and not others contaminates the control group. The standard alternative is a switchba…

14 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
PreviousPage 9 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