arXiv · 2306.15524
Robust Wasserstein Optimization and its Application in Mean-CVaR
Abstract
We refer to recent inference methodology and formulate a framework for solving the distributionally robust optimization problem, where the true probability measure is inside a Wasserstein ball around the empirical measure and the radius of the Wasserstein ball is determined by the empirical data. We transform the robust optimization into a non-robust optimization with a penalty term and provide the selection of the Wasserstein ambiguity set's size. Moreover, we apply this framework to the robust mean-CVaR optimization problem and the numerical experiments of the US stock market show impressive results compared to other popular strategies.
Explore related subjects
Keep this discovery
Xin Hai, Kihun Nam. 2023-06-27. Robust Wasserstein Optimization and its Application in Mean-CVaR. https://arxiv.org/abs/2306.15524
Cite the original work for its findings. Save a collection to share your selection of sources.