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

Consistent Nonparametric Regression II: Nearest-Neighbor Weights with Vanishing Coefficients Are Consistent for Every Distribution of X (Theorem 2)Research Paper

Nonparametric regression estimates the regression function x↦E(Y∣X=x)x \mapsto E(Y \mid X = x)x↦E(Y∣X=x) from i.i.d. observations (X1,Y1),…,(Xn,Yn)(X_1, Y_1), \dots, (X_n, Y_n)(X1​,Y1​),…,(Xn​,Yn​) without assuming a parametric form. The simplest such estimates are local averages: to predict at a point XXX, average the responses YiY_iYi​ of the sample points closest to XXX. Nearest neighbor rules of this kind go back to…

8 thms2 active usersReviewed
Machine LearningProbability·Captain: mikedeng1

Consistent Nonparametric Regression I: Conditions (1)–(5) on a Sequence of Weights Are Sufficient for Consistency, and Consistency Forces Them Back (Theorem 1)Research Paper

Nonparametric regression estimates the conditional mean E(Y∣X=x)E(Y\mid X=x)E(Y∣X=x) of a real response YYY given a predictor X∈RdX\in\mathbb R^dX∈Rd without assuming that it belongs to a finite-dimensional family. Most practical estimators of this kind are local averages: kernel estimators (Nadaraya 1964, Watson 1964), nearest-neighbor rules (Cover and Hart 1967), and their many…

9 thms2 active usersReviewed
🏆Completed
Probability·Captain: mikedeng1

On Tail Probabilities for Martingales 2: For |X_n| ≤ 1 and E{X_n | ℱ_{n−1}} = 0, the Conditional Variance W_a Used to Cross a Satisfies E exp[−f(λ)W_a] ≥ exp[−λ(a+1)]Research Paper

Exponential tail bounds for sums of bounded martingale differences (Bernstein, Bennett, Hoeffding, Freedman) are the workhorses of probability, statistics and learning theory. They bound how far a martingale can travel in a given amount of conditional variance. The converse question is just as basic: how much conditional variance does a martingale need…

10 thms2 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

Residual Life Time at Great Age 6: For 0 < ξ < α, Residual Life Attraction to Γ_α Is Equivalent to a Finite ξ-th Moment and E((X/t)^ξ | X > t) → (1 − ξ/α)^{−1}Research Paper

Actuaries, reliability engineers and demographers ask how much longer an item or a person will live given that it has already survived to a great age ttt. For a lifetime XXX with distribution function FFF, this is the law of the residual life time X−tX - tX−t given X>tX > tX>t, and the question is what this law looks like as t→∞t \to \inftyt→∞. Balkema and de Haan (Ann. Probab. 2…

8 thms2 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

Residual Life Time at Great Age 2: The Domain of Residual Life Time Attraction of the Exponential Law Is D(Λ) ∩ D₀Research Paper

A lifetime observed only after it has survived to a high age is described by its residual life: the additional time until failure, conditional on survival so far. Reliability analysis asks whether these conditional distributions settle into a stable shape after scaling and shifting. Extreme-value theory asks a related question about the largest observation…

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

Residual Life Time at Great Age 3: F Is in the Domain of Residual Life Time Attraction of Π_{p,c} iff It Is Tail Equivalent to a Discrete Law with Gap Ratios → e^{pc} and Tail Ratios → e^{−p}Research Paper

A component that has survived to age ttt has a residual life time X−tX - tX−t, and in reliability, actuarial work and the analysis of excesses over high thresholds the question is what its conditional law looks like when ttt is large. Balkema and de Haan (Ann. Probab. 2 (1974), 792–804) answered this in full generality: after an affine normalization, the only…

9 thms2 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

Simulation Output Analysis Using Standardized Time Series 2: Every STS Interval Has liminf n^{1/2} E Lₙ ≥ 2σΦ⁻¹(1 − δ/2)Research Paper

A simulation run often estimates a steady-state mean without producing independent observations. A confidence interval must account for dependence in the output, and the relevant variance constant may be unknown. Standardized time series (STS) methods use the shape of an integrated output path to cancel that constant rather than estimating it separately.…

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

Some Theoretical Aspects of Road Traffic Research I: Time-Mean Speed Equals Space-Mean Speed plus σₛ²/v̄ₛ, so v̄ₜ ≥ v̄ₛ with Equality Only Without Speed VariationResearch Paper

A speed recorded as a vehicle passes a fixed point and a speed recorded among vehicles occupying a road segment answer different questions. Fast vehicles pass a detector more often per unit time; slow vehicles remain visible along the segment for longer. Traffic studies therefore need to identify which distribution a measurement samples before comparing…

5 thms2 active usersReviewed
🏆Completed
AnalysisProbability·Captain: mikedeng1

Estimating Variance From High, Low and Closing Prices II: Under the Overshoot Law (9), E(Z ∨ Z′) = aσ√h and E(Z ∨ Z′)² = bσ²hResearch Paper

Volatility estimates from daily high, low and closing prices have been used since Parkinson (1980) and Garman and Klass (1980): the range of a day's log-price carries much more information about the volatility σ\sigmaσ than the close alone. Rogers and Satchell (1991) propose an estimator, S1(S1−X1)+I1(I1−X1)S_1(S_1-X_1)+I_1(I_1-X_1)S1​(S1​−X1​)+I1​(I1​−X1​), that is unbiased for σ2\sigma^2σ2 whatever the…

8 thms2 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

Some Aspects of the Sequential Design of Experiments III: Optional Stopping — P(Sₙ > αn^½ for Some n₁ ≤ n ≤ n₂) < (1 − Φ(α))/(1 − Φ(α(λ^½ − 1)/(λ − 1)^½))Research Paper

Section 4 of Herbert Robbins's 1952 address Some aspects of the sequential design of experiments (Bull. Amer. Math. Soc. 58, 527–535, doi:10.1090/S0002-9904-1952-09620-8) isolates a problem that every user of significance tests meets: if the sample size is not fixed in advance, an experimenter can keep sampling until the test rejects. Robbins shows that a…

4 thms2 active usersReviewed
Probability·Captain: mikedeng1

Dependent Central Limit Theorems and Invariance Principles: A Martingale Difference Array with L²-Bounded Maximum Tending to 0 and Sum of Squares → 1 in Probability Is Asymptotically N(0, 1)Research Paper

The classical central limit theorem concerns sums of independent summands. Most sums that arise in statistics and applied probability are not independent: estimating equations of time-series models, stochastic approximation iterates, additive functionals of Markov chains, sequential test statistics. The standard route to asymptotic normality for such sums…

10 thms2 active usersReviewed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Asymptotic Theory for Solutions in Statistical Estimation and Stochastic Programming: Generalized M-Estimates Converge in Distribution to the Inverse Contingent Derivative at a GaussianResearch Paper

Maximum likelihood estimates, least-squares fits and sample-average approximations of stochastic programs solve 0=fˉν(x)0 = \bar f^\nu(x)0=fˉ​ν(x), where fˉν\bar f^\nufˉ​ν averages a random integrand over ν\nuν observations. Their classical asymptotic theory rests on the implicit function theorem and needs a smooth, unconstrained problem.

10 thms2 active usersReviewed
🏆Completed
Probability·Captain: mikedeng1

The Tight Constant in the Dvoretzky–Kiefer–Wolfowitz Inequality II: Binomial Tail Bound P(S − np > nε) ≤ exp(−nε²/(2(p + ε/3)(q − ε/3))) for 0 < ε ≤ qResearch Paper

Exponential bounds for the tails of the binomial distribution are among the most frequently used tools in probability, statistics and the analysis of algorithms: they control the number of successes in independent trials, the deviation of an empirical frequency from its mean, and, through counting arguments, the empirical distribution function itself. The…

5 thms2 active usersReviewed
OptimizationProbabilityStochastic Systems·Captain: mikedeng1

Stochastic Estimation of the Maximum of a Regression Function: The Kiefer–Wolfowitz Iterates z_n Converge in Probability to the Maximizer θResearch Paper

Many problems in statistics, engineering and operations research ask for the input level xxx at which an unknown response function is largest, when the response can only be measured with noise: the dose that maximizes a yield, the setting that maximizes throughput in a simulation, the parameter that maximizes an expected reward. Robbins and Monro (1951) had…

9 thms2 active usersReviewed
🏆Completed
Convex OptimizationMachine Learning·Captain: mikedeng1

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers VI: The Group-Lasso Block Update Is Zero iff ‖Aᵢᵀv‖₂ ≤ λ/ρ, Otherwise Ridge with ν‖xᵢ‖₂ = λ/ρTextbook

Fitting a statistical model usually means solving a convex problem of the form

10 thms2 active usersReviewed
🏆Completed
Convex OptimizationLinear algebra·Captain: mikedeng1

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers IV: The Covariance-Selection X-Update Is Q·diag((λᵢ + √(λᵢ² + 4ρ))/(2ρ))·QᵀTextbook

Many estimation problems in statistics, machine learning and signal processing minimize a smooth loss plus a nonsmooth ℓ1-type regularizer: the lasso, basis pursuit, least absolute deviations, Huber fitting, the group lasso, and ℓ1-penalized maximum likelihood for Gaussian graphical models. Chapter 6 of Boyd, Parikh, Chu, Peleato and Eckstein, Distributed…

13 thms2 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

Residual Life Time at Great Age 4: α₁ ≤ tF′(t)/(1 − F(t)) ≤ α₂ for t ≥ t₀ Sandwiches P{(X − t)/t ≤ x | X > t} Between Γ_{α₁}(x) and Γ_{α₂}(x)Research Paper

The residual life time of a lifetime XXX at age ttt is the remaining life X−tX - tX−t given survival past ttt. Its distribution at great age is a basic object in reliability, insurance and the statistics of extremes: excess-of-loss reinsurance prices the part of a claim above a retention level, and peaks-over-threshold methods fit a model to the observations exceeding…

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

Optimal Estimation of Executive Compensation by Linear Programming I: Least Absolute Deviations under Ranking Constraints Equal a Linear ProgramResearch Paper

A firm may know salary bounds and the ranking of positions without having a reliable sample of individual salaries suitable for least-squares estimation. Charnes, Cooper and Ferguson used that kind of partial information to estimate a salary formula from ratings assigned to job factors. Their 1955 paper gives a model in which weights respect the job…

5 thms2 active usersReviewed
Machine LearningOperations ResearchOptimization+1·Captain: mikedeng1

From Predictive to Prescriptive Analytics 1: The k-Nearest-Neighbor Predictive Prescription Is Asymptotically Optimal and ConsistentResearch Paper

Operations research has long studied the stochastic problem min⁡z∈ZE[c(z;Y)]\min_{z\in\mathcal Z}\mathbb E[c(z;Y)]minz∈Z​E[c(z;Y)]: choose a decision zzz before an uncertain quantity YYY (demand, prices, returns) is revealed. In practice the decision maker also observes covariates XXX before deciding (web-search volume before stocking a product, weather before routing a shipment) and should…

7 thms2 active usersReviewed
🏆Completed
Bandit AlgorithmsMachine LearningProbability·Captain: mikedeng1

Kullback–Leibler Upper Confidence Bounds for Optimal Sequential Allocation II: Empirical KL-UCB Draws a Suboptimal Arm log(T)/K_inf(ν_a, μ*) + O((log T)^{4/5} log log T) TimesResearch Paper

In a stochastic multi-armed bandit a player repeatedly chooses one of KKK arms and receives a random reward drawn from that arm's unknown distribution; the aim is to pull suboptimal arms as rarely as possible. Lai and Robbins (1985) and, for general models, Burnetas and Katehakis (1996) showed that any reasonable strategy must pull a suboptimal arm aaa at least …

13 thms2 active usersReviewed
🏆Completed
Machine LearningOptimal TransportProbability·Captain: mikedeng1

Robust Wasserstein Profile Inference and Applications to Machine Learning 3: The Scaled Robust Wasserstein Profile n^(ρ/2)·R_n(θ*) Is Asymptotically Stochastically Bounded by R̄(ρ)Research Paper

Many statistical parameters are defined implicitly, as the root θ∗\theta_*θ∗​ of an estimating equation E[h(W,θ∗)]=0\mathbb E[h(W, \theta_*)] = \mathbf 0E[h(W,θ∗​)]=0: a mean, a quantile, a regression coefficient, the minimizer of an expected loss. Owen's empirical likelihood builds confidence regions for such parameters by asking how far the empirical distribution of the data must be…

13 thms2 active usersReviewed
🏆Completed
Machine LearningOptimal TransportOptimization·Captain: mikedeng1

Robust Wasserstein Profile Inference and Applications to Machine Learning 2: ℓp-Regularized Logistic Regression and the Hinge-Loss SVM Are Wasserstein DRO under a Label-Preserving Transport CostResearch Paper

Regularized logistic regression and the support vector machine (SVM) are two of the most widely used linear classifiers. Both are usually introduced as empirical risk minimization plus a norm penalty ∥β∥p\|\beta\|_p∥β∥p​ whose size is tuned by cross-validation, with the penalty justified heuristically as a guard against overfitting. Distributionally robust…

13 thms2 active usersReviewed
🏆Completed
Bandit AlgorithmsOperations ResearchProbability·Captain: mikedeng1

Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms II: The Parametric Learn-then-Price Policy Has Regret at Most C(log n)^{1/2}/n^{1/3}Research Paper

A seller with a fixed inventory must choose prices before knowing how customers respond to them. A price that earns a high margin can sell too slowly; a price that sells quickly can exhaust stock before the selling season ends. Learning demand uses time and inventory, so the seller must account for the cost of its own experiments. This mission formalizes…

13 thms2 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

Assessing Solution Quality in Stochastic Programs: The Single-Replication Confidence Interval on the Optimality Gap Is Asymptotically ValidResearch Paper

Most stochastic programs of practical size, such as two-stage recourse models in energy, finance or supply-chain planning, cannot be solved exactly: the expectation in the objective is a high-dimensional integral. The standard remedy is sample average approximation (SAA): replace the expectation by an average over a Monte Carlo sample and solve the…

8 thms2 active usersReviewed
🏆Completed
Machine LearningOptimizationProbability·Captain: mikedeng1

Non-Strongly-Convex Smooth Stochastic Approximation with Convergence Rate O(1/n): Averaged Constant-Step-Size LMS Has Expected Excess Risk at Most (1/2n)[σ√d/(1−√(γR²)) + R‖θ₀−θ*‖/√(γR²)]²Research Paper

Least-squares regression fitted by stochastic gradient descent — the least-mean-square (LMS) algorithm — is the basic large-scale learning procedure: each observation is touched once, at a cost linear in the dimension. Classical analyses of stochastic approximation give the rate O(1/n)O(1/\sqrt n)O(1/n​) for non-strongly-convex objectives, and O(1/(μn))O(1/(\mu n))O(1/(μn)) when the…

15 thms2 active usersReviewed
PreviousPage 20 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