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

Trend · papers per month

83165248330 · Jun 202019922001200920172026
48 results for spectral measures

Spectral risk measures are attractive risk measures as they allow the user to obtain risk measures that reflect their risk-aversion functions. To date there has been very little guidance on the choice of risk-aversion functions underlying spectral risk measures. This paper addresses this issue by examining two popular …

2011-03-29abs ↗pdf ↗

Spectral risk measures are attractive risk measures as they allow the user to obtain risk measures that reflect their subjective risk-aversion. This paper examines spectral risk measures based on an exponential utility function, and finds that these risk measures have nice intuitive properties. It also discusses how th…

2011-03-28abs ↗pdf ↗

We study Spectral Measures of Risk from the perspective of portfolio optimization. We derive exact results which extend to general Spectral Measures M_phi the Pflug--Rockafellar--Uryasev methodology for the minimization of alpha--Expected Shortfall. The minimization problem of a spectral measure is shown to be equivale…

2002-03-29abs ↗pdf ↗

Paper estimates spectral risk measures for insurance data with truncated and censored data.

problem Estimating spectral risk measures for insurance data with left truncation and right censoring.
method Proposes a non-parametric estimator using product limit estimator and establishes asymptotic normality.
result Proposed estimator outperforms existing methods for small k and small sample sizes.

Spectral risk measures (SRMs) are risk measures that take account of user riskaversion, but to date there has been little guidance on the choice of utility function underlying them. This paper addresses this issue by examining alternative approaches based on exponential and power utility functions. A number of problems…

2011-03-29abs ↗pdf ↗

Optimizes risk measures given known marginal distributions of two unknown factors.

problem Determining an upper bound for spectral risk measures with unknown joint distribution.
method Introduces Maximum Spectral Measure (MSP) as a worst-case risk measure, formulated as an optimization problem with a more general objective function.
result Characterizes the continuity properties of the optimal value function and optimal solution set with respect to marginal distributions.

Stochastic optimization problems often involve the expectation in its objective. When risk is incorporated in the problem description as well, then risk measures have to be involved in addition to quantify the acceptable risk, often in the objective. For this purpose it is important to have an adjusted, adapted and eff…

2012-09-17abs ↗pdf ↗

New algorithms optimize spectral risk measures, improving interpolation between average and worst-case performance.

problem Optimizing spectral risk measures for learning systems.
method Developed stochastic algorithms to optimize spectral risk measures by characterizing their subdifferential and addressing challenges like biasedness of subgradient estimates and non-smoothness.
result Our approach outperforms out-of-the-box stochastic subgradient and dual averaging methods in optimizing spectral risk measures.

The paper defines surface area for graphs and derives spectral estimates.

problem Understanding connectivity measures and spectral properties of graphs.
method Introducing surface area concepts related to inverse degree and deriving spectral bounds.
result An upper bound on the second eigenvalue for planar graphs.

Bayesian framework integrates spectral deconvolution with expert reasoning for robust peak estimation.

problem Challenges in extracting meaningful peaks from noisy or complex spectra.
method Bayesian spectral deconvolution coupled with a physical-property regression layer.
result Recovery of weak peaks in poly(lactic acid) IR spectra related to degradation rates.

Spectral Clustering(SC) is a prominent data clustering technique of recent times which has attracted much attention from researchers. It is a highly data-driven method and makes no strict assumptions on the structure of the data to be clustered. One of the central pieces of spectral clustering is the construction of an…

2019-09-17abs ↗pdf ↗

A new method for risk-sensitive reinforcement learning using Spectral Risk Measures.

problem Incorporating risk sensitivity into reinforcement learning algorithms.
method Proposes a novel framework for optimizing Spectral Risk Measures in both online and offline RL algorithms.
result Demonstrates consistent outperformance over existing risk-sensitive methods in various domains.

Paper proposes a new DRL algorithm optimizing Spectral Risk Measures for better risk management.

problem Inconsistencies and conservatism in existing risk measures in DRL.
method Optimizes a broader class of static Spectral Risk Measures (SRM) in DRL.
result Demonstrates improved performance over existing risk-neutral and risk-sensitive DRL models.

This paper establishes the consistency of spectral approaches to data clustering. We consider clustering of point clouds obtained as samples of a ground-truth measure. A graph representing the point cloud is obtained by assigning weights to edges based on the distance between the points they connect. We investigate the…

2015-08-08abs ↗pdf ↗

In this paper, we propose a new measure to gauge the complexity of image classification problems. Given an annotated image dataset, our method computes a complexity measure called the cumulative spectral gradient (CSG) which strongly correlates with the test accuracy of convolutional neural networks (CNN). The CSG meas…

2019-05-17abs ↗pdf ↗

Risk assessment under different possible scenarios is a source of uncertainty that may lead to concerning financial losses. We address this issue, first, by adapting a robust framework to the class of spectral risk measures. Second, we propose a Deviation-based approach to quantify uncertainty. Furthermore, the theory …

2019-05-19abs ↗pdf ↗

Paper shows stability of metric reconstruction for orbifolds from spectral data.

problem Determining the metric structure of collapsing orbifolds from spectral data.
method Improved quantitative unique continuation for wave operator on Riemannian manifolds.
result Quantitative stability of inverse problem for Riemannian orbifolds.

Phase retrieval refers to the problem of recovering real- or complex-valued vectors from magnitude measurements. The best-known algorithms for this problem are iterative in nature and rely on so-called spectral initializers that provide accurate initialization vectors. We propose a novel class of estimators suitable fo…

2018-06-09abs ↗pdf ↗

Paper provides unbiased spectral moment estimates from finite data.

problem Challenges in estimating spectral moments from limited data.
method Dynamic programming approach to estimate spectral moments of kernel integral operator.
result Demonstrates consistency with theoretical spectra and practical utility in neural networks.

Study spectral properties of sub-Riemannian Laplacians, proving quantum ergodicity and heat kernel asymptotics.

problem Spectral properties of sub-Riemannian Laplacians.
method Quantum ergodicity results, small-time asymptotics of sub-Riemannian heat kernels, Weyl law.
result Weyl law and spectral concentration on Lie brackets of length r-1.

A theory of feature geometry using spectral analysis of weight matrices.

problem Current methods decompose neural network activations into sparse linear features, losing geometric structure.
method Develops a theory by analyzing the spectra of weight-derived matrices, introducing the frame operator.
result Features collapse onto single eigenspaces, organizing into tight frames, and admit discrete classification.

The main results of this paper are an asymptotic expansion in powers of \hbar for the spectral measure μμ_\hbar of a semi-classical Toeplitz operator, QQ_\hbar, and an equivariant version of this result when QQ_\hbar admits an nn-torus as a symmetry group. In addition we discuss some inverse spectral consequences…

2017-06-13abs ↗pdf ↗

A new method resolves permutation issues in shuffled linear regression for large-scale applications.

problem Estimating latent features through linear transformation with unknown permutations.
method Spectral matching method to align spectral components of measurement and feature covariances.
result Achieves accurate estimates in shuffled LS and LASSO settings with sufficient samples.

Many spectral unmixing methods rely on the non-negative decomposition of spectral data onto a dictionary of spectral templates. In particular, state-of-the-art music transcription systems decompose the spectrogram of the input signal onto a dictionary of representative note spectra. The typical measures of fit used to …

2016-09-30abs ↗pdf ↗

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 ↗

In phase retrieval we want to recover an unknown signal xCd\boldsymbol x\in\mathbb C^d from nn quadratic measurements of the form yi=ai,x2+wiy_i = |\langle{\boldsymbol a}_i,{\boldsymbol x}\rangle|^2+w_i where aiCd\boldsymbol a_i\in \mathbb C^d are known sensing vectors and wiw_i is measurement noise. We ask the following weak rec…

2017-08-20abs ↗pdf ↗

We consider the problem of estimating a spectral risk measure (SRM) from i.i.d. samples, and propose a novel method that is based on numerical integration. We show that our SRM estimate concentrates exponentially, when the underlying distribution has bounded support. Further, we also consider the case when the underlyi…

2019-12-22abs ↗pdf ↗

Spectral measurements reveal hidden representation geometry in language model training.

problem Hidden internal representation in language model training is hard to examine.
method Empirical protocol using activation covariance and per-sample gradient SVD spectra.
result Batch size affects representation geometry, and activation spectra predict token efficiency.