Accelerating nonnegative matrix factorization algorithms using extrapolation
From MaRDI portal
Publication:3379602
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.
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
- A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
- Accelerated, parallel, and proximal coordinate descent
- Adaptive restart for accelerated gradient schemes
- Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
- Algorithms for nonnegative matrix factorization with the \(\beta\)-divergence
- Cyclic coordinate-update algorithms for fixed-point problems: analysis and applications
- Efficient and Non-Convex Coordinate Descent for Symmetric Nonnegative Matrix Factorization
- Fast nonnegative matrix factorization: an active-set-like method and comparisons
- Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization
- Introductory lectures on convex optimization. A basic course.
- Iteration complexity analysis of block coordinate descent methods
- Learning the parts of objects by non-negative matrix factorization
- Linear and nonlinear programming.
- NeNMF: An Optimal Gradient Method for Nonnegative Matrix Factorization
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- On the complexity of nonnegative matrix factorization
- On the convergence of block coordinate descent type methods
- Projected Gradient Methods for Nonnegative Matrix Factorization
- Robust Volume Minimization-Based Matrix Factorization for Remote Sensing and Document Clustering
Cited in
(10)- A survey on deep matrix factorizations
- An Alternating Rank-k Nonnegative Least Squares Framework (ARkNLS) for Nonnegative Matrix Factorization
- A nonlinear matrix decomposition for mining the zeros of sparse data
- Algorithms for nonnegative matrix factorization with the Kullback-Leibler divergence
- Quasi non-negative quaternion matrix factorization with application to color face recognition
- A multilevel approach for nonnegative matrix factorization
- Robust Manhattan non-negative matrix factorization for image recovery and representation
- Multiplicative Updates for NMF with $\beta$-Divergences under Disjoint Equality Constraints
- An efficient method for non-negative low-rank completion
- On the asymptotic linear convergence speed of Anderson acceleration, Nesterov acceleration, and nonlinear GMRES
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)
