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

90179269358 · Jun 202019922001200920172026
48 results for Principal Component Regression (PCR)

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.

A new PCR method using SVD with sparse regularization.

problem Lack of response variable information in traditional PCR.
method One-stage SVD approach with two loss functions and sparse regularization.
result Obtains principal component loadings with response variable information.

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 ↗

VC-PCR improves prediction by clustering correlated variables.

problem Decreased prediction accuracy due to cluster structure in predictor variables.
method Supervised variable selection and clustering to integrate cluster information into a sparse modeling process.
result VC-PCR achieves better prediction, variable selection, and clustering performance.

This study analyzes prediction risk for PCR method in latent factor regression models.

problem Prediction risk analysis in latent factor regression models.
method Adaptive PCR method with risk bounds established under factor regression model.
result Unified framework for analyzing various linear prediction methods under factor regression.

PCR-LE achieves optimal rates for nonparametric regression over Sobolev spaces.

problem Nonparametric regression over Sobolev spaces with random design.
method PCR-LE using Laplacian Eigenmaps on neighborhood graphs.
result PCR-LE achieves minimax rates of convergence for both estimation and goodness-of-fit testing.

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 ↗

Improved fMRI analysis models enhance classification performance and select relevant brain regions.

problem Inaccurate selection of relevant brain components in MVPA models.
method Hybrid Sparsity-Ranked LASSO (JSRL) method integrating component-level and voxel-level activity.
result JSRL models achieve up to 51.7% improvement in cross-validated deviance R2R^2 and 7.3% improvement in cross-validated AUC.

We identify and validate a model for PCR in high dimensions, improving prediction guarantees.

problem Model identification and out-of-sample prediction in high-dimensional error-in-variables settings.
method Analysis of principal component regression (PCR) in fixed design settings, introducing a linear algebraic condition.
result Consistent model identification and improved out-of-sample prediction guarantees.

Principal component regression (PCR) is a simple, but powerful and ubiquitously utilized method. Its effectiveness is well established when the covariates exhibit low-rank structure. However, its ability to handle settings with noisy, missing, and mixed-valued, i.e., discrete and continuous, covariates is not understoo…

2019-02-28abs ↗pdf ↗

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.

A new method improves target selection for manipulating complex systems like the brain.

problem Improper incorporation of low-variance outcomes into latent space of predictive models.
method Developed a novel objective based on supervised variational autoencoders (SVAEs) for PPCA (Probabilistic Principal Component Analysis).
result gPCR (Generative Principal Component Regression) dramatically improves target selection in manipulation compared to standard PCR and SVAEs.

Consider a regression problem where there is no labeled data and the only observations are the predictions fi(xj)f_i(x_j) of mm experts fif_{i} over many samples xjx_j. With no knowledge on the accuracy of the experts, is it still possible to accurately estimate the unknown responses yjy_{j}? Can one still detect the leas…

2017-03-08abs ↗pdf ↗

We analyze optimal weighted ridge regression in overparameterized linear models.

problem Optimal regularization in overparameterized linear regression models.
method Generalized ridge regression with weighted regularization.
result The optimal regularization parameter can be negative in overparameterized settings.

PLS-Lasso integrates dimension reduction into regression for financial index tracking.

problem Dimension reduction and regression are traditionally treated separately in multivariate data analysis.
method PLS-Lasso integrates dimension reduction directly into the regression process, presenting two formulations: PLS-Lasso-v1 and PLS-Lasso-v2.
result PLS-Lasso-v1 and PLS-Lasso-v2 outperform Lasso in financial index tracking.

New method speeds up learning of complex dynamical systems.

problem Efficiently learning large-scale dynamical systems from finite data.
method Random projections (sketching) to boost kernel-based Koopman operator estimators.
result The proposed estimators maintain accuracy while significantly reducing computation time.

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 ↗

Survey of SDR methods for high-dimensional regression and embedding.

problem Reducing dimensionality in high-dimensional data.
method Involves both statistical and machine learning approaches, covering inverse and forward regression methods.
result Supervised Kernel Dimension Reduction is equivalent to supervised PCA.

New approach to quantify posterior concentration rates using Wasserstein dynamics.

problem Quantifying the speed of posterior distribution concentration in Bayesian statistics.
method Combining local Lipschitz-continuity with dynamic formulation of Wasserstein distance.
result Optimal posterior contraction rates in finite and infinite-dimensional models.

Study on reducing dimensionality in high-dimensional regression with kernel methods and stability analysis.

problem Analyzing errors in high-dimensional regression with dimensionality reduction and kernel regression.
method Derive a stability result for kernel regression with Wasserstein distance and apply it to PCA to deduce convergence rates.
result Two-step procedure yields useful convergence rates in semi-supervised settings.

Linear models can overfit without harming OOD generalization under certain conditions.

problem Understanding how overparameterized linear models generalize to out-of-distribution data.
method Analyzing overparameterized linear models under covariate shift, providing guarantees for OOD generalization.
result Benign overfitting occurs in standard ridge regression under OOD conditions, with specific structural conditions on target covariance.

In the multiple linear regression setting, we propose a general framework, termed weighted orthogonal components regression (WOCR), which encompasses many known methods as special cases, including ridge regression and principal components regression. WOCR makes use of the monotonicity inherent in orthogonal components …

2017-09-13abs ↗pdf ↗

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 ↗

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.

Study reduces financial dynamics complexity using PCA for NASDAQ, oil, gold, and USD.

problem Understanding complex financial interactions among multiple assets.
method Time-delay embedding and PCA for dimensionality reduction, followed by linear regression.
result Limited number of principal components capture dominant dynamics of each asset.

We propose a penalized orthogonal-components regression (POCRE) for large p small n data. Orthogonal components are sequentially constructed to maximize, upon standardization, their correlation to the response residuals. A new penalization framework, implemented via empirical Bayes thresholding, is presented to effecti…

2008-11-25abs ↗pdf ↗

We study least squares linear regression over NN uncorrelated Gaussian features that are selected in order of decreasing variance. When the number of selected features pp is at most the sample size nn, the estimator under consideration coincides with the principal component regression estimator; when p>np>n, the esti…

2019-06-04abs ↗pdf ↗

Technological change and innovation are vitally important, especially for high-tech companies. However, factors influencing their future research and development (R&D) trends are both complicated and various, leading it a quite difficult task to make technology tracing for high-tech companies. To this end, in this pape…

2020-01-02abs ↗pdf ↗

SPPCSO addresses multicollinearity in high-dimensional data, improving model stability and predictive accuracy.

problem Multicollinearity in high-dimensional data leads to unstable estimation and reduced predictive accuracy.
method SPPCSO integrates principal component regression and L1 regularization to adaptively adjust shrinkage factors.
result SPPCSO achieves stable and reliable estimation in high-noise settings, distinguishing signal variables from noise.

Kernelized PCovR reveals structure-property relations in chemistry and materials.

problem Understanding structure-property relations in complex systems.
method Kernel Principal Covariates Regression (kernel PCovR) with sparsification.
result Kernelized PCovR effectively reveals and predicts structure-property relations.

We compare the risk of ridge regression to a simple variant of ordinary least squares, in which one simply projects the data onto a finite dimensional subspace (as specified by a Principal Component Analysis) and then performs an ordinary (un-regularized) least squares regression in this subspace. This note shows that …

2011-05-04abs ↗pdf ↗

Motivated by the Bagging Partial Least Squares (PLS) and Principal Component Analysis (PCA) algorithms, we propose a Principal Model Analysis (PMA) method in this paper. In the proposed PMA algorithm, the PCA and the PLS are combined. In the method, multiple PLS models are trained on sub-training sets, derived from the…

2019-02-06abs ↗pdf ↗

This paper introduces a new unsupervised method for dimensionality reduction via regression (DRR). The algorithm belongs to the family of invertible transforms that generalize Principal Component Analysis (PCA) by using curvilinear instead of linear features. DRR identifies the nonlinear features through multivariate r…

2016-01-31abs ↗pdf ↗

We explore the effect of past market movements on the instantaneous correlations between assets within the futures market. Quantifying this effect is of interest to estimate and manage the risk associated to portfolios of futures in a non-stationary context. We apply and extend a previously reported method called the P…

2019-12-27abs ↗pdf ↗

New methods combine low and high-fidelity data for accurate surrogate modeling.

problem Challenges in surrogate modeling for high-dimensional outputs with limited training data.
method Projection-based multifidelity linear regression methods integrating low-fidelity and high-fidelity data.
result Multifidelity methods achieve up to 12% improvement in median accuracy compared to single-fidelity methods.