Optimal Transport Divergences induced by Scoring Functions
We employ scoring functions, used in statistics for eliciting risk functionals, as cost functions in the Monge-Kantorovich (MK) optimal transport problem. This gives raise to a rich variety of novel asymmetric MK divergences, which subsume the family of Bregman-Wasserstein divergences. We show that for distributions on the real line, the comonotonic coupling is optimal for the majority of the new divergences. Specifically, we derive the optimal coupling of the MK divergences induced by functionals including the mean, generalised quantiles, expectiles, and shortfall measures. Furthermore, we show that while any elicitable law-invariant coherent risk measure gives raise to infinitely many MK divergences, the comonotonic coupling is simultaneously optimal. The novel MK divergences, which can be efficiently calculated, open an array of applications in robust stochastic optimisation. We derive sharp bounds on distortion risk measures under a Bregman-Wasserstein divergence constraint, and solve for cost-efficient payoffs under benchmark constraints.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Relaxation of optimal transport problem via strictly convex functions
An optimal transport problem on finite spaces is a linear program. Recently, a relaxation of the optimal transport problem via strictly convex functions, especially via the Kullback--Leibler divergence, sheds new light o…
Transport f divergences
We define a class of divergences to measure differences between probability density functions in one-dimensional sample space. The construction is based on the convex function with the Jacobi operator of mapping function…
Optimal transport with $f$-divergence regularization and generalized Sinkhorn algorithm
Entropic regularization provides a generalization of the original optimal transport problem. It introduces a penalty term defined by the Kullback-Leibler divergence, making the problem more tractable via the celebrated S…
Statistical Guarantees for Distributionally Robust Optimization with Optimal Transport and OT-Regularized Divergences
We study finite-sample statistical performance guarantees for distributionally robust optimization (DRO) with optimal transport (OT) and OT-regularized divergence model neighborhoods. Specifically, we derive concentratio…
Adversarial RobustnessDivergences induced by dual subtractive and divisive normalizations of exponential families and their convex deformations
Exponential families are statistical models which are the workhorses in statistics, information theory, and machine learning among others. An exponential family can either be normalized subtractively by its cumulant or f…