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

138277415553 · Jun 202019922001200920172026
48 results for robustness measures

Dual representations for robust risk measures and uncertainty sets.

problem Characterizing continuity of robust risk measures and their uncertainty sets.
method Develop dual representations for robust risk measures and uncertainty sets based on distinct geometric assumptions.
result Two dual frameworks for consolidated uncertainty sets are complementary, not interchangeable.

When estimating the risk of a P&L from historical data or Monte Carlo simulation, the robustness of the estimate is important. We argue here that Hampel's classical notion of qualitative robustness is not suitable for risk measurement and we propose and analyze a refined notion of robustness that applies to tail-depend…

2012-04-11abs ↗pdf ↗

Robust variable selection for high-dimensional data with missing and measurement errors.

problem Missing data and measurement errors confound data distribution.
method Exponential loss function with inverse probability weighting and additive error models.
result The Atan punishment method improves robust variable selection.

The paper develops robust risk measures for uncertain loss positions.

problem Risk assessment for loss positions with uncertain distributions.
method Robust optimized certainty equivalents and generalized quantiles are proposed and analyzed.
result Robust expectiles with specific penalization functions are coherent risk measures.

Investigates the effects of nondominated sets of probability measures in robust models of finance.

problem Uncertainty in financial models due to multiple possible probability measures.
method Analyzes various results from mathematical finance literature under the assumption of nondominated sets of probability measures.
result Many classical results in robust models do not hold when the set of measures is nondominated.

We study issues of robustness in the context of Quantitative Risk Management and Optimization. We develop a general methodology for determining whether a given risk measurement related optimization problem is robust, which we call "robustness against optimization". The new notion is studied for various classes of risk …

2018-09-25abs ↗pdf ↗

The paper studies robust risk measures with linear penalties under uncertain distributions.

problem Risk measurement under distributional uncertainty.
method Robust distortion risk measures with linear penalty function under distributional constraints.
result Explicit characterization of optimal quantile distribution and value function.

Develops a framework for robust RL with dynamic risk measures.

problem Optimal RL strategies depend on risk preferences and model dynamics.
method Dynamic robust distortion risk measures, Wasserstein ball, neural networks, strictly consistent scoring functions, policy gradient formulae, actor-critic algorithm.
result Demonstrates improved performance in portfolio allocation example.

Bayesian approach to robust risk measures under model uncertainty.

problem Representing robust risk measures as a single probability measure.
method Introducing two types of risk measures and analyzing their relation to robust risk measures.
result Robust risk measures can be represented by a mixture probability measure, a Bayesian approach.

This paper improves the robustness of risk estimation for financial positions.

problem Ensuring robustness of risk measures in the presence of data noise.
method Proposes a quantitative approach using the Fortet-Mourier metric to quantify the variation of true probability measures.
result Derives explicit error bounds for discrepancies between laws of estimators based on true and perturbed data.

Starting from the requirement that risk measures of financial portfolios should be based on their losses, not their gains, we define the notion of loss-based risk measure and study the properties of this class of risk measures. We characterize loss-based risk measures by a representation theorem and give examples of su…

2011-10-07abs ↗pdf ↗

Paper introduces P-sensitive functions and their applications in robust optimization and financial models.

problem Developing robust models for financial and optimization problems under uncertainty.
method Introducing P-sensitive functions and their localization representations, applying to optimization and financial models.
result P-sensitive functions are precisely those that can be localized, providing a new perspective on robust modeling.

Paper quantifies distortion risk measures' robustness to distributional uncertainty.

problem Quantifying risk measures' robustness to distributional uncertainty.
method Employing isotonic projections, the paper derives bounds on distortion risk measures' values.
result Sharp bounds on distortion risk measures' values are provided, especially for Value-at-Risk and Range-Value-at-Risk.

Bayesian hierarchical models are increasing popular in economics. When using hierarchical models, it is useful not only to calculate posterior expectations, but also to measure the robustness of these expectations to reasonable alternative prior choices. We use variational Bayes and linear response methods to provide f…

2016-06-23abs ↗pdf ↗

We develop robust Markov Decision Processes with risk measures for uncertain environments.

problem Uncertainty in Markov Decision Processes and its impact on risk measures.
method Formulation as a Stackelberg game, robust cost and value iterations, existence of optimal policies.
result Existence of deterministic optimal policies for robust optimization and risk measures.

A new method optimizes robustness measures under input uncertainty using randomized Gaussian process upper confidence bound.

problem Optimizing robustness measures under input uncertainty.
method Randomized robustness measure GP-UCB (RRGP-UCB) that samples β from a chi-squared-based distribution.
result RRGP-UCB provides tight bounds on expected regret.

We characterize when a convex risk measure associated to a law-invariant acceptance set in LL^\infty can be extended to LpL^p, 1p<1\leq p<\infty, preserving finiteness and continuity. This problem is strongly connected to the statistical robustness of the corresponding risk measures. Special attention is paid to concre…

2014-01-14abs ↗pdf ↗

A new framework for robust risk measurement and portfolio optimization.

problem Uncertainty in mean-covariance space and portfolio optimization challenges.
method Modeling uncertainty with Gelbrich distance and prior structural information, related to optimal transport theory.
result Mean-covariance robust portfolio optimization simplifies to Markowitz model with a regularization term.

Proposes a new method to measure classifier robustness.

problem Measuring robustness of classifiers is crucial but challenging.
method Weighting sample importance based on difficulty and using logistic regression as a theoretical case study.
result The proposed score is independent of sample choice and measures robustness effectively.

The paper assesses quality measures for machine learning models using cross-validation.

problem Evaluating the accuracy and robustness of quality measures for machine learning models.
method Cross-validation approach to estimate prediction error and quantify explained variation. Confidence bounds and local quality measures derived from residuals.
result The reliability and robustness of quality measures are assessed through numerical examples and confidence bounds.

New measure assesses deep neural networks' robustness to adversarial attacks.

problem Deep learning's fragility to adversarial attacks limits its adoption in mission-critical applications.
method Introduces residual error as a new performance measure for assessing adversarial robustness.
result Demonstrates effectiveness of residual error in assessing robustness of deep neural networks.

The paper refines and generalizes worst-case law invariant convex risk measures.

problem Developing robust convex risk measures under uncertainty sets.
method Generalizing closed forms for worst-case law invariant convex risk measures with uncertainty sets based on norms and moment constraints.
result Explicit closed forms for convex risk measures are developed and assessed through numerical simulations.

In this paper, we propose a perturbation framework to measure the robustness of graph properties. Although there are already perturbation methods proposed to tackle this problem, they are limited by the fact that the strength of the perturbation cannot be well controlled. We firstly provide a perturbation framework on …

2018-12-03abs ↗pdf ↗

Study proposes active learning method for estimating robust regions in uncertain function evaluations.

problem Estimating robust regions for uncertain function evaluations with unknown distributions.
method Distributionally robust level-set estimation (DRPTR) with active learning.
result The proposed method efficiently identifies reliable regions with theoretical guarantees.

A framework for robust exploration in reinforcement learning under ambiguity.

problem Optimal stopping under ambiguity in reinforcement learning.
method Continuous-time robust reinforcement learning framework using gg-expectation and backward stochastic differential equations.
result Constructs a robust exploratory stopping time approximating the optimal stopping time under ambiguity.

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.

Due to the insufficient measurements in the distribution system state estimation (DSSE), full observability and redundant measurements are difficult to achieve without using the pseudo measurements. The matrix completion state estimation (MCSE) combines the matrix completion and power system model to estimate voltage b…

2019-02-06abs ↗pdf ↗

Framework for robust control under model uncertainty, improving financial derivatives hedging.

problem Model uncertainty in financial derivatives hedging.
method Dynamic programming principle for solving one-step optimization problems.
result Robust hedging strategy outperforms model-based strategies during adverse scenarios.

Bayesian framework improves robustness in nonlinear regression models.

problem Measurement error, model misspecification, and distributional misspecification in regression analyses.
method Joint Dirichlet process prior on latent covariate-response distribution, updating with posterior pseudo-samples.
result Improved stability and consistency in estimators under increasing measurement error.

Novel framework for risk-sensitive reinforcement learning with robustness against uncertainty.

problem Risk-sensitive reinforcement learning with uncertainty in transition dynamics.
method Developed a risk-sensitive robust Markov decision process (RSRMDP), derived its Bellman equation, and proposed a Bayesian Dynamic Programming (Bayesian DP) algorithm.
result Demonstrated convergence to near-optimal policies and analyzed sample and computational complexities.

The paper introduces a new measure of robustness for partially identifiable risks.

problem Achieving robustness when the robust risk is only partially identified.
method Introduces the worst-case robust risk and evaluates existing methods.
result Existing robustness methods are suboptimal in the partially identifiable case.

This paper improves active learning by using robust divergences for committee disagreement.

problem Active learning with high measurement costs.
method Query by committee with Bregman divergence (including Kullback-Leibler divergence as a special case).
result The proposed method is more robust and performs as well as or better than conventional methods.

This work improves robustness guarantees for neural networks using low rank representations.

problem Certified robustness to adversarial perturbations in neural networks.
method Low rank representations to provide improved robustness guarantees.
result Improved robustness guarantees for \ell_\infty perturbations using natural low rank representations.

Optimal transport for measures on noisy tree metrics is solved with robust approach.

problem Optimal transport problem for measures on noisy tree metrics.
method Max-min robust optimal transport approach considering uncertainty sets of tree metrics.
result Robust optimal transport admits a closed-form expression for fast computation.

Study proves existence of robust classifiers in multiclass adversarial training.

problem Proves existence of robust classifiers in multiclass adversarial training.
method Three models of adversarial training in multiclass classification, proving existence of Borel measurable robust classifiers.
result Proves existence of Borel measurable robust classifiers in each model.

Sign-RIP improves robust low-rank matrix recovery by preserving norms even with corrupted measurements.

problem Robust low-rank matrix recovery in the presence of corrupted measurements.
method Proposed Sign-RIP, a robust restricted isometry property.
result Sign-RIP guarantees uniform convergence of subdifferentials in robust low-rank matrix recovery.