Accelerating nonnegative matrix factorization algorithms using extrapolation
From MaRDI portal
Publication:3379602
DOI10.1162/NECO_A_01157zbMATH Open1470.65083DBLPjournals/neco/AngG19arXiv1805.06604OpenAlexW2804176448WikidataQ90701089 ScholiaQ90701089MaRDI QIDQ3379602FDOQ3379602
Authors: Andersen Man Shun Ang, Nicolas Gillis 
Publication date: 27 September 2021
Published in: Neural Computation (Search for Journal in Brave)
Abstract: In this paper, we propose a general framework to accelerate significantly the algorithms for nonnegative matrix factorization (NMF). This framework is inspired from the extrapolation scheme used to accelerate gradient methods in convex optimization and from the method of parallel tangents. However, the use of extrapolation in the context of the two-block exact coordinate descent algorithms tackling the non-convex NMF problems is novel. We illustrate the performance of this approach on two state-of-the-art NMF algorithms, namely, accelerated hierarchical alternating least squares (A-HALS) and alternating nonnegative least squares (ANLS), using synthetic, image and document data sets.
Full work available at URL: https://arxiv.org/abs/1805.06604
Recommendations
- A multilevel approach for nonnegative matrix factorization
- Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
- Alternative gradient algorithms with applications to nonnegative matrix factorizations
- An efficient nonmonotone projected Barzilai-Borwein method for nonnegative matrix factorization with extrapolation
- Fast nonnegative matrix factorization: an active-set-like method and comparisons
Cites Work
- Introductory lectures on convex optimization. A basic course.
- Adaptive restart for accelerated gradient schemes
- Linear and nonlinear programming.
- On the complexity of nonnegative matrix factorization
- Projected Gradient Methods for Nonnegative Matrix Factorization
- Learning the parts of objects by non-negative matrix factorization
- Algorithms for nonnegative matrix factorization with the \(\beta\)-divergence
- A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
- Accelerated, parallel, and proximal coordinate descent
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
- On the convergence of block coordinate descent type methods
- Fast nonnegative matrix factorization: an active-set-like method and comparisons
- Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization
- Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- Iteration complexity analysis of block coordinate descent methods
- Efficient and Non-Convex Coordinate Descent for Symmetric Nonnegative Matrix Factorization
- Robust Volume Minimization-Based Matrix Factorization for Remote Sensing and Document Clustering
- NeNMF: An Optimal Gradient Method for Nonnegative Matrix Factorization
- Cyclic coordinate-update algorithms for fixed-point problems: analysis and applications
Cited In (10)
- Quasi non-negative quaternion matrix factorization with application to color face recognition
- Multiplicative Updates for NMF with $\beta$-Divergences under Disjoint Equality Constraints
- A multilevel approach for nonnegative matrix factorization
- Robust Manhattan non-negative matrix factorization for image recovery and representation
- Algorithms for nonnegative matrix factorization with the Kullback-Leibler divergence
- An efficient method for non-negative low-rank completion
- An Alternating Rank-k Nonnegative Least Squares Framework (ARkNLS) for Nonnegative Matrix Factorization
- A survey on deep matrix factorizations
- On the Asymptotic Linear Convergence Speed of Anderson Acceleration, Nesterov Acceleration, and Nonlinear GMRES
- A Nonlinear Matrix Decomposition for Mining the Zeros of Sparse Data
Uses Software
This page was built for publication: Accelerating nonnegative matrix factorization algorithms using extrapolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3379602)
