English
Related papers

Related papers: Wasserstein Hamiltonian flow with common noise on …

200 papers

This paper contains two contributions in the study of optimal transport on metric graphs. Firstly, we prove a Benamou-Brenier formula for the Wasserstein distance, which establishes the equivalence of static and dynamical optimal transport.…

Analysis of PDEs · Mathematics 2022-05-02 Matthias Erbar , Dominik Forkert , Jan Maas , Delio Mugnolo

We perform a systematic study of optimization problems in the Wasserstein spaces that are analogs of infinite horizon, deterministic control problems. We derive necessary conditions on action minimizing paths and present a sufficient…

Analysis of PDEs · Mathematics 2014-06-25 Ryan Hynd , Hwa Kil Kim

We study the Wasserstein gradient flow of semi-discrete energies in the space of probability measures, that is functionals depending on two measures-one being an absolutely continuous density and the other an atomic measure. These energies…

Analysis of PDEs · Mathematics 2026-03-05 Joao Miguel Machado

In this work, we obtain a short time existence result for harmonic map heat flow coupled with a smooth family of complete metrics in the domain manifold. Our results generalize short time existence results for harmonic map heat flow by…

Differential Geometry · Mathematics 2021-10-15 Shaochuang Huang , Luen-Fai Tam

We develop in this paper a new regularized flow dynamic approach to construct efficient numerical schemes for Wasserstein gradient flows in Lagrangian coordinates. Instead of approximating the Wasserstein distance which needs to solve…

Numerical Analysis · Mathematics 2024-06-24 Qing Cheng , Qianqian Liu , Wenbin Chen , Jie Shen

A reduced dynamical model is derived which describes the interaction of weak inertia-gravity waves with nonlinear vortical motion in the context of rotating shallow-water flow. The formal scaling assumptions are (i) that there is a…

chao-dyn · Physics 2009-10-28 Caroline Nore , Theodore G. Shepherd

This paper derives non-asymptotic error bounds for nonlinear stochastic approximation algorithms in the Wasserstein-$p$ distance. To obtain explicit finite-sample guarantees for the last iterate, we develop a coupling argument that compares…

Machine Learning · Computer Science 2026-02-03 Seo Taek Kong , R. Srikant

Many tasks in machine learning and signal processing can be solved by minimizing a convex function of a measure. This includes sparse spikes deconvolution or training a neural network with a single hidden layer. For these problems, we study…

Optimization and Control · Mathematics 2018-10-30 Lenaic Chizat , Francis Bach

We study the short-time asymptotical behavior of stochastic flows on \mathbb{R} in the \sup-norm. The results are stated in terms of a Gaussian process associated with the covariation of the flow. In case the Gaussian process has a…

Probability · Mathematics 2010-10-27 Alexander Shamov

In this work, we introduce a new method to prove the existence and uniqueness of a variational solution to the stochastic nonlinear diffusion equation $dX(t)={\rm div} [\frac{\nabla X(t)}{|\nabla X(t)|}]dt+X(t)dW(t) in…

Probability · Mathematics 2018-06-27 Michael Röckner , Viorel Barbu

Wasserstein barycenter, built on the theory of optimal transport, provides a powerful framework to aggregate probability distributions, and it has increasingly attracted great attention within the machine learning community. However, it…

Machine Learning · Computer Science 2022-12-20 Jinjin Chi , Zhiyao Yang , Jihong Ouyang , Ximing Li

In {\em{Holm}, Proc. Roy. Soc. A 471 (2015)} stochastic fluid equations were derived by employing a variational principle with an assumed stochastic Lagrangian particle dynamics. Here we show that the same stochastic Lagrangian dynamics…

Analysis of PDEs · Mathematics 2017-10-25 Colin J Cotter , Georg A Gottwald , Darryl D Holm

We examine the infinite-dimensional optimization problem of finding a decomposition of a probability measure into K probability sub-measures to minimize specific loss functions inspired by applications in clustering and user grouping. We…

Optimization and Control · Mathematics 2024-06-04 Jiangze Han , Christopher Thomas Ryan , Xin T. Tong

We prove existence and uniqueness of a solution for the stochastic Allen-Cahn equation with logarithmic potential and multiplicative Wiener noise, under homogeneous Neumann boundary condition. The existence of a solution is obtained in the…

Analysis of PDEs · Mathematics 2020-09-30 Federico Bertacco

The motion of rarefied gases for uniform shear flow at the kinetic level is governed by the spatially homogeneous Boltzmann equation with a deformation force. In the paper we study the corresponding Cauchy problem with initial data of…

Analysis of PDEs · Mathematics 2022-10-25 Renjun Duan , Shuangqian Liu

Slow flows of an ideal compressible fluid (gas) in the gravity field in the presence of two isentropic layers are considered, with a small difference of specific entropy between them. Assuming irrotational flows in each layer [that is ${\bf…

Atmospheric and Oceanic Physics · Physics 2010-12-30 V. P. Ruban

We study a thermodynamically consistent diffuse-interface model that describes the motion of two macroscopically immiscible, incompressible, and viscous Newtonian fluids with unmatched densities. This model is compatible with continuum…

Analysis of PDEs · Mathematics 2026-04-30 Mingwen Fei , Xiang Fei , Yadong Liu , Hao Wu

Wasserstein distributionally robust optimization offers a framework for model fitting in machine learning under potential shifts in the data distribution. We study a regularized variant of this problem in which entropic smoothing produces a…

Optimization and Control · Mathematics 2026-05-28 Tam Le

Wasserstein gradient flows on probability measures have found a host of applications in various optimization problems. They typically arise as the continuum limit of exchangeable particle systems evolving by some mean-field interaction…

Probability · Mathematics 2023-06-30 Sewoong Oh , Soumik Pal , Raghav Somani , Raghavendra Tripathi

We give an $\widetilde{O}({m^{3/2 - 1/762} \log (U+W))}$ time algorithm for minimum cost flow with capacities bounded by $U$ and costs bounded by $W$. For sparse graphs with general capacities, this is the first algorithm to improve over…

Data Structures and Algorithms · Computer Science 2021-11-22 Kyriakos Axiotis , Aleksander Mądry , Adrian Vladu
‹ Prev 1 3 4 5 6 7 10 Next ›