English
Related papers

Related papers: Minimizing optimal transport for functions with fi…

200 papers

Optimal transport induces the Earth Mover's (Wasserstein) distance between probability distributions, a geometric divergence that is relevant to a wide range of problems. Over the last decade, two relaxations of optimal transport have been…

Optimization and Control · Mathematics 2023-01-18 Thibault Séjourné , Jean Feydy , François-Xavier Vialard , Alain Trouvé , Gabriel Peyré

Wasserstein distance (WD) and the associated optimal transport plan have been proven useful in many applications where probability measures are at stake. In this paper, we propose a new proxy of the squared WD, coined min-SWGG, that is…

Machine Learning · Statistics 2023-10-31 Guillaume Mahey , Laetitia Chapel , Gilles Gasso , Clément Bonet , Nicolas Courty

In this paper, we first establish a narrow region principle and a decay at infinity theorem to extend the direct method of moving planes for general fractional $p$-Laplacian systems. By virtue of this method, we can investigate the…

Analysis of PDEs · Mathematics 2019-09-12 Lingwei Ma , Zhenqiu Zhang

The problem of maximizing the $p$-th power of a $p$-norm over a halfspace-presented polytope in $\R^d$ is a convex maximization problem which plays a fundamental role in computational convexity. It has been shown in 1986 that this problem…

Computational Complexity · Computer Science 2013-07-25 Christian Knauer , Stefan König , Daniel Werner

Given sparse collections of measurable sets $\mathcal S_k$, $k=1,2,\ldots ,N$, in a general measure space $(X,\mathfrak M,\mu)$, let $ \Lambda_{\mathcal S_k}$ be the sparse operator, corresponding to $\mathcal S_k$. We show that the maximal…

Classical Analysis and ODEs · Mathematics 2021-01-26 Grigori A. Karagulyan , Michael T. Lacey

Min cut is an important graph partitioning method. However, current solutions to the min cut problem suffer from slow speeds, difficulty in solving, and often converge to simple solutions. To address these issues, we relax the min cut…

Machine Learning · Computer Science 2025-01-31 Fangyuan Xie , Jinghui Yuan , Feiping Nie , Xuelong Li

Katz and Sarnak conjectured a correspondence between the $n$-level density statistics of zeros from families of $L$-functions with eigenvalues from random matrix ensembles. In many cases the sums of smooth test functions, whose Fourier…

Number Theory · Mathematics 2024-09-10 Elżbieta Bołdyriew , Fangu Chen , Charles Devlin VI , Steven J. Miller , Jason Zhao

Optimal transport theory, originally developed in the 18th century for civil engineering, has since become a powerful optimization framework across disciplines, from generative AI to cell biology. In physics, it has recently been shown to…

Statistical Mechanics · Physics 2025-12-02 Shingo Oikawa , Yohei Nakayama , Sosuke Ito , Takahiro Sagawa , Shoichi Toyabe

We introduce a constrained optimal transport problem where origins $x$ can only be transported to destinations $y\geq x$. Our statistical motivation is to describe the sharp upper bound for the variance of the treatment effect $Y-X$ given…

Optimization and Control · Mathematics 2021-06-22 Marcel Nutz , Ruodu Wang

We study first-order optimality conditions for constrained optimization in the Wasserstein space, whereby one seeks to minimize a real-valued function over the space of probability measures endowed with the Wasserstein distance. Our…

Optimization and Control · Mathematics 2025-03-03 Nicolas Lanzetti , Saverio Bolognani , Florian Dörfler

This paper focuses on the Monge-Kantorovich formulation of the optimal transport problem and the associated $L^2$ Wasserstein distance. We use the $L^2$ Wasserstein distance in the Nearest Neighbour (NN) machine learning architecture to…

Computer Vision and Pattern Recognition · Computer Science 2019-03-20 Michael Snow , Jan Van lent

Let $1<p<\infty$. We prove that there exists an $\varepsilon_p>0$ such that for each $f\in L^p(\mathbb{R})$, the centered Hardy-Littlewood maximal operator $M$ on $\mathbb{R}$ satisfies the lower bound $\|Mf\|_{L^p(\mathbb{R})}\ge…

Classical Analysis and ODEs · Mathematics 2020-02-07 F. J. Pérez Lázaro

It was recently shown that under smoothness conditions, the squared Wasserstein distance between two distributions could be efficiently computed with appealing statistical error upper bounds. However, rather than the distance itself, the…

Machine Learning · Statistics 2021-12-30 Boris Muzellec , Adrien Vacher , Francis Bach , François-Xavier Vialard , Alessandro Rudi

We show that on a compact Riemmanian manifold $(M,g)$, nodal sets of linear combinations of any $p+1$ smooth functions form an admissible $p-$sweepout provided these linear combinations have uniformly bounded vanishing order. This applies…

Analysis of PDEs · Mathematics 2016-10-19 Thomas Beck , Spencer T. Becker-Kahn , Boris Hanin

Optimal transport is widely used to learn distributions, enforce distributional constraints, and model uncertainty. In applications, transport losses are often computed from samples through tractable representations, such as one-dimensional…

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

We introduce a weak asymptotic version of nonlinear contraction, termed \emph{asymptotic pointwise contraction}. For a mapping on a metric space, this notion requires the existence of a sequence of functions that dominate the distances…

Functional Analysis · Mathematics 2026-04-15 Jie Shi

We investigate time-dependent optimization problems in fractional Sobolev spaces with the sparsity promoting $L^p$-pseudo norm for $0<p<1$ in the objective functional. In order to avoid computing the fractional Laplacian on the time-space…

Optimization and Control · Mathematics 2025-05-22 Anna Lentz , Daniel Wachsmuth

This article deals with the variable coefficient thin obstacle problem in $n+1$ dimensions. We address the regular free boundary regularity, the behavior of the solution close to the free boundary and the optimal regularity of the solution…

Analysis of PDEs · Mathematics 2016-03-23 Herbert Koch , Angkana Rüland , Wenhui Shi

This paper studies distributional model risk in marginal problems, where each marginal measure is assumed to lie in a Wasserstein ball centered at a fixed reference measure with a given radius. Theoretically, we establish several…

Optimization and Control · Mathematics 2023-07-04 Yanqin Fan , Hyeonseok Park , Gaoqian Xu

We study a variant of the dynamical optimal transport problem in which the energy to be minimised is modulated by the covariance matrix of the distribution. Such transport metrics arise naturally in mean-field limits of certain ensemble…

Analysis of PDEs · Mathematics 2024-12-23 Martin Burger , Matthias Erbar , Franca Hoffmann , Daniel Matthes , André Schlichting