Accelerated parallel and distributed algorithm using limited internal memory for nonnegative matrix factorization

Nonnegative matrix factorization (NMF) is a powerful technique for dimension reduction, extracting latent factors and learning part-based representation. For large datasets, NMF performance depends on some major issues such as fast algorithms, fully parallel distributed feasibility and limited inter...

Full description

Saved in:
Bibliographic Details
Published in:Journal of global optimization Vol. 68; no. 2; pp. 307 - 328
Main Authors: Nguyen, Duy Khuong, Ho, Tu Bao
Format: Journal Article
Language:English
Published: New York Springer US 01.06.2017
Springer
Springer Nature B.V
Subjects:
Algorithms
Computer Science
Convergence
Datasets
Factorization
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Real Functions
Search algorithms
Cooridinate descent algorithm
Parallel and distributed algorithm
Non-negative matrix factorization
Accelerated anti-lopsided algorithm
ISSN:0925-5001, 1573-2916
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Nonnegative matrix factorization (NMF) is a powerful technique for dimension reduction, extracting latent factors and learning part-based representation. For large datasets, NMF performance depends on some major issues such as fast algorithms, fully parallel distributed feasibility and limited internal memory. This research designs a fast fully parallel and distributed algorithm using limited internal memory to reach high NMF performance for large datasets. Specially, we propose a flexible accelerated algorithm for NMF with all its L 1 L 2 regularized variants based on full decomposition, which is a combination of exact line search, greedy coordinate descent, and accelerated search. The proposed algorithm takes advantages of these algorithms to converges linearly at an over-bounded rate ( 1 - μ L ) ( 1 - μ r L ) 2 r in optimizing each factor matrix when fixing the other factor one in the sub-space of passive variables, where r is the number of latent components, and μ and L are bounded as 1 2 ≤ μ ≤ L ≤ r . In addition, the algorithm can exploit the data sparseness to run on large datasets with limited internal memory of machines, which is is advanced compared to fast block coordinate descent methods and accelerated methods. Our experimental results are highly competitive with seven state-of-the-art methods about three significant aspects of convergence, optimality and average of the iteration numbers.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0925-5001
1573-2916
DOI:10.1007/s10898-016-0471-z