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

171342512683 · Jun 202019922001200920172026
48 results for common principal component analysis

This study examines whether PCA can effectively identify nitrogen pollution sources in rivers.

problem Identifying pollution sources in rivers for effective environmental management.
method Principal Component Analysis and its modifications, along with Independent Component Analysis and Factor Analysis, are applied to nitrogen pollution source identification.
result PCA and related techniques can be powerful tools for uncovering nitrogen pollution sources in rivers.

A new portfolio method using quantum mechanics improves risk diversification.

problem Improving risk-based portfolio construction methods for multi-asset portfolios.
method Schrödinger principal component analysis applied to extract common factors from asset fluctuations.
result The proposed method outperforms conventional risk parity and other risk diversification methods.

Methods for analysis of principal components in discrete data have existed for some time under various names such as grade of membership modelling, probabilistic latent semantic analysis, and genotype inference with admixture. In this paper we explore a number of extensions to the common theory, and present some applic…

2012-07-11abs ↗pdf ↗

FCPCA fuzzy clusters high-dimensional time series data efficiently.

problem Ambiguous clustering of multivariate time series data with overlapping distributions.
method FCPCA based on common principal component analysis.
result FCPCA outperforms existing methods in fuzzy clustering of multivariate time series.

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.

Principal Component Analysis (PCA) is the most common nonparametric method for estimating the volatility structure of Gaussian interest rate models. One major difficulty in the estimation of these models is the fact that forward rate curves are not directly observable from the market so that non-trivial observational e…

2014-08-26abs ↗pdf ↗

Two new models forecast multiple subpopulations' mortality, outperforming existing methods.

problem Modeling mortality patterns and trajectories in related populations.
method Adapted multivariate functional principal component analysis techniques.
result The second proposed model outperforms existing methods in forecast accuracy.

We present a large-scale study of commonality in liquidity and resilience across assets in an ultra high-frequency (millisecond-timestamped) Limit Order Book (LOB) dataset from a pan-European electronic equity trading facility. We first show that extant work in quantifying liquidity commonality through the degree of ex…

2014-06-20abs ↗pdf ↗

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.

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.

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 ↗

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 ↗

A new robust PCA estimator combining M-estimators and minimum divergence estimators.

problem Adverse effect of outlying observations in PCA for high-dimensional data.
method Minimum density power divergence estimator combined with a computationally efficient algorithm.
result High breakdown guarantee regardless of data dimension with theoretical support and practical applications.

In this work we propose a method for reducing the dimensionality of tensor objects in a binary classification framework. The proposed Common Mode Patterns method takes into consideration the labels' information, and ensures that tensor objects that belong to different classes do not share common features after the redu…

2019-02-06abs ↗pdf ↗

The excluded area between a pair of two-dimensional hard particles with given relative orientation is the region in which one particle cannot be located due to the presence of the other particle. The magnitude of the excluded area as a function of the relative particle orientation plays a major role in the determinatio…

2019-02-15abs ↗pdf ↗

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.

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.

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.

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 ↗

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.

New method embeds correlation networks to reveal underlying time series patterns.

problem Analyzing correlation networks derived from time series data.
method Spectral embedding of noisy correlation networks, leveraging Fourier basis elements.
result Spectral embedding recovers true vertex-level latent representations under suitable assumptions.

Proposes an online method for high-dimensional streaming data.

problem Increasing variable dimensions with sample size in online kernel sliced inverse regression.
method Introduces approximate linear dependence condition and dictionary variable sets to address the problem. Transforms into online generalized eigen-decomposition problem and uses stochastic optimization for updates.
result Achieves close performance to batch processing kernel sliced inverse regression.

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 ↗

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.