Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Probability

2,743 missions · 1,549 completed

Missions

Open1194Completed1549All2743
Operations ResearchOptimizationStatistics·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
OptimizationStatisticsStochastic 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
Operations ResearchOptimizationStochastic Systems·Captain: mikedeng1

Mean-Variance Hedging in Continuous Time: The Feedback Futures Strategy Φ(G*) Minimizes the Expected Squared Deviation of Terminal Wealth from Any Target LevelResearch Paper

A firm that will receive or deliver a quantity of a commodity, currency or security at a future date carries price risk until that date. When the asset itself cannot be traded in the meantime, the standard instrument for reducing that risk is a futures contract on a correlated asset: the firm takes a position in futures and adjusts it over time, and the…

12 thms2 active usersReviewed
AnalysisHarmonic Analysis·Captain: mikedeng1

Distribution Function Inequalities for Martingales 1: The Square Function and the Martingale Have Equivalent L^p Norms for 1 < p < ∞Research Paper

A martingale f=(f1,f2,… )f = (f_1, f_2, \dots)f=(f1​,f2​,…) is a sum fn=d1+⋯+dnf_n = d_1 + \cdots + d_nfn​=d1​+⋯+dn​ of increments that are uncorrelated with the past. For sums of independent random variables, sizes are compared through the sum of squares of the summands; for martingales the corresponding object is the square function

11 thms2 active usersReviewed
Control TheoryStochastic Systems·Captain: mikedeng1

Backward-Forward Stochastic Differential Equations 1: A Backward Equation Driven by a Bounded-Variation Integrator Has a Unique Adapted Solution in L¹(μ) Under Integrability AloneResearch Paper

Backward stochastic differential equations (BSDEs) prescribe a process by its terminal value rather than its initial value: the unknown VVV must be adapted to the information flow, yet must reach a given random variable YYY at the horizon TTT. They arise in mathematical finance (pricing and hedging, where YYY is a contingent claim), in stochastic control (adjoint…

10 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
Control TheoryOperations ResearchStochastic Systems·Captain: mikedeng1

Dynamic Scheduling of a System with Two Parallel Servers in Heavy Traffic with Resource Pooling: The Threshold Policy Is Asymptotically OptimalResearch Paper

Many service systems route several classes of work to servers with overlapping skills: call centers with cross-trained agents, manufacturing cells with flexible machines, computing clusters with heterogeneous processors. Choosing which server works on which class at each moment is a dynamic scheduling problem. Exact optimal policies are out of reach except…

14 thms2 active usersReviewed
Mathematical PhysicsOptimizationPartial Differential Equations·Captain: mikedeng1

Optimization of Mean-field Spin Glasses I: Every Minimizer of the Extended Parisi Functional Has Full SupportResearch Paper

The Ising mixed ppp-spin model assigns to each configuration σ∈{−1,+1}N\sigma \in \{-1,+1\}^Nσ∈{−1,+1}N the energy of a random polynomial whose covariance is E{HN(σ)HN(σ′)}=Nξ(⟨σ,σ′⟩/N)\mathbb E\{H_N(\sigma)H_N(\sigma')\} = N\xi(\langle\sigma,\sigma'\rangle/N)E{HN​(σ)HN​(σ′)}=Nξ(⟨σ,σ′⟩/N). Its ground-state energy max⁡σHN(σ)/N\max_\sigma H_N(\sigma)/Nmaxσ​HN​(σ)/N converges to the value of a variational problem, the zero-temperature Parisi formula (Auffinger–C…

22 thms2 active usersReviewed
Operations ResearchOptimization·Captain: mikedeng1

On linear optimization over Wasserstein balls: Existence of Discrete Optimal Solutions on at Most N+1 AtomsResearch Paper

Wasserstein distributionally robust optimization replaces an unknown data-generating distribution by the set of all distributions within a prescribed optimal-transport distance of a reference distribution, typically the empirical distribution of NNN training samples. The inner problem of every such model is a linear optimization over this set: maximize the…

18 thms2 active usersReviewed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Minimization Methods for Non-Differentiable Functions VI: Almost-Sure Convergence of the Stochastic Subgradient MethodTextbook

Many optimization problems in operations research are posed on an expectation: a two-stage or multistage stochastic program minimizes f(x)=E F(x,ξ)f(x) = E\,F(x,\xi)f(x)=EF(x,ξ), where F(⋅,ξ)F(\cdot,\xi)F(⋅,ξ) is convex but nonsmooth and the expectation cannot be computed exactly. What can be computed is a stochastic subgradient, a random vector whose mean is a subgradient of fff. The stochastic…

17 thms2 active usersReviewed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Numerical Techniques for Stochastic Optimization VI: Adaptive Stepsizes and Cesàro Convergence of Stochastic Quasigradient MethodsTextbook

Stochastic quasigradient (SQG) methods minimize an expectation F(x)=Eωf(x,ω)F(x)=E_\omega f(x,\omega)F(x)=Eω​f(x,ω) over a constraint set X⊆RnX\subseteq\mathbb R^nX⊆Rn when neither FFF nor its gradient can be computed, only random vectors whose conditional mean is (close to) a subgradient. They are the workhorse of stochastic programming and, under the name stochastic gradient descent, of…

11 thms2 active usersReviewed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Introduction to the Scenario Approach II: Violation Guarantees after Discarding k ConstraintsTextbook

Decisions under uncertainty are often required to satisfy a constraint θ∈Θδ\theta \in \Theta_\deltaθ∈Θδ​ that depends on a random parameter δ\deltaδ, and requiring it for every possible δ\deltaδ is usually too conservative or infeasible. The scenario approach replaces the unknown distribution of δ\deltaδ by NNN independent samples (scenarios) and enforces only the sampled…

13 thms2 active usersReviewed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Introduction to the Scenario Approach IV: The FAST Algorithm Keeps the Beta Bound and Adds a Factor (1−ε)^{N₂}Textbook

The scenario approach turns an optimization problem under uncertainty into a finite, data-driven program: sample NNN instances of the uncertain parameter, optimize against all of them, and certify how often the resulting design fails on a new instance. Its main guarantee (Theorem 3.7 of Campi and Garatti's Introduction to the Scenario Approach) bounds the…

6 thms2 active usersReviewed
Operations ResearchStatistics·Captain: mikedeng1

Adaptive Data-Driven Inventory Control with Censored Demand Based on Kaplan-Meier Estimator: Almost-Sure Convergence of KM-Myopic Orders to the Newsvendor Optimal SetResearch Paper

A retailer who restocks a perishable product every period faces the newsvendor problem: order too much and each leftover unit costs h>0h>0h>0, order too little and each unmet unit of demand costs b>0b>0b>0. If the demand distribution were known, the optimal order would be a quantile of it. In practice the distribution is unknown and has to be learned from sales data,…

11 thms2 active usersReviewed
AnalysisOperations ResearchStochastic Systems·Captain: mikedeng1

Elements of Queueing Theory Ib: Ergodicity and Stochastic IntensityTextbook

Chapter 1 of Baccelli and Brémaud's Elements of Queueing Theory has two halves. The first builds Palm calculus from the Matthes definition of P⁰_N and reaches the Swiss army formula. This mission is the second: §§1.6, 1.8 and 1.9, which supply the two things the rest of the book runs on.

13 thms2 active usersReviewed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Introduction to the Scenario Approach III: The Risks of the Empirical Costs Follow an Ordered Dirichlet DistributionTextbook

A scenario program replaces an uncertain optimization problem by its worst case over finitely many sampled instances. In its simplest form it reads

10 thms2 active usersReviewed
Numerical AnalysisStochastic Systems·Captain: mikedeng1

Euler Approximations with Varying Coefficients III: Uniform Lq-Convergence with Order 1/2Research Paper

Stochastic differential equations whose coefficients grow faster than linearly (for instance stochastic volatility models such as the 3/2-model) cannot be simulated with the classical explicit Euler–Maruyama scheme: Hutzenthaler, Jentzen and Kloeden showed that its moments diverge when the drift or diffusion grows superlinearly (Proc. R. Soc. A, 2011).…

14 thms2 active usersReviewed
Operations ResearchStochastic Systems·Captain: mikedeng1

Diffusion approximations for open queueing networks with service interruptions 2: jump-diffusion heavy-traffic limit for long up and down timesResearch Paper

Servers in manufacturing lines, communication links and service systems break down, are taken offline for maintenance, or go on vacation. When the interruptions are rare but long, they dominate congestion. A single down period can build a backlog that takes a long time to clear, and in a network that backlog propagates downstream. Standard heavy-traffic…

10 thms2 active usersReviewed
Dynamical SystemsReinforcement LearningStochastic Systems·Captain: mikedeng1

The O.D.E. Method for Convergence of Stochastic Approximation and Reinforcement Learning I: Stability and Almost-Sure Convergence under Tapering StepsizesResearch Paper

Stochastic approximation is the family of recursive algorithms that locate a zero of a function observed only through noisy evaluations. It goes back to Robbins and Monro (1951) and today underlies stochastic gradient descent, temporal-difference learning, Q-learning and actor–critic methods in reinforcement learning, and models of learning by boundedly…

17 thms2 active usersReviewed
Operations ResearchStochastic Systems·Captain: Shuze Chen

Processing Networks IV: Fluid Equations for Non-Idling, Priority and FCFS ControlTextbook

Mission III's Theorem 6.2 — "fluid limit stability implies SPN stability" — converts a probabilistic stability question into a real-analysis question, but it only supplies the generic fluid equations (6.1)-(6.6), which hold under any control policy and therefore say nothing policy-specific: (6.1)-(6.6) alone never force a fluid path to reach zero. To…

9 thms2 active usersReviewed
Functional AnalysisOperations Research·Captain: mikedeng1

Conditional and Dynamic Convex Risk Measures I: Robust Representation of Conditional Convex Risk MeasuresResearch Paper

A convex risk measure assigns to a bounded financial position XXX (a random net payoff) a number ρ(X)\rho(X)ρ(X), interpreted as the capital that must be added to XXX to make it acceptable. The axiomatic theory began with coherent risk measures (Artzner, Delbaen, Eber and Heath, 1999) and was extended to convex ones by Föllmer and Schied (2002) and Frittelli and…

14 thms2 active usersReviewed
Operations ResearchStochastic Systems·Captain: mikedeng1

Exit Problems for Spectrally Negative Lévy Processes and Applications to (Canadized) Russian Options I: Joint Laplace Transform of the Exit Time and Exit Position of the Reflected ProcessResearch Paper

A spectrally negative Lévy process is a process with stationary independent increments whose jumps are all downward: Brownian motion with drift plus a compound Poisson or infinite-activity stream of negative jumps. It is the standard model for a risk reserve that earns premiums continuously and pays claims in lumps, for a storage level or a queue workload…

16 thms2 active usersReviewed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

Subjectivity and Correlation in Randomized Strategies II: Subjective Events Let Both Zero-Sum Players Beat the ValueResearch Paper

In a two-person zero-sum game with objective randomization, whatever one player gains the other loses: the value vvv of the game is the most player 1 can guarantee and the least player 2 can hold him to, and no arrangement between the players can give player 1 more than vvv and player 2 more than −v-v−v at the same time. Aumann's 1974 paper (doi:10.1016/0304-4068(74…

9 thms2 active usersReviewed
Operations ResearchOptimizationStatistics+1·Captain: mikedeng1

Acceleration of Stochastic Approximation by Averaging: Almost-Sure Convergence and Asymptotic Normality of the Averaged IterateResearch Paper

Stochastic approximation finds a root x∗x^*x∗ of an unknown map R:RN→RNR:\mathbb R^N\to\mathbb R^NR:RN→RN from noisy evaluations yt=R(xt−1)+ξty_t=R(x_{t-1})+\xi_tyt​=R(xt−1​)+ξt​, by the Robbins–Monro recursion xt=xt−1−γtytx_t=x_{t-1}-\gamma_ty_txt​=xt−1​−γt​yt​. It underlies stochastic gradient descent, recursive estimation in statistics, adaptive control and simulation-based optimization. The classical theory (Sacks 1958) shows…

10 thms2 active usersReviewed
Dynamic ProgrammingOperations ResearchStochastic Systems·Captain: mikedeng1

On the optimality equation for average cost Markov decision processes and its validity for inventory control: The Average-Cost Optimality Equation for Setup-Cost Inventory ControlResearch Paper

Average-cost criteria are standard in inventory, queueing and maintenance models that run indefinitely. For a Markov decision process (MDP), the central object is the average-cost optimality equation (ACOE). It couples a constant www (the optimal long-run cost per period) with a relative value function u~\tilde uu~. A stationary policy that attains the minimum in…

12 thms2 active usersReviewed
PreviousPage 36 of 48Next

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