Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Probability

2,744 missions · 1,556 completed

Missions

Open1188Completed1556All2744
Machine LearningStatistics·Captain: mikedeng1

Optimal Aggregation of Classifiers in Statistical Learning: The Adaptive Classifier Attains the Optimal Fast Rate up to a Logarithmic Factor Simultaneously on All Classes (Theorem 3)Research Paper

Binary classification asks for a rule that predicts a label Y∈{0,1}Y\in\{0,1\}Y∈{0,1} from a feature vector X∈RdX\in\mathbb R^dX∈Rd, given nnn labelled examples. A classical way to measure how hard this is, due to Mammen and Tsybakov (1999), treats classification as the estimation of a set, the region where label 111 is more likely, and asks how fast the excess misclassification…

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

Mitigating Supply Risk: Dual Sourcing or Process Improvement? 2: With No Committed Cost, Expected Profit Is Concave in the Supplier's Reliability Index, with an Explicit First-Order ConditionResearch Paper

Supply disruptions — fires, quality failures, capacity shortfalls at a supplier — are a first-order risk in manufacturing supply chains. A buying firm has two broad responses. It can dual source, splitting orders between suppliers so that one supplier's shortfall is partly covered by the other, or it can invest in process improvement at a single supplier…

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

Mitigating Supply Risk: Dual Sourcing or Process Improvement? 1: Region-by-Region Optimal Dual-Sourcing Quantities under Random Capacity, Including the Quantity HedgeResearch Paper

Firms that buy from unreliable suppliers face two broad remedies: spread orders across several suppliers (dual sourcing), or invest in making a supplier more reliable (process improvement). Wang, Gilland and Tomlin, Mitigating Supply Risk: Dual Sourcing or Process Improvement? (M&SOM 12(3):489–510, 2010), compare the two in a single newsvendor model in…

8 thms2 active usersReviewed
CombinatoricsGraph Theory·Captain: mikedeng1

The Diameter of a Scale-Free Random Graph: For m ≥ 2, Almost Every G_mⁿ Is Connected with Diameter Between (1−ε) log n/log log n and (1+ε) log n/log log nResearch Paper

Barabási and Albert (Science 1999) proposed preferential attachment as a mechanism behind the heavy-tailed degree distributions observed in the web graph and other networks: vertices arrive one at a time and attach to existing vertices with probability proportional to their degree. Empirical work on such networks reported that typical distances are very…

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

Supply Chain Coordination Under Channel Rebates with Sales Effort Effects III: Returns Alone, Linear Rebates Alone or Target Rebates Alone Cannot Coordinate Effort and QuantityResearch Paper

Manufacturers of computer hardware, software and automobiles routinely pay channel rebates to their retailers: a payment for each unit the retailer sells to end customers, either for every unit (a linear rebate) or only for units beyond a target (a target rebate). In the same industries manufacturers also accept returns, crediting the retailer for unsold…

7 thms2 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion 4: With Random Right-Hand Side and Known Dual Extreme Points, a Distribution in 𝒫 Attains Ẑ(x) = Ẑ_DD(x)Research Paper

Two-stage stochastic linear programs model decisions taken before uncertainty is revealed (a first-stage plan xxx) followed by a corrective recourse action once it is. The classical model needs the full probability distribution of the uncertain data. In practice usually only estimates of a few moments are available, and the computed plan can be sensitive to…

10 thms2 active usersReviewed
Linear algebraOptimizationRandom Matrix Theory·Captain: mikedeng1

Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization 2: Nearly Isometric Random Maps Have δ_r ≤ δ with Probability 1 − e^(−c₁p) Once p ≥ c₀r(m+n)log(mn)Research Paper

Many problems in system identification, collaborative filtering, low-dimensional embedding and model reduction ask for the matrix of least rank in an affine space. Affine rank minimization — given a linear map A:Rm×n→Rp\mathcal A:\mathbb R^{m\times n}\to\mathbb R^pA:Rm×n→Rp and b∈Rpb\in\mathbb R^pb∈Rp, find a matrix of minimum rank with A(X)=b\mathcal A(X)=bA(X)=b — is NP-hard in general.…

9 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

Centralized and Competitive Inventory Models with Demand Substitution 1: The Competitive Substitution Game Has a Nash Equilibrium, Unique and Globally Stable When Substitution Rates Sum Below OneResearch Paper

A retailer that carries several substitutable products, such as brands of the same item or sizes of the same garment, must choose stock levels before demand is known. When a product runs out, some of its customers buy another product instead. Inventory models with this demand substitution go back to McGillivray and Silver (1978, INFOR 16(1)) and Parlar and…

8 thms2 active usersReviewed
Bandit AlgorithmsOperations Research·Captain: mikedeng1

Linearly Parameterized Bandits 1: On the Unit Sphere with a Gaussian Prior, Every Policy Has Bayes Risk at Least 0.006·r√TResearch Paper

In a linearly parameterized bandit, a decision maker repeatedly chooses an arm uuu from a set Ur⊂Rr\mathcal U_r \subset \mathbb R^rUr​⊂Rr and observes a noisy reward whose mean is the inner product u′Zu'Zu′Z with an unknown parameter vector ZZZ. The model covers pricing, assortment and recommendation problems in which arms are described by feature vectors and the number of arms…

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

Supply Chain Coordination Under Channel Rebates with Sales Effort Effects IV: A Larger Return Credit Strictly Increases the Retailer's Sales EffortResearch Paper

A manufacturer that sells through a retailer can accept returns: it pays a return credit bbb for every unit the retailer has not sold at the end of the season. Returns policies are common in publishing, software and computer hardware, and since Pasternack (Marketing Science, 1985) they have been studied as a way to make the retailer order more. Retailers also…

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

Supply Chain Coordination Under Channel Rebates with Sales Effort Effects II: A Target Rebate and Returns Contract Coordinates Effort and Quantity Under Uniform DemandResearch Paper

Manufacturers of computer hardware, software and automobiles routinely pay their retailers channel rebates: a payment per unit the retailer sells to end customers. A target rebate pays only for units sold beyond a target level. These industries also commonly offer returns: a credit for each unsold unit. Both instruments are used to change the retailer's…

13 thms2 active usersReviewed
Control TheoryOperations ResearchStochastic Systems·Captain: mikedeng1

On Minimizing the Ruin Probability by Investment and Reinsurance I: An Increasing Solution f of the HJB Equation Is Bounded, δ(u) = f(u)/f(∞), and the Feedback Strategy A*, b* Is OptimalResearch Paper

An insurance company that collects premiums and pays random claims is ruined when its surplus becomes negative. The probability of ultimate ruin is the classical solvency criterion of risk theory, going back to Lundberg and Cramér. Real insurers have two levers on this probability: they can invest part of the surplus in a risky asset, and they can cede part…

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

Supply Chain Coordination Under Channel Rebates with Sales Effort Effects I: A Target Rebate Coordinates the Newsvendor Channel and Splits Its Profit in Any ProportionResearch Paper

Manufacturers in computer hardware, software and automobiles routinely pay channel rebates to their retailers: a payment per unit the retailer sells to end consumers, as opposed to per unit the retailer buys. A target rebate pays only for units sold beyond a target level, a linear rebate pays for every unit sold. T. A. Taylor, Supply Chain Coordination…

8 thms2 active usersReviewed
Operations ResearchStochastic Systems·Captain: mikedeng1

Is Network Traffic Approximated by Stable Lévy Motion or Fractional Brownian Motion? 1: Infinite Source Poisson Input Under Slow Growth Converges (fidi) to Totally Skewed α-Stable Lévy MotionResearch Paper

Measurements of Ethernet and Internet traffic in the 1990s showed that the amount of data offered to a link is bursty on every time scale and that the lengths of transmissions (file sizes, connection durations) have heavy, regularly varying tails. Two families of approximations for the cumulative input were proposed: fractional Brownian motion, which has…

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

Quantitative Stability in Stochastic Programming: The Method of Probability Metrics 2: Linear Two-Stage Programs Are Lipschitz Stable in the Fortet–Mourier Metric ζ₂Research Paper

A linear two-stage stochastic program with fixed recourse chooses a here-and-now decision xxx before a random vector ξ\xiξ is observed, and pays a recourse cost afterwards. It is the basic model of stochastic programming, used in capacity planning, energy and supply-chain models. In practice the distribution μ\muμ of ξ\xiξ is never known exactly: it is estimated…

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

Is Network Traffic Approximated by Stable Lévy Motion or Fractional Brownian Motion? 4: Superposed ON/OFF Input Under Fast Growth Converges in C[0,∞) to Fractional Brownian MotionResearch Paper

Measurements of Ethernet and Internet traffic in the 1990s showed that cumulative traffic is self-similar and long-range dependent: correlations of the input rate decay so slowly that they are not summable, and fluctuations at large time scales do not average out the way Poisson-type models predict (Leland et al. 1994). A widely accepted explanation is that…

9 thms2 active usersReviewed
🏆Completed
CombinatoricsTheoretical Computer Science·Captain: mikedeng1

On Lattices, Learning with Errors, Random Linear Codes, and Cryptography 4: A Random Subset Sum of l Uniform Elements of a Finite Abelian Group Is on Average Within √(|G|/2^l) of UniformResearch Paper

Regev's On Lattices, Learning with Errors, Random Linear Codes, and Cryptography (J. ACM 56(6), 2009, Article 34; doi:10.1145/1568318.1568324) introduced the Learning with Errors (LWE) problem and built a public-key cryptosystem on it. The source for this mission is that published J. ACM article. The paper's main theorem, a quantum reduction from worst-case…

6 thms2 active usersReviewed
🏆Completed
Experimental DesignOperations ResearchStatistics+1·Captain: mikedeng1

Stochastic Kriging for Simulation Metamodeling II: The MSE of the Optimal Stochastic Kriging Predictor Exceeds the Kriging MSE by a Positive Definite FormResearch Paper

A simulation metamodel is a cheap surrogate for an expensive stochastic simulation: after running the simulation at a few design settings, one predicts the mean response at settings never simulated. Kriging, the interpolation method of geostatistics and of the design and analysis of computer experiments (DACE; Sacks, Welch, Mitchell and Wynn 1989; Santner,…

4 thms2 active usersReviewed
🏆Completed
Experimental DesignOperations ResearchStatistics+1·Captain: mikedeng1

Stochastic Kriging for Simulation Metamodeling I: The Plug-In Stochastic Kriging Predictor Is UnbiasedResearch Paper

Stochastic simulation models of queues, supply chains and manufacturing systems are often too slow to run at every input setting of interest. A metamodel fitted to a moderate number of simulation runs then stands in for the simulation, for instance inside an optimization or a sensitivity analysis. Kriging, developed in geostatistics and in the design and…

6 thms2 active usersReviewed
Algorithmic Game TheoryMachine Learning·Captain: mikedeng1

A Simple Adaptive Procedure Leading to Correlated Equilibrium 1: Under Regret-Matching (2.2), the Empirical Distributions of Play Converge Almost Surely to the Set of Correlated EquilibriaResearch Paper

A correlated equilibrium (Aumann 1974) is a probability distribution over strategy profiles of a game such that no player gains by deviating from a recommended strategy, given the recommendation. It is the solution concept of choice when players can condition on common signals, and its set is a convex polytope defined by linear inequalities, which makes it…

17 thms2 active usersReviewed
🏆Completed
Control TheoryStochastic Systems·Captain: mikedeng1

Backward-Forward Stochastic Differential Equations 4: A Nonsingular Linear Backward-Forward System with Lipschitz Constant 1 Has No Solution on the Horizon T = π/2Research Paper

A backward stochastic equation determines its current value from a conditional expectation of future values. A forward equation determines its current value from past values. Coupling the two makes existence depend on more than integrability of the data: the feedback between the past and future can prevent a solution. Antonelli's 1993 paper studies this…

9 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchOptimization·Captain: mikedeng1

On the Structure of Lost-Sales Inventory Models 3: If Demand Increases in the Convex Order, the Optimal Lost-Sales Cost f̄_t(v; φ) Is Nondecreasing in φResearch Paper

In the periodic-review inventory model with lost sales, demand that cannot be met from stock is lost rather than backordered. With a positive order lead time LLL the state of the system is a vector of length LLL: on-hand stock plus the L−1L-1L−1 orders still in the pipeline. This model is standard in retail, where a customer facing an empty shelf buys elsewhere. Its…

8 thms2 active usersReviewed
🏆Completed
AnalysisOperations ResearchStochastic Systems·Captain: mikedeng1

The G/GI/N Queue in the Halfin–Whitt Regime 2: The Diffusion-Limit Equation Is Equivalent to a Renewal-Function Equation, Which Has a Unique Càdlàg SolutionResearch Paper

A G/GI/N queue has NNN identical servers, a general arrival process, a first-come-first-served waiting room and i.i.d. service times with a general distribution FFF of mean 111. In the Halfin–Whitt regime the number of servers grows while the traffic intensity ρN\rho^NρN approaches 111 at rate N(1−ρN)→β∈R\sqrt N(1-\rho^N)\to\beta\in\mathbb RN​(1−ρN)→β∈R; this is the standard asymptotic model…

11 thms2 active usersReviewed
Machine LearningStatistics·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
🏆Completed
Combinatorics·Captain: mikedeng1

Coalescents With Multiple Collisions 2: Coagulating an (α, θ) Partition by (β, θ/α) Equals Fragmenting an (αβ, θ) Partition by (α, −αβ)Research Paper

Random partitions of the positive integers N={1,2,… }\mathbb N=\{1,2,\dots\}N={1,2,…} are the common language of population genetics, Bayesian nonparametrics and the theory of coalescent processes. When a sample of genes, customers or particles is grouped into classes, the grouping is a partition, and in most models its law is exchangeable: it does not depend on the labels.…

8 thms2 active usersReviewed
PreviousPage 86 of 110Next

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