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

Trend · papers per month

100199299398 · Jun 202019922001200920172026
48 results for vector-valued risk measures

Paper proposes a new method to evaluate joint risk under uncertainty.

problem Evaluating joint risk of multiple insurance risks under dependence uncertainty.
method Axiomatic approach to scalar and vector-valued distortion joint risk measures.
result Established a new scalar distortion joint risk measure with positive homogeneity.

We describe a general framework for measuring risks, where the risk measure takes values in an abstract cone. It is shown that this approach naturally includes the classical risk measures and set-valued risk measures and yields a natural definition of vector-valued risk measures. Several main constructions of risk meas…

2006-06-21abs ↗pdf ↗

In [16], a new family of vector-valued risk measures called multivariate expectiles is introduced. In this paper, we focus on the asymptotic behavior of these measures in a multivariate regular variations context. For models with equivalent tails, we propose an estimator of these multivariate asymptotic expectiles, in …

2017-04-24abs ↗pdf ↗

In this paper, we introduce two alternative extensions of the classical univariate Value-at-Risk (VaR) in a multivariate setting. The two proposed multivariate VaR are vector-valued measures with the same dimension as the underlying risk portfolio. The lower-orthant VaR is constructed from level sets of multivariate di…

2011-11-05abs ↗pdf ↗

In this study, we propose a new definition of multivariate conditional value-at-risk (MCVaR) as a set of vectors for discrete probability spaces. We explore the properties of the vector-valued MCVaR (VMCVaR) and show the advantages of VMCVaR over the existing definitions given for continuous random variables when adapt…

2017-08-03abs ↗pdf ↗

Randomized algorithm solves vector-valued regression problems with low-rank operators.

problem Vector-valued regression problems involving infinite-dimensional spaces.
method Randomized Reduced Rank Regression (R4) using Gaussian sketching for optimization.
result R4 estimators are efficient and accurate, with empirical risk close to optimal.

The paper extends consistency results for sequential design strategies to vector-valued Gaussian processes.

problem Estimating excursion sets of vector-valued Gaussian processes.
method Clarifying the connection between continuous Gaussian processes and Gaussian measures in Banach spaces, extending concepts and properties from scalar-valued settings to vector-valued settings.
result Consistency results for sequential design strategies can be applied to vector-valued Gaussian processes.

Paper develops a theory for Patterson-Sullivan measures in higher rank symmetric spaces.

problem Establishing existence and uniqueness of Patterson-Sullivan measures in higher rank symmetric spaces.
method Develops theory for vector-valued horofunction boundaries and shadows.
result Proves existence and uniqueness of Patterson-Sullivan measures for transverse groups.

We present a framework to derive risk bounds for vector-valued learning with a broad class of feature maps and loss functions. Multi-task learning and one-vs-all multi-category learning are treated as examples. We discuss in detail vector-valued functions with one hidden layer, and demonstrate that the conditions under…

2016-06-05abs ↗pdf ↗

Vector-valued learning, where the output space admits a vector-valued structure, is an important problem that covers a broad family of important domains, e.g. multi-task learning and transfer learning. Using local Rademacher complexity and unlabeled data, we derive novel semi-supervised excess risk bounds for general v…

2019-09-11abs ↗pdf ↗

Study confirms learning rates for vector-valued spectral algorithms, proving consistency.

problem Theoretical confirmation of learning rates for vector-valued spectral algorithms.
method Rigorous analysis of learning rates for various vector-valued spectral algorithms, including kernel ridge regression and gradient descent.
result Upper and lower bounds on learning rates for vector-valued spectral algorithms, proving minimax optimality in various scenarios.

Paper analyzes error bounds for learning with vector-valued RF, improving existing analyses.

problem Learning with vector-valued random features in infinite-dimensional settings.
method Direct analysis of risk functional, avoiding random matrix theory.
result Strong consistency and minimax optimal convergence rates established.

In economics, insurance and finance, value at risk (VaR) is a widely used measure of the risk of loss on a specific portfolio of financial assets. For a given portfolio, time horizon, and probability αα, the 100α%100α\% VaR is defined as a threshold loss value, such that the probability that the loss on the portfolio ove…

2015-02-03abs ↗pdf ↗

We define the Ricci curvature, as a measure, for certain singular torsion-free connections on the tangent bundle of a manifold. The definition uses an integral formula and vector-valued half-densities. We give relevant examples in which the Ricci measure can be computed. In the time dependent setting, we give a weak no…

2015-03-16abs ↗pdf ↗

In this article we propose a study of market models starting from a set of axioms, as one does in the case of risk measures. We define a market model simply as a mapping from the set of adapted strategies to the set of random variables describing the outcome of trading. We do not make any concavity assumptions. The fir…

2015-12-06abs ↗pdf ↗

Optimal rates for vector-valued regression on various norms.

problem Optimal rates for vector-valued ridge regression on continuous norms.
method Combining standard capacity assumptions with tensor product constructions of vector-valued interpolation spaces.
result Optimal rates for vector-valued ridge regression, independent of output space dimension.

Boosting framework for vector-valued prediction with geometric stability.

problem Lack of a general theoretical understanding of aggregation for structured prediction.
method Identifies (α,β)(α,β)-stability property and proposes a boosting framework based on exponential reweighting and geometric-median aggregation.
result Obtains exponential decay of empirical divergence error under weak learner condition and (α,β)(α,β)-stability.

The space of vector-valued forms on any manifold is a graded Lie algebra with respect to the Frolicher-Nijenhuis bracket. In this paper we consider multiplicative vector-valued forms on Lie groupoids and show that they naturally form a graded Lie subalgebra. Along the way, we discuss various examples and different char…

2017-06-02abs ↗pdf ↗

The paper proposes methods to find a shared active subspace for multivariate vector-valued functions.

problem Minimizing the deviation between function evaluations in the original and reconstructed spaces.
method Manipulating gradients or SPD matrices to identify a shared structure.
result Summing SPD matrices often identifies the best shared active subspace.

Optimal transport for vector Gaussian mixtures improves efficiency and structure preservation.

problem Optimal mass transport for vector-valued Gaussian mixtures.
method Vectorizing Gaussian mixture models and studying optimal mass transport problems.
result Computational efficiency and structure preservation in optimal mass transport.

We obtain a blow-up theorem for regular submanifolds in the Heisenberg group, where intrinsic dilations are used. Main consequence of this result is an explicit formula for the density of (p+1)-dimensional spherical Hausdorff measure restricted to a p-dimensional submanifold with respect to the Riemannian surface measu…

2005-06-22abs ↗pdf ↗

Study improves self-normalized bounds for vector-valued processes beyond sub-Gaussianity.

problem Limited understanding of self-normalized concentration for vector-valued processes outside sub-Gaussian frameworks.
method Developed concentration inequalities for self-normalized processes with light tails (e.g., Bennett, Bernstein bounds) for vector-valued data.
result Provided new insights and bounds for self-normalized processes with non-sub-Gaussian distributions.

We approximate derivatives of functions on manifolds by embedding them and applying vector-valued operators.

problem Derivatives of manifold-valued functions are harder to approximate than vector-valued functions.
method Embed the manifold into a higher space, approximate the derivative of the vector-valued function, and project back.
result We provide error bounds for the approximation of manifold-valued function derivatives.

Paper introduces vector-valued variation spaces for multi-output neural networks.

problem Understanding and optimizing multi-output neural networks.
method Development of vector-valued variation spaces and representer theorem.
result Novel bounds for layer widths in deep networks and a convex optimization method for compression.

Develops vector-valued RKBS for neural networks and operators.

problem Understanding function spaces of Rd\mathbb{R}^d-valued neural networks and neural operators.
method Defines and constructs vector-valued RKBS (vv-RKBS) without restrictive assumptions.
result Establishes Representer Theorem for neural architectures.

The paper develops sampling methods for ocean phenomena based on temperature and salinity measurements.

problem Improving oceanographic sampling with limited resources.
method Design criterion based on uncertainty in excursions of vector-valued Gaussian random fields.
result Demonstrates effective exploration of ambiguous regions for data-driven sampling.

Study on identifying most preferred policy in bandits with vector-valued rewards.

problem Identifying the most preferred policy in bandits with vector-valued rewards.
method Derive a novel lower bound on sample complexity, design the Preference-based Track and Stop (PreTS) algorithm, and derive a new concentration inequality.
result The sample complexity of PreTS is asymptotically tight.

This work studies the denoising of piecewise smooth graph signals that exhibit inhomogeneous levels of smoothness over a graph, where the value at each node can be vector-valued. We extend the graph trend filtering framework to denoising vector-valued graph signals with a family of non-convex regularizers, which exhibi…

2019-05-29abs ↗pdf ↗

Consider vector valued harmonic maps of at most linear growth, defined on a complete non-compact Riemannian manifold with non-negative Ricci curvature. For the norm square of the pull-back of the target volume form by such maps, we report a strong maximum principle, and equalities among its supremum, its asymptotic ave…

2018-01-08abs ↗pdf ↗

Framework for transferring discount curve estimates across fixed-income product classes.

problem Challenges in estimating discount curves from sparse or noisy data.
method Proposes a vector-valued kernel ridge regression (KR) framework with economic regularization.
result Transfer learning tightens confidence intervals and improves extrapolation performance.

New set-valued star-shaped risk measures introduced for better risk assessment.

problem Improving risk assessment in financial contexts.
method Developed new set-valued star-shaped risk measures and proved their representation theorems.
result Set-valued star-shaped risk measures can be represented as unions of set-valued convex risk measures.

A new method estimates multi-dimensional value distributions using Hilbert space embeddings.

problem Estimating value distributions in complex, multi-dimensional reinforcement learning settings.
method Hilbert space mappings and kernel mean embeddings to estimate the kernel mean embedding of multi-dimensional value distributions.
result Uniform convergence guarantees and robust off-policy evaluation demonstrated in simulations.

This paper examines error bounds for deep learning classifiers with noisy labels.

problem Understanding the performance of classifiers trained on noisy data.
method Derives error bounds for excess risk, decomposing it into statistical and approximation errors. Uses independent block construction for statistical dependencies and vector-valued setting for approximation error.
result Established theoretical results for error bounds in deep learning with noisy labels, mitigating the impact of high-dimensional input spaces.

The paper studies dynamic star-shaped risk measures and their representation.

problem Representing dynamic star-shaped risk measures and their properties.
method Representation theorems for dynamic monetary and star-shaped risk measures.
result Dynamic star-shaped risk measures can be represented as the lower envelope of a family of dynamic convex risk measures.