This work provides a useful characterization of OCE that links OCE to utility-based shortfall risk (UBSR) and enables it to form an OCE estimator from the classic sample-average approximation of UBSR, and derives mean-squared error bounds for the proposed OCE estimator.
Abstract
We consider the optimization of the Optimized Certainty Equivalent (OCE) risk, with applications including portfolio optimization in finance, and uncertainty quantification, classification, and regression in machine learning. Our contributions cover popular special cases of OCE, such as entropic risk, mean-variance risk, and smooth variants of Conditional Value-at-Risk. Our treatment sets out the conditions that facilitate the extension of OCE to unbounded r.v.s.. We provide a useful characterization of OCE that links OCE to utility-based shortfall risk (UBSR). Our characterization enables us to form an OCE estimator from the classic sample-average approximation (SAA) of UBSR. We derive mean-squared error (MSE) bounds for our proposed OCE estimator. For OCE optimization, we first derive an expression for the OCE gradient using the characterization linking OCE to UBSR. This expression serves as the basis for a gradient estimator for the OCE. We derive non-asymptotic bounds on the MSE for the proposed OCE gradient estimator. We incorporate the aforementioned gradient estimator into a stochastic gradient (SG) algorithm to optimize OCE and quantify its convergence rate using non-asymptotic bounds that we derive. Finally, we present three experiments that use our OCE optimization algorithm to solve portfolio optimization and uncertainty quantification problems.
The algorithm is parameterized so as to address various stochastic formulations spanning from Expectation-focused to Value-at-Risk (VaR) as well as Conditional-Value-at-Risk (CVaR) as well as Conditional-Value-at-Risk (CVaR)-focused formulations.
This work exploits the auxiliary-threshold representation of CVaR to establish the existence of an optimal strategy and strong duality without requiring market completeness, and proves that the resulting strategies converge to the optimal control as the number of iterations tends to infinity.
An-Ran Hu, Silvana M. Pesenti, Xiaofei Shi· 0 citations
This work derives a finite-dimensional dual formulation of PrO inference that separates sampling fluctuation, approximation under a divergence budget, regularization, and numerical optimization error and uses an exactly solvable categorical example to show that predictive-risk convergence can imply convergence to a uni...
Aurya Javeed, D. Kouri, Teresa Portone et al.· 0 citations
This work argues that, in the presence of a simulation model, natural attempts to integrate variance reduction into optimization, even executed in a reasonable adaptive fashion, encounter fundamental challenges in guaranteeing realistic runtime when using common stochastic gradient descent algorithms.
We present in this article a non-parametric value-at-risk (VaR+CVaR) algorithm that remains accurate for an arbitrarily large number of underlying positions. The algorithm solves the two inherent problems of VaR estimation. First, past history is not directly applicable to the future, but all predictions of the future...
Value-at-Risk (VaR) remains a fundamental risk measure in financial risk management, providing an indicator for managing capital allocation and avoiding worst-case risk scenarios. Traditionally its defined as a quantile of the loss distribution. However, its computation depends critically on the existence and tractabil...
Jacob Stevy Seleky, L. Cahyadi, Sausan Ramadhani· Jambura Journal of Mathemati...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.