Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Optimization

2,311 missions · 1,728 completed

Missions

Open583Completed1728All2311
🏆Completed
Dynamic ProgrammingOperations Research·Captain: mikedeng1

Dynamic Type Matching: Under the Modified Monge Condition There Is an Optimal Matching Policy That Respects the Priority Relation ≻MsResearch Paper

Many platforms match two sides of a market over time: ride-hailing platforms match riders with drivers, blood banks match donated units with patients, organ allocation matches donors with recipients, and retailers pool inventory across fulfilment centres to serve orders from several regions. Demand and supply arrive in several types (locations, blood…

11 thms3 active usersReviewed
🏆Completed
Machine Learning·Captain: mikedeng1

Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Łojasiewicz Condition I: Gradient Descent with Step 1/L Satisfies f(x_k) − f* ≤ (1 − μ/L)^k (f(x_0) − f*)Research Paper

Gradient descent is often introduced with strong convexity as the condition that gives a geometric reduction in objective error. That condition excludes useful smooth objectives whose minimizer is not unique and some nonconvex objectives. Karimi, Nutini, and Schmidt place the Polyak–Łojasiewicz inequality at the center of a more general account: it controls…

5 thms3 active usersReviewed
🏆Completed
Machine LearningProbability·Captain: mikedeng1

Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Łojasiewicz Condition IV: Stochastic Gradient Rates LC²/(2kμ²) and (1 − 2μα)^k [f(x_0) − f*] + LC²α/(4μ)Research Paper

Stochastic gradient (SG) methods are the default algorithms for training machine-learning models: when an objective is an average over a very large number of training examples, computing its full gradient even a few times is infeasible, while the gradient of a single randomly chosen example is cheap. The classical convergence theory of SG rates its expected…

7 thms3 active usersReviewed
🏆Completed
CombinatoricsOperations ResearchProbability·Captain: mikedeng1

Online Contention Resolution Schemes with Applications to Bayesian Selection Problems 2: The Degree Relaxation of Matching Has a (b, e^(−2b))-Selectable Randomized Greedy OCRSResearch Paper

In online selection, candidate items reveal themselves one at a time and an algorithm must decide immediately whether to keep each one. When the kept items must form a matching, accepting one edge can prevent a later edge sharing an endpoint from being accepted. A fractional solution supplies useful marginal probabilities, but it does not by itself specify…

11 thms3 active usersReviewed
🏆Completed
CombinatoricsOperations ResearchProbability·Captain: mikedeng1

Online Contention Resolution Schemes with Applications to Bayesian Selection Problems 3: A Knapsack Polytope Has a (b, (1−2b)/(2−2b))-Selectable Randomized Greedy OCRS for b ≤ 1/2Research Paper

In online selection, useful items arrive one at a time and must be accepted or rejected before the next arrival. A knapsack constraint limits the total size of accepted items to one unit. When the order may depend on all of the random outcomes, an algorithm needs a guarantee that survives every such order. Feldman, Svensson, and Zenklusen introduced online…

8 thms3 active usersReviewed
🏆Completed
Graph TheoryLinear OptimizationOperations Research·Captain: mikedeng1

Minimum Cost Flows in Graphs with Unit Capacities: When the Second Phase of a Cost Scale Starts, at Most 3λ Excess Is Left for λ = √m and 36λ for λ = n^(2/3)Research Paper

Minimum-cost flow is a standard model for routing a quantity through a network while paying a cost on each arc. Unit capacities arise when each input arc can carry at most one unit; they include flow formulations of several matching and assignment problems. Goldberg, Kaplan, Hed and Tarjan analyze a cost-scaling algorithm for this setting. Their…

9 thms3 active usersReviewed
🏆Completed
Machine LearningProbability·Captain: mikedeng1

Certifying Some Distributional Robustness with Principled Adversarial Training 1: SGD on the Wasserstein Penalty Surrogate Finds an Approximate Stationary Point at Rate 4σ√(L_φΔ_F/T)Research Paper

Neural networks trained by empirical risk minimization are sensitive to small, deliberately chosen perturbations of their inputs ("adversarial examples"). A standard defence is adversarial training: at each step, perturb the training example to increase the loss, then take a gradient step at the perturbed point. Sinha, Namkoong, Volpi and Duchi (arXiv:1710.1…

10 thms3 active usersReviewed
🏆Completed
Operations ResearchProbabilityStatistics·Captain: mikedeng1

Recovering Best Statistical Guarantees via the Empirical Divergence-Based Distributionally Robust Optimization 3: On a Finite Support the Empirical DRO Equals the Burg-Divergence DRO with χ²₁ RadiusResearch Paper

Distributionally robust optimization (DRO) evaluates a decision against a collection of probability distributions near an empirical one. In a finite scenario model, the familiar construction puts a divergence ball around the histogram of observed scenarios. Lam's empirical construction instead gives one weight to each observation, even when several…

9 thms3 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

Optimization-Based Scenario Reduction for Data-Driven Two-Stage Stochastic Optimization II: Under a Symmetric Uncertainty Law the Mean Solves the Convex Upper-Bound Scenario ProblemResearch Paper

A two-stage stochastic programme chooses a decision zzz before an uncertain parameter ξ\xiξ is revealed and pays a cost c(z;ξ)c(z;\xi)c(z;ξ). When ξ\xiξ is known only through nnn data points, or through a law with many atoms, the expected cost is expensive to optimize, and practitioners replace the law by a small set of mmm reduced scenarios. Classical scenario reduction chooses…

9 thms3 active usersReviewed
🏆Completed
Machine LearningOperations ResearchProbability·Captain: mikedeng1

Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming 1: The Randomized Stochastic Gradient Method Has (1/L)E‖∇f(x_R)‖² ≤ (D_f² + σ²Σγ_k²)/Σ(2γ_k − Lγ_k²)Research Paper

Stochastic gradient methods are the standard tool for minimizing an objective that can only be accessed through noisy gradient samples. Training a machine-learning model on sampled data, simulation-based optimization, and stochastic programs with endogenous uncertainty are all of this kind. In many of these applications the objective is nonconvex: the loss…

13 thms3 active usersReviewed
🏆Completed
Machine LearningOperations ResearchOptimal Transport·Captain: mikedeng1

Wasserstein Distributionally Robust Optimization and Variation Regularization II: The ∞-Wasserstein Regularizer Equals ρ Times the Mean Local Slope up to ρ²‖H‖ Plus a Boundary TermResearch Paper

In distributionally robust optimization, a decision is judged against probability laws near a nominal law rather than against the nominal law alone. The nominal law is often the empirical distribution of observed data. For a loss function, this produces a worst-case expected loss that depends on the size and geometry of the permitted changes to the data.…

10 thms3 active usersReviewed
🏆Completed
Harmonic AnalysisOperations Research·Captain: mikedeng1

The Sum-of-Squares Hierarchy on the Sphere, and Applications in Quantum Information Theory I: If 0 ⪯ F ⪯ I on S^{d−1} for a Degree-2n Matrix Polynomial F, Then F + C′ₙ(d/ℓ)²·I Is ℓ-SOS for ℓ ≥ CₙdResearch Paper

Maximizing a homogeneous polynomial ppp over the unit sphere, pmax⁡=max⁡x∈Sd−1p(x)p_{\max}=\max_{x\in S^{d-1}}p(x)pmax​=maxx∈Sd−1​p(x), covers the largest stable set of a graph (degree three), the 2→42\to42→4 norm of a matrix (degree four) and the best separable state problem of quantum information. For quadratic ppp it is an eigenvalue problem; for degree at least three it is NP-hard. The sum-of-squares…

23 thms3 active usersReviewed
🏆Completed
AnalysisOperations ResearchProbability·Captain: mikedeng1

On the Heavy-Tail Behavior of the Distributionally Robust Newsvendor 1: Worst-Case Expected Shortage under Known First and αth Moments Equals That of a Regularly Varying Demand of Tail Index αResearch Paper

A newsvendor chooses an order quantity before seeing demand. Unsold units have no salvage value, while demand above the order quantity cannot be filled. If the demand law is unknown but a few moments are known, the decision maker may minimize cost against the worst distribution consistent with those moments. Das, Dhara and Natarajan study this…

12 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

A game-theoretic approach to computation offloading in mobile cloud computing III: Variational Solutions Are the Nash Equilibria of the Extended Cloudlet-Pricing GameResearch Paper

Mobile devices can divide work between local execution, a nearby shared cloudlet, and a remote cloud. A cloudlet has limited capacity, so one user's choice changes the delay faced by the others. Cardellini and coauthors model this as a generalized Nash equilibrium problem, in which each user's feasible choices depend on the aggregate cloudlet load. The…

8 thms3 active usersReviewed
🏆Completed
Mechanism DesignOperations Research·Captain: mikedeng1

Double Counting in Supply Chain Carbon Footprinting II: A Carbon Leader Paying Linear Emission-Contingent Rules That Double-Count Internally Earns Its Effort-Contracting ProfitResearch Paper

Firms increasingly account for, and offset, the greenhouse-gas emissions of their entire supply chain, not only their own operations. Emissions in a supply chain are often jointly produced: the footprint of one process (transport, packaging, a molten-bulk delivery) depends on the abatement efforts of several firms at once. When each firm is charged for…

9 thms3 active usersReviewed
🏆Completed
CombinatoricsOperations Research·Captain: mikedeng1

Scheduling Problems with Two Competing Agents 9: Total Completion Time Against a Maximum Cost Has at Most n_A·n_B + 1 Nondominated PairsResearch Paper

Many scheduling decisions are not owned by a single decision maker. A machine shared by two departments, a production line serving two customers, or a computing resource shared by two users must process the jobs of two agents, each of which judges a schedule by its own criterion. Agnetis, Mirchandani, Pacciarelli and Pacifici introduced this model in Schedul…

10 thms3 active usersReviewed
🏆Completed
Mechanism DesignOperations Research·Captain: mikedeng1

Double Counting in Supply Chain Carbon Footprinting I: With Joint Carbon Production, Every Differentiable Increasing Payment Rule That Makes the Social First-Best a Nash Equilibrium Double-CountsResearch Paper

Carbon accounting assigns emissions from a shared supply-chain process to firms that can reduce them. If more than one firm can change the same emissions, charging each firm only a share may leave each with too little incentive to abate. Caro, Corbett, Tan and Zuidwijk study the conflict between avoiding double counting in an emissions ledger and inducing…

7 thms3 active users
🏆Completed
Operations Research·Captain: mikedeng1

Scheduling Problems with Two Competing Agents 3: The Least-Cost Backward Rule Gives a Nondominated Schedule Minimizing Total Completion Time Under a Maximum-Cost BoundResearch Paper

Many scheduling situations involve more than one decision maker sharing a resource. Two departments of a firm may share a machine shop, two clients may share a contractor, or two users may share a processor, and each cares only about how its own jobs are served. Agnetis, Mirchandani, Pacciarelli and Pacifici (Oper. Res. 52(2), 2004) introduced a systematic…

9 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations Research·Captain: mikedeng1

Dynamic Pricing with Loss-Averse Consumers and Peak-End Anchoring: Every Optimal Price Path Converges Monotonically to a Steady State Set by the Initial Minimum PriceResearch Paper

Firms that change prices over time face customers who remember past prices. A large empirical literature in marketing documents reference price effects: demand depends not only on the current price but on how that price compares with a price the customer expects, and losses (prices above the reference) weigh more than gains of the same size, the loss…

14 thms3 active usersReviewed
🏆Completed
Numerical AnalysisOperations Research·Captain: mikedeng1

On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems 1: Steepest Descent Can Need ε^(−2+τ) Iterations to Reach |g| ≤ εResearch Paper

Steepest descent is the oldest method for unconstrained minimization: to minimize a smooth function fff, it moves from the current point xkx_kxk​ along the negative gradient −gk=−∇f(xk)-g_k = -\nabla f(x_k)−gk​=−∇f(xk​). It is the prototype of every first-order method, and its worst-case evaluation complexity — how many iterations it may need before the gradient norm drops below a…

10 thms3 active usersReviewed
🏆Completed
Functional AnalysisNumerical AnalysisOperations Research·Captain: mikedeng1

Some Numerical Experiments with Variable-Storage Quasi-Newton Algorithms: The Update (A.7) Is the Unique Least-Change Self-Adjoint Secant Update in a Weighted Hilbert–Schmidt NormResearch Paper

Quasi-Newton methods replace a costly exact Hessian with an operator updated from successive changes in position and gradient. A secant update must map the observed step sss to the observed gradient difference yyy. Many operators satisfy that one equation, so the choice of update needs another criterion. Gilbert and Lemaréchal's working paper studies…

14 thms3 active usersReviewed
🏆Completed
Numerical Analysis·Captain: mikedeng1

Branch-and-Bound Performance Estimation Programming: A Unified Methodology for Constructing Optimal Optimization Methods: Subgradient Rate L̃²(2√(4κ²(N+1)+1)−1)/(N+1) on Weakly Convex FunctionsResearch Paper

Many objectives in statistics and machine learning are neither smooth nor convex, yet are well behaved in a weaker sense: robust phase retrieval, blind deconvolution, robust PCA and training with piecewise-linear losses all lead to weakly convex functions, functions that become convex after adding a fixed quadratic. For such functions the plain subgradient…

13 thms3 active usersReviewed
🏆Completed
Numerical AnalysisOperations Research·Captain: mikedeng1

An Augmented Lagrangian Based Algorithm for Distributed Nonconvex Optimization 2: Near a Regular KKT Point the Decoupled Subproblems Have Locally Unique Minimizers with ‖y−x*‖ ≤ χ₁‖x−x*‖+χ₂‖λ−λ*‖Research Paper

Many large optimization problems arising in networked control, smart grids, distributed estimation and resource allocation have a separable objective with coupled affine constraints: NNN agents each own a variable xix_ixi​ and a private cost fif_ifi​, and only a linear constraint ∑iAixi=b\sum_i A_ix_i=b∑i​Ai​xi​=b ties them together. Distributed algorithms for such problems let each…

7 thms3 active usersReviewed
🏆Completed
Algorithmic Game Theory·Captain: mikedeng1

On the Complexity of Nash Equilibria and Other Fixed Points 4: The Fixed Points of the Division-Free Map G_I(x)ij = max(x_ij + u_i((i:j); x−i) − t_i, 0) Are Exactly the Nash EquilibriaResearch Paper

Nash's existence theorem for finite games is a fixed-point theorem: one writes down a continuous map from the set of mixed strategy profiles to itself whose fixed points are exactly the Nash equilibria, and applies Brouwer's theorem. Nash's own map (Nash 1951) divides by 1+∑jmax⁡(0,⋅)1+\sum_j \max(0,\cdot)1+∑j​max(0,⋅), and the choice of map matters as soon as the question is…

10 thms3 active usersReviewed
🏆Completed
Numerical AnalysisOperations Research·Captain: mikedeng1

On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems 3: ARC Can Need ε^(−3/2+τ) Iterations to Reach |g| ≤ εResearch Paper

Worst-case iteration counts are the standard way to compare unconstrained optimization methods on nonconvex problems. For finding an approximate first-order critical point, a point with ∥∇f(x)∥≤ϵ\|\nabla f(x)\|\le\epsilon∥∇f(x)∥≤ϵ, steepest descent needs at most O(ϵ−2)O(\epsilon^{-2})O(ϵ−2) iterations on functions with a Lipschitz gradient. The cubic regularization of Newton's method…

11 thms3 active usersReviewed
PreviousPage 29 of 70Next

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