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. 1805.06837
  4. Cited By
A fast algorithm with minimax optimal guarantees for topic models with
  an unknown number of topics

A fast algorithm with minimax optimal guarantees for topic models with an unknown number of topics

17 May 2018
Xin Bing
F. Bunea
M. Wegkamp
ArXivPDFHTML

Papers citing "A fast algorithm with minimax optimal guarantees for topic models with an unknown number of topics"

3 / 3 papers shown
Title
Unique sparse decomposition of low rank matrices
Unique sparse decomposition of low rank matrices
Dian Jin
Xin Bing
Yuqian Zhang
10
4
0
14 Jun 2021
Optimal Bayesian estimation of Gaussian mixtures with growing number of
  components
Optimal Bayesian estimation of Gaussian mixtures with growing number of components
Ilsang Ohn
Lizhen Lin
12
16
0
17 Jul 2020
Factoring nonnegative matrices with linear programs
Factoring nonnegative matrices with linear programs
Victor Bittorf
Benjamin Recht
Christopher Ré
J. Tropp
75
203
0
06 Jun 2012
1