Quentin Mérigot’s research while affiliated with University of Paris-Saclay and other places

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (76)


Gluing methods for quantitative stability of optimal transport maps
  • Preprint

November 2024

·

2 Reads

Cyril Letrouit

·

Quentin Mérigot

We establish quantitative stability bounds for the quadratic optimal transport map TμT_\mu between a fixed probability density ρ\rho and a probability measure μ\mu on Rd\mathbb{R}^d. Under general assumptions on ρ\rho, we prove that the map μTμ\mu\mapsto T_\mu is bi-H\"older continuous, with dimension-free H\"older exponents. The linearized optimal transport metric W2,ρ(μ,ν)=TμTνL2(ρ)W_{2,\rho}(\mu,\nu)=\|T_\mu-T_\nu\|_{L^2(\rho)} is therefore bi-H\"older 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 ρ\rho with full support in Rd\mathbb{R}^d, and any log-bounded perturbation thereof; (ii) for ρ\rho 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\"older stability estimate. Our proofs rely on local variance inequalities for the Brenier potentials in small convex subsets of the support of ρ\rho, 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.


Quantitative Stability of the Pushforward Operation by an Optimal Transport Map

July 2024

·

18 Reads

·

1 Citation

Foundations of Computational Mathematics

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.


Robust Risk Management via Multi-marginal Optimal Transport
  • Article
  • Publisher preview available

May 2024

·

34 Reads

·

5 Citations

Journal of Optimization Theory and Applications

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.

View access options


Let ρ1=12(δ(0;1)+δ(0;-1))\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\rho _1 = \frac{1}{2}(\delta _{(0; 1)} + \delta _{(0; -1)})$$\end{document}. For ε>0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon > 0$$\end{document} and xε=(1;ε/2)∈R2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$x_\varepsilon = (1; \varepsilon /2) \in \mathbb {R}^2$$\end{document}, let ρ2ε=12(δxε+δ-xε)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\rho _2^\varepsilon = \frac{1}{2}(\delta _{x^\varepsilon } + \delta _{-x^\varepsilon })$$\end{document}. Introduce Pε=12(δρ1+δρ2ε)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {P}_\varepsilon = \frac{1}{2} (\delta _{\rho _1} + \delta _{\rho _2^\varepsilon })$$\end{document}. Then for ε≤12\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon \le \frac{1}{2}$$\end{document}, W2(μPε,μP-ε)=1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textrm{W}_2(\mu _{\mathbb {P}_\varepsilon }, \mu _{\mathbb {P}_{-\varepsilon }}) = 1$$\end{document} while W1(Pε,P-ε)≤ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {W}_1(\mathbb {P}_\varepsilon , \mathbb {P}_{-\varepsilon }) \le \varepsilon $$\end{document}
Let ρ1=12(δ(0;1)+δ(0;-1))\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\rho _1 = \frac{1}{2}(\delta _{(0; 1)} + \delta _{(0; -1)})$$\end{document}. For a∈(0,1)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$a \in (0, 1)$$\end{document} and ε>0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon > 0$$\end{document}, let cε=[1-a2;1+a2]×[-a2+ε;a2+ε]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$c_\varepsilon = [1-\frac{a}{2}; 1 + \frac{a}{2}] \times [-\frac{a}{2} + \varepsilon ; \frac{a}{2} + \varepsilon ]$$\end{document} and ρ2ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\rho _2^\varepsilon $$\end{document} the probability measure with density ρ2ε(x,y)=α21-2αa1+2αy-ε2α-11cε(x,y)+y+ε2α-11-cε(x,y)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\rho _2^\varepsilon (x,y) = \frac{\alpha }{2^{1-2\alpha } a ^{1 + 2\alpha }}\left( \left| y-\varepsilon \right| ^{2\alpha -1} \mathbbm {1}_{c_\varepsilon }(x,y) + \left| y+\varepsilon \right| ^{2\alpha -1} \mathbbm {1}_{-c_\varepsilon }(x,y) \right) $$\end{document} for some α>0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha > 0$$\end{document}. Introduce Pε=12(δρ1+δρ2ε)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {P}_\varepsilon = \frac{1}{2} (\delta _{\rho _1} + \delta _{\rho _2^\varepsilon })$$\end{document}. Then for ε≤a2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varepsilon \le \frac{a}{2}$$\end{document}, W2(μP0,μPε)∼εα\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textrm{W}_2(\mu _{\mathbb {P}_0}, \mu _{\mathbb {P}_\varepsilon }) \sim \varepsilon ^{\alpha }$$\end{document} while W1(P0,Pε)≤ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {W}_1(\mathbb {P}_0, \mathbb {P}_\varepsilon ) \le \varepsilon $$\end{document}
Quantitative stability of barycenters in the Wasserstein space

October 2023

·

6 Reads

·

9 Citations

Probability Theory and Related Fields

Wasserstein barycenters define averages of probability measures in a geometrically meaningful way. Their use is increasingly popular in applied fields, such as image, geometry or language processing. In these fields however, the probability measures of interest are often not accessible in their entirety and the practitioner may have to deal with statistical or computational approximations instead. In this article, we quantify the effect of such approximations on the corresponding barycenters. We show that Wasserstein barycenters depend in a Hölder-continuous way on their marginals under relatively mild assumptions. Our proof relies on recent estimates that allow to quantify the strong convexity of the barycenter functional. Consequences regarding the statistical estimation of Wasserstein barycenters and the convergence of regularized Wasserstein barycenters towards their non-regularized counterparts are explored.


Robust risk management via multi-marginal optimal transport *

November 2022

·

33 Reads

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 reformu-lation 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, * 1 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.



Quantitative Stability of Barycenters in the Wasserstein Space

September 2022

·

15 Reads

Wasserstein barycenters define averages of probability measures in a geometrically meaningful way. Their use is increasingly popular in applied fields, such as image, geometry or language processing. In these fields however, the probability measures of interest are often not accessible in their entirety and the practitioner may have to deal with statistical or computational approximations instead. In this article, we quantify the effect of such approximations on the corresponding barycenters. We show that Wasserstein barycenters depend in a H{\"o}lder-continuous way on their marginals under relatively mild assumptions. Our proof relies on recent estimates that quantify the strong convexity of the dual quadratic optimal transport problem and a new result that allows to control the modulus of continuity of the push-forward operation under a (not necessarily smooth) optimal transport map.


Strong c-concavity and stability in optimal transport

July 2022

·

13 Reads

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.



Citations (52)


... Related work: Multimarginal Schrödinger bridge problems (MSBPs) are entropy regularized variants of the multimarginal optimal mass transport (MOMT) problems [5], [6]. The latter has been applied to learning and inference problems in chemical physics [7], [8], team matching [9], fluid dynamics [10] and risk management [11]. For recent applications of MSBPs to learning and tracking problems, see e.g., [12]- [14]. ...

Reference:

Stochastic Learning of Computational Resource Usage as Graph Structured Multimarginal Schrödinger Bridge
Robust Risk Management via Multi-marginal Optimal Transport

Journal of Optimization Theory and Applications

... Remark 5.3. When is absolutely continuous with respect to the Lebesgue measure, and T 1 and T 2 are the optimal transport maps between and 1 , and and 2 respectively, the upper bound in (5.3) is know as the linearized optimal transport distance (see [DM23,JCP23] and the references therein). The proof of Lemma 5.4 is involved, so we postpone it to Appendix C.7. ...

Quantitative stability of optimal transport maps under variations of the target measure
  • Citing Article
  • January 2024

Duke Mathematical Journal

... Our test statistic employs a different functional -the Multimarginal Optimal Transport program M OT [62] -which can be represented as a variance functional on the space of measures [10] and thus serves as a natural candidate for testing variability in a collection of k measures. We show that despite well-documented differences in solution structures of M OT and W p problems (Section 1.7.4 of [66]), M OT shares the same benefits as W p when it comes to the limiting behavior of its optimal value. ...

Quantitative stability of barycenters in the Wasserstein space

Probability Theory and Related Fields

... Moreover, full space discretization of the JKO scheme on fixed grids creates difficulties which do not arise in semi-discrete problems [44,19,33,46], and as a consequence the JKO time discretization is often replaced by the computationally cheaper Backward Euler scheme [13]. Lagrangian particle schemes [38,28,51] and moving meshes [45,15] on the other hand, are generally only first order accurate in space. ...

Convergence of a Lagrangian Discretization for Barotropic Fluids and Porous Media Flow
  • Citing Article
  • June 2022

SIAM Journal on Mathematical Analysis

... Recently, besides the applications of optics and economics, the theoretical and numerical aspects of GJEs themself have been extensively studied, see [9, 11-14, 19, 23-25, 36] for the theoretical aspect and [1,3,7,28,29] for the numerical aspect. So far, the study of GJEs has become an important research area. ...

A damped Newton algorithm for generated Jacobian equations

Calculus of Variations and Partial Differential Equations

... Both OF methods have one tunable parameter which defines the window in which to look for perturbations, or the number of layers in the pyramid corse-fine graining. Entropy regularised UOT has a complexity of O (n 2 log n ) (provided the entropic parameter is suitably chosen depending on the number of grid points and desired convergence criteria), and has one tunable parameter relating to locality (Berman, 2020;Mérigot and Thibert, 2020). However, unlike the LK-OF method, which handles non-matches through local squared errors, UOT allows for the destruction of mass when no match is possible or when matches are too distant. ...

Optimal transport: discretization and algorithms
  • Citing Chapter
  • November 2020

Handbook of Numerical Analysis

... The essence of this concept is the transformative Legendre transform, which highlights the symmetries between convex functions and their conjugates [2,12]. The utility of convexity is highlighted by its property of preserving inequalities, rendering it indispensable in fields such as optimization, economics, and others [4,7]. ...

One more proof of the Alexandrov–Fenchel inequality

Comptes Rendus Mathematique

... This ensures the convexity of the GSOT distance for time up to approximately τ . The assignment problem is eciently solved using the auction algorithm (Bertsekas & Castanon, 1989;Métivier et al., 2019b). The nal cost function we use for the purpose of FWI application with N s shots containing N r receivers is dened as: ...

A graph space optimal transport misfit measurement for FWI: auction algorithm, application to the 2D Valhall case study
  • Citing Conference Paper
  • June 2019

... These factors may limit the resolving powers of inversions to tightly constrain model parameters. Alternatively, new objective functions have been proposed that aim to create a broad convex region around the global minimum solution, thereby mitigating cycle-skipping issues (e.g., Dong et al., 2022;Métivier et al., 2019;Petitjean et al., 2011;Warner & Guasch, 2016;Zhu et al., 2016). ...

A graph space optimal transport distance as a generalization of Lp distances: application to a seismic imaging inverse problem
  • Citing Article
  • May 2019