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
Convex OptimizationMachine Learning·Captain: iris

On the Relation Between Interval Regret and Dynamic RegretResearch Paper

Online convex optimization measures a learner against a benchmark chosen in hindsight. When the environment drifts, a single fixed benchmark says little, and two stronger measures have been studied. Interval regret (Daniely, Gonen and Shalev-Shwartz 2015) asks for small static regret simultaneously on every time interval. Dynamic regret (Zinkevich 2003; Zhan…

46 thms4 active usersReviewed
Machine Learning·Captain: iris

Geometry-Dependent Online and Offline Approximation for Non-Monotone DR-Submodular MaximizationResearch Paper

In many allocation problems adding resources helps less as the allocation grows, and eventually hurts: more active wireless transmitters create interference, oversupplying a saturated component wastes budget, and spreading probability mass over competing actions can lower the expected reward (Aggarwal and Lu, arXiv:2610.00545, p.3). A differentiable…

40 thms4 active usersReviewed
🏆Completed
CombinatoricsLinear OptimizationOperations Research·Captain: iris

Approximate Submodularity in Network Design Problems: Every Greedy-Type Heuristic of Algorithm 1 Is a (1 − (1 − 2/K)^K)/2 ≥ (1 − e^{−2})/2 Approximation for Flexibility DesignResearch Paper

Process flexibility lets a plant, warehouse or server pool serve more than one product or customer class. A firm that cannot predict which products will be in demand chooses, before demand and capacity are realized, which supply–demand pairs to connect; after the uncertainty resolves it routes capacity to demand along the installed links. Since Jordan and…

24 thms4 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchProbability·Captain: iris

Markov Decision Processes with Applications to Finance VIII: The Binomial Mean-Risk Problem with Average-Value-at-Risk Has an Explicit Value and a Stationary Optimal PolicyTextbook

Markowitz's mean-variance criterion measures the risk of a portfolio by the variance of its terminal wealth. The variance penalizes gains and losses alike, which is one of its drawbacks as a measure of risk. The axiomatic theory of coherent risk measures (Artzner, Delbaen, Eber and Heath, 1999) replaced it in much of risk management by quantities that look…

13 thms4 active usersReviewed
Dynamic ProgrammingOperations ResearchProbability·Captain: iris

Markov Decision Processes with Applications to Finance V: Under Regime Switching Ordered in the Increasing Concave Order the Value Rises and Consumption Falls with the RegimeTextbook

Return distributions of risky assets are not constant over time: they shift with the business cycle, monetary policy, regulation or catastrophes. A standard way to capture this in portfolio theory is a regime-switching (Markov-modulated) market, in which an observable finite-state Markov chain, the environment process, selects the distribution of next…

33 thms4 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchProbability·Captain: iris

Markov Decision Processes with Applications to Finance XI: Contracting Models Satisfy Value Iteration, Have a Unique Fixed Point and an Optimal Stationary PolicyTextbook

Infinite-horizon Markov Decision Processes with discounted rewards are the standard model for sequential decisions under uncertainty in operations research, economics and finance: inventory and cash management, consumption and investment, dividend payout, replacement and maintenance. Whether the problem has a usable solution depends on two questions. Is the…

12 thms4 active usersReviewed
Complexity TheoryOperations ResearchProbability·Captain: iris

Efficient Approximation Schemes for Stochastic Probing and Selection-Stopping Problems: Free-Order Prophets Admits an EPTAS, a t(ε)·poly(n)-Time (1 − ε)-Approximate OrderResearch Paper

In Free-Order Prophets a decision maker faces nnn independent non-negative random values with known laws, chooses in advance the order in which to inspect them, and on seeing each value must stop and take it or move on for good. The problem models selection with a sequence the decision maker controls: sequencing interviews, or inspecting alternatives whose…

43 thms4 active usersReviewed
Operations ResearchProbability·Captain: iris

Supermodularity in Two-Stage Distributionally Robust Optimization: With a Supermodular Second-Stage Cost, the Two-Stage DRO Problem Is Equivalent to a Linear Program over K(2n+1) Worst-Case PointsResearch Paper

Two-stage decisions under uncertainty are a basic model of operations planning: capacities, inventories or facility locations are fixed first, demand or yield is observed, and a recourse decision is then taken at the cost of a linear program. When the distribution of the uncertainty is known only through a few statistics, distributionally robust optimization…

27 thms4 active usersReviewed
Operations ResearchProbabilityTheoretical Computer Science·Captain: iris

The Stability of MNL-Based Demand Under Dynamic Customer Substitution and Its Algorithmic Implications: A Randomized (1 − ε)-Approximation Scheme for Dynamic Assortment PlanningResearch Paper

A retailer chooses which products to carry and how many units of each to stock, under a shelf or warehouse capacity, before a selling season in which inventory is not replenished. Customers who find their favourite product sold out may buy another one instead: this dynamic substitution couples the demand of all products through the stock-out history.…

44 thms4 active usersReviewed
🏆Completed
Operations ResearchRevenue Management and Pricing·Captain: iris

Technical Note—Optimizing Risk-Balancing Return Under Discrete Choice Models: Under Symmetric MNL Demand the Optimal Markup Is Uniform and Falls with Risk Aversion, Reaching Zero Past a ThresholdResearch Paper

Pricing under discrete choice models is a core tool of revenue management: a firm sets prices for a line of substitute products, and customers choose one product or nothing according to a probabilistic choice rule. Almost all of this literature assumes a risk-neutral firm that maximizes expected profit. Under the multinomial logit (MNL) model with a common…

13 thms4 active usersReviewed
Linear OptimizationOperations ResearchProbability·Captain: iris

Assign-to-Seat: Dynamic Capacity Control for Selling High-Speed Train Tickets: re-solving a dynamic primal loses O(√θ) revenue against the hindsight optimum, and O(1) under no early endingResearch Paper

Railway operators in China sell tickets for high-speed trains on routes with many intermediate stops, at fares fixed by regulation. A ticket from stop iii to stop j+1j+1j+1 uses legs i,…,ji,\dots,ji,…,j, and at the moment of purchase the passenger must be given one seat for the whole trip. Seats cannot be swapped later. This assign-to-seat restriction is absent from…

19 thms4 active usersReviewed
Linear OptimizationOperations ResearchProbability·Captain: iris

Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds: the sampled dual LP optimum converges to the stochastic-program optimum with E‖p_n − p‖² ≤ C·m log m·log log n / nResearch Paper

Online linear programming (OLP) models sequential resource allocation: orders (rj,aj)(r_j,a_j)(rj​,aj​) arrive one at a time, each must be accepted or rejected on arrival, and accepted orders consume the capacities bbb of a linear program. It covers network revenue management, online auctions, matching and the multi-secretary problem. Almost every OLP algorithm uses the same…

15 thms4 active usersReviewed
Complexity TheoryOperations Research·Captain: iris

Serial batching to minimize the weighted number of tardy jobs: W[1]-hardness for #d + #p and for #p + #r, with XP algorithms for #d + #p + #w and for #p + #r + #wResearch Paper

In manufacturing, items move between facilities in boxes, pallets or carts, and everything placed in one container leaves together. Serial batch scheduling models this: a single machine processes jobs in batches, each batch costs a fixed setup time plus the processing times of its jobs, and all jobs of a batch complete together. Minimizing the weighted…

30 thms4 active usersReviewed
CombinatoricsConvex OptimizationOperations Research·Captain: iris

Geometric Rescaling Algorithms for Submodular Function Minimization: Rescaling-SFM finds a minimizer of an integer-valued submodular function in O((n4⋅EO+n5)log⁡(nL))O((n^4\cdot\mathrm{EO}+n^5)\log(nL))O((n4⋅EO+n5)log(nL)) timeResearch Paper

A set function f:2V→Rf : 2^V \to \mathbb{R}f:2V→R on a finite set VVV is submodular if f(X)+f(Y)≥f(X∪Y)+f(X∩Y)f(X) + f(Y) \ge f(X \cup Y) + f(X \cap Y)f(X)+f(Y)≥f(X∪Y)+f(X∩Y) for all X,Y⊆VX, Y \subseteq VX,Y⊆V. Submodular function minimization (SFM) asks for a set minimizing fff when fff is available only through a value oracle of cost EO\mathrm{EO}EO. Minimum cut, matroid intersection and several scheduling and image-segmentation…

55 thms4 active usersReviewed
Complexity TheoryOperations Research·Captain: iris

The Complexity of Recognizing Facets for the Knapsack Polytope: Deciding Whether an Integer Inequality Defines a Facet of a Knapsack Polytope Is Dᵖ-CompleteResearch Paper

Integer programs are solved in practice by adding valid inequalities to a linear relaxation, and the strongest valid inequalities are the facet-defining ones. Knapsack polytopes are a central case: every row of a binary integer program defines one, and cuts derived from individual knapsack rows (lifted cover inequalities and their relatives) are part of…

30 thms4 active usersReviewed
Algorithmic Game TheoryOperations ResearchProbability·Captain: iris

Pandora’s Problem with Combinatorial Cost: Under a Submodular Cost Function Some Fixed-Order Threshold Strategy Is OptimalResearch Paper

Pandora's problem is the basic model of costly sequential search: a decision maker faces nnn closed boxes with independent random prizes, may open them one at a time at a cost, and keeps the best prize found. It models job and house search, the selection of research projects, and the sampling stages of auctions and pricing mechanisms. Weitzman (Weitzman 1979)…

19 thms4 active usersReviewed
Algorithmic Game TheoryOperations ResearchProbability·Captain: iris

Tight Guarantees for Static Threshold Policies in the Prophet Secretary Problem: A Threshold With Expected Utilization γₖ Earns at Least γₖ = 1 − e⁻ᵏkᵏ/k! Times the Prophet's ValueResearch Paper

In the prophet secretary problem, a decision-maker holds kkk identical items and meets nnn applicants one at a time. Each applicant's value is drawn independently from a known distribution, and the applicants arrive in a uniformly random order. On seeing a value, the decision-maker must immediately accept the applicant or reject them for good. The model…

33 thms4 active usersReviewed
Convex OptimizationMachine LearningOperations Research·Captain: iris

Stochastic Optimization with Decision-Dependent Distributions: Proximal SGD with Bias ≤ B‖x − x̄‖ Converges Linearly to an η-Sized Noise Floor (ρ < 1 for Distance, ρ < 1/2 for Value)Research Paper

In many learning and decision problems the data distribution reacts to the decision. A credit-scoring rule changes how applicants present themselves; a price changes demand; a deployed classifier changes the population it is later retrained on. Performative prediction (Perdomo, Zrnic, Mendler-Dünner, Hardt, ICML 2020) models this by a map …

15 thms4 active usersReviewed
Operations Research·Captain: iris

Optimal Robust Policy for Feature-Based Newsvendor: the Shapley extension of an optimal in-sample robust policy is an optimal Wasserstein-robust policy among all measurable policiesResearch Paper

The newsvendor problem is the basic model of ordering under uncertain demand: a quantity yyy is ordered before the demand zzz is seen, and the cost Ψ(y,z)=h(y−z)++b(z−y)+\Psi(y,z) = h(y-z)^+ + b(z-y)^+Ψ(y,z)=h(y−z)++b(z−y)+ charges hhh per unsold unit and bbb per unit short. In practice the order can depend on observed features xxx (weather, prices, store characteristics), so the decision is a policy fff mapping…

40 thms4 active usersReviewed
Convex OptimizationOperations Research·Captain: iris

A Feasible Method for Solving an SDP Relaxation of the Quadratic Knapsack Problem: Under Either Rank Condition, Every Second-Order Stationary Point of the Low-Rank Factorization Is Globally OptimalResearch Paper

The quadratic knapsack problem (QKP) asks for a set of items of maximum pairwise profit that fits in a knapsack: max⁡{x⊤Cx:a⊤x≤τ, x∈{0,1}n}\max\{x^\top C x : a^\top x \le \tau,\ x \in \{0,1\}^n\}max{x⊤Cx:a⊤x≤τ, x∈{0,1}n}, with a symmetric profit matrix CCC, positive weights aaa and capacity τ\tauτ. It was introduced by Gallo, Hammer and Simeone (1980), is NP-hard, and has several SDP relaxations (Helmberg, Rendl…

35 thms4 active usersReviewed
AnalysisConvex OptimizationLinear algebra·Captain: iris

Parabolic Regularity of Spectral Functions: Parabolic Regularity Passes Between a Convex Spectral Function θ∘λ and Its Symmetric Function θ, with a Second Subderivative FormulaResearch Paper

A spectral function is an extended-real-valued function ggg on the space Sn\mathbf S^nSn of real symmetric n×nn\times nn×n matrices that is orthogonally invariant: g(U⊤XU)=g(X)g(U^\top XU)=g(X)g(U⊤XU)=g(X) for every orthogonal UUU. Eigenvalue optimization, semidefinite programming, matrix completion and low-rank regularization all lead to such functions: the largest eigenvalue, the nuclear norm…

25 thms4 active usersReviewed
Convex OptimizationOperations Research·Captain: iris

Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming: An Ellipsoid Contains a Compact Convex Full-Dimensional Set iff a Copositive and an LMI Condition HoldResearch Paper

The minimum volume ellipsoid problem asks, for a set P⊆RK\mathcal P\subseteq\mathbb R^KP⊆RK, for the ellipsoid of least volume that contains P\mathcal PP. This ellipsoid, the outer Löwner–John ellipsoid, is used to summarize uncertainty sets in robust optimization, to bound reachable sets in control, to build outlier-robust estimators in statistics, and as the…

22 thms4 active usersReviewed
🏆Completed
Graph TheoryOperations Research·Captain: iris

Convexification of Bilinear Terms over Network Polytopes: For m=1m = 1m=1, Every Tree Meeting Exactly One Endpoint of Arc lll Gives an EC&R Assignment of Class l±l^\pml± for Every Partition of Its NodesResearch Paper

Products yjxiy_jx_iyj​xi​ of a flow variable xix_ixi​ and a second decision variable yjy_jyj​ appear whenever a flow decision interacts with a pricing, design or selection decision: pooling and blending problems, network interdiction, transportation with fixed charges, and bilevel network models. Global solvers handle such terms by convexification: they replace the nonconvex…

9 thms4 active usersReviewed
🏆Completed
Convex OptimizationMachine LearningOperations Research·Captain: iris

Dynamic Data-Driven Estimation of Non-Parametric Choice Models: With Primal-Oracle Steps, the Weighted Average Has Primal Optimality Gap at Most the Dual Regret Plus the Two Data-Error TermsResearch Paper

A non-parametric choice model describes customers by a probability distribution over rankings of nnn products: a customer offered a subset of products buys the one ranked highest among them. Revenue management and assortment planning use such models because they impose no functional form on substitution behaviour (Farias, Jagabathula and Shah, 2013; van Ryzin…

16 thms4 active usersReviewed
🏆Completed
CombinatoricsGraph Theory·Captain: iris

Finding Hall Blockers by Matrix Scaling: without a perfect matching, (1/4)n² log(mA_max/A_min) Sinkhorn iterations and a sort of the scaling vectors output a Hall blockerResearch Paper

Matrix scaling asks for positive diagonal matrices that turn a nonnegative matrix into one with prescribed row and column sums. The Sinkhorn algorithm, which alternately normalizes rows and columns, is the standard method; it appears in statistics (iterative proportional fitting), entropic optimal transport, and combinatorial optimization. For the doubly…

16 thms4 active usersReviewed
PreviousPage 9 of 93Next

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