From Saddle Points Toward Global Minima: A Newton-Type Method on Wasserstein Space

• URL: http://arxiv.org/abs/2605.17963v1
• Date: Mon, 18 May 2026 07:18:22 GMT
• Title: From Saddle Points Toward Global Minima: A Newton-Type Method on Wasserstein Space
• Abstract summary: We propose a second-order method that preconditions Wasserstein minimization by a regularized square root of the squared Wasserstein Hessian.<n>This construction preserves attraction toward directions toward directions toward positive curvature while inducing repulsion directions along negative curvature.<n>We show that WSFN converges linearly in $L2$-Wasserstein to a non-de global distance.
• Score: 51.56484100374058
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study the minimization of non-convex functionals over the Wasserstein space. While recent work has showed that perturbed Wasserstein gradient methods can avoid saddle points for benign landscapes, existing approaches remain essentially first-order and do not provide fast local convergence once the iterates enter a neighborhood of a global minimizer. We propose Wasserstein Saddle-Free Newton (WSFN), a second-order method that preconditions the Wasserstein gradient by a regularized square root of the squared Wasserstein Hessian. This construction preserves attraction toward directions of positive curvature while inducing repulsion along directions of negative curvature, thereby overcoming the tendency of standard Wasserstein Newton dynamics to be attracted to saddles. We also establish second-order sufficient optimality conditions on Wasserstein space for strict local minimality. Under regularity and benign landscape assumptions, we prove that WSFN escapes saddle regions and reaches an $α$-neighborhood of a global minimizer in polynomial time, with improved dependence on saddle parameters compared with prior perturbed first-order methods. Once inside this neighborhood, we show that WSFN converges linearly in $L^2$-Wasserstein distance to a non-degenerate global minimizer. Finally, we present a particle-based implementation of the method.

Related papers

• Riemannian ascent--descent for nonconvex nonconcave minimax landscapes: convergence to basin saddle points and applications to distributionally robust optimization [1.0195618602298684]
  We study minimax problems over a gradient of a geodesicean space and a Buresian manifold.<n>Because no globally convergent order first method is known to be available, we instead introduce the notion of a emphbasin saddle point.
  arXiv  Detail & Related papers  (2026-09-12T20:42:11Z)
• Local LMO: Constrained Gradient Optimization via a Local Linear Minimization Oracle [51.714334316332476]
  Local L is a new projection-free type for constrained optimization.<n>Local LMO is perhaps best viewed as an oracle of Gradient Descent (GD)
  arXiv  Detail & Related papers  (2026-05-09T10:03:24Z)
• Fast Estimation of Wasserstein Distances via Regression on Sliced Wasserstein Distances [70.94157767200342]
  We propose a fast estimation method based on regressing Wasserstein distance on sliced Wasserstein distances.<n>We show that accurate models can be learned from a small number of distribution pairs.<n>Our method consistently provides a better approximation of Wasserstein distance than the state-of-the-art Wasserstein embedding model, Wasserstein Wormhole.
  arXiv  Detail & Related papers  (2025-09-24T19:30:53Z)
• Hessian-guided Perturbed Wasserstein Gradient Flows for Escaping Saddle Points [54.06226763868876]
  Wasserstein flow (WGF) is a common method to perform optimization over the space of measures.<n>We show that PWGF converges to a global optimum in terms of general non objectives.
  arXiv  Detail & Related papers  (2025-09-21T08:14:20Z)
• Joint Metric Space Embedding by Unbalanced OT with Gromov-Wasserstein Marginal Penalization [3.7498611358320733]
  We propose a new approach for unsupervised alignment of heterogeneous datasets.<n>Our method is based on an unbalanced optimal transport problem with Gromov-Wasserstein marginalization.
  arXiv  Detail & Related papers  (2025-02-11T12:28:47Z)
• Continuous-time Riemannian SGD and SVRG Flows on Wasserstein Probabilistic Space [21.12668895845275]
  We extend the family of continuous optimization methods in the Wasserstein space by extending the gradient on flow into the gradient descent.<n>By leveraging the property of Wasserstein space, we construct differential equations (SDEs) to approximate the corresponding discrete Euclidean dynamics.<n>Finally, we establish convergence rates of the proposed flows, which align with those known in the Euclidean setting.
  arXiv  Detail & Related papers  (2024-01-24T15:35:44Z)
• Riemannian stochastic optimization methods avoid strict saddle points [68.80251170757647]
  We show that policies under study avoid strict saddle points / submanifolds with probability 1. This result provides an important sanity check as it shows that, almost always, the limit state of an algorithm can only be a local minimizer.
  arXiv  Detail & Related papers  (2023-11-04T11:12:24Z)
• Projected Langevin dynamics and a gradient flow for entropic optimal transport [0.8057006406834466]
  We introduce analogous diffusion dynamics that sample from an entropy-regularized optimal transport. By studying the induced Wasserstein geometry of the submanifold $Pi(mu,nu)$, we argue that the SDE can be viewed as a Wasserstein gradient flow on this space of couplings.
  arXiv  Detail & Related papers  (2023-09-15T17:55:56Z)
• Non-asymptotic convergence bounds for Wasserstein approximation using point clouds [0.0]
  We show how to generate discrete data as if sampled from a model probability distribution. We provide explicit upper bounds for the convergence-type algorithm.
  arXiv  Detail & Related papers  (2021-06-15T06:53:08Z)
• Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization [94.18714844247766]
  Wasserstein barycenters provide a geometric notion of the weighted average of probability measures based on optimal transport. We present a scalable algorithm to compute Wasserstein-2 barycenters given sample access to the input measures.
  arXiv  Detail & Related papers  (2021-02-02T21:01:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.