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

4183124165 · May 202619922001200920172026
48 results for Principal Components

New simulations advise caution in choosing principal components for multivariate functional data.

problem Inaccurate selection of principal components in multivariate functional data.
method Extensive simulations investigating the reliability of percentage of variance explained thresholds.
result Conventional threshold methods may fail to accurately explain overall variance in multivariate functional data.

Principal component regression (PCR) is a two-stage procedure that selects some principal components and then constructs a regression model regarding them as new explanatory variables. Note that the principal components are obtained from only explanatory variables and not considered with the response variable. To addre…

2014-02-26abs ↗pdf ↗

The paper introduces a method for interpretable principal component analysis of high-dimensional time series.

problem Inconsistent and difficult-to-interpret principal component estimates in high-dimensional regimes.
method Localized sparse principal component analysis of spectral density matrices in frequency domain.
result Efficient algorithm for sparse-localized estimates of principal subspaces.

Conventional principal component analysis (PCA) finds a principal vector that maximizes the sum of second powers of principal components. We consider a generalized PCA that aims at maximizing the sum of an arbitrary convex function of principal components. We present a gradient ascent algorithm to solve the problem. Fo…

2019-10-29abs ↗pdf ↗

We show how to efficiently project a vector onto the top principal components of a matrix, without explicitly computing these components. Specifically, we introduce an iterative algorithm that provably computes the projection using few calls to any black-box routine for ridge regression. By avoiding explicit principal …

2016-02-22abs ↗pdf ↗

Essential principal components simplify spectral analysis with minimal training data.

problem Accurate spectral quantification from complex mixtures.
method Identifying essential principal components and using molar extinction coefficients.
result Near one-to-one projection from principal components to mixture constituents.

Principal component regression (PCR) is a widely used two-stage procedure: principal component analysis (PCA), followed by regression in which the selected principal components are regarded as new explanatory variables in the model. Note that PCA is based only on the explanatory variables, so the principal components a…

2016-09-28abs ↗pdf ↗

New supervised and unsupervised NFLTs for elliptical distributions.

problem Understanding unsupervised No Free Lunch Theorems for elliptical distributions.
method Proved two equally optimal strategies for elliptical distributions, inspired PRIM-based bump-hunting algorithms.
result Optimal strategies for selecting principal components based on variance or volume.

CPCR mitigates bias in PCR for overparameterized models.

problem Bias in Principal Component Regression (PCR) for overparameterized models.
method Calibrated Principal Component Regression (CPCR) learns a low-variance prior in the PC subspace and calibrates the model in the original feature space.
result CPCR outperforms standard PCR in overparameterized settings, improving prediction across multiple problems.

The computation of the sparse principal component of a matrix is equivalent to the identification of its principal submatrix with the largest maximum eigenvalue. Finding this optimal submatrix is what renders the problem NP{\mathcal{NP}}-hard. In this work, we prove that, if the matrix is positive semidefinite and its …

2013-12-20abs ↗pdf ↗

The paper uses PCA and HMM to forecast stock returns outperforming buy-and-hold.

problem Predicting stock returns accurately.
method Applied PCA to covariance matrix of S&P 500 stocks, used HMM on principal components, and forecasted stock returns.
result The model outperforms buy-and-hold strategy in terms of annualized Sharpe ratio.

Study explores K-means clustering of variables and its relation to PCA.

problem Exploring the relationship between K-means clustering of variables and PCA.
method Apply PCA to original data and K-means to transposed data, quantify variable contributions to principal components.
result Identifies how variable clusters contribute to principal components identified by PCA.

We propose a new method for supervised learning, especially suited to wide data where the number of features is much greater than the number of observations. The method combines the lasso (1\ell_1) sparsity penalty with a quadratic penalty that shrinks the coefficient vector toward the leading principal components of …

2018-10-10abs ↗pdf ↗

A new method uses Gram matrix for efficient multivariate functional principal components.

problem Efficiently estimating eigencomponents of multidimensional functional datasets.
method Proposes using inner-product matrix to estimate eigenelements of multivariate and multidimensional functional datasets.
result Established relationship between eigenelements of covariance operator and inner-product matrix.

In this paper the exact linear relation between the leading eigenvectors of the modularity matrix and the singular vectors of an uncentered data matrix is developed. Based on this analysis the concept of a modularity component is defined, and its properties are developed. It is shown that modularity component analysis …

2015-10-19abs ↗pdf ↗

R package spca computes sparse principal components efficiently.

problem Sparse principal components analysis (SPCA) for interpretable data.
method Least squares sparse principal component analysis (LS-SPCA) with efficient C++ backend.
result Computes sparse principal components that maximize variance and maintain strong correlations with PCs.

GT-PCA improves PCA for image and time series data.

problem Lack of robustness to transformations in PCA.
method GT-PCA is a neural network that estimates components invariant to specific transformations.
result GT-PCA outperforms alternative methods in synthetic and real data experiments.

Improved convergence speed of principal component analysis through modified learning rules.

problem Slow convergence for covariance matrices with close eigenvalues.
method Introduced an additional term to the objective function to mitigate convergence issues.
result Significantly improved convergence speed confirmed through simulations.

We propose a fair principal component analysis method that balances reconstruction error and subgroup fairness.

problem Fairness and robustness in principal component analysis for consequential domains.
method Distributionally robust optimization over the Stiefel manifold with a Riemannian subgradient descent.
result The proposed method achieves better performance on real-world datasets compared to state-of-the-art baselines.

Generalized principal component analysis (GLM-PCA) facilitates dimension reduction of non-normally distributed data. We provide a detailed derivation of GLM-PCA with a focus on optimization. We also demonstrate how to incorporate covariates, and suggest post-processing transformations to improve interpretability of lat…

2019-07-03abs ↗pdf ↗

Kernel PCA explains self-attention mechanisms in deep learning models.

problem Understanding and explaining self-attention mechanisms in deep learning models.
method Deriving self-attention from kernel principal component analysis (kernel PCA).
result RPC-Attention, a robust attention mechanism, outperforms softmax attention in various tasks.

This study improves estimation of the first principal component in multivariate functional data.

problem Estimating the first principal component of multivariate random processes.
method Defined covariance functions and operators, introduced LASSO optimization, and established minimax lower bounds.
result The method provides an optimal variance in the minimax sense for estimating eigenelements.

Regularized MFPCA smooths multivariate functional data for clearer patterns.

problem Challenges in controlling roughness of multivariate functional PCs.
method ReMFPCA incorporates a roughness penalty in a penalized framework to smooth PCs.
result Smoothed multivariate functional PCs reveal clearer patterns.