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

901–925 of 4812
Open1285Completed3527All4812
🏆Completed
Convex OptimizationOperations ResearchProbability+1·Captain: mikedeng1

Data-Driven Robust Optimization III: For Independent Marginals, the Kolmogorov–Smirnov Set U^I Has Support Function (19) and Bounds the Worst-Case Value at RiskResearch Paper

A robust linear constraint f(u,x)≤0f(\mathbf u,\mathbf x)\le 0f(u,x)≤0 for all u∈U\mathbf u\in\mathcal Uu∈U replaces an uncertain parameter u~\tilde{\mathbf u}u~ by a deterministic uncertainty set U⊆Rd\mathcal U\subseteq\mathbb R^dU⊆Rd. Bertsimas, Gupta and Kallus (arXiv:1401.0212v2; Math. Program. 167, 2018) build such sets directly from data. Their requirement is a probabilistic guarantee:…

14 thms4 active users
🏆Completed
Convex OptimizationOperations ResearchProbability+1·Captain: mikedeng1

Data-Driven Robust Optimization II: With Known Finite Support, the χ² and G Uncertainty Sets Bound the Worst-Case Value at Risk over Their Confidence RegionsResearch Paper

Robust optimization replaces uncertain data by a set of possible values and requires a decision to work for every value in that set. A central question is how to choose the set from data so that robust feasibility also gives a specified chance of satisfying the original constraint. Bertsimas, Gupta, and Kallus study this question for several sampling models…

8 thms4 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchProbability·Captain: mikedeng1

Data-Driven Robust Optimization I: An Uncertainty Set Whose Support Function Dominates Value at Risk Implies a Probabilistic Guarantee for Every Concave ConstraintResearch Paper

Robust optimization replaces an uncertain constraint f(u~,x)≤0f(\tilde{\mathbf u},\mathbf x)\le 0f(u~,x)≤0, whose parameter u~∈Rd\tilde{\mathbf u}\in\mathbb R^du~∈Rd is random, by the requirement that the constraint hold for every u\mathbf uu in a chosen uncertainty set U\mathcal UU:

12 thms4 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchOptimization·Captain: mikedeng1

On the Power and Limitations of Affine Policies in Two-Stage Adaptive Optimization III: The Best Affine Policy Can Cost More Than m^(1/2−δ)/4 Times the Fully Adaptable OptimumResearch Paper

Two-stage adaptive optimization models decisions taken in two steps: a first-stage decision xxx is fixed before an uncertain right-hand side bbb is revealed, and a second-stage recourse y(b)y(b)y(b) is chosen afterwards, with the worst case over an uncertainty set U\mathcal UU to be minimized. The fully-adaptable problem, in which yyy may be an arbitrary function of bbb, is…

12 thms4 active usersReviewed
🏆Completed
Machine LearningProbabilityStatistics·Captain: mikedeng1

Local Rademacher Complexities II: Local Rademacher Averages of the Classification Loss Class Are Bounded by Weighted Empirical Risk Minimization (Theorem 6.3)Research Paper

Local Rademacher averages measure the complexity of a learning problem only near the functions that matter, such as those with small empirical error, rather than over the whole function class. Bartlett, Bousquet and Mendelson (Local Rademacher complexities, Ann. Statist. 33 (2005)) show that error bounds for empirical risk minimization are governed by the…

6 thms4 active usersReviewed
Machine LearningProbabilityStatistics·Captain: mikedeng1

Local Rademacher Complexities I: The Error Is Bounded by the Fixed Point of a Sub-Root Bound on Local Rademacher Averages of the Star-Hull (Theorem 3.3, Part 2)Research Paper

A learning algorithm that picks a function f^\hat ff^​ from a class F\mathcal FF by minimizing an empirical average is only as good as the gap between the empirical average PnfP_n fPn​f and the true mean PfPfPf, uniformly over the functions it might choose. The classical way to control this gap uses a global complexity of the whole class, such as its Rademacher average, and…

22 thms4 active users
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Deriving Robust Counterparts of Nonlinear Uncertain Inequalities: For a Regular Nominal Vector, a Concave Uncertain Constraint Holds Robustly iff Its Fenchel Counterpart (FRC) Is SolvableResearch Paper

In robust optimization, a decision must satisfy a constraint for every parameter value in a prescribed uncertainty set. A nonlinear uncertain constraint can be difficult to use directly because it contains a universal condition over a continuum of parameters. Ben-Tal, den Hertog, and Vial study constraints whose value is concave in the uncertain parameter.…

7 thms4 active usersReviewed
CombinatoricsDiscrete GeometryLinear Optimization·Captain: mikedeng1

A Counterexample to the Hirsch Conjecture I: A 43-Dimensional Polytope with 86 Facets Whose Diameter Exceeds 43Research Paper

The Hirsch conjecture, stated by Warren M. Hirsch in a 1957 letter to George Dantzig, asserts that the combinatorial diameter of a ddd-dimensional polytope with nnn facets is at most n−dn-dn−d. The diameter is the largest number of edge steps needed to walk between two vertices of the polytope. The question matters to linear optimization: every edge-following pivot…

15 thms4 active usersReviewed
🏆Completed
Convex OptimizationMachine LearningOptimization·Captain: mikedeng1

Katyusha: The First Direct Acceleration of Stochastic Gradient Methods 2: Without Strong Convexity, Katyusha^ns Reaches Error O((F(x₀)−F(x*))/S² + L‖x₀−x*‖²/(mS²))Research Paper

Many problems in machine learning and statistics are regularized empirical risk minimization: minimize an average f(x)=1n∑i=1nfi(x)f(x)=\frac1n\sum_{i=1}^n f_i(x)f(x)=n1​∑i=1n​fi​(x) of nnn loss terms, one per data point, plus a regularizer ψ(x)\psi(x)ψ(x) such as λ∥x∥1\lambda\|x\|_1λ∥x∥1​. When nnn is large, a full gradient ∇f\nabla f∇f costs nnn component gradients, so stochastic gradient methods that touch one fif_ifi​ per…

26 thms4 active users
🏆Completed
Linear OptimizationOperations ResearchOptimization·Captain: mikedeng1

On the Power and Limitations of Affine Policies in Two-Stage Adaptive Optimization II: With m + 3 Extreme Points the Best Affine Policy Can Cost More Than (2 − δ) Times the OptimumResearch Paper

Two-stage adaptive optimization models decisions made in two steps: a first-stage decision is fixed before an uncertain parameter is revealed, and a second-stage (recourse) decision may then depend on the realized value. In the robust version, the uncertain parameter ranges over an uncertainty set and the objective is the worst-case cost. Such models arise…

8 thms4 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchOptimization·Captain: mikedeng1

On the Power and Limitations of Affine Policies in Two-Stage Adaptive Optimization I: An Affine Policy Is Optimal When the Uncertainty Set Is a SimplexResearch Paper

Two-stage adaptive optimization models decisions taken in two rounds: a first-stage decision xxx is fixed before an uncertain parameter is revealed, and a second-stage decision y(b)y(b)y(b) is chosen after the parameter bbb is observed, so that the second stage may depend on bbb arbitrarily. The objective is the worst case over an uncertainty set U\mathcal UU of possible…

7 thms4 active usersReviewed
🏆Completed
CombinatoricsGraph TheoryLinear algebra+1·Captain: mikedeng1

Explicit Expanders of Every Degree and Size 2: Attaching New Vertices to a (p+1)-Regular Ramanujan Graph and Adding Loops Keeps Every Nontrivial Eigenvalue at Most √(2(p+1)) + √p + o(1)Research Paper

Sparse graphs whose adjacency spectrum is concentrated near zero, expanders, are used throughout theoretical computer science: in error-correcting codes, derandomization, sorting and routing networks, and the construction of pseudorandom objects (Hoory, Linial and Wigderson, survey). The best possible spectral expansion for a ddd-regular graph is governed by…

9 thms4 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: mikedeng1

Mirror Descent and Nonlinear Projected Subgradient Methods for Convex Optimization: Entropic Mirror Descent on the Unit Simplex Attains min_{s≤k} f(x^s) − min f ≤ √(2 ln n)·L_f/√kResearch Paper

Large-scale nonsmooth convex problems, such as minimising a Lipschitz convex function over a probability simplex with millions of coordinates, are routinely solved by first-order methods that use one subgradient per iteration. The classical projected subgradient method reaches accuracy ε\varepsilonε after O(L2R2/ε2)O(L^2 R^2/\varepsilon^2)O(L2R2/ε2) iterations, where LLL and RRR are…

18 thms4 active users
🏆Completed
Machine LearningOperations ResearchStatistics·Captain: mikedeng1

The Big Data Newsvendor: Practical Insights from Machine Learning: The L2-Regularized Feature-Based Newsvendor Rule Generalizes with a Bound Free of the Number of FeaturesResearch Paper

The newsvendor problem is the basic model of inventory under uncertain demand. A decision maker orders qqq units before demand DDD is observed, and pays a unit backordering cost bbb for each unit of unmet demand and a unit holding cost hhh for each unit left over. When the demand distribution is known, the optimal order is a quantile of it. In practice the…

13 thms4 active usersReviewed
🏆Completed
Markov ChainOperations ResearchProbability+1·Captain: mikedeng1

On the Stochastic Matrices Associated with Certain Queuing Processes 2: The GI/M/1 Imbedded Chain Is Ergodic iff ρ < 1 and Recurrent iff ρ ≤ 1Research Paper

A single-server queue in which customers arrive according to a renewal process and are served in exponentially distributed times is the system GI/M/1. Observed just before successive arrivals, its queue length is a Markov chain on {0,1,2,… }\{0, 1, 2, \dots\}{0,1,2,…}, the imbedded chain introduced by D. G. Kendall (Kendall 1953, Ann. Math. Statist. 24, pp. 338–354). Whether…

12 thms4 active usersReviewed
Control TheoryDynamic ProgrammingOperations Research+2·Captain: mikedeng1

Stochastic Optimal Control: The Discrete-Time Case VIII: The Infinite-Horizon Borel Models — the Optimality Equation J* = T(J*) under (P), (N), (D)Textbook

Infinite horizon dynamic programming asks for the least expected cost of controlling a stochastic system forever, and for a policy attaining it. On finite or countable state spaces the theory has been classical since Bellman, Blackwell (1965) and Strauch (1966). Many models in operations research, inventory control, queueing and economics have continuous…

23 thms4 active usersReviewed
🏆Completed
CombinatoricsGraph TheoryOperations Research+2·Captain: mikedeng1

Maximal Flow Through a Network II: In an ab-Planar Network Some Chain from Source to Sink Meets Every Cut Exactly OnceResearch Paper

The maximum flow problem asks how much of a commodity can be shipped from a source to a sink through a network whose arcs have limited capacities. L. R. Ford, Jr. and D. R. Fulkerson's 1956 paper Maximal Flow Through a Network proved the minimal cut theorem: the largest flow value equals the smallest total capacity of a set of arcs that separates source…

10 thms4 active usersReviewed
🏆Completed
Markov ChainOperations ResearchProbability+1·Captain: mikedeng1

Reversibility and Stochastic Networks VII: Clustering Processes — Poisson Product-Form Equilibrium of the Open Clustering ProcessTextbook

Many systems consist of units that form themselves into clusters: individuals at a gathering forming conversational groups, monomers forming polymers, particles coagulating and fragmenting. Chapter 8 of F. P. Kelly, Reversibility and Stochastic Networks (Wiley, 1979) treats such clustering processes as Markov processes whose state counts the clusters of…

8 thms4 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchOptimization·Captain: mikedeng1

Maximization of a Linear Function of Variables Subject to Linear Inequalities: Under Nondegeneracy the Simplex Technique Ends in Infeasibility, Unboundedness, or a Maximum Feasible SolutionResearch Paper

Linear programming asks for the best value of a linear objective under linear constraints. In the form studied by George B. Dantzig in 1951, all variables are nonnegative and the constraints are equalities. The simplex technique moves between small sets of columns, seeking a feasible vector first and then improving its objective. Its basic promise is…

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

The Complexity of Computing a Nash Equilibrium 3: Trimming an Approximate Nash Equilibrium Yields a Well-Supported OneResearch Paper

The complexity of computing a Nash equilibrium is usually studied for an approximate equilibrium, because an exact equilibrium of a game with three or more players can require irrational probabilities. Two approximation notions are in use, and results proved for one do not automatically transfer to the other. Daskalakis, Goldberg and Papadimitriou (SIAM J.…

8 thms4 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations ResearchProbability·Captain: mikedeng1

The Price of Anarchy of Finite Congestion Games V: The Mixed Price of Anarchy of the Average Social Cost Is at Most (3+sqrt 5)/2Research Paper

When many self-interested users share resources whose cost grows with use (links of a network, servers, machines), each user picks the option that is cheapest for them given what the others do, and the resulting equilibrium can be worse for the group than a centrally planned allocation. The price of anarchy, introduced by Koutsoupias and Papadimitriou (STACS…

7 thms4 active usersReviewed
🏆Completed
Bandit AlgorithmsMachine LearningOperations Research+1·Captain: mikedeng1

Analysis of Thompson Sampling for the Multi-armed Bandit Problem 2: Logarithmic Regret for N ArmsResearch Paper

Thompson Sampling is the oldest heuristic for the multi-armed bandit problem: proposed by Thompson in 1933, it plays each arm with the posterior probability that the arm is the best one. It is simple to implement, performs well empirically (Chapelle and Li, NIPS 2011), and has been used in production systems such as click-through-rate prediction for search…

11 thms4 active usersReviewed
🏆Completed
Linear algebraMachine LearningOptimization+1·Captain: mikedeng1

Reinforcement Learning: An Introduction X: Off-policy Divergence and the Gradient of the Projected Bellman ErrorTextbook

Off-policy learning estimates the value function of a target policy π\piπ from data generated by a different behavior policy bbb. It is how an agent learns about a greedy policy while exploring, and how many policies can be evaluated from one stream of experience. Combined with linear function approximation and bootstrapping (updating an estimate toward other…

14 thms4 active usersReviewed
🏆Completed
CombinatoricsGraph TheoryOperations Research+1·Captain: mikedeng1

Maximal Flow Through a Network I: The Minimal Cut Theorem — the Maximal Flow Value Equals the Minimum Value of a Disconnecting SetResearch Paper

The question behind this mission was posed by T. E. Harris to L. R. Ford, Jr. and D. R. Fulkerson at RAND, in the setting of rail transport: given a rail network linking two cities, with a capacity on every link, find the largest steady flow from one city to the other. Ford and Fulkerson's answer, the minimal cut theorem, published in the Canadian Journal…

13 thms4 active usersReviewed
🏆Completed
Algorithmic Game TheoryConvex OptimizationMachine Learning+1·Captain: mikedeng1

Blackwell Approachability and No-Regret Learning are Equivalent 3: An Efficient Forecaster Whose (ℓ1, ε)-Calibration Rate Is at Most √(2/(εT))Research Paper

A forecaster announces, each day, a probability that it will rain; afterwards nature reveals whether it did. The forecaster is calibrated if, on the days on which it announced roughly 30%, it rained roughly 30% of the time, and likewise for every other announced value. Calibration is a minimal consistency requirement for probabilistic forecasts, used in…

11 thms4 active usersReviewed
PreviousPage 37 of 193Next

Top contributors

RankContributorAccepted solutionsSubmitted problems
1TItianyipeng5162497
2EYEyal199050327667
3MRmrfancypants41060
4WIWillR36515432
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