اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe boundary method for semi-discrete optimal transport partitions and Wasserstein distance computation
78
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We introduce a new technique, which we call the boundary method, for solving semi-discrete optimal transport problems with a wide range of cost functions. The boundary method reduces the effective dimension of the problem, thus improving complexity. For cost functions equal to a p-norm with p in (1,infinity), we provide mathematical justification, convergence analysis, and algorithmic development. Our testing supports the boundary method with these p-norms, as well as other, more general cost functions.
قيم البحث
اقرأ أيضاً
We give a new and constructive proof of the existence of global-in-time weak solutions of the 3-dimensional incompressible semi-geostrophic equations (SG) in geostrophic coordinates, for arbitrary initial measures with compact support. This new proof
, based on semi-discrete optimal transport techniques, works by characterising discrete solutions of SG in geostrophic coordinates in terms of trajectories satisfying an ordinary differential equation. It is advantageous in its simplicity and its explicit relation to Eulerian coordinates through the use of Laguerre tessellations. Using our method, we obtain improved time-regularity for a large class of discrete initial measures, and we compute explicitly two discrete solutions. The method naturally gives rise to an efficient numerical method, which we illustrate by presenting simulations of a 2-dimensional semi-geostrophic flow in geostrophic coordinates generated using a numerical solver for the semi-discrete optimal transport problem coupled with an ordinary differential equation solver.
Numerical approximation of a general class of nonlinear unidirectional wave equations with a convolution-type nonlocality in space is considered. A semi-discrete numerical method based on both a uniform space discretization and the discrete convoluti
on operator is introduced to solve the Cauchy problem. The method is proved to be uniformly convergent as the mesh size goes to zero. The order of convergence for the discretization error is linear or quadratic depending on the smoothness of the convolution kernel. The discrete problem defined on the whole spatial domain is then truncated to a finite domain. Restricting the problem to a finite domain introduces a localization error and it is proved that this localization error stays below a given threshold if the finite domain is large enough. For two particular kernel functions, the numerical examples concerning solitary wave solutions illustrate the expected accuracy of the method. Our class of nonlocal wave equations includes the Benjamin-Bona-Mahony equation as a special case and the present work is inspired by the previous work of Bona, Pritchard and Scott on numerical solution of the Benjamin-Bona-Mahony equation.
Projection robust Wasserstein (PRW) distance, or Wasserstein projection pursuit (WPP), is a robust variant of the Wasserstein distance. Recent work suggests that this quantity is more robust than the standard Wasserstein distance, in particular when
comparing probability measures in high-dimensions. However, it is ruled out for practical application because the optimization model is essentially non-convex and non-smooth which makes the computation intractable. Our contribution in this paper is to revisit the original motivation behind WPP/PRW, but take the hard route of showing that, despite its non-convexity and lack of nonsmoothness, and even despite some hardness results proved by~citet{Niles-2019-Estimation} in a minimax sense, the original formulation for PRW/WPP textit{can} be efficiently computed in practice using Riemannian optimization, yielding in relevant cases better behavior than its convex relaxation. More specifically, we provide three simple algorithms with solid theoretical guarantee on their complexity bound (one in the appendix), and demonstrate their effectiveness and efficiency by conducing extensive experiments on synthetic and real data. This paper provides a first step into a computational theory of the PRW distance and provides the links between optimal transport and Riemannian optimization.
In this paper, we propose a numerical method to solve the classic $L^2$-optimal transport problem. Our algorithm is based on use of multiple shooting, in combination with a continuation procedure, to solve the boundary value problem associated to the
transport problem. We exploit the viewpoint of Wasserstein Hamiltonian flow with initial and target densities, and our method is designed to retain the underlying Hamiltonian structure. Several numerical examples are presented to illustrate the performance of the method.
We provide a survey of recent results on model calibration by Optimal Transport. We present the general framework and then discuss the calibration of local, and local-stochastic, volatility models to European options, the joint VIX/SPX calibration pr
oblem as well as calibration to some path-dependent options. We explain the numerical algorithms and present examples both on synthetic and market data.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
