← Back to all news
arXiv Machine Learning By Baran Koseoglu, Berrin Yanikoglu

Variance-Preserving Orthogonal Selection (VPOS): Greedy Feature Selection via Orthogonal Deflation in PCA Loading Space

Read the original on arXiv Machine Learning →

arXiv:2607. 23198v1 Announce Type: new Abstract: We propose Variance-Preserving Orthogonal Selection (VPOS), a greedy framework for unsupervised feature selection that operates in the weighted PCA loading space.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv Machine Learning
Jul 7

Efficient Cross-Validation for Sparse Linear Regression

arXiv:2306. 14851v5 Announce Type: replace-cross Abstract: Given a high-dimensional covariate matrix and a response vector, ridge-regularized sparse linear regression selects a subset of features that explains the relationship between covariates and the response in an interpretable manner.

By Ryan Cory-Wright, Andr\'es G\'omez
efficiency
More like this →
arXiv Machine Learning
Sep 23

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

SuperPCA is a new algorithm for high‑dimensional principal component analysis that exploits an approximate eigenspace of the sample covariance matrix. The authors show that the subspace spanned by several leading eigenvectors contains useful signal information long before individual eigenvectors converge, and they derive posteriori bounds on the angle between this subspace and the true signal subspace. By using only a small number of subsampled coordinates, SuperPCA can achieve up to a ten‑fold improvement in accuracy over classical PCA while reducing data acquisition costs, especially when the signals are approximately sparse.

By Irina-Beatrice Haas, Maike Meier, Yuji Nakatsukasa, Taejun Park
More like this →
arXiv Machine Learning
Sep 15

Eigenvalue-Decomposition Cost Denoising as an Alternative to Predict-then-Optimize for Shortest-Path Problems

The paper proposes using eigenvalue decomposition (or PCA) to denoise noisy cost observations for shortest‑path problems, instead of the traditional predict‑then‑optimize approach. By projecting new cost vectors onto the top‑k eigenvectors of the training covariance matrix before running Dijkstra’s algorithm, the method can recover the true underlying costs. Experiments on a 5×5 grid benchmark show that choosing k equal to the true latent feature dimension (k=5) yields the best performance, outperforming the SPO+ method especially under high model misspecification.

By Henry Aldridge-Krawciw, Irene Aldridge
benchmarks
More like this →