Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2105.08005
Cited By
Learning a Latent Simplex in Input-Sparsity Time
17 May 2021
Ainesh Bakshi
Chiranjib Bhattacharyya
R. Kannan
David P. Woodruff
Samson Zhou
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Learning a Latent Simplex in Input-Sparsity Time"
4 / 4 papers shown
Title
On the Robustness of the Successive Projection Algorithm
Giovanni Barbarino
Nicolas Gillis
86
0
0
25 Nov 2024
Krylov Methods are (nearly) Optimal for Low-Rank Approximation
Ainesh Bakshi
Shyam Narayanan
31
6
0
06 Apr 2023
Scalable MCMC for Mixed Membership Stochastic Blockmodels
Wenzhe Li
Sungjin Ahn
Max Welling
BDL
34
42
0
16 Oct 2015
Fast and Robust Recursive Algorithms for Separable Nonnegative Matrix Factorization
Nicolas Gillis
S. Vavasis
58
222
0
06 Aug 2012
1
