Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations
From MaRDI portal
(Redirected from Publication:1640558)
Abstract: The successive projection algorithm (SPA) can quickly solve a nonnegative matrix factorization problem under a separability assumption. Even if noise is added to the problem, SPA is robust as long as the perturbations caused by the noise are small. In particular, robustness against noise should be high when handling the problems arising from real applications. The preconditioner proposed by Gillis and Vavasis (2015) makes it possible to enhance the noise robustness of SPA. Meanwhile, an additional computational cost is required. The construction of the preconditioner contains a step to compute the top- truncated singular value decomposition of an input matrix. It is known that the decomposition provides the best rank- approximation to the input matrix; in other words, a matrix with the smallest approximation error among all matrices of rank less than . This step is an obstacle to an efficient implementation of the preconditioned SPA. To address the cost issue, we propose a modification of the algorithm for constructing the preconditioner. Although the original algorithm uses the best rank- approximation, instead of it, our modification uses an alternative. Ideally, this alternative should have high approximation accuracy and low computational cost. To ensure this, our modification employs a rank- approximation produced by an SPA based algorithm. We analyze the accuracy of the approximation and evaluate the computational cost of the algorithm. We then present an empirical study revealing the actual performance of the SPA based rank- approximation algorithm and the modified preconditioned SPA.
Recommendations
- Robustness analysis of preconditioned successive projection algorithm for general form of separable NMF problem
- Semidefinite programming based preconditioning for more robust near-separable nonnegative matrix factorization
- Successive nonnegative projection algorithm for robust nonnegative blind source separation
- Sparse and unique nonnegative matrix factorization through data preprocessing
- Refinement of Hottopixx method for nonnegative matrix factorization under noisy separability
Cites work
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- A randomized algorithm for principal component analysis
- Compressed Nonnegative Matrix Factorization Is Fast and Accurate
- Computation of Minimum-Volume Covering Ellipsoids
- Computing a nonnegative matrix factorization -- provably
- Ellipsoidal rounding for nonnegative matrix factorization under noisy separability
- Enhancing pure-pixel identification performance via preconditioning
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Handbook series linear algebra. Linear least squares solutions by Householder transformations
- Introduction to Information Retrieval
- Latent semantic indexing: A probabilistic analysis
- Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids
- Matrix completion from noisy entries
- On a decomposition lemma for positive semi-definite block-matrices
- On selecting a maximum volume sub-matrix of a matrix and related problems
- On the complexity of nonnegative matrix factorization
- Robust Hyperspectral Unmixing With Correntropy-Based Metric
- Robustness analysis of preconditioned successive projection algorithm for general form of separable NMF problem
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Semidefinite programming based preconditioning for more robust near-separable nonnegative matrix factorization
- Sketching as a tool for numerical linear algebra
- Spectral Unmixing via Data-Guided Sparsity
- Subspace Iteration Randomization and Singular Value Problems
Cited in
(4)- Robustness analysis of preconditioned successive projection algorithm for general form of separable NMF problem
- Enhancing pure-pixel identification performance via preconditioning
- Semidefinite programming based preconditioning for more robust near-separable nonnegative matrix factorization
- CMD: controllable matrix decomposition with global optimization for deep neural network compression
This page was built for publication: Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1640558)
