arXiv · 1812.04315
Faster-than-fast NMF using random projections and Nesterov iterations
Abstract
Random projections have been recently implemented in Nonnegative Matrix Factorization (NMF) to speed-up the NMF computations, with a negligible loss of performance. In this paper, we investigate the effects of such projections when the NMF technique uses the fast Nesterov gradient descent (NeNMF). We experimentally show the randomized subspace iteration to significantly speed-up NeNMF.
Explore related subjects
Keep this discovery
Farouk Yahaya, Matthieu Puigt, Gilles Delmaire, Gilles Roussel. 2018-12-11. Faster-than-fast NMF using random projections and Nesterov iterations. https://arxiv.org/abs/1812.04315
Cite the original work for its findings. Save a collection to share your selection of sources.