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

3469103137 · May 202619922001200920172026
48 results for covariance spectrum

The salient properties of large empirical covariance and correlation matrices are studied for three datasets of size 54, 55 and 330. The covariance is defined as a simple cross product of the returns, with weights that decay logarithmically slowly. The key general properties of the covariance matrices are the following…

2009-03-09abs ↗pdf ↗

WeSpeR speeds up non-linear shrinkage for high-dimensional weighted covariance.

problem Computing non-linear shrinkage formulas for high-dimensional weighted sample covariance.
method Derive extit{WeSpeR} algorithm using asymptotic sample spectrum properties.
result Significantly speeds up non-linear shrinkage in dimensions higher than 1000.

Adaptive Bayesian model for covariate-dependent power spectra analysis.

problem Estimating complex relationships and interactions between covariates and power spectra.
method Bayesian sum of trees model with local power spectrum estimation and reversible-jump MCMC for tree modifications.
result The method can accurately recover both smooth and abrupt changes in power spectra across multiple covariates.

This paper analyzes generalization for linear models with spiked covariance structures.

problem Understanding the generalization performance of linear models with spiked covariance structures.
method Derives the generalization error for two simple models with spiked covariances using random matrix theory.
result The eigenvector and eigenvalue corresponding to the spike significantly influence the generalization error.

The exact meaning of the noise spectrum of eigenvalues of the covariance matrix is discussed. In order to better understand the possible phenomena behind the observed noise, the spectrum of eigenvalues of the covariance matrix is studied under a model where most of the true eigenvalues are zero and the parameters are n…

2006-10-21abs ↗pdf ↗

Using Random Matrix Theory one can derive exact relations between the eigenvalue spectrum of the covariance matrix and the eigenvalue spectrum of its estimator (experimentally measured correlation matrix). These relations will be used to analyze a particular case of the correlations in financial series and to show that…

2003-12-18abs ↗pdf ↗

Study improves Hayashi-Yoshida estimator for high-dimensional stock covolatility.

problem Inconsistent performance of Hayashi-Yoshida estimator in high dimensions.
method Analyzed the limiting spectral distribution of the Hayashi-Yoshida estimator.
result Established the connection between the estimator's spectrum and the true covariance matrix in high dimensions.

A new debiasing method for high-dimensional regression with applications to PCR.

problem Debiasing in high-dimensional statistics with i.i.d. samples and sub-Gaussian covariates.
method Spectrum-Aware Debiasing using rescaled gradient descent with spectral information.
result Achieves debiasing in broader contexts with structured dependencies, heavy tails, and low-rank structures.

Kernel method is a very powerful tool in machine learning. The trick of kernel has been effectively and extensively applied in many areas of machine learning, such as support vector machine (SVM) and kernel principal component analysis (kernel PCA). Kernel trick is to define a kernel function which relies on the inner-…

2011-05-15abs ↗pdf ↗

We describe a method to determine the eigenvalue density of empirical covariance matrix in the presence of correlations between samples. This is a straightforward generalization of the method developed earlier by the authors for uncorrelated samples. The method allows for exact determination of the experimental spectru…

2005-08-19abs ↗pdf ↗

Power-law spectrum of random feature model is preserved in neural networks.

problem Preserving power-law spectrum in neural networks through random feature model.
method Characterized eigenvalues of population random-feature covariance using dyadic head-tail decomposition and Wick chaos expansions.
result Power-law exponent αα is inherited from input covariance, modified by a logarithmic correction.

CDST improves ensemble prediction by adjusting model weights based on covariates.

problem Improving ensemble prediction accuracy in complex scenarios.
method Covariate-dependent stacking (CDST) with flexible model weights estimated via cross-validation.
result CDST consistently outperforms conventional model averaging methods in complex datasets.

We consider the problem of approximating the set of eigenvalues of the covariance matrix of a multivariate distribution (equivalently, the problem of approximating the "population spectrum"), given access to samples drawn from the distribution. The eigenvalues of the covariance of a distribution contain basic informati…

2016-01-30abs ↗pdf ↗

Study precise sample covariance error for Gaussian centered data.

problem Precise characterization of sample covariance error for Gaussian data.
method Developed a Random Duality Theory (RDT) framework to determine upper and lower bounds.
result Upper and lower bounds match in large-dimensional contexts, matching the spectral norm's limiting value.

In dealing with high-dimensional data sets, factor models are often useful for dimension reduction. The estimation of factor models has been actively studied in various fields. In the first part of this paper, we present a new approach to estimate high-dimensional factor models, using the empirical spectral density of …

2016-11-17abs ↗pdf ↗

We propose a novel sparse spectrum approximation of Gaussian process (GP) tailored for Bayesian optimization. Whilst the current sparse spectrum methods provide desired approximations for regression problems, it is observed that this particular form of sparse approximations generates an overconfident GP, i.e. it produc…

2019-06-21abs ↗pdf ↗

New method estimates covariance matrices without restrictive assumptions.

problem Estimating high-dimensional covariance matrices under restrictive assumptions.
method Distributionally robust covariance estimation problems with mild conditions.
result Robust estimators are efficient, consistent, and perform well.

Model improves covariance estimation from shared and distinct datasets.

problem Limited sample sizes and shared covariance structure across related datasets.
method Spiked covariance model with shared subspace, closed-form pooling weight, and asymptotic guarantees.
result Improves estimation of high-dimensional covariance matrices from related datasets.

We provide a unified analysis of the predictive risk of ridge regression and regularized discriminant analysis in a dense random effects model. We work in a high-dimensional asymptotic regime where p,np, n \to \infty and p/nγ(0,)p/n \to γ\in (0, \, \infty), and allow for arbitrary covariance among the features. For both metho…

2015-07-10abs ↗pdf ↗

Paper analyzes ensemble Kalman updates for effective dimension and localization.

problem Why small ensemble sizes work well in inverse problems and data assimilation.
method Non-asymptotic analysis of ensemble Kalman updates, focusing on effective dimension and localization.
result Rigorously explains why a small ensemble size is sufficient when prior covariance has moderate effective dimension.

The study establishes minimax bounds for estimating operators from noisy samples.

problem Estimating unknown operators between Hilbert spaces from noisy data.
method Developed a minimax theory for uniformly bounded Lipschitz operators, proving lower and upper bounds.
result Sharp characterizations of minimax risk for generic Lipschitz operators, showing a curse of sample complexity.

Least squares regression shows unexpected double descent in under-parameterized models.

problem Understanding the generalization of under-parameterized models in regression.
method Analyzing the spectrum and eigenvectors of the sample covariance matrix.
result Least squares regression can exhibit a peak in generalization in the under-parameterized regime, contrary to previous explanations.

Study on the geometric Dyson Brownian motion of non-square matrix products.

problem Understanding the spectrum of a product of non-square random matrices.
method Proportional depth-width limit followed by mean-field limit, solving Burgers equation.
result Free log-normal law is obtained in the identity-start case.

Hybrid ResNet and RMT improve covariance matrix estimation for cryptocurrency portfolios.

problem Noisy, non-Gaussian financial data leads to unstable covariance matrices.
method Combines RMT regularization and ResNet learning for data-driven corrections.
result Hybrid estimator outperforms traditional methods in portfolio optimization.

Bayesian method uses data spectra to estimate non-sparse high-dimensional models.

problem Handling many parameters in high-dimensional Bayesian statistics.
method Data-adaptive Gaussian prior aligned with leading eigenvectors of sample covariance.
result Posterior contraction rates reveal the effect of spectral mass on prediction error.

In this paper, we study the spectrum and the eigenvectors of radial kernels for mixtures of distributions in Rn\mathbb{R}^n. Our approach focuses on high dimensions and relies solely on the concentration properties of the components in the mixture. We give several results describing of the structure of kernel matrices …

2019-06-25abs ↗pdf ↗

This paper shows universality in spectrum behavior for random inner-product kernel matrices in polynomial regime.

problem Understanding spectrum behavior of random inner-product kernel matrices in polynomial regime.
method Analyzing matrices formed by a nonlinear function applied entrywise to a sample-covariance matrix, considering i.i.d. entries with all finite moments.
result The spectrum of random inner-product kernel matrices is universally described by the free convolution of the semicircular and Marčenko-Pastur distributions, with relative weights given by expanding the nonlinear function in the Hermite basis.

Scaling laws in linear regression explain model performance improvements with size and data.

problem Disagreement between empirical neural scaling laws and conventional wisdom on variance error.
method Infinite dimensional linear regression setup, one-pass SGD, Gaussian prior, power-law spectrum.
result Variance error is dominated by other errors, disappearing from the bound due to SGD's implicit regularization.

We provide a method to prepare covariance matrices for quantum datasets.

problem No concrete protocol for preparing covariance matrices for quantum datasets.
method Amplitude encoding of data, exploiting global phase symmetry to center the dataset.
result Covariance matrix can be prepared for arbitrary quantum datasets or centered classical datasets.

We obtain a tight distribution-specific characterization of the sample complexity of large-margin classification with L_2 regularization: We introduce the γ-adapted-dimension, which is a simple function of the spectrum of a distribution's covariance matrix, and show distribution-specific upper and lower bounds on the s…

2010-11-23abs ↗pdf ↗

Study eigenvalues and eigenvectors in neural networks, focusing on signal propagation.

problem Characterize signal eigenvalues and eigenvectors in neural networks.
method Characterizes signal eigenvalues and eigenvectors for a nonlinear spiked covariance model.
result Provides precise quantitative characterizations of signal eigenvalues and eigenvectors in neural networks.

In this paper we study the behaviour of the continuous spectrum of the Laplacian on a complete Riemannian manifold of bounded curvature under perturbations of the metric. The perturbations that we consider are such that its covariant derivatives up to some order decay with some rate in the geodesic distance from a fixe…

2007-01-10abs ↗pdf ↗

Improved scaling laws in linear regression using data reuse.

problem Sustainability of neural scaling laws when running out of new data.
method Data reuse in multi-pass stochastic gradient descent (multi-pass SGD) for MM-dimensional linear models trained on NN data with sketched features.
result Multi-pass SGD achieves a test error of Θ(M1b+L(1b)/a)Θ(M^{1-b} + L^{(1-b)/a}) with L>NL>N, improving scaling laws in data-constrained regimes.