no code implementations • 1 May 2024 • Daniel Bartl, Stephan Eckstein
We address the problem of estimating the expected shortfall risk of a financial loss using a finite number of i. i. d.
no code implementations • 7 Nov 2023 • Stephan Eckstein
Motivated by the entropic optimal transport problem in unbounded settings, we study versions of Hilbert's projective metric for spaces of integrable functions of bounded growth.
no code implementations • 30 Aug 2022 • Stephan Eckstein, Marcel Nutz
We study the convergence of divergence-regularized optimal transport as the regularization parameter vanishes.
no code implementations • 17 Mar 2022 • Stephan Eckstein, Armin Iske, Mathias Trabs
We apply the general stability result to principal component analysis (PCA).
2 code implementations • NeurIPS 2020 • Luca De Gennaro Aquino, Stephan Eckstein
We study MinMax solution methods for a general class of optimization problems related to (and including) optimal transport.
no code implementations • 29 Sep 2020 • Stephan Eckstein
This note shows that, for a fixed Lipschitz constant $L > 0$, one layer neural networks that are $L$-Lipschitz are dense in the set of all $L$-Lipschitz functions with respect to the uniform norm on bounded sets.
no code implementations • 27 Aug 2019 • Stephan Eckstein, Michael Kupper
We study a variant of the martingale optimal transport problem in a multi-period setting to derive robust price bounds of a financial derivative.
no code implementations • 1 Nov 2018 • Stephan Eckstein, Michael Kupper, Mathias Pohl
We work with the set of distributions that are both close to the given reference measure in a transportation distance (e. g. the Wasserstein distance), and additionally have the correct marginal structure.
1 code implementation • 23 Feb 2018 • Stephan Eckstein, Michael Kupper
This paper presents a widely applicable approach to solving (multi-marginal, martingale) optimal transport and related problems via neural networks.