Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Optimal Transport

97 missions · 65 completed

Missions

Open32Completed65All97
🏆Completed
Operations ResearchOptimizationProbability·Captain: Shuze Chen

Technical Note—Data-Driven Chance Constrained Programs over Wasserstein Balls: Exact deterministic reformulation of chance constraintsResearch Paper

A decision can be inexpensive on average yet fail too often to be acceptable. A chance constraint addresses this by bounding the probability of an unsafe outcome. When the distribution of uncertainty is itself unknown, enforcing the constraint only under observed frequencies can overlook outcomes absent from the data. A distributionally robust chance…

16 thms6 active usersReviewed
🏆Completed
Actuarial ScienceOperations ResearchProbability·Captain: mikedeng1

Maximum Spectral Measures of Risk with Given Risk Factor Marginal Distributions: Strong Duality for the Worst-Case Spectral Risk Measure over CouplingsResearch Paper

A portfolio loss often depends on several risk factors whose individual distributions can be estimated well but whose joint distribution cannot. Regulators and risk managers then ask for the worst-case risk: the largest value a risk measure can take over all joint laws compatible with the known marginals. For Value-at-Risk and Expected Shortfall of sums…

15 thms5 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchOptimization·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
AnalysisOptimization·Captain: mikedeng1

Computational Optimal Transport X: For the Cost c = d a Function Is a c-Transform if and only if It Is 1-Lipschitz, and Then f^c = −fTextbook

Optimal transport compares two probability distributions by the least cost of moving one onto the other. When the ground cost is itself a distance, c(x,y)=d(x,y)c(x,y)=d(x,y)c(x,y)=d(x,y), the resulting quantity is the 1-Wasserstein distance W1\mathcal W_1W1​, also called the earth mover's distance. It is the transport distance most used in practice for comparing histograms, images and…

11 thms5 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Computational Optimal Transport II: For a Distance Matrix D and p ≥ 1, W_p(a, b) = L_{D^p}(a, b)^{1/p} Is a Distance on the Probability SimplexTextbook

Comparing histograms is a basic operation in statistics, computer vision and machine learning: a bag of image descriptors, a word-frequency vector, a discretized density. When the bins carry a geometry (colors that are close to one another, words with related meanings), a comparison that ignores the geometry, such as an ℓp\ell^pℓp norm between the histogram…

10 thms5 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchOptimization·Captain: mikedeng1

Computational Optimal Transport III: Discrete Kantorovich Duality — L_C(a, b) Is the Maximum of ⟨f, a⟩ + ⟨g, b⟩ over Potentials with f ⊕ g ≤ CTextbook

Optimal transport between two histograms is a linear program: move mass aia_iai​ out of each source bin iii and deliver mass bjb_jbj​ to each target bin jjj at unit cost Ci,jC_{i,j}Ci,j​, as cheaply as possible. Its dual replaces the transport plan by a pair of price vectors and is the basis of most of the computational methods in G. Peyré and M. Cuturi's Computational Optimal…

10 thms5 active usersReviewed
🏆Completed
Machine LearningNumerical AnalysisOptimization·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 ResearchOptimization·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
Pure Mathematics·Captain: ykanoria

Excursion Coupling for the Monge Problem on the Line (Juillet 2019)Research Paper

The Monge optimal transport problem on the real line with the classical distance cost ∣x−y∣|x-y|∣x−y∣ famously fails to have a unique solution. Juillet (2019) restored uniqueness by considering the strictly concave power costs ∣x−y∣p|x-y|^p∣x−y∣p with p<1p<1p<1 and letting p→1−p\to 1^-p→1−: the limit selects a distinguished optimal plan, the excursion coupling, built from the level sets of…

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

A Short and General Duality Proof for Wasserstein Distributionally Robust Optimization IV: On a Polish Space, the Maximum-Transport-Cost Worst-Case Loss Equals E[sup{f(x) : c(X̂, x) ≤ ρ}]Research Paper

In Wasserstein distributionally robust optimization (DRO) a decision is evaluated against the worst distribution within an optimal-transport ball around a nominal distribution P^\widehat{\mathbb P}P. For a Wasserstein distance of finite order ppp, the ball constrains an average transport cost. The case p=∞p=\inftyp=∞ is different. The ∞\infty∞-Wasserstein distance …

16 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Residuals-based distributionally robust optimization with covariate information 1: Wasserstein ER-DRO with the Enlarged Radius (10) Certifies Its Out-of-Sample Cost with Probability 1−αResearch Paper

Many operational decisions are made after observing covariates that carry information about the uncertainty: a retailer sets inventory after seeing weather and calendar features that predict demand, a grid operator commits generation after seeing a load forecast. The decision problem is a conditional stochastic program: choose z∈Zz\in\mathcal Zz∈Z to minimize …

15 thms4 active usersReviewed
🏆Completed
Markov ChainNumerical AnalysisProbability·Captain: mikedeng1

Coupling and Convergence for Hamiltonian Monte Carlo 1: Exact HMC Contracts the Concave Kantorovich Distance W_ρ at Rate c = (1/10)·min(1, ½KT²(1+ℛ/T)e^{−ℛ/(2T)})·e^{−2ℛ/T}Research Paper

Hamiltonian Monte Carlo (HMC) is one of the most widely used Markov chain Monte Carlo methods for sampling from a probability density μ(dx)∝e−U(x) dx\mu(dx)\propto e^{-U(x)}\,dxμ(dx)∝e−U(x)dx on Rd\mathbb R^dRd. It is the default sampler of probabilistic programming systems such as Stan, and it is used throughout Bayesian statistics, molecular dynamics and machine learning. In practice the…

13 thms4 active usersReviewed
🏆Completed
CombinatoricsLinear OptimizationOptimization·Captain: mikedeng1

Computational Optimal Transport V: A Feasible Pair of Kantorovich Potentials Is Optimal or Strictly Improves Along a Direction (1_S, −1_S′)Textbook

The discrete optimal transport problem between two histograms is a linear program, and much of the algorithmic theory of optimal transport is the theory of solving that linear program well. Chapter 3 of Peyré and Cuturi's Computational Optimal Transport (Foundations and Trends in Machine Learning, 2019) surveys the classical combinatorial solvers: the…

9 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

On a Problem of Optimal Transport Under Marginal Martingale Constraints 6: For c = −|y − x| and Continuous µ the Optimizer Is Unique and Lives on Two Monotone GraphsResearch Paper

A forward-start straddle pays ∣S2−S1∣|S_2 - S_1|∣S2​−S1​∣, the absolute change of an asset price between two future dates. A trader who knows the market prices of all vanilla options at both dates knows the laws μ\muμ of S1S_1S1​ and ν\nuν of S2S_2S2​, but not their joint law. Under a pricing measure the price is a martingale, so the admissible joint laws are exactly the martingale…

17 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

On a Problem of Optimal Transport Under Marginal Martingale Constraints 4: For c = h(y − x) with h′ Strictly Convex the Left-Curtain Coupling Is the Unique OptimizerResearch Paper

Martingale optimal transport asks for the cheapest way to couple two probability laws μ\muμ and ν\nuν on R\mathbb RR under the extra constraint that the coupling is the law of a one-step martingale. The problem arose in robust mathematical finance: when the prices of all call options at two maturities are observed, the marginal laws of the underlying asset at…

12 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Distributionally Robust Chance-Constrained Programs with Right-Hand Side Uncertainty under Wasserstein Ambiguity: The Reduced Quantile-Strengthened MIP (20) Is an Exact Reformulation of DR-CCPResearch Paper

A chance-constrained program chooses a decision xxx so that a random vector ξ\xiξ falls outside a decision-dependent safety set S(x)\mathcal S(x)S(x) with probability at most ϵ\epsilonϵ. Chance constraints are a standard model for reliability requirements in power systems, supply chains and transportation, where a plan must survive random demand or supply with high…

18 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Optimal Transport-Based Distributionally Robust Optimization: Structural Properties and Iterative Schemes 1: Mahalanobis-Transport Worst-Case Loss Equals inf over λ ≥ 0 of E_P0[ℓ_rob(β, λ; X)]Research Paper

Distributionally robust optimization chooses a decision against a range of plausible probability laws instead of a single fitted law. Here the decision is a linear rule evaluated through a loss function. The range of laws is specified by how much probability mass may be transported away from a baseline law. A conventional transport cost depends only on the…

13 thms4 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Distributionally Robust Linear and Discrete Optimization with Marginals: the worst-case expected optimal value over a Fréchet class equals its Lagrangian primal and dual formsResearch Paper

Many decision problems in operations research end in a linear optimization over a finite set of alternatives whose objective coefficients are random: the longest path in a project network with random activity durations, a maximum-weight assignment or spanning tree with random weights, the best item in a ranking with random utilities. The quantity of…

11 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Robustifying Conditional Portfolio Decisions via Optimal Transport 3: For a Fiber of Radius γ > 0 and a Budget ρ > ρ_max, the Worst-Case Conditional Expected Loss Collapses to sup_y ℓ(y)Research Paper

A portfolio manager who observes a covariate today, say a vector of macroeconomic indicators x0x_0x0​, wants an allocation that performs well on the returns YYY that follow such a covariate. With finitely many historical pairs (x^i,y^i)(\hat x_i,\hat y_i)(x^i​,y^​i​) the conditional law of YYY given X=x0X=x_0X=x0​ is poorly estimated: usually no sample has covariate exactly x0x_0x0​, and few have…

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

Robustifying Conditional Portfolio Decisions via Optimal Transport 1: With a Singleton Fiber and Only Positive Fiber Mass Required, the Worst-Case Conditional Expected Loss Collapses to sup_y ℓ(y)Research Paper

A portfolio manager who observes side information (a covariate XXX, such as a market indicator) before choosing a portfolio wants to control the loss of the asset returns YYY conditional on the observed covariate value x0x_0x0​. The conditional law of YYY given X=x0X=x_0X=x0​ is unknown and must be learned from NNN historical pairs (x^i,y^i)(\widehat x_i,\widehat y_i)(xi​,y​i​). When x0x_0x0​ itself…

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

Global Sensitivity Analysis via Optimal Transport 1: An OT-Based Sensitivity Measure Is Maximal Exactly When the Output Is a Function of the InputResearch Paper

Global sensitivity analysis asks how much of the uncertainty in the output YYY of a model, a simulator or a learned predictor is attributable to an input XXX. A standard way to answer is to compare the law of YYY with its law after XXX is revealed, and to average that discrepancy over XXX. Variance-based indices (Sobol' 1993; Wagner 1995) compare conditional and…

11 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

A Short and General Duality Proof for Wasserstein Distributionally Robust Optimization II: Interchangeability Holds for Diagonally Dominant Functions iff Measurable Projection and Weak Selection DoResearch Paper

In Wasserstein distributionally robust optimization (DRO) a decision is evaluated against the worst distribution within an optimal-transport ball around a nominal distribution P^\widehat{\mathbb P}P. Every tractable reformulation rests on a strong duality theorem that replaces the supremum over distributions by a one-dimensional minimization over a multiplier …

13 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

A Short and General Duality Proof for Wasserstein Distributionally Robust Optimization I: Worst-Case Loss = min over λ ≥ 0 of λρ + E[sup f − λc] for All ρ > 0 iff Interchangeability HoldsResearch Paper

Wasserstein distributionally robust optimization (DRO) hedges a decision against every probability distribution within a given transport distance of a nominal one, typically the empirical distribution of data. The inner problem, the worst-case loss, is an optimization over an infinite-dimensional set of measures, and every practical use of Wasserstein DRO —…

15 thms3 active usersReviewed
🏆Completed
Machine LearningOperations ResearchOptimization·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
Markov ChainProbability·Captain: mikedeng1

Coupling and Convergence for Hamiltonian Monte Carlo 2: Lyapunov Bounds and Local Contractivity Give W_ρ(νπⁿ, ηπⁿ) ≤ e^{−cn}W_ρ(ν, η) + βⁿλⁿ⁻¹(∫ψdν + ∫ψdη)δ(C)Research Paper

Markov chain Monte Carlo methods approximate a target probability measure by the law after nnn steps of a Markov chain. A quantitative guarantee for such a method is a bound on the distance between the law after nnn steps and the target, or between the laws of two copies of the chain started from different initial distributions. A standard route to such bounds…

7 thms3 active usersReviewed
PreviousPage 1 of 3Next

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