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. 2105.08005
  4. Cited By
Learning a Latent Simplex in Input-Sparsity Time

Learning a Latent Simplex in Input-Sparsity Time

17 May 2021
Ainesh Bakshi
Chiranjib Bhattacharyya
R. Kannan
David P. Woodruff
Samson Zhou
ArXivPDFHTML

Papers citing "Learning a Latent Simplex in Input-Sparsity Time"

3 / 3 papers shown
Title
On the Robustness of the Successive Projection Algorithm
On the Robustness of the Successive Projection Algorithm
Giovanni Barbarino
Nicolas Gillis
81
0
0
25 Nov 2024
Scalable MCMC for Mixed Membership Stochastic Blockmodels
Scalable MCMC for Mixed Membership Stochastic Blockmodels
Wenzhe Li
Sungjin Ahn
Max Welling
BDL
32
42
0
16 Oct 2015
Fast and Robust Recursive Algorithms for Separable Nonnegative Matrix
  Factorization
Fast and Robust Recursive Algorithms for Separable Nonnegative Matrix Factorization
Nicolas Gillis
S. Vavasis
51
221
0
06 Aug 2012
1