Distributionally Robust Mean-Variance Portfolio Selection with Wasserstein Distances

02/13/2018
by   Jose Blanchet, et al.
0

We revisit Markowitz's mean-variance portfolio selection model by considering a distributionally robust version, where the region of distributional uncertainty is around the empirical measure and the discrepancy between probability measures is dictated by the so-called Wasserstein distance. We reduce this problem into an empirical variance minimization problem with an additional regularization term. Moreover, we extend recent inference methodology in order to select the size of the distributional uncertainty as well as the associated robust target return rate in a data-driven way.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/19/2017

Doubly Robust Data-Driven Distributionally Robust Optimization

Data-driven Distributionally Robust Optimization (DD-DRO) via optimal tr...
research
06/08/2020

Distributional Robustness with IPMs and links to Regularization and GANs

Robustness to adversarial attacks is an important concern due to the fra...
research
06/01/2022

Distributional Convergence of the Sliced Wasserstein Process

Motivated by the statistical and computational challenges of computing W...
research
02/18/2020

Distributional Sliced-Wasserstein and Applications to Generative Modeling

Sliced-Wasserstein distance (SWD) and its variation, Max Sliced-Wasserst...
research
12/13/2020

k-Variance: A Clustered Notion of Variance

We introduce k-variance, a generalization of variance built on the machi...
research
05/02/2016

Fuzzy clustering of distribution-valued data using adaptive L2 Wasserstein distances

Distributional (or distribution-valued) data are a new type of data aris...
research
05/27/2019

Distributionally Robust Optimization and Generalization in Kernel Methods

Distributionally robust optimization (DRO) has attracted attention in ma...

Please sign up or login with your details

Forgot password? Click here to reset