Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Collections

The OR Formalization Drive

A coordinated effort to formalize the mathematics of operations research in Lean 4.

Scope: missions in linear and integer programming, convex and nonlinear optimization, combinatorial optimization, dynamic programming, scheduling, stochastic models such as queueing and inventory, simulation, revenue management, and game theory and mechanism design.

4812 missions

Missions

251–275 of 4812
Open1285Completed3527All4812
🏆Completed
Machine LearningNumerical AnalysisOptimal Transport+1·Captain: mikedeng1

Computational Optimal Transport VIII: Sinkhorn's Scalings Contract by λ(K)² per Iteration in Hilbert's Projective MetricTextbook

Sinkhorn's algorithm is the standard method for computing entropically regularized optimal transport between two histograms. It is used throughout machine learning, statistics, imaging and graphics because each iteration is two matrix–vector products followed by entrywise divisions, which parallelize on GPUs and differentiate easily. The same iteration,…

19 thms5 active users
🏆Completed
Machine LearningOperations ResearchOptimal Transport+1·Captain: mikedeng1

Regularization via Mass Transportation II: Wasserstein-Robust Linear Regression Equals Empirical Loss plus a Dual-Norm PenaltyResearch Paper

Ordinary least squares and its robust relatives (least absolute deviations, Huber, ϵ\epsilonϵ-insensitive and quantile regression) fit a linear predictor by minimizing an average loss over the training sample. That average estimates the out-of-sample error poorly when the sample is small, and the usual fix is to add a regularization penalty such as a norm of…

15 thms5 active usersReviewed
🏆Completed
Complexity TheoryGraph TheoryLinear algebra+1·Captain: mikedeng1

Most Tensor Problems Are NP-Hard 2: Graph 3-Colorability Reduces to Tensor Bilinear Feasibility over the Reals and over the Complex NumbersResearch Paper

A matrix A∈Cn×nA \in \mathbb C^{n\times n}A∈Cn×n is singular exactly when the pair of linear systems x⊤A=0\mathbf x^\top A = 0x⊤A=0, Ay=0A\mathbf y = 0Ay=0 has a solution with both x\mathbf xx and y\mathbf yy nonzero, and this is decided in polynomial time by Gaussian elimination. The natural analogue for a 3-tensor replaces the two linear systems by three families of bilinear equations,…

25 thms5 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Proximal Algorithms I: A Point Minimizes f + g Exactly When It Is a Fixed Point of the Forward-Backward Operator x ↦ prox_λg(x − λ∇f(x))Research Paper

Many convex optimization problems combine a smooth loss with a term that is easy to handle through minimization but awkward to differentiate. A constraint can be represented by an indicator function that is zero on the feasible set and +∞+\infty+∞ outside it. A norm penalty can be finite yet nonsmooth. The proximal gradient method handles such objectives by…

11 thms5 active usersReviewed
🏆Completed
Complexity TheoryGraph TheoryLinear algebra+1·Captain: mikedeng1

Most Tensor Problems Are NP-Hard 1: Graph 3-Colorability Reduces to Deciding Whether 0 Is an Eigenvalue of a Rational 3-Tensor over the RealsResearch Paper

Eigenvalues of matrices are computable in polynomial time to any accuracy, and numerical linear algebra rests on that fact. Higher-order tensors appear in statistics (moment and cumulant tensors), signal processing, quantum information and polynomial optimization, and several notions of tensor eigenvalue were proposed for them, independently by Lim and by…

23 thms5 active usersReviewed
🏆Completed
CombinatoricsMachine Learning·Captain: mikedeng1

Online Learning and Online Convex Optimization 4: Finite Littlestone Dimension Gives Agnostic Online Regret 2√(Ldim·ln(eT/Ldim)·T)Research Paper

Online classification is the simplest model of learning from a stream: on every round a learner sees an instance, guesses its binary label, and is then told the truth. Cover's impossibility argument shows that against an adversary no deterministic learner can compete with even two fixed hypotheses, so two relaxations are studied. In the realizable case the…

8 thms5 active usersReviewed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Self-Scaled Barriers and Interior-Point Methods for Convex Programming II: A Long Step of the Conic Karmarkar Method Lowers the Potential by at Least (‖p‖²/|p|²)(1 − ln 2) ≥ 1 − ln 2Research Paper

Karmarkar's projective method (1984) was the first interior-point algorithm for linear programming with a polynomial bound that was also fast in practice. Its analysis rests on a potential function that combines the logarithm of the objective gap with a logarithmic barrier: if every iteration lowers the potential by a fixed constant, then the gap shrinks…

15 thms5 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Hedging Inventory Risk Through Market Instruments I: Hedging Raises the Risk-Averse Newsvendor's Optimal Order QuantityResearch Paper

A retailer who orders a seasonal product before demand is known faces the newsvendor trade-off. Ordering too much leaves unsold stock, and ordering too little forgoes sales. A risk-neutral newsvendor orders a critical fractile of demand. A risk-averse one orders less, since inventory is a risky investment, and this reduction has been shown under constant…

11 thms5 active usersReviewed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Self-Scaled Barriers and Interior-Point Methods for Convex Programming I: A Joint-Scaling Primal-Dual Long Step Lowers the Potential (ν + ρ) ln⟨s, x⟩ + F(x) + F∗(s) by at Least √3/2 − ln(1 + √3/2)Research Paper

Interior-point methods solve linear, second-order cone and semidefinite programs in polynomial time, and they are the engine of most conic optimization software. The general theory of Nesterov and Nemirovskii (1994) covers any convex cone with a self-concordant barrier, but its methods are essentially primal and short-step: their analysis controls the…

22 thms5 active usersReviewed
🏆Completed
CombinatoricsGroup TheoryNumber Theory·Captain: mikedeng1

New Proofs of Plünnecke-type Estimates for Product Sets in Groups 1: In an Abelian Group, |A + B| ≤ α|A| Gives One Nonempty X ⊆ A with |X + hB| ≤ αʰ|X| for Every hResearch Paper

A basic question of additive combinatorics asks how a set grows under repeated addition. If a finite set AAA in an abelian group satisfies ∣A+B∣≤α∣A∣|A + B| \le \alpha |A|∣A+B∣≤α∣A∣ for some finite set BBB, how large can the iterated sumsets hB=B+⋯+BhB = B + \cdots + BhB=B+⋯+B be? Plünnecke's inequality gives the answer used throughout the subject: some nonempty part of AAA grows by at most a…

4 thms5 active usersReviewed
🏆Completed
Dynamic ProgrammingMarkov ChainOperations Research+1·Captain: mikedeng1

Optimality of (s, S) Policies in Inventory Models with Markovian Demand I: With Markov-Modulated Demand and Fixed Ordering Costs, a State-Dependent (s, S) Policy Is Optimal over a Finite HorizonResearch Paper

Single-item inventory theory asks how much stock to order each period when the order carries a fixed cost KKK on top of a per-unit cost and demand is random. With independent, identically distributed demand, Scarf (1960) showed that the optimal finite-horizon policy has the (s,S)(s,S)(s,S) form: when the stock falls below the reorder point sss, order up to the level SSS;…

20 thms5 active usersReviewed
🏆Completed
Dynamic ProgrammingLinear OptimizationOperations Research+1·Captain: mikedeng1

Analysis of Stochastic Dual Dynamic Programming Method: SDDP with Independently Subsampled Scenarios Finds an Optimal Policy of the SAA Problem in Finitely Many Iterations Almost SurelyResearch Paper

Multistage stochastic linear programs model sequential decisions under uncertainty: capacity and reservoir planning, hydro-thermal scheduling, inventory and asset–liability management. When the data process is stagewise independent, the problem decomposes by dynamic programming into one linear program per stage, coupled through expected cost-to-go functions.…

14 thms5 active usersReviewed
🏆Completed
Machine LearningProbabilityTheoretical Computer Science·Captain: mikedeng1

What Can We Learn Privately? II: Parity Functions Are Privately PAC Learnable from O(d log(1/β)/(εα)) ExamplesResearch Paper

Differential privacy (Dwork, McSherry, Nissim and Smith, 2006) requires a randomized algorithm's output distribution to change little when one individual's record is changed. PAC learning asks an algorithm to output, from i.i.d. labeled examples, a hypothesis whose error is small with high probability. Kasiviswanathan, Lee, Nissim, Raskhodnikova and Smith (a…

14 thms5 active usersReviewed
🏆Completed
Machine LearningProbabilityTheoretical Computer Science·Captain: mikedeng1

What Can We Learn Privately? I: The Exponential Mechanism Privately Agnostically Learns Any Finite Concept Class from O((ln|C| + ln(1/β))·max{1/(εα), 1/α²}) ExamplesResearch Paper

Many learning tasks run on data about people: medical records, purchase histories, survey answers. A learner whose output reveals too much about any one training example is unusable on such data, however accurate it is. Differential privacy (Dwork, McSherry, Nissim and Smith, 2006) makes "reveals too much" precise: changing one individual's record may…

10 thms5 active usersReviewed
🏆Completed
Algorithmic Game TheoryLinear algebraOperations Research·Captain: mikedeng1

Flows and Decompositions of Games: Harmonic and Potential Games 5: Every ϵ-Equilibrium of the Closest Potential Game Is an (ϵ + max_m 2α/√h_m)-Equilibrium of the Game, and ConverselyResearch Paper

Potential games (Monderer and Shapley, 1996) are the finite games whose unilateral payoff differences are all differences of a single function, the potential. They always have a pure Nash equilibrium, and many natural learning dynamics (best response, fictitious play, logit response) converge in them. Most games met in applications are not exactly potential…

19 thms5 active usersReviewed
🏆Completed
Algorithmic Game TheoryLinear algebraOperations Research·Captain: mikedeng1

Flows and Decompositions of Games: Harmonic and Potential Games 2: Harmonic Games Generically Have No Pure Nash EquilibriumResearch Paper

Finite games in strategic form are the basic model of interaction between self-interested agents in economics, engineering and computer science. Among them, potential games (Monderer and Shapley, 1996) are the class with the most tractable equilibrium behaviour: every finite potential game has a pure Nash equilibrium, and simple learning dynamics such as…

9 thms5 active usersReviewed
🏆Completed
Convex OptimizationLinear algebraNumerical Analysis·Captain: mikedeng1

Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization 1: IRLS-M Converges to the Nuclear-Norm Minimizer Under the Strong Rank Null Space PropertyResearch Paper

Many data problems ask for a matrix of low rank from far fewer linear measurements than it has entries: matrix completion (recommender systems, where a few ratings of a large user–item table are observed), system identification, and quantum state tomography. Minimizing the rank under the measurement constraints is NP-hard in general. The standard convex…

19 thms5 active usersReviewed
🏆Completed
Formal VerificationTheoretical Computer Science·Captain: mikedeng1

Compositional Shape Analysis by Means of Bi-Abduction 2: With Precise Preconditions and Best Anti-Frames, the Canonical Precondition of an Action Sequence Is Its FootprintResearch Paper

Automatic program analyses for heap-manipulating code have to infer, for each procedure, a precondition describing the memory the procedure needs. Calcagno, Distefano, O'Hearn and Yang (J. ACM 2011) do this with bi-abduction: at a call site the analysis asks for an anti-frame MMM, the missing memory, and a frame, the memory left untouched, so that the current…

9 thms5 active usersReviewed
🏆Completed
Convex OptimizationLinear algebraOptimization·Captain: mikedeng1

Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization 1: If δ_5r < 1/10, Nuclear Norm Minimization Recovers Every Matrix of Rank at Most r ExactlyResearch Paper

Many problems in system identification, collaborative filtering, low-dimensional embedding and model reduction ask for the simplest matrix consistent with a set of linear observations, where "simplest" means "of least rank". Given a linear map A:Rm×n→Rp\mathcal A:\mathbb R^{m\times n}\to\mathbb R^pA:Rm×n→Rp and a vector b∈Rpb\in\mathbb R^pb∈Rp, the affine rank minimization problem is

11 thms5 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations ResearchOptimization·Captain: mikedeng1

How Bad is Selfish Routing? 1: A Nash Flow Costs No More Than Any Flow Feasible for Twice the Rates, for Continuous Nondecreasing LatenciesResearch Paper

In a road or communication network, traffic is routed by many independent users, each choosing a route that is fastest for itself given the congestion caused by everyone else. The resulting Nash flow (also called a Wardrop equilibrium, after Wardrop 1952) need not minimize the total delay experienced by all users: Braess's paradox shows that adding a road…

15 thms5 active usersReviewed
🏆Completed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Designing a Call Center with Impatient Customers I: The Steady-State Fraction of Abandoning Callers Tends to max(0, 1 − 1/ρ) as the Number of Agents GrowsResearch Paper

Telephone call centers are among the largest employers of service labour, and their staffing decisions are made with queueing models. The classical model is the Erlang-C queue M/M/NM/M/NM/M/N: Poisson arrivals, NNN agents, exponential service, infinitely patient callers. Real callers hang up. Garnett, Mandelbaum and Reiman (M&SOM 2002) argued that a model ignoring…

14 thms5 active usersReviewed
🏆Completed
Machine LearningOptimizationStatistics·Captain: mikedeng1

Additive Logistic Regression: A Statistical View of Boosting 2: Population Discrete AdaBoost Is a Newton-Like Step with Exact Line Search c = ½ log((1−err)/err)Research Paper

AdaBoost (Freund and Schapire, 1997) combines many weak classifiers fm(x)∈{−1,1}f_m(x) \in \{-1, 1\}fm​(x)∈{−1,1} into a weighted vote sign⁡(∑mcmfm(x))\operatorname{sign}\big(\sum_m c_m f_m(x)\big)sign(∑m​cm​fm​(x)). At each round it fits a classifier to a reweighted training sample, sets cm=log⁡((1−errm)/errm)c_m = \log((1 - \mathrm{err}_m)/\mathrm{err}_m)cm​=log((1−errm​)/errm​) from the weighted error errm\mathrm{err}_merrm​, and multiplies the weights of the…

10 thms5 active usersReviewed
🏆Completed
Functional AnalysisMarkov ChainProbability·Captain: mikedeng1

Logarithmic Sobolev Inequalities for Finite Markov Chains 5: The Log-Sobolev Constant of K(x, y) = π(y) Is (1 − 2π_)/log(1/π_ − 1)Research Paper

The log-Sobolev constant α\alphaα of a finite Markov chain controls how fast the chain forgets its starting point in relative entropy and in ℓ2\ell^2ℓ2, and it gives sharper mixing-time bounds than the spectral gap λ\lambdaλ when the stationary distribution has very small atoms. Diaconis and Saloff-Coste (Ann. Appl. Probab. 6 (1996)) made this constant a standard…

16 thms5 active usersReviewed
🏆Completed
Functional AnalysisMarkov ChainProbability·Captain: mikedeng1

Logarithmic Sobolev Inequalities for Finite Markov Chains 4: The Metropolis Chain for the Binomial Distribution Is Within e^{1−c} of Stationarity after (n/2)(log n + 2c) StepsResearch Paper

The Metropolis algorithm turns a simple random walk into a Markov chain with a prescribed stationary distribution, by accepting or rejecting the walk's proposals. It is the basic tool of Markov chain Monte Carlo, and the practical question it raises is quantitative: how many steps are needed before the chain's distribution is close to the target? For most…

23 thms5 active usersReviewed
🏆Completed
CombinatoricsInformation TheoryTheoretical Computer Science·Captain: mikedeng1

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data 4: A Secure Sketch Correcting t Errors Has Residual Min-Entropy at Most L(M, t, m)Research Paper

Biometric readings, typed passphrases and physical measurements are secrets that are never reproduced exactly: a second reading w′w'w′ of the same fingerprint differs from the enrolled reading www in a few positions. Dodis, Ostrovsky, Reyzin and Smith (arXiv:cs/0602007, SIAM J. Comput. 38(1), 2008) introduced the secure sketch, public helper data that lets anyone…

7 thms5 active usersReviewed
PreviousPage 11 of 193Next

Top contributors

RankContributorAccepted solutionsSubmitted problems
1TItianyipeng5162497
2EYEyal199050327667
3MRmrfancypants41060
4WIWillR36415412
5NINickrobbins953286155
6VEvebis25800
7FIfizzyinc321725
8SHshivm17490
9SCShuze Chen9455324
10KMkmehltretter82895261

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