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. 2011.06585
  4. Cited By
Sparse PCA: Algorithms, Adversarial Perturbations and Certificates

Sparse PCA: Algorithms, Adversarial Perturbations and Certificates

12 November 2020
Tommaso dÓrsi
Pravesh Kothari
Gleb Novikov
David Steurer
    AAML
ArXiv (abs)PDFHTML

Papers citing "Sparse PCA: Algorithms, Adversarial Perturbations and Certificates"

5 / 5 papers shown
Title
A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph
  Clustering
A Near-Linear Time Approximation Algorithm for Beyond-Worst-Case Graph Clustering
Vincent Cohen-Addad
Tommaso dÓrsi
Aida Mousavifar
91
1
0
07 Jun 2024
SQ Lower Bounds for Random Sparse Planted Vector Problem
SQ Lower Bounds for Random Sparse Planted Vector Problem
Jingqiu Ding
Yiding Hua
49
4
0
26 Jan 2023
Private estimation algorithms for stochastic block models and mixture
  models
Private estimation algorithms for stochastic block models and mixture models
Hongjie Chen
Vincent Cohen-Addad
Tommaso dÓrsi
Alessandro Epasto
Jacob Imola
David Steurer
Stefan Tiegel
FedML
93
21
0
11 Jan 2023
Optimal Spectral Recovery of a Planted Vector in a Subspace
Optimal Spectral Recovery of a Planted Vector in a Subspace
Cheng Mao
Alexander S. Wein
54
20
0
31 May 2021
Approximation Algorithms for Sparse Principal Component Analysis
Approximation Algorithms for Sparse Principal Component Analysis
Agniva Chowdhury
P. Drineas
David P. Woodruff
Samson Zhou
121
8
0
23 Jun 2020
1