ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1502.05675
  4. Cited By
NP-Hardness and Inapproximability of Sparse PCA
v1v2 (latest)

NP-Hardness and Inapproximability of Sparse PCA

19 February 2015
M. Magdon-Ismail
    TPM
ArXiv (abs)PDFHTML

Papers citing "NP-Hardness and Inapproximability of Sparse PCA"

14 / 14 papers shown
Title
Minimax rates in variance and covariance changepoint testing
Minimax rates in variance and covariance changepoint testing
Per August Jarval Moen
110
0
0
13 May 2024
Recovering Simultaneously Structured Data via Non-Convex Iteratively
  Reweighted Least Squares
Recovering Simultaneously Structured Data via Non-Convex Iteratively Reweighted Least SquaresNeural Information Processing Systems (NeurIPS), 2023
C. Kümmerle
J. Maly
168
1
0
08 Jun 2023
Variable Selection for Kernel Two-Sample Tests
Variable Selection for Kernel Two-Sample Tests
Jie Wang
Santanu S. Dey
Yao Xie
163
5
0
15 Feb 2023
Hardness and Algorithms for Robust and Sparse Optimization
Hardness and Algorithms for Robust and Sparse OptimizationInternational Conference on Machine Learning (ICML), 2022
Eric Price
Sandeep Silwal
Samson Zhou
142
9
0
29 Jun 2022
Sparse PCA on fixed-rank matrices
Sparse PCA on fixed-rank matricesMathematical programming (Math. Program.), 2022
Alberto Del Pia
198
7
0
07 Jan 2022
Several Approximation Algorithms for Sparse Best Rank-1 Approximation to
  Higher-Order Tensors
Several Approximation Algorithms for Sparse Best Rank-1 Approximation to Higher-Order TensorsJournal of Global Optimization (JGO), 2020
Xianpeng Mao
Yuning Yang
216
4
0
05 Dec 2020
Exact and Approximation Algorithms for Sparse PCA
Exact and Approximation Algorithms for Sparse PCA
Yongchun Li
Weijun Xie
172
22
0
28 Aug 2020
Approximation Algorithms for Sparse Principal Component Analysis
Approximation Algorithms for Sparse Principal Component Analysis
Agniva Chowdhury
P. Drineas
David P. Woodruff
Samson Zhou
226
9
0
23 Jun 2020
Computationally Efficient Robust Estimation of Sparse Functionals
Computationally Efficient Robust Estimation of Sparse Functionals
S. Du
Sivaraman Balakrishnan
Aarti Singh
124
18
0
24 Feb 2017
Sparse PCA via Bipartite Matchings
Sparse PCA via Bipartite Matchings
Megasthenis Asteris
Dimitris Papailiopoulos
Anastasios Kyrillidis
A. Dimakis
160
29
0
04 Aug 2015
On the Worst-Case Approximability of Sparse PCA
On the Worst-Case Approximability of Sparse PCA
S. Chan
Dimitris Papailiopoulos
A. Rubinstein
121
7
0
21 Jul 2015
Approximating Sparse PCA from Incomplete Data
Approximating Sparse PCA from Incomplete Data
Abhisek Kundu
P. Drineas
M. Magdon-Ismail
145
4
0
12 Mar 2015
Optimal Sparse Linear Auto-Encoders and Sparse PCA
Optimal Sparse Linear Auto-Encoders and Sparse PCA
M. Magdon-Ismail
Christos Boutsidis
108
6
0
23 Feb 2015
Alternating Maximization: Unifying Framework for 8 Sparse PCA
  Formulations and Efficient Parallel Codes
Alternating Maximization: Unifying Framework for 8 Sparse PCA Formulations and Efficient Parallel Codes
Peter Richtárik
Majid Jahani
S. Ahipaşaoğlu
Martin Takáč
213
31
0
17 Dec 2012
1