Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

200400599799 · Jun 202019922001200920172026
48 results for CVaR optimization

Improved portfolio optimization using VaR and CVaR with NMVM models.

problem Optimizing portfolios with VaR and CVaR under NMVM distributions.
method Transformed mean-CVaR-skewness problems into quadratic optimization with closed-form solutions for NMVM models.
result Approximate closed-form expressions for VaR and CVaR of NMVM portfolios.

Conditional Value at Risk (CVaR) is a prominent risk measure that is being used extensively in various domains. We develop a new formula for the gradient of the CVaR in the form of a conditional expectation. Based on this formula, we propose a novel sampling-based estimator for the CVaR gradient, in the spirit of the l…

2014-04-15abs ↗pdf ↗

SAA method solves insurance portfolio optimization with CVaR constraints.

problem Optimal allocation under CVaR constraint in insurance.
method Sample Average Approximation (SAA) method applied to CVaR constrained portfolio optimization.
result Convergence of SAA method and solution uniqueness proved under mild assumptions.

Study a continuous portfolio optimization with a new CVaR-like constraint using martingale approach.

problem Optimizing a portfolio under a new CVaR-like constraint that is not compatible with traditional methods.
method Follows a martingale approach in a complete market setting, solving a convex constrained minimization problem.
result Obtains a tractable and interpretable characterization of the optimal strategy.

New model approximates sparse mean-CVaR portfolio optimization efficiently.

problem NP-hard 0\ell_0-constrained mean-CVaR optimization.
method Proximal alternating linearized minimization algorithm with nested fixed-point proximity.
result The model offers a guaranteed approximation of the 0\ell_0-constrained mean-CVaR model.

We solve robust optimization problems using Wasserstein balls and apply it to mean-CVaR optimization.

problem Distributionally robust optimization with Wasserstein ambiguity sets.
method Transformed robust optimization into non-robust with penalty term, selecting ambiguity set size.
result Impressive results in robust mean-CVaR optimization compared to other strategies.

We introduce performance-based regularization (PBR), a new approach to addressing estimation risk in data-driven optimization, to mean-CVaR portfolio optimization. We assume the available log-return data is iid, and detail the approach for two cases: nonparametric and parametric (the log-return distribution belongs in …

2011-11-09abs ↗pdf ↗

Privacy affects how much data is needed for CVaR optimization.

problem Privacy constraints impact the effective sample size for CVaR optimization.
method Analyzes the privacy-relevant sample size and decomposes CVaR excess risk.
result The effective private tail sample size is εnτ, affecting CVaR learning rates.

Value-at-Risk (VaR) and Conditional Value-at-Risk (CVaR) are popular risk measures from academic, industrial and regulatory perspectives. The problem of minimizing CVaR is theoretically known to be of Neyman-Pearson type binary solution. We add a constraint on expected return to investigate the Mean-CVaR portfolio sele…

2013-08-10abs ↗pdf ↗

Proposes risk-averse learning framework using CVaR for better performance evaluation.

problem Risk-averse evaluation of machine learning algorithms.
method Develops algorithms based on stochastic gradient descent for CVaR optimization with weaker distributional assumptions.
result Shows convergence and generalization bounds for the proposed algorithms.

The problem of data uncertainty has motivated the incorporation of robust optimization in various arenas, beyond the Markowitz portfolio optimization. This work presents the extension of the robust optimization framework for the minimization of downside risk measures, such as Value-at-Risk (VaR) and Conditional Value-a…

2019-08-14abs ↗pdf ↗

This thesis presents the Conditional Value-at-Risk concept and combines an analysis that covers its application as a risk measure and as a vector norm. For both areas of application the theory is revised in detail and examples are given to show how to apply the concept in practice. In the first part, CVaR as a risk mea…

2015-10-31abs ↗pdf ↗

Paper proposes an algorithm to optimize CVaR using retrospective approximation and importance sampling.

problem Optimizing risk-averse problems with large sample requirements for CVaR.
method Retrospective approximation combined with importance sampling, tailored for CVaR optimization.
result The proposed algorithm reduces variance efficiently and is computationally efficient.

This work analyzes CVaR under heavy-tailed data, providing generalization and robustness bounds.

problem Understanding CVaR's behavior under heavy-tailed data and rare high-impact losses.
method Learning-theoretic analysis of CVaR-based empirical risk minimization.
result Sharp, high-probability generalization and excess risk bounds under minimal moment assumptions.

We study a risk-constrained version of the stochastic shortest path (SSP) problem, where the risk measure considered is Conditional Value-at-Risk (CVaR). We propose two algorithms that obtain a locally risk-optimal policy by employing four tools: stochastic approximation, mini batches, policy gradients and importance s…

2014-05-12abs ↗pdf ↗

Quantum algorithms for CVaR portfolio optimization face trade-offs between hardware coherence and expressibility.

problem Quantum algorithmic resilience for CVaR portfolio optimization
method WS-QAOA vs. HE-VQNN
result WS-QAOA provides exact theoretical mapping but suffers from hardware decoherence, while HE-VQNN preserves hardware coherence but lacks expressibility.

The entropic value-at-risk (EVaR) is a new coherent risk measure, which is an upper bound for both the value-at-risk (VaR) and conditional value-at-risk (CVaR). As important properties, the EVaR is strongly monotone over its domain and strictly monotone over a broad sub-domain including all continuous distributions, wh…

2017-08-18abs ↗pdf ↗

New algorithms optimize risk for large datasets, improving efficiency.

problem Optimizing risk for large datasets with robust methods.
method Proposed algorithms for distributionally robust optimization with CVaR and χ² divergence uncertainty sets.
result Algorithms require independent gradient evaluations of training set size and parameters, suitable for large-scale applications.

New approach uses SGLD to minimize CVaR for portfolio weights.

problem Minimizing CVaR for portfolio weights with complete theoretical guarantees.
method Stochastic Gradient Langevin Dynamics (SGLD) with discontinuous updating.
result Theoretical guarantees for convergence in Wasserstein distances for convex and non-convex functions.

We propose and analyze StoROO, an algorithm for risk optimization on stochastic black-box functions derived from StoOO. Motivated by risk-averse decision making fields like agriculture, medicine, biology or finance, we do not focus on the mean payoff but on generic functionals of the return distribution. We provide a g…

2019-04-17abs ↗pdf ↗

We consider continuous-time stochastic optimal control problems featuring Conditional Value-at-Risk (CVaR) in the objective. The major difficulty in these problems arises from time-inconsistency, which prevents us from directly using dynamic programming. To resolve this challenge, we convert to an equivalent bilevel op…

2015-12-16abs ↗pdf ↗

Optimal algorithm identifies best arm for risk measures in heavy-tailed distributions.

problem Identifying the arm with smallest CVaR, VaR, or weighted sum of CVaR and mean from heavy-tailed distributions.
method Multi-armed bandit best-arm identification framework, solving non-convex optimization problem.
result Optimal δ-correct algorithm with matching lower bound on expected samples.

The paper optimizes risk-sensitive RL with CVaR, achieving near-minimax-optimal results.

problem Optimizing risk-sensitive reinforcement learning with CVaR objective.
method Developed algorithms for multi-arm bandits and online RL in MDPs, achieving near-minimax-optimal regret.
result Achieved near-minimax-optimal regret of O(τ1SAK)O(τ^{-1}\sqrt{SAK}) for constant ττ.

Optimizes dynamic investment portfolios with correlated jumps.

problem Maximizing expected terminal wealth in a multivariate Merton model with dependent jumps.
method Approximating CVaR with comonotonic bounds and maximizing expected terminal wealth.
result Improved optimization of dynamic investment portfolios.

RL-CVaR model improves insurance reserving under economic stress.

problem Managing insurance reserve setting under claim development uncertainty and macroeconomic stress.
method Reinforcement Learning (PPO) with CVaR constraints, trained under regime-aware curriculum.
result RL-CVaR policy reduces solvency violations and tail-risk compared to classical methods.

This paper analyzes ETFs with Taiwan exposure, finding heavy tails and asymmetric volatility.

problem Heavy tails and asymmetric volatility in Taiwan-related ETFs.
method Tail-risk diagnostics, asymmetric volatility modeling, and portfolio optimization under mean--variance and CVaR criteria.
result CVaR optimization produces more concentrated allocations, favoring SMH during the post-COVID AI-driven expansion.

End-to-end framework optimizes financial metrics using neural networks.

problem Difficult portfolio optimization in financial markets due to non-stationarity and high costs.
method Directly optimizes differentiable financial metrics via neural networks, incorporating realistic costs and rebalancing.
result Best model achieves +7.86% total return, outperforming S&P 500 by 12.38 percentage points.

This paper analyzes risk-sensitive reinforcement learning with Conditional Value-at-Risk (CVaR) for robust Markov Decision Processes.

problem Risk-sensitive reinforcement learning for robust Markov Decision Processes (RMDPs) with state-action-dependent ambiguity sets.
method The paper establishes a connection between robustness and risk sensitivity, defining a new risk measure NCVaR and proposing value iteration algorithms.
result The proposed approach using NCVaR optimization and value iteration algorithms can solve problems with state-action-dependent ambiguity sets.

Study enhances robustness of In-CVaR based regression models under perturbation and contamination.

problem Enhancing robustness of nonlinear regression models under perturbation and contamination.
method Introduces interval conditional value-at-risk (In-CVaR) and rigorously analyzes its robustness properties under both perturbation and contamination.
result The In-CVaR based estimator is qualitatively robust in terms of the Prokhorov metric if and only if the largest portion of losses is trimmed.

New method for optimizing risk in financial models using Fourier transforms.

problem Optimizing risk in financial models with multi-period mean-CVaR.
method Strictly monotone 2D integration scheme via Fourier-trained transition kernels.
result Established robust and accurate optimization method for financial models.