Sparse constrained projection approximation subspace tracking
From MaRDI portal
Abstract: In this paper we revisit the well-known constrained projection approximation subspace tracking algorithm (CPAST) and derive, for the first time, non-asymptotic error bounds. Furthermore, we introduce a novel sparse modification of CPAST which is able to exploit sparsity in the underlying covariance structure. We present a non-asymptotic analysis of the proposed algorithm and study its empirical performance on simulated and real data.
Cites work
- Asymptotic convergence analysis of the projection approximation subspace tracking algorithms
- Chi-square oracle inequalities
- Fast and Stable Subspace Tracking
- Fast approximated power iteration subspace tracking
- Fast STAP Method Based on PAST with Sparse Constraint for Airborne Phased Array Radar
- Fast subspace tracking algorithm based on the constrained projection approximation
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- Local operator theory, random matrices and Banach spaces.
- Minimax bounds for sparse PCA with noisy high-dimensional data
- Multiscale local change point detection with applications to value-at-risk
- Sparse principal component analysis and iterative thresholding
- The Rotation of Eigenvectors by a Perturbation. III
- Unconditional bases are optimal bases for data compression and for statistical estimation
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
This page was built for publication: Sparse constrained projection approximation subspace tracking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6119054)
