Réunion d'hiver SMC 2020

Montréal, 4 - 7 décembre 2020

Transport Optimal et Applications
Org: Jun Kitagawa (Michigan State) et Abbas Momeni (Carleton)
[PDF]

FARHAN ABEDIN, Michigan State University
Exponential Convergence of Parabolic Optimal Transport on Bounded Domains  [PDF]

I will speak about joint work with Jun Kitagawa on the asymptotic behavior of solutions to a parabolic version of the optimal mass transport problem. Our main result is an exponential rate of convergence for solutions of the evolution equation to the stationary solution of the optimal transport problem. The key ingredient we use is a global differential Harnack inequality for a special class of functions that solve the linearized problem. I will discuss the proof of this differential Harnack inequality in the case of domains with boundary, and show how it implies the desired exponential convergence result.

RENÉ CABRERA, University of Massachusetts Amherst
The Monge-Kantorovich Optimal Transportation of Mass Problem on Rectifiable Continuous Paths  [PDF]

The Monge-Kantorovich problem (MKP) is the study of transferring mass from an initial location to a final location in the most efficient way possible. Essentially, in the classical MKP we are a priori transferring mass along straight lines. But suppose that we now want to transfer mass along paths. In this talk, we present the MKP along paths and show that minimizers exist using a coercivity property. We consider maps $\Gamma(x,t):=(\gamma(x))(t)$ defined on the space of paths such that $\Gamma(x, 0)=x$ and $\Gamma(x, 1)=T(x)$, where $T$ pushes forward $\mu_{0}$ to $\mu_{1}$---probability measures on $\overline{B}_{R}(0)$. Then for given transference plan on the space of paths, $\pi_{\Gamma}=\Gamma_{\sharp}\mu_{0}$, MKP takes the form $\int c(\gamma)\;d\pi(\gamma)=\int c(\Gamma)\;d\mu_{0}$. When the cost is $c(\gamma):=\int_{0}^{1}\frac{1}{2}|\dot{\gamma}|^{2}$, perturbations and optimality conditions of $\Gamma$ show $\pi_{\Gamma}$ concentrates on constant speed geodesics. Then we untrivialize the problem on paths by adding congestion with interaction term: $\mathcal{E}(\pi):=\int c(\gamma)d\pi(\gamma)+\int \int \int_{0}^{1}\;u(|\gamma(t)-\sigma(t)|)\;dtd\pi(\gamma)d\pi(\sigma)$ between paths $\sigma$'s, keeping $\gamma$ fixed, with different endpoints. Here we require $u$ to satisfying a Lipschitz condition. The methods that we used to prove existence of minimizers for MKP on paths apply equally well to this new formulation. Formally, the minimizers of $\mathcal{E}(\pi)$ are solutions of $-\partial_{tt}\Gamma(x,t)+\int\;u^{\prime}(|\Gamma(x,t)-\Gamma(y,t)|)\frac{\Gamma(x,t)-\Gamma(y,t)}{|\Gamma(x,t)-\Gamma(y,t)|}\;d\mu_{0}(y)=0$.

KATY CRAIG, University of California, Santa Barbara
A blob method for spatially inhomogeneous degenerate diffusion and applications to sampling and two layer neural networks.  [PDF]

Given a desired target distribution on Euclidean space and an initial guess of that distribution, composed of finitely many samples from Euclidean space, what is the best way to move the locations of the samples so that they more accurately represent the desired distribution? A classical solution to this problem is to allow the samples to evolve according to Langevin dynamics, the stochastic particle method for approximating solutions of the Fokker-Planck equation. In today’s talk, I will introduce an alternative deterministic particle method for approximating solutions of a spatially inhomogeneous porous medium equation. This method corresponds exactly to the mean-field dynamics of training a two layer neural network for a radial basis function activation function. We prove that, as the number of samples increases and the variance of the radial basis function goes to zero, the particle method converges to a bounded entropy solution of the porous medium equation. As a consequence, we both obtain a novel method for sampling probability distributions as well as insight into the dynamics of training two layer neural networks in the mean field regime, including conditions on which the limiting energy is strongly convex. This is joint work with Karthik Elamvazhuthi (UCLA), Matt Haberland (Cal Poly), and Olga Turanova (Michigan State).

LUIGI DE PASCALE, University of Firenze
The relaxation of the Coulomb multi-marginal optimal transport cost and applications  [PDF]

Multi-marginal optimal transport costs are relevant for several applications. In particular the Coulomb repulsive cost play a role in certain energies in quantum mechanics. Some times, these energies don't allow to obtain compactness in the space of probability measures and then one needs to define, in a physically meaningful way, the transport cost for a sub-probability measure. After describing briefly the motivations, I will introduce the problem and two formula for the relaxed cost. If time allows I'll address the dual problem for the relaxed functional too. (From joints works with Guy Bouchitté, Giuseppe Buttazzo and Thierry Champion).

ALFRED GALICHON, New York University
Equilibrium transport with entropic regularization  [PDF]

In this talk, I will introduce and motivate the equilibrium transport problem, which is a generalization of the optimal transport problem, and I will focus on its entropic regularization. I will show the existence and uniqueness of a solution to a generalization of the Schrodinger-Bernstein system, and I will provide an algorithm to compute it. Based on joint work with Eugene Choo, Charles Liang, and Simon Weber.

SEONGHYEON JEONG, Michigan State University
Equivalence of the synthetic MTW conditions  [PDF]

I will present about the synthetic MTW conditions, Loerper's condition introduced by G. Loeper in 09 and QQconv introduced by N. Guillen and J. Kitagawa in 15. I will show that the two synthetic MTW conditions are equivalent when the regularity of the cost function is weaker than $C^3$.

YASH JHAVERI, Columbia University
On the (in)stability of the identity map in optimal transportation  [PDF]

In the optimal transport problem, it is well-known that the geometry of the target domain plays a crucial role in the regularity of the optimal transport. In the quadratic cost case, for instance, Caffarelli showed that having a convex target domain is essential in guaranteeing the optimal transport’s continuity. In this talk, we shall explore how, quantitatively, important convexity is in producing continuous optimal transports.

YOUNG-HEON KIM, The University of British Columbia
Optimal transport for dendritic structures  [PDF]

Optimal transport gives an effective way to make geometric averages of different shapes, by giving a metric barycentre of a distribution over the space of probability measures. This metric barycentre is called the Wasserstein barycentre. We will discuss how this notion can be applied to studying dendritic structures, such as plant roots. Based on joint work with Brendan Pass (U. Alberta) and David Schneider (U. Saskatchewan).

TONGSEOK LIM, Purdue University
Geometry of interaction energy minimizers  [PDF]

An interaction energy is a quadratic function defined on a domain of probability measures. We study geometry and uniqueness of interaction energy minimizers on $\mathbb{R}^n$, $\mathbb{S}^n$, or $\mathbb{RP}^n$. This talk is based on a sequence of joint works with Robert J. McCann.

ROBERT MCCANN, University of Toronto
Inscribed radius bounds for lower Ricci bounded metric measure spaces with mean convex boundary  [PDF]

Consider an essentially nonbranching metric measure space with the measure contraction property of Ohta and Sturm. We prove a sharp upper bound on the inscribed radius of any subset whose boundary has a suitably signed lower bound on its generalized mean curvature. This provides a nonsmooth analog of results dating back to Kasue (1983) and subsequent authors. We prove a stability statement concerning such bounds and --- in the Riemannian curvature-dimension (RCD) setting --- characterize the cases of equality. This represents joint work with Annegret Burtscher, Christian Ketterer and Eric Woolgar.