ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1807.00891
  4. Cited By
Optimality and Sub-optimality of PCA I: Spiked Random Matrix Models

Optimality and Sub-optimality of PCA I: Spiked Random Matrix Models

2 July 2018
Amelia Perry
Alexander S. Wein
Afonso S. Bandeira
Ankur Moitra
ArXivPDFHTML

Papers citing "Optimality and Sub-optimality of PCA I: Spiked Random Matrix Models"

16 / 16 papers shown
Title
On the phase diagram of extensive-rank symmetric matrix denoising beyond rotational invariance
On the phase diagram of extensive-rank symmetric matrix denoising beyond rotational invariance
Jean Barbier
Francesco Camilli
Justin Ko
Koki Okajima
21
5
0
04 Nov 2024
Computational lower bounds for multi-frequency group synchronization
Computational lower bounds for multi-frequency group synchronization
Anastasia Kireeva
Afonso S. Bandeira
Dmitriy Kunisky
46
1
0
05 Jun 2024
Fundamental limits of Non-Linear Low-Rank Matrix Estimation
Fundamental limits of Non-Linear Low-Rank Matrix Estimation
Pierre Mergny
Justin Ko
Florent Krzakala
Lenka Zdeborová
27
1
0
07 Mar 2024
Deflated HeteroPCA: Overcoming the curse of ill-conditioning in
  heteroskedastic PCA
Deflated HeteroPCA: Overcoming the curse of ill-conditioning in heteroskedastic PCA
Yuchen Zhou
Yuxin Chen
38
4
0
10 Mar 2023
Minimax Rates for Robust Community Detection
Minimax Rates for Robust Community Detection
Allen Liu
Ankur Moitra
18
13
0
25 Jul 2022
High-dimensional limit theorems for SGD: Effective dynamics and critical
  scaling
High-dimensional limit theorems for SGD: Effective dynamics and critical scaling
Gerard Ben Arous
Reza Gheissari
Aukosh Jagannath
49
59
0
08 Jun 2022
Sampling Approximately Low-Rank Ising Models: MCMC meets Variational
  Methods
Sampling Approximately Low-Rank Ising Models: MCMC meets Variational Methods
Frederic Koehler
Holden Lee
Andrej Risteski
24
21
0
17 Feb 2022
HyperPCA: a Powerful Tool to Extract Elemental Maps from Noisy Data
  Obtained in LIBS Mapping of Materials
HyperPCA: a Powerful Tool to Extract Elemental Maps from Noisy Data Obtained in LIBS Mapping of Materials
Riccardo Finotello
M. Tamaazousti
J. Sirven
13
12
0
30 Nov 2021
Hutch++: Optimal Stochastic Trace Estimation
Hutch++: Optimal Stochastic Trace Estimation
R. A. Meyer
Cameron Musco
Christopher Musco
David P. Woodruff
18
103
0
19 Oct 2020
Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent
Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent
Matthew Brennan
Guy Bresler
Samuel B. Hopkins
J. Li
T. Schramm
19
62
0
13 Sep 2020
Estimating Rank-One Spikes from Heavy-Tailed Noise via Self-Avoiding
  Walks
Estimating Rank-One Spikes from Heavy-Tailed Noise via Self-Avoiding Walks
Jingqiu Ding
Samuel B. Hopkins
David Steurer
6
10
0
31 Aug 2020
Near-Optimal Performance Bounds for Orthogonal and Permutation Group
  Synchronization via Spectral Methods
Near-Optimal Performance Bounds for Orthogonal and Permutation Group Synchronization via Spectral Methods
Shuyang Ling
18
34
0
12 Aug 2020
Information-Theoretic Limits for the Matrix Tensor Product
Information-Theoretic Limits for the Matrix Tensor Product
Galen Reeves
30
29
0
22 May 2020
Notes on Computational Hardness of Hypothesis Testing: Predictions using
  the Low-Degree Likelihood Ratio
Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio
Dmitriy Kunisky
Alexander S. Wein
Afonso S. Bandeira
21
135
0
26 Jul 2019
Subexponential-Time Algorithms for Sparse PCA
Subexponential-Time Algorithms for Sparse PCA
Yunzi Ding
Dmitriy Kunisky
Alexander S. Wein
Afonso S. Bandeira
20
57
0
26 Jul 2019
Computational Hardness of Certifying Bounds on Constrained PCA Problems
Computational Hardness of Certifying Bounds on Constrained PCA Problems
Afonso S. Bandeira
Dmitriy Kunisky
Alexander S. Wein
18
64
0
19 Feb 2019
1