A fully data-driven approach to minimizing CVaR for portfolio of assets via SGLD with discontinuous updating
arXiv:2007.01672
Abstract
A new approach in stochastic optimization via the use of stochastic gradient Langevin dynamics (SGLD) algorithms, which is a variant of stochastic gradient decent (SGD) methods, allows us to efficiently approximate global minimizers of possibly complicated, high-dimensional landscapes. With this in mind, we extend here the non-asymptotic analysis of SGLD to the case of discontinuous stochastic gradients. We are thus able to provide theoretical guarantees for the algorithm's convergence in (standard) Wasserstein distances for both convex and non-convex objective functions. We also provide explicit upper estimates of the expected excess risk associated with the approximation of global minimizers of these objective functions. All these findings allow us to devise and present a fully data-driven approach for the optimal allocation of weights for the minimization of CVaR of portfolio of assets with complete theoretical guarantees for its performance. Numerical results illustrate our main findings.
arXiv commentarXiv admin note: text overlap with arXiv:1910.02008
References in corpus (6)
- Transportation cost-information inequalities and applications to random dynamical systems and diffusions
- Non-convex learning via Stochastic Gradient Langevin Dynamics: a nonasymptotic analysis
- Efficient and fast estimation of the geometric median in Hilbert spaces with an averaged stochastic gradient algorithm
- On stochastic gradient Langevin dynamics with dependent data streams: the fully non-convex case
- Recursive estimation of the conditional geometric median in Hilbert spaces
- On stochastic gradient Langevin dynamics with dependent data streams in the logconcave case