Skip to content
conftrace_

sparse pca

24 papers

Papers

Fast and Provable Algorithms for Sparse PCA with Improved Sample Complexity ICML 2025 Computational-Statistical Gaps for Improper Learning in Sparse Linear Regression COLT 2024 Privacy-preserving Sparse Generalized Eigenvalue Problem AISTATS 2023 Outlier-Robust Sparse Estimation via Non-Convex Optimization NeurIPS 2022 Riemannian Stochastic Proximal Gradient Methods for Nonsmooth Optimization over the Stiefel Manifold JMLR 2022 Optimal Structured Principal Subspace Estimation: Metric Entropy and Minimax Rates JMLR 2021 Statistical Query Algorithms and Low Degree Tests Are Almost Equivalent COLT 2021 A Greedy Anytime Algorithm for Sparse PCA COLT 2020 Reducibility and Statistical-Computational Gaps from Secret Leakage COLT 2020 Outlier-Robust High-Dimensional Sparse Estimation via Iterative Filtering NeurIPS 2019 Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure COLT 2018 Globally Sparse Probabilistic PCA AISTATS 2016 On the Approximability of Sparse PCA COLT 2016 Optimal Sparse Linear Encoders and Sparse PCA NeurIPS 2016 Sparse PCA via Bipartite Matchings NeurIPS 2015 Stay on path: PCA along graph paths ICML 2015 Finding a sparse vector in a subspace: Linear sparsity using alternating directions NeurIPS 2014 Sparse PCA with Oracle Property NeurIPS 2014 Sparse PCA through Low-rank Approximations ICML 2013 Group Lasso Estimation of High-dimensional Covariance Matrices JMLR 2011 An Inverse Power Method for Nonlinear Eigenproblems with Applications in 1-Spectral Clustering and Sparse PCA NeurIPS 2010 CUR from a Sparse Optimization Viewpoint NeurIPS 2010 Dense Message Passing for Sparse Principal Component Analysis AISTATS 2010 Deflation Methods for Sparse PCA NeurIPS 2008