Related papers: Conformal Wasserstein distances: comparing surface…
We consider a class of convex optimization problems modelling temporal mass transport and mass change between two given mass distributions (the so-called dynamic formulation of unbalanced transport), where we focus on those models for which…
We propose a novel method for comparing non-aligned graphs of different sizes, based on the Wasserstein distance between graph signal distributions induced by the respective graph Laplacian matrices. Specifically, we cast a new formulation…
We present a criterion for the stochastic completeness of a submanifold in terms of its distance to a hypersurface in the ambient space. This relies in a suitable version of the Hessian comparison theorem. In the sequel we apply a…
The convergence rate in Wasserstein distance is estimated for the empirical measures of symmetric semilinear SPDEs. Unlike in the finite-dimensional case that the convergence is of algebraic order in time, in the present situation the…
To determine the relative position of any two surfaces in a system, one approach is to useoperations (Minkowski sum and intersection) on sets of constraints. These constraints aremade compliant with half-spaces of R^n where each set of…
Computing Wasserstein barycenters (a.k.a. Optimal Transport barycenters) is a fundamental problem in geometry which has recently attracted considerable attention due to many applications in data science. While there exist polynomial-time…
The goal of the present paper is to discuss new transport inequalities for convex measures. We retrieve some dimensional forms of Brascamp-Lieb inequalities. We also give some quantitative forms involving the Wasserstein's distances.
In this paper, we apply the framework of optimal transport to the formulation of optimal design problems. By considering the Wasserstein space as a set of design variables, we associate each probability measure with a shape configuration of…
We consider the problem of approximating the solution of variational problems subject to the constraint that the admissible functions must be convex. This problem is at the interface between convex analysis, convex optimization, variational…
The main purpose of this paper is to study the NP-complete subset-sum problem, not in the usual context of time-complexity-based classification of the algorithms (exponential/polynomial), but through a new kind of algorithmic classification…
In this work, we propose a novel approach for subgraph matching, the problem of finding a given query graph in a large source graph, based on the fused Gromov-Wasserstein distance. We formulate the subgraph matching problem as a partial…
In this paper, we are concerned with the problem of creating flattening maps of simply-connected open surfaces in $\mathbb{R}^3$. Using a natural principle of density diffusion in physics, we propose an effective algorithm for computing…
We provide a simple $C^{1,1}$ approximation of the squared Wasserstein distance on R^d when one of the two measures is fixed. This approximation converges locally uniformly. More importantly, at points where the differential of the squared…
We propose a new similarity measure between texts which, contrary to the current state-of-the-art approaches, takes a global view of the texts to be compared. We have implemented a tool to compute our textual distance and conducted…
Demoulin surfaces in real projective $3$-space are investigated. Our result enable us to establish a generalized Weierstrass type representation for definite Demoulin surfaces by virtue of primitive maps into a certain semi-Riemannian…
One of basic difficulties of machine learning is handling unknown rotations of objects, for example in image recognition. A related problem is evaluation of similarity of shapes, for example of two chemical molecules, for which direct…
Making sense of Wasserstein distances between discrete measures in high-dimensional settings remains a challenge. Recent work has advocated a two-step approach to improve robustness and facilitate the computation of optimal transport, using…
Mesh deformation plays a pivotal role in many 3D vision tasks including dynamic simulations, rendering, and reconstruction. However, defining an efficient discrepancy between predicted and target meshes remains an open problem. A prevalent…
Exploiting geometric structure to improve the asymptotic complexity of discrete assignment problems is a well-studied subject. In contrast, the practical advantages of using geometry for such problems have not been explored. We implement…
We introduce a principled way of computing the Wasserstein distance between two distributions in a federated manner. Namely, we show how to estimate the Wasserstein distance between two samples stored and kept on different devices/clients…