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,657 papers · 148 categories

Trend · papers per month

2468 · Oct 202519922001200920172026
48 results for CVaR

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 ↗

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.

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.

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 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 ↗

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 ↗

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.

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 ↗

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.

We propose a risk-averse statistical learning framework wherein the performance of a learning algorithm is evaluated by the conditional value-at-risk (CVaR) of losses rather than the expected loss. We devise algorithms based on stochastic gradient descent for this framework. While existing studies of CVaR optimization …

2020-02-14abs ↗pdf ↗

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.

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.

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.

Quantum method improves CVaR evaluation under correlated fields.

problem Accurately evaluating CVaR in high-dimensional, correlated material uncertainty.
method Quantum-enhanced inference framework using stabilized IQAE.
result Quantum method achieves lower oracle complexity than classical methods.

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 ↗

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.

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 ↗

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.

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.

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.

Tail-Safe hedging uses reinforcement learning with a safety layer to manage financial risks.

problem Managing financial risks in derivatives trading with robustness and explainability.
method Combines distributional reinforcement learning with a CBF-QP safety layer to enforce financial constraints.
result Improves risk management without degrading central performance and avoids hard constraint violations.

This paper develops a CVaR framework for managing tail risks using puts and trend-following strategies.

problem Managing tail risks, especially crashes and drawdowns, requires different forms of protection.
method Develops a continuous-time CVaR framework that integrates long out-of-the-money put options and systematic trend-following overlays.
result Shows how convex crash protection and drawdown protection can be optimally combined in a mandate.

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 ↗

We consider a statistical model for pairs of traded assets, based on a Cointegrated Vector Auto Regression (CVAR) Model. We extend standard CVAR models to incorporate estimation of model parameters in the presence of price series level shifts which are not accurately modeled in the standard Gaussian error correction mo…

2010-08-01abs ↗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.

MARCD uses generative scenarios to improve portfolio decisions during regime shifts.

problem Improving portfolio decisions under regime shifts and drawdowns.
method MARCD employs a Gaussian HMM for regime inference, a diffusion generator for scenario production, and a CVaR allocator with tail-weighted and crisis-aware components.
result MARCD reduces maximum drawdowns by 34% compared to baseline methods over 2020-2025.

A declining CVaR glidepath framework for TDF design with Chilean pension system application

problem Designing Target-Date Funds around an explicit return objective while controlling risk
method Propose a framework for designing TDFs with a declining CVaR constraint
result Key feature: conservative evaluation of each glidepath

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.