SuperPCA: subspace analysis and an efficient algorithm for high-dimensional PCA (Q7353516)

From MaRDI portal

Jump to:navigation, search

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

SuperPCA: subspace analysis and an efficient algorithm for high-dimensional PCA

No description defined

Language	Label	Description	Also known as
default for all languages	No label defined
English	SuperPCA: subspace analysis and an efficient algorithm for high-dimensional PCA	No description defined

Statements

scholarly article

0 references

MaRDI profile type

MaRDI publication profile

0 references

SuperPCA: subspace analysis and an efficient algorithm for high-dimensional PCA (English)

0 references

publication date

22 September 2026

0 references

arXiv classification

stat.ML

0 references

cs.LG

0 references

math.NA

0 references

stat.CO

0 references

author name string

Irina-Beatrice Haas

0 references

Maike Meier

0 references

Yuji Nakatsukasa

0 references

Taejun Park

0 references

Irina-Beatrice Haas

Prefect Workflow Research Theme Updater

0 references

Prefect Workflow Research Theme Updater

0 references

Yuji Nakatsukasa

Prefect Workflow Research Theme Updater

0 references

We present SuperPCA (SUbsPace subsamplER PCA), an algorithm that efficiently estimates leading signals in high-dimensional data by leveraging an approximate eigenspace of the sample covariance matrix obtained from only a small number of subsampled coordinates, achieving up to 10x accuracy gain over classical PCA.

Llama-3.1_OpenScholar-8B

0 references

SuperPCA

0 references

Subspace Analysis

0 references

Efficient Algorithm

0 references

Prefect Workflow Research Theme Updater

0 references

Finite Sample Guarantees for PCA in Non-Isotropic and Data-Dependent Noise

1 reference

Semantic Scholar

Simpler is better: A comparative study of randomized algorithms for computing the CUR decomposition

1 reference

Semantic Scholar

Accuracy and Stability of CUR decompositions with Oversampling

1 reference

Semantic Scholar

SubApSnap: Solving parameter-dependent linear systems with a snapshot and subsampling

1 reference

Semantic Scholar

Sparse Principal Component Analysis

1 reference

Semantic Scholar

Gradient-based learning applied to document recognition

1 reference

Semantic Scholar

Normal approximation and concentration of spectral projectors of sample covariance

1 reference

Semantic Scholar

Limit of the smallest eigenvalue of a large dimensional sample covariance matrix

1 reference

Semantic Scholar

Finite sample approximation results for principal component analysis: A matrix perturbation approach

1 reference

Semantic Scholar

The smallest eigenvalue of a large dimensional Wishart matrix

1 reference

Semantic Scholar

A limit theorem for the norm of random matrices

1 reference

Semantic Scholar

On the distribution of the largest eigenvalue in principal components analysis

1 reference

Semantic Scholar

A rationale and test for the number of factors in factor analysis

1 reference

Semantic Scholar

Eigenvalues of large sample covariance matrices of spiked population models

1 reference

Semantic Scholar

Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices

1 reference

Semantic Scholar

A new selection operator for the discrete empirical interpolation method -- improved a priori error bound and extensions

1 reference

Semantic Scholar

Determinantal point processes for machine learning

1 reference

Semantic Scholar

Nonlinear model reduction via discrete empirical interpolation

1 reference

Semantic Scholar

Numerical methods for large eigenvalue problems

1 reference

Semantic Scholar

Sampling algorithms for \(l_2\) regression and applications

1 reference

Semantic Scholar

The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems

1 reference

Semantic Scholar

Sample Eigenvalue Based Detection of High-Dimensional Signals in White Noise Using Relatively Few Samples

1 reference

Semantic Scholar

Non-Parametric Detection of the Number of Signals: Hypothesis Testing and Random Matrix Theory

1 reference

Semantic Scholar

DISTRIBUTION OF EIGENVALUES FOR SOME SETS OF RANDOM MATRICES

1 reference

Semantic Scholar

The Rotation of Eigenvectors by a Perturbation. III

1 reference

Semantic Scholar

Asymptotic Theory for Principal Component Analysis

1 reference

Semantic Scholar

Perturbation bounds in connection with singular value decomposition

1 reference

Semantic Scholar

Accuracy and stability of CUR decompositions with oversampling

1 reference

Semantic Scholar

Randomly pivoted Cholesky: practical approximation of a kernel matrix with few entry evaluations

1 reference

Semantic Scholar

Sharp error bounds for Ritz vectors and approximate singular vectors

1 reference

Semantic Scholar

Nonasymptotic upper bounds for the reconstruction error of PCA

1 reference

Semantic Scholar

Large sample covariance matrices and high-dimensional data analysis

1 reference

Semantic Scholar

Truncated power method for sparse eigenvalue problems

1 reference

Semantic Scholar

Fast approximation of matrix coherence and statistical leverage

1 reference

Semantic Scholar

On consistency and sparsity for principal components analysis in high dimensions

1 reference

Semantic Scholar

Generalized power method for sparse principal component analysis

1 reference

Semantic Scholar

The Symmetric Eigenvalue Problem

1 reference

Semantic Scholar

Matrix Computations

1 reference

Semantic Scholar

Asymptotics of sample eigenstructure for a large dimensional spiked covariance model

1 reference

Semantic Scholar

Identifiers

0 references

10.48550/arXiv.2609.26406

0 references

Sitelinks

Mathematics(1 entry)

mardi SuperPCA: subspace analysis and an efficient algorithm for high-dimensional PCA

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q7353516&oldid=105210917"