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

6481,2971,9452,593 · Jun 202019922001200920172026
48 results for sums of risks

This paper shows how to calculate risk measures for sums of two counter-monotonic risks.

problem Calculating risk measures for sums of two counter-monotonic risks.
method Using a fixed distortion function and expressing the risk measure of a sum as the sum of two related measures of the marginals.
result The risk measure of a sum of two counter-monotonic risks can be expressed as the sum of two related distortion risk measures of the marginals.

We discuss two distinct approaches, for distorting risk measures of sums of dependent random variables, which preserve the property of coherence. The first, based on distorted expectations, operates on the survival function of the sum. The second, simultaneously applies the distortion on the survival function of the su…

2011-06-14abs ↗pdf ↗

Paper discusses natural quasiconvexity and its relation to decomposable sums in risk measures.

problem Understanding natural quasiconvexity and its implications in risk measures.
method Relates natural quasiconvexity to decomposable sums, proposes a general treatment of convexity index, and proves equivalence for certain spaces.
result Natural quasiconvexity and convexity are equivalent for conditional risk measures on LpL^p spaces under mild conditions.

It is well known that a random vector with given marginal distributions is comonotonic if and only if it has the largest sum with respect to the convex order [ Kaas, Dhaene, Vyncke, Goovaerts, Denuit (2002), A simple geometric proof that comonotonic risks have the convex-largest sum, ASTIN Bulletin 32, 71-80. Cheung (2…

2016-03-17abs ↗pdf ↗

Paper establishes sufficient condition for comparing linear combinations of infinite-mean risks.

problem Comparing linear combinations of infinite-mean risks under stochastic dominance.
method Introduced a new class of distributions and used majorization order to compare weights.
result Linear combinations of random variables are stochastically larger when their weight vectors are smaller in majorization order.

A new method calculates risk loadings in classification ratemaking without subjective parameters.

problem Subjective risk loading parameters in classification ratemaking.
method Bootstrap method to calculate total risk premium, then determine risk loading parameters using quantile regression models.
result Risk premiums calculated by the new method reasonably differentiate different risk classes.

Investment strategy optimizes risk using a specific risk measure.

problem Optimizing investment with risk controlled by a weighted entropic risk measure.
method Investigation of expected utility maximization and risk minimization problems with solutions provided iteratively.
result Explicit characterization of solutions to optimization problems.

We describe a novel optimization method for finite sums (such as empirical risk minimization problems) building on the recently introduced SAGA method. Our method achieves an accelerated convergence rate on strongly convex smooth problems. Our method has only one parameter (a step size), and is radically simpler than o…

2016-02-08abs ↗pdf ↗

Theoretical limits on verifying self-improving systems without risking unbounded utility.

problem Formalizing and proving the limits of safety verification for self-improving systems.
method Developed dual conditions and used Holder's inequality, NP counting method, and Lipschitz bounds to establish impossibility and ceiling results.
result A classifier-based safety gate cannot simultaneously permit unbounded beneficial self-modification and bounded cumulative risk.

The paper explores the information-theoretic nature of excess risk in machine learning.

problem Understanding the excess risk in machine learning models.
method Formulates the minimax excess risk as a zero-sum game and modifies it to allow swapping of the order of play.
result Proves that under certain conditions, the duality gap is zero, allowing for the application of Bayesian results to provide bounds on minimax excess risk.

We provide a dual characterisation of the weak^*-closure of a finite sum of cones in LL^\infty adapted to a discrete time filtration Ft\mathcal{F}_t: the ttht^{th} cone in the sum contains bounded random variables that are Ft\mathcal{F}_t-measurable. Hence we obtain a generalisation of Delbaen's m-stability condition…

2017-03-10abs ↗pdf ↗

SVRN accelerates Newton methods by reducing variance and improving performance.

problem Improving the efficiency of Newton methods for large-scale optimization problems.
method Stochastic Variance-Reduced Newton (SVRN) algorithm that accelerates Subsampled Newton and Iterative Hessian Sketch algorithms.
result SVRN accelerates Newton methods by reducing the number of passes over the data, achieving a significant improvement in performance.

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 ↗

New monitoring method detects ML risk models' performance changes in medical interventions.

problem Monitoring ML risk models in healthcare is complicated by confounding medical interventions.
method Developed a new score-based CUSUM monitoring procedure with dynamic control limits.
result Valid inference is possible if conditional exchangeability or time-constant selection bias hold.

The matrix completion problem consists in reconstructing a matrix from a sample of entries, possibly observed with noise. A popular class of estimator, known as nuclear norm penalized estimators, are based on minimizing the sum of a data fitting term and a nuclear norm penalization. Here, we investigate the case where …

2015-02-24abs ↗pdf ↗

Paper studies second order tail probabilities in risk models.

problem Analyzing tail probabilities in risk models with constant interest force.
method Asymptotic expansion and weighted Kesten-type inequality for second order subexponential random variables.
result Second order asymptotic formulae for continuous-time renewal risk models are derived.

We use martingale and stochastic analysis techniques to study a continuous-time optimal stopping problem, in which the decision maker uses a dynamic convex risk measure to evaluate future rewards. We also find a saddle point for an equivalent zero-sum game of control and stopping, between an agent (the "stopper") who c…

2009-09-27abs ↗pdf ↗

Investigates VaR behavior for sums of one-sided random variables, showing impossibilities and conditions for super-additivity.

problem Investigates the behavior of Value-at-Risk (VaR) for sums of one-sided random variables.
method Analyzes the extremal aggregation behavior of VaR, introduces structural conditions for super-additivity.
result Characterizes when VaR is fully super-additive and provides unified framework for various dependence structures.

Sharp bounds found for various risk measures using generalized FGM copulas.

problem Finding sharp bounds for risk measures in high dimensions.
method Proved that generalized FGM copulas form a convex polytope, used this structure to find bounds for risk measures.
result Sharp analytical bounds for convex risk measures in the class of generalized FGM copulas.

We use principle component analysis (PCA) of cross correlations in European government bonds and European stocks to investigate the systemic risk contained in the European economy. We tackle the task to visualize the evolution of risk, introducing the conditional average rolling sum (CARS). Using this tool we see that …

2015-02-24abs ↗pdf ↗

A new method to break down insurance costs into risk and uncertainty.

problem Understanding and quantifying insurance costs in uncertain environments.
method An axiomatic approach to decompose premium principles into risk and deviation measures.
result Maximal risk and minimal deviation measures can be uniquely identified in decompositions.

In this paper we are concerned with backward stochastic differential equations with random default time and their applications to default risk. The equations are driven by Brownian motion as well as a mutually independent martingale appearing in a defaultable setting. We show that these equations have unique solutions …

2009-10-12abs ↗pdf ↗

Novel Newton method for large-scale kernel methods using random features.

problem Efficiently solving large-scale finite-sum minimization problems in RKHS.
method Randomized feature-based Newton method for empirical risk minimization.
result Local superlinear and global linear convergence of the method.

We propose an iterative gradient-based algorithm to efficiently solve the portfolio selection problem with multiple spectral risk constraints. Since the conditional value at risk (CVaR) is a special case of the spectral risk measure, our algorithm solves portfolio selection problems with multiple CVaR constraints. In e…

2014-10-20abs ↗pdf ↗

Study risk-constrained Kelly optimization for mutually exclusive outcomes, proving support invariance and developing a structured algorithm.

problem Risk-constrained Kelly optimization for mutually exclusive outcomes with explicit state prices.
method Analyzes the finite mutually exclusive outcome version of risk-constrained Kelly optimization with explicit state prices, proving support invariance and developing a structured algorithm.
result Support is invariant across CRRA parameter and drawdown-surrogate parameter in the overround regime.

In this paper we consider reinsurance or risk sharing from a macroeconomic point of view. Our aim is to find socially optimal reinsurance treaties. In our setting we assume that there are nn insurance companies each bearing a certain risk and one representative reinsurer. The optimization problem is to minimize the su…

2017-11-28abs ↗pdf ↗

The paper studies the convergence of SAA for systemic risk measures.

problem Theoretical convergence of SAA for set-valued systemic risk measures.
method General theory and specific case study with mixed-integer programming formulations.
result Theoretical convergence results for SAA under Wijsman and Hausdorff topologies.

Adaptive sampling for risk-averse learning on hard examples.

problem Training models to perform well on difficult examples in high-stakes applications.
method Adaptive sampling algorithm for stochastically optimizing CVaR, using distributionally robust formulation and regret minimization.
result Empirically demonstrates effectiveness on large-scale convex and non-convex learning tasks.

The paper examines how small positive dependence can lead to correlated tail risks.

problem Understanding the impact of dependence uncertainty on tail risk measures.
method Introducing a regular dependence measure and analyzing the aggregation of risks.
result Small positive dependence can result in perfectly correlated tail risks.

Proposes a new risk model using stable laws to manage company-wide losses.

problem Managing aggregate risks and pricing policies in the presence of systematic risk.
method Develops a modified risk model using multivariate stable distributions to account for various risk phenomena.
result Computes the Tail Conditional Expectation of aggregate risks and corresponding allocations.

New method for sequential probability assignment reduces regret using contextual Shtarkov sums.

problem Minimizing regret in sequential probability assignment with arbitrary hypothesis classes.
method Introducing contextual Shtarkov sum and contextual Normalized Maximum Likelihood (cNML) algorithm.
result The contextual Shtarkov sum characterizes minimax regret and provides a minimax optimal strategy.

Stochastic Gradient Descent underperforms on some problems, contrary to expectations.

problem Understanding the generalization performance of SGD on specific problem instances.
method Analysis of stochastic convex optimization framework, proving empirical and generalization gaps for SGD.
result SGD exhibits both empirical risk and generalization gap of Ω(1)Ω(1) on some problem instances, contradicting its conventional understanding.