Statistical and computational trade-offs in estimation of sparse principal components

22 August 2014

Papers citing "Statistical and computational trade-offs in estimation of sparse principal components"

26 / 26 papers shown

Title
Robust Sparse Estimation for Gaussians with Optimal Error under Huber Contamination Ilias Diakonikolas Daniel M. Kane Sushrut Karmalkar Ankit Pensia Thanasis Pittas 34 0 0 15 Mar 2024
Do algorithms and barriers for sparse principal component analysis extend to other structured settings? Guanyi Wang Mengqi Lou A. Pananjady CML 40 1 0 25 Jul 2023
Statistical and computational rates in high rank tensor estimation Chanwoo Lee Miaoyan Wang 33 1 0 08 Apr 2023
Outlier Robust and Sparse Estimation of Linear Regression Coefficients Takeyuki Sasai Hironori Fujisawa 30 4 0 24 Aug 2022
Robust and Sparse Estimation of Linear Regression Coefficients with Heavy-tailed Noises and Covariates Takeyuki Sasai 26 4 0 15 Jun 2022
Entrywise Recovery Guarantees for Sparse PCA via Sparsistent Algorithms Joshua Agterberg Jeremias Sulam 29 0 0 08 Feb 2022
Optimal convex lifted sparse phase retrieval and PCA with an atomic matrix norm regularizer Andrew D. McRae Justin Romberg Mark A. Davenport 35 8 0 08 Nov 2021
Inferring Hidden Structures in Random Graphs Wasim Huleihel 19 7 0 05 Oct 2021
Random Subgraph Detection Using Queries Wasim Huleihel A. Mazumdar S. Pal 25 6 0 02 Oct 2021
Sparse principal component analysis for high-dimensional stationary time series Kou Fujimori Yuichi Goto Yong Liu M. Taniguchi 27 2 0 01 Sep 2021
Open Problem: Average-Case Hardness of Hypergraphic Planted Clique Detection Yuetian Luo Anru R. Zhang 27 14 0 12 Sep 2020
Computationally efficient sparse clustering Matthias Löffler Alexander S. Wein Afonso S. Bandeira 35 14 0 21 May 2020
Tensor Clustering with Planted Structures: Statistical Optimality and Computational Limits Yuetian Luo Anru R. Zhang 35 44 0 21 May 2020
Reducibility and Statistical-Computational Gaps from Secret Leakage Matthew Brennan Guy Bresler 29 86 0 16 May 2020
Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio Dmitriy Kunisky Alexander S. Wein Afonso S. Bandeira 29 136 0 26 Jul 2019
Subexponential-Time Algorithms for Sparse PCA Yunzi Ding Dmitriy Kunisky Alexander S. Wein Afonso S. Bandeira 30 57 0 26 Jul 2019
Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness Matthew Brennan Guy Bresler 29 50 0 20 Feb 2019
Universality of Computational Lower Bounds for Submatrix Detection Matthew Brennan Guy Bresler Wasim Huleihel 35 26 0 19 Feb 2019
Wald Statistics in high-dimensional PCA Matthias Loffler 23 1 0 10 May 2018
Tensor SVD: Statistical and Computational Limits Anru R. Zhang Dong Xia 21 166 0 08 Mar 2017
Robust Sparse Estimation Tasks in High Dimensions Jerry Li 53 27 0 20 Feb 2017
High-dimensional changepoint estimation via sparse projection Tengyao Wang R. Samworth AI4TS 29 229 0 20 Jun 2016
Optimal Rates of Convergence for Noisy Sparse Phase Retrieval via Thresholded Wirtinger Flow T. Tony Cai Xiaodong Li Zongming Ma 29 232 0 10 Jun 2015
Detection of Planted Solutions for Flat Satisfiability Problems Quentin Berthet J. Ellenberg 35 6 0 21 Feb 2015
Testing uniformity on high-dimensional spheres against monotone rotationally symmetric alternatives Christine Cutting D. Paindaveine Thomas Verdebout 34 21 0 07 Feb 2015
Computational and Statistical Boundaries for Submatrix Localization in a Large Noisy Matrix T. Tony Cai Tengyuan Liang Alexander Rakhlin 34 61 0 06 Feb 2015