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.

3527 completed missions

Missions

176–200 of 3527
Open1285Completed3527All4812
🏆Completed
Linear OptimizationOperations ResearchOptimization+1·Captain: mikedeng1

On the Optimality of Affine Policies for Budgeted Uncertainty Sets 1: For Budget of Uncertainty Sets, Affine Policies Approximate the Two-Stage Adjustable Robust Problem within O(log n / log log n)Research Paper

Two-stage adjustable robust optimization models decisions taken in two steps around an uncertain demand: a first-stage decision is fixed now, the demand is revealed, and a second-stage (recourse) decision reacts to it. The objective is the worst-case total cost over a set of possible demands. The model covers set cover, capacity planning and network design…

20 thms5 active usersReviewed
🏆Completed
Control TheoryConvex OptimizationLinear algebra+1·Captain: mikedeng1

Quadratic Matrix Inequalities with Applications to Data-Based Control III: Petersen's Lemma Recovered from the Matrix S-LemmasResearch Paper

Robust control repeatedly meets linear matrix inequalities that must hold for every value of an unknown, norm-bounded matrix. A typical instance is

12 thms5 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: mikedeng1

Linear Convergence of First Order Methods for Non-Strongly Convex Optimization IV: Projected Gradient on a Quasi-Strongly Convex f Has dist²(x^k, X*) ≤ ((1 − μ)/(1 + μ))^k dist²(x^0, X*)Research Paper

The projected gradient method is the basic algorithm for minimising a smooth convex function over a closed convex set. For an objective with an LfL_fLf​-Lipschitz gradient it converges at the sublinear rate f(xk)−f∗≤Lf∥x0−x∗∥2/(2k)f(x^k)-f^*\le L_f\|x^0-x^*\|^2/(2k)f(xk)−f∗≤Lf​∥x0−x∗∥2/(2k), and the classical way to obtain a linear (geometric) rate is to assume strong convexity. Many objectives that arise in…

13 thms5 active users
🏆Completed
Operations ResearchProbabilityTheoretical Computer Science·Captain: mikedeng1

Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios III: No Online Algorithm Earns More Than F(𝒫) Times the Expected Offline OptimumResearch Paper

A firm sells several products, each in limited supply. Customers arrive one at a time, and each product can be offered at one of a few prices. This is the setting of airline fare classes, hotel rate plans and e-commerce discounting. Because future demand is unknown, the firm must decide online whether to sell a unit now at a low price or keep it for a…

13 thms5 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchProbability+1·Captain: mikedeng1

Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios I: Multi-price Balance Is minᵢ F̃ᵢ-Competitive, F̃ᵢ Bounded via F(𝒫ᵢ), G(𝒫ᵢ)/2 and kᵢResearch Paper

Online matching and its revenue-management variants model a firm that allocates limited inventory to customers who arrive one at a time, without knowing who comes next. Classical results in this area assume each item has a single price, or weight. For a single price and large inventories, the BALANCE algorithm of Kalyanasundaram and Pruhs (2000) and its…

11 thms5 active usersReviewed
🏆Completed
Algorithmic Game TheoryConvex OptimizationDynamical Systems·Captain: mikedeng1

Learning in Games via Reinforcement and Regularization 2: Under Regularized Reinforcement Learning, Every Strict Nash Equilibrium Is Asymptotically StableResearch Paper

In a repeated game, players who do not know the payoff structure can still learn by reinforcement: each player keeps a running score for every action, the cumulative payoff that action would have earned, and plays a mixed strategy that favours actions with high scores. Turning scores into mixed strategies through a regularized best response (maximize score…

12 thms5 active usersReviewed
🏆Completed
Algorithmic Game TheoryConvex OptimizationDynamical Systems·Captain: mikedeng1

Learning in Games via Reinforcement and Regularization 3: In 2-Player Zero-Sum Games with an Interior Equilibrium, Time-Averaged Play Converges to the Nash SetResearch Paper

Learning dynamics in games describe how players who repeatedly interact adjust their strategies from observed payoffs. A central question is whether such dynamics lead to Nash equilibrium. For the replicator dynamics, the canonical model of evolutionary game theory, the answer is negative in general: in Matching Pennies and in generic zero-sum games with a…

10 thms5 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchOptimal Transport+1·Captain: mikedeng1

Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls 2: With Q = 0 and Ξ = ℝ^K, the 1-Wasserstein Problem Is the Linear Program (32)Research Paper

Two-stage stochastic linear programs model decisions taken in two steps: a first-stage decision xxx is fixed before an uncertain parameter ξ\xiξ is observed, and a second-stage (recourse) decision yyy adapts to ξ\xiξ afterwards. They underlie capacity planning, inventory and network design. In practice the distribution of ξ\xiξ is known only through samples …

13 thms5 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: mikedeng1

On the Convergence of Decentralized Gradient Descent I: Under (Restricted) Strong Convexity Every Agent Satisfies ‖x₍ᵢ₎(k) − x*(k)‖ ≤ c₃ᵏ‖x*(0)‖ + c₄/√(1 − c₃²) + αD/(1 − β)Research Paper

In decentralized optimization a group of agents minimizes a sum of functions without a central coordinator: agent iii knows only its own function fif_ifi​ and can exchange vectors only with its neighbours in a communication network. The setting covers sensor networks, multi-robot coordination and data-parallel learning in which the data cannot be pooled. The basic…

14 thms5 active usersReviewed
🏆Completed
AlgebraNumber Theory·Captain: mikedeng1

On Ideal Lattices and Learning with Errors over Rings: Multiplication by t ∈ I with tI⁻¹ Coprime to J Induces an R-Module Isomorphism M/JM ≅ IM/IJMResearch Paper

Ring learning with errors (ring-LWE) is the algebraic variant of the learning-with-errors problem on which most practical lattice-based cryptography is built, including the key-encapsulation scheme ML-KEM standardized by NIST in 2024. Its hardness rests on the paper of Lyubashevsky, Peikert and Regev, On ideal lattices and learning with errors over rings (J.…

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

Distributed Algorithms for Aggregative Games on Graphs I: Synchronous Aggregate-Tracking Projected Gradients on Time-Varying Graphs Converge to the Unique EquilibriumResearch Paper

In an aggregative game, a player's cost depends on its own decision and on a summary of all players' decisions. An electricity producer, for example, may choose its output while the market price depends on total output. When players communicate only with neighbours, each player must estimate the aggregate before making an update. Koshal, Nedić, and Shanbhag…

14 thms5 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: mikedeng1

Relatively Smooth Convex Optimization by First-Order Methods, and Applications I: The Primal Gradient Scheme Attains f(x^k) − f(x) ≤ μD_h(x,x⁰)/((1+μ/(L−μ))^k − 1) ≤ (L−μ)D_h(x,x⁰)/kResearch Paper

Gradient methods for convex minimisation are usually analysed under two assumptions on the objective fff: its gradient is Lipschitz continuous (LLL-smoothness), and, for linear rates, fff is strongly convex. Many objectives met in practice satisfy neither on their whole domain. The D-optimal design objective −ln⁡det⁡(∑ixiaiai⊤)-\ln\det(\sum_i x_i a_i a_i^\top)−lndet(∑i​xi​ai​ai⊤​), the univariate…

10 thms5 active users
🏆Completed
Convex OptimizationMachine LearningOptimization+1·Captain: mikedeng1

Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Łojasiewicz Condition VI: Randomized Proximal Coordinate Descent Has Expected Rate (1 − μ/(dL))^kResearch Paper

Many problems in machine learning and statistics have the composite form min⁡xF(x)=f(x)+g(x)\min_x F(x)=f(x)+g(x)minx​F(x)=f(x)+g(x), where fff is a smooth loss and ggg is a non-smooth regularizer such as λ∥x∥1\lambda\|x\|_1λ∥x∥1​. When ggg is separable, g(x)=∑igi(xi)g(x)=\sum_i g_i(x_i)g(x)=∑i​gi​(xi​), the method of choice at scale is often randomized proximal coordinate descent: at each step one coordinate is drawn at random and a…

13 thms5 active users
🏆Completed
Convex OptimizationOptimizationProbability·Captain: mikedeng1

Accelerated Gradient Methods for Nonconvex Nonlinear and Stochastic Programming 3: The Randomized Stochastic AG Method Bounds E‖∇Ψ(x_R^md)‖² on Nonconvex Problems and Is Optimal on Convex OnesResearch Paper

In stochastic programming the objective Ψ(x)=Eξ[F(x,ξ)]\Psi(x)=\mathbb E_\xi[F(x,\xi)]Ψ(x)=Eξ​[F(x,ξ)] is an expectation that cannot be evaluated, and an algorithm sees only noisy gradients G(x,ξ)G(x,\xi)G(x,ξ) drawn from a stochastic first-order oracle. Stochastic gradient descent and its relatives are the standard methods. For convex Ψ\PsiΨ the optimal rate is known: Lan's accelerated stochastic…

21 thms5 active usersReviewed
🏆Completed
Bandit AlgorithmsMachine LearningProbability+1·Captain: mikedeng1

Provably Efficient Reinforcement Learning with Linear Function Approximation 1: LSVI-UCB Has Regret O(√(d³H³Tι²)) with Probability 1 − p on Linear MDPsResearch Paper

Reinforcement learning with large or continuous state spaces is done in practice with function approximation: the agent represents value functions in a low-dimensional parametric family instead of a table indexed by states. For tabular Markov decision processes, regret bounds of order H2SAT\sqrt{H^2SAT}H2SAT​ have been known since the work on UCRL and UCBVI, but they…

23 thms5 active usersReviewed
🏆Completed
CombinatoricsDiscrete GeometryLinear Optimization+1·Captain: mikedeng1

An Improved Kalai-Kleitman Bound for the Diameter of a Polyhedron: Every d-Polyhedron with n Facets, Bounded or Not, Has Graph Diameter at Most (n-d)^(log2 d)Research Paper

The simplex method for linear programming moves from vertex to vertex along the edges of a polyhedron. A lower bound on the number of pivots of any edge-following method is the graph diameter of the feasible polyhedron: the largest number of edges needed to connect two of its vertices. Whether this diameter is bounded by a polynomial in the dimension ddd and…

21 thms5 active usersReviewed
🏆Completed
Algorithmic Game TheoryMachine LearningOperations Research·Captain: mikedeng1

Fast Convergence of Regularized Learning in Games III: In a (λ,µ)-Smooth Cost Game, First-Order Regret Bounds Make the Average Cost at Most λ(1+µ)/(µ(1−µ))·OPT′ + A·n log d/TResearch Paper

When independent players repeatedly choose actions, a low-regret guarantee controls each player's performance against a fixed alternative. It does not directly control the social cost, the sum of all players' costs. For a class of games satisfying smoothness, however, the individual comparisons can imply a bound on the cost of the joint play. This…

8 thms5 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchProbability+1·Captain: mikedeng1

Greed Works – Online Algorithms For Unrelated Machine Stochastic Scheduling 1: Greedy Assignment With WSEPT Sequencing Is (4 + 2Δ)-Competitive in the Online-List ModelResearch Paper

Online scheduling asks for decisions before the full job set is known. In the online-list model, jobs are revealed one at a time and each must be assigned to a machine before the next job is revealed; the scheduler may choose the processing order after the list is complete. When processing durations are random and machines are unrelated, the same job may…

14 thms5 active usersReviewed
🏆Completed
Bandit AlgorithmsMachine LearningOperations Research+1·Captain: mikedeng1

Explore First, Exploit Next: The True Shape of Regret in Bandit Problems III: A Strategy Smarter Than Uniform Draws Every Arm at Least (T/K)(1 − √(2T K_inf)) TimesResearch Paper

A stochastic multi-armed bandit learner repeatedly selects one of finitely many arms and sees only the reward from the selected arm. The learner must gather information about uncertain rewards while trying to select high-mean arms. Expected regret summarizes the lost reward relative to always selecting an optimal arm, but regret alone does not explain how…

11 thms5 active usersReviewed
🏆Completed
Bandit AlgorithmsMachine LearningReinforcement Learning·Captain: mikedeng1

The Statistical Complexity of Interactive Decision Making V: The Multi-Armed Bandit Has Localized DEC at Least 2⁻⁶·A/γ, via Hard Families of ModelsResearch Paper

The Decision-Estimation Coefficient (DEC) of Foster, Kakade, Qian and Rakhlin (arXiv:2112.13487) is a single complexity measure that bounds the minimax regret of interactive decision making (bandits, reinforcement learning, and their structured variants) from above and from below. Its lower bound (Theorem 3.2 of the paper) states that every algorithm…

13 thms5 active usersReviewed
🏆Completed
CombinatoricsGraph Theory·Captain: mikedeng1

Finding Cliques in Social Networks: A New Distribution-Free Model 2: Every c-Closed Graph on n Vertices Has at Most 4^((c+4)(c−1)/2)·n^(2−2^(1−c)) Maximal CliquesResearch Paper

Social networks exhibit triadic closure: two people with many friends in common tend to be friends themselves. Fox, Roughgarden, Seshadhri, Wei and Wein (arXiv:1804.07431, SIAM J. Comput. 2020, doi:10.1137/18m1210459) turn this empirical regularity into a distribution-free graph class and ask which algorithmic problems that are hard on worst-case graphs…

11 thms5 active usersReviewed
🏆Completed
Information TheoryMachine LearningStatistics·Captain: mikedeng1

The Statistical Complexity of Interactive Decision Making I: Subadditivity of Squared Hellinger Distance for Sequential Laws, D²_H(P,Q) ≤ 10² log(n)·E_P[Σᵢ D²_H(P⁽ⁱ⁾, Q⁽ⁱ⁾)] for n ≥ 2Research Paper

Lower bounds for interactive decision making (bandits, reinforcement learning, and the general decision making with structured observations framework of Foster, Kakade, Qian and Rakhlin, arXiv:2112.13487) compare what a learner observes under two different environments. A learner's whole interaction history is generated one step at a time: each observation…

23 thms5 active users
🏆Completed
Algorithmic Game TheoryFunctional AnalysisOperations Research·Captain: mikedeng1

Stochastic Graphon Games: I. The Static Case 1: If the State Map b Is Bounded and √c_z‖W‖ < 1, the Graphon Game Has at Least One Nash EquilibriumResearch Paper

Games with many interacting players appear in economics, epidemiology and network engineering: firms competing in a market, individuals deciding whether to vaccinate, agents in a social network choosing an effort level. When every player interacts with every other player symmetrically, mean field game theory replaces the finite game by a limit with a…

11 thms5 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability+1·Captain: mikedeng1

Recovering Best Statistical Guarantees via the Empirical Divergence-Based Distributionally Robust Optimization 2: Empirical Burg-Ball DRO Bounds Converge Almost Surely to E[h(x;ξ)]Research Paper

Many stochastic optimization models contain an expected-value constraint

13 thms5 active usersReviewed
🏆Completed
Machine LearningOperations ResearchOptimization+1·Captain: mikedeng1

Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming 2: The Randomized Stochastic Gradient-Free Method with Gaussian Smoothing Bounds (1/L)E‖∇f(x_R)‖² for Nonconvex fResearch Paper

Many optimization problems in simulation-based design, reinforcement learning and machine learning can be evaluated but not differentiated. Their objective is an expectation f(x)=E[F(x,ξ)]f(x) = \mathbb E[F(x,\xi)]f(x)=E[F(x,ξ)] that can only be sampled through noisy function values F(x,ξ)F(x,\xi)F(x,ξ). Gradients may be unavailable because the model is a black box, a simulator, or a legacy code.…

18 thms5 active usersReviewed
PreviousPage 8 of 142Next

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