SearcharxivSearch

arXiv subjects

Quentin Mérigot

Publications and source records attributed to Quentin Mérigot.

At least 19 recordsLinked to original sources

Gluing methods for quantitative stability of optimal transport maps

We establish quantitative stability bounds for the quadratic optimal transport map $T_μ$ between a fixed probability density $ρ$ and a probability measure $μ$ on $\mathbb{R}^d$. Under general assumptions on $ρ$, we prove that the map $μ\mapsto T_μ$ is bi-Hölder continuous, with dimension-free Hölder exponents. The linearized optimal transport metric $W_{2,ρ}(μ,ν)=\|T_μ-T_ν\|_{L^2(ρ)}$ is therefore bi-Hölder equivalent to the $2$-Wasserstein distance, which justifies its use in applications. We show this property in the following cases: (i) for any log-concave density $ρ$ with full support in $\mathbb{R}^d$, and any log-bounded perturbation thereof; (ii) for $ρ$ bounded away from $0$ and $+\infty$ on a John domain (e.g., on a bounded Lipschitz domain), while the only previously known result of this type assumed convexity of the domain; (iii) for some important families of probability densities on bounded domains which decay or blow-up polynomially near the boundary. Concerning the sharpness of point (ii), we also provide examples of non-John domains for which the Brenier potentials do not satisfy any Hölder stability estimate. Our proofs rely on local variance inequalities for the Brenier potentials in small convex subsets of the support of $ρ$, which are glued together to deduce a global variance inequality. This gluing argument is based on two different strategies of independent interest: one of them leverages the properties of the Whitney decomposition in bounded domains, the other one relies on spectral graph theory.

math.AP

Semi-discrete convex order and Laguerre tessellation fitting

Laguerre tessellations offer an efficient way to parameterize a large class of convex partitions of Euclidean space using only a set of points and scalar weights. For this reason, they have become popular in computational geometry, imaging and numerical analysis, both as a modeling and a discretization tool. In this paper we study the problem of reconstructing a Laguerre tessellation with prescribed cell volumes from the barycenters of its cells. We establish a geometric interpretation of this problem in terms of the set of discrete measures dominated in convex order by an absolutely continuous measure. In particular, we show that the reconstruction problem can be solved approximately by computing a Wasserstein projection onto this set. More generally, our method can also be applied to fit a Laguerre tessellation to an arbitrary set of barycenters. We give a concrete application of this in materials science, of fitting a Laguerre tessellation to an electron backscatter diffraction (EBSD) image of a steel.

math.OC

Highly Data Parallelizable Estimation of the Sliced-Wasserstein Distance Using Cumulative Distribution Functions

The Sliced Wasserstein (SW) distance has emerged as a computationally attractive alternative to the Wasserstein distance by leveraging one-dimensional optimal transport along random projections. Standard estimators of the SW distance rely on Monte Carlo averages of one-dimensional Wasserstein distances computed via quantile functions, which require sorting projected samples and access to full datasets. In this work, we introduce a new class of estimators for the Sliced Wasserstein distance based on cumulative distribution functions (CDFs) of projected measures, that avoid sorting and scale via massive dataset parallelism. This class includes several estimators, some of them being indexed by hyperparameters controlling their variance or smoothness. We show that they are especially well suited to scenarios in which CDFs are more tractable than quantile functions, such as mixtures of Gaussians, and moreover that they are also naturally compatible with federated learning, since CDFs of projected data can be computed and aggregated locally without requiring the exchange of raw samples.

stat.ML

Polynomial diagrams for microstructure modelling

We formulate a framework of polynomial diagrams, which are a generalisation of power diagrams (PDs) and anisotropic power diagrams (APDs) allowing for boundaries between cells to be algebraic curves of a prescribed degree. We show that they arise naturally from rephrasing PDs (APDs) as first-degree (second-degree) instances of linear parametrised minimisation diagrams. We also develop an efficient GPU-accelerated framework for fitting polynomial diagrams to image data using Legendre polynomials and by maximising a regularised concave objective function adapted from classical logistic regression literature. A largely self-contained analysis of the optimisation algorithm is also provided, including identification of scale and gauge invariances and the limiting objective function as the regularisation parameter vanishes. We apply the algorithm to fit polynomial diagrams to electron backscatter diffraction images of steel.

math.OC

Particle method for a nonlinear multimarginal optimal transport problem

We study a nonlinear multimarginal optimal transport problem arising in risk management, where the objective is to maximize a spectral risk measure of the pushforward of a coupling by a cost function. Although this problem is inherently nonlinear, it is known to have an equivalent linear reformulation as a multimarginal transport problem with an additional marginal. We introduce a Lagrangian particle discretization of this problem, in which admissible couplings are approximated by uniformly weighted point clouds, and marginal constraints are enforced through Wasserstein penalization. We prove quantitative convergence results for this discretization as the number of particles tends to infinity. The convergence rate is shown to be governed by the uniform quantization error of an optimal solution, and can be bounded in terms of the geometric properties of its support, notably its box dimension. In the case of univariate marginals and supermodular cost functions, where optimal couplings are known to be comonotone, we obtain sharper convergence rates expressed in terms of the asymptotic quantization errors of the marginals themselves. We also discuss the particular case of conditional value at risk, for which the problem reduces to a multimarginal partial transport formulation. Finally, we illustrate our approach with numerical experiments in several application domains, including risk management and partial barycenters, as well as some artificial examples with a repulsive cost.

math.OC

Sharp comparisons between sliced and standard $1$-Wasserstein distances

Sliced Wasserstein distances are widely used in practice as a computationally efficient alternative to Wasserstein distances in high dimensions. In this paper, motivated by theoretical foundations of this alternative, we prove quantitative estimates between the sliced $1$-Wasserstein distance and the $1$-Wasserstein distance. We construct a concrete example to demonstrate the exponents in the estimate is sharp. We also provide a general analysis for the case where slicing involves projections onto $k$-planes and not just lines.

math.ST

Large-scale semi-discrete optimal transport with distributed Voronoi diagrams

In this article, we propose a numerical method to solve semi-discrete optimal transport problems for gigantic pointsets (108 points and more). By pushing the limits by several orders of magnitude, it opens the path to new applications in cosmology, fluid simulation and data science to name but a few. The method is based on a new algorithm that computes (generalized) Voronoi diagrams in parallel and in a distributed way. First we make the simple observation that the cells defined by a subgraph of the Delaunay graph contain the Voronoi cells, and that one can deduce the missing edges from the intersections between those cells. Based on this observation, we introduce the Distributed Voronoi Diagram algorithm (DVD) that can be used on a cluster and that exchanges vertices between the nodes as need be. We also report early experimental results, demonstrating that the DVD algorithm has the potential to solve some giga-scale semi-discrete optimal transport problems encountered in computational cosmology.

physics.comp-ph

Towards Understanding Gradient Dynamics of the Sliced-Wasserstein Distance via Critical Point Analysis

In this paper, we investigate the properties of the Sliced Wasserstein Distance (SW) when employed as an objective functional. The SW metric has gained significant interest in the optimal transport and machine learning literature, due to its ability to capture intricate geometric properties of probability distributions while remaining computationally tractable, making it a valuable tool for various applications, including generative modeling and domain adaptation. Our study aims to provide a rigorous analysis of the critical points arising from the optimization of the SW objective. By computing explicit perturbations, we establish that stable critical points of SW cannot concentrate on segments. This stability analysis is crucial for understanding the behaviour of optimization algorithms for models trained using the SW objective. Furthermore, we investigate the properties of the SW objective, shedding light on the existence and convergence behavior of critical points. We illustrate our theoretical results through numerical experiments.

stat.ML

Stability of optimal transport maps on Riemannian manifolds

We prove quantitative bounds on the stability of optimal transport maps and Kantorovich potentials from a fixed source measure $ρ$ under variations of the target measure $μ$, when the cost function is the squared Riemannian distance on a Riemannian manifold. Previous works were restricted to subsets of Euclidean spaces, or made specific assumptions either on the manifold, or on the regularity of the transport maps. Our proof techniques combine entropy-regularized optimal transport with spectral and integral-geometric techniques. As some of the arguments do not rely on the Riemannian structure, our work also paves the way towards understanding stability of optimal transport in more general geometric spaces.

math.MG

Quantitative Stability of the Pushforward Operation by an Optimal Transport Map

We study the quantitative stability of the mapping that to a measure associates its pushforward measure by a fixed (non-smooth) optimal transport map. We exhibit a tight Hölder-behavior for this operation under minimal assumptions. Our proof essentially relies on a new bound that quantifies the size of the singular sets of a convex and Lipschitz continuous function on a bounded domain.

math.OC

Robust risk management via multi-marginal optimal transport

We study the problem of maximizing a spectral risk measure of a given output function which depends on several underlying variables, whose individual distributions are known but whose joint distribution is not. We establish and exploit an equivalence between this problem and a multi-marginal optimal transport problem. We use this reformulation to establish explicit, closed form solutions when the underlying variables are one dimensional, for a large class of output functions. For higher dimensional underlying variables, we identify conditions on the output function and marginal distributions under which solutions concentrate on graphs over the first variable and are unique, and, for general output functions, we find upper bounds on the dimension of the support of the solution. We also establish a stability result on the maximal value and maximizing joint distributions when the output function, marginal distributions and spectral function are perturbed; in addition, when the variables one dimensional, we show that the optimal value exhibits Lipschitz dependence on the marginal distributions for a certain class of output functions. Finally, we show that the equivalence to a multi-marginal optimal transport problem extends to maximal correlation measures of multi-dimensional risks; in this setting, we again establish conditions under which the solution concentrates on a graph over the first marginal.

math.OC

Strong c-concavity and stability in optimal transport

The stability of solutions to optimal transport problems under variation of the measures is fundamental from a mathematical viewpoint: it is closely related to the convergence of numerical approaches to solve optimal transport problems and justifies many of the applications of optimal transport. In this article, we introduce the notion of strong c-concavity, and we show that it plays an important role for proving stability results in optimal transport for general cost functions c. We then introduce a differential criterion for proving that a function is strongly c-concave, under an hypothesis on the cost introduced originally by Ma-Trudinger-Wang for establishing regularity of optimal transport maps. Finally, we provide two examples where this stability result can be applied, for cost functions taking value +$\infty$ on the sphere: the reflector problem and the Gaussian curvature measure prescription problem.

math.NA

Metasurfaces and Optimal transport

This paper provides a theoretical and numerical approach to show existence, uniqueness, and the numerical determination of metalenses refracting radiation with energy patterns. The theoretical part uses ideas from optimal transport and for the numerical solution we study and implement a damped Newton algorithm to solve the semi discrete problem. A detailed analysis is carried out to solve the near field one source refraction problem and extensions to the far field are also mentioned.

math.AP

Lagrangian discretization of crowd motion and linear diffusion

We study a model of crowd motion following a gradient vector field, with possibly additional interaction terms such as attraction/repulsion, and we present a numerical scheme for its solution through a Lagrangian discretization. The density constraint of the resulting particles is enforced by means of a partial optimal transport problem at each time step. We prove the convergence of the discrete measures to a solution of the continuous PDE describing the crowd motion in dimension one. In a second part, we show how a similar approach can be used to construct a Lagrangian discretization of a linear advection-diffusion equation, interpreted as a gradient flow in Wasserstein space. We provide also a numerical implementation in 2D to demonstrate the feasibility of the computations.

math.NA

Quantitative stability of optimal transport maps and linearization of the 2-Wasserstein space

This work studies an explicit embedding of the set of probability measures into a Hilbert space, defined using optimal transport maps from a reference probability density. This embedding linearizes to some extent the 2-Wasserstein space, and enables the direct use of generic supervised and unsupervised learning algorithms on measure data. Our main result is that the embedding is (bi-)Hölder continuous, when the reference density is uniform over a convex set, and can be equivalently phrased as a dimension-independent Hölder-stability results for optimal transport maps.

stat.ML

Light in Power: A General and Parameter-free Algorithm for Caustic Design

We present in this paper a generic and parameter-free algorithm to efficiently build a wide variety of optical components, such as mirrors or lenses, that satisfy some light energy constraints. In all of our problems, one is given a collimated or point light source and a desired illumination after reflection or refraction and the goal is to design the geometry of a mirror or lens which transports exactly the light emitted by the source onto the target. We first propose a general framework and show that eight different optical component design problems amount to solving a light energy conservation equation that involves the computation of visibility diagrams. We then show that these diagrams all have the same structure and can be obtained by intersecting a 3D Power diagram with a planar or spherical domain. This allows us to propose an efficient and fully generic algorithm capable to solve these eight optical component design problems. The support of the prescribed target illumination can be a set of directions or a set of points located at a finite distance. Our solutions satisfy design constraints such as convexity or concavity. We show the effectiveness of our algorithm on simulated and fabricated examples.

cs.GR

An algorithm for optimal transport between a simplex soup and a point cloud

We propose a numerical method to find the optimal transport map between a measure supported on a lower-dimensional subset of R^d and a finitely supported measure. More precisely, the source measure is assumed to be supported on a simplex soup, i.e. on a union of simplices of arbitrary dimension between 2 and d. As in [Aurenhammer, Hoffman, Aronov, Algorithmica 20 (1), 1998, 61--76] we recast this optimal transport problem as the resolution of a non-linear system where one wants to prescribe the quantity of mass in each cell of the so-called Laguerre diagram. We prove the convergence with linear speed of a damped Newton's algorithm to solve this non-linear system. The convergence relies on two conditions: (i) a genericity condition on the point cloud with respect to the simplex soup and (ii) a (strong) connectedness condition on the support of the source measure defined on the simplex soup. Finally, we apply our algorithm in R^3 to compute optimal transport plans between a measure supported on a triangulation and a discrete measure. We also detail some applications such as optimal quantization of a probability density over a surface, remeshing or rigid point set registration on a mesh.

cs.CG

Convergence of a Newton algorithm for semi-discrete optimal transport

Many problems in geometric optics or convex geometry can be recast as optimal transport problems: this includes the far-field reflector problem, Alexandrov's curvature prescription problem, etc. A popular way to solve these problems numerically is to assume that the source probability measure is absolutely continuous while the target measure is finitely supported. We refer to this setting as semi-discrete optimal transport. Among the several algorithms proposed to solve semi-discrete optimal transport problems, one currently needs to choose between algorithms that are slow but come with a convergence speed analysis (e.g. Oliker-Prussner) or algorithms that are much faster in practice but which come with no convergence guarantees Algorithms of the first kind rely on coordinate-wise increments and the number of iterations required to reach the solution up to an error of $ε$ is of order $N^3/ε$, where $N$ is the number of Dirac masses in the target measure. On the other hand, algorithms of the second kind typically rely on the formulation of the semi-discrete optimal transport problem as an unconstrained convex optimization problem which is solved using a Newton or quasi-Newton method. The purpose of this article is to bridge this gap between theory and practice by introducing a damped Newton's algorithm which is experimentally efficient and by proving the global convergence of this algorithm with optimal rates. The main assumptions is that the cost function satisfies a condition that appears in the regularity theory for optimal transport (the Ma-Trudinger-Wang condition) and that the support of the source density is connected in a quantitative way (it must satisfy a weighted Poincaré-Wirtinger inequality).

math.NA