A Fast Gradient Method for Nonnegative Sparse Regression With Self-Dictionary
From MaRDI portal
Abstract: A nonnegative matrix factorization (NMF) can be computed efficiently under the separability assumption, which asserts that all the columns of the given input data matrix belong to the cone generated by a (small) subset of them. The provably most robust methods to identify these conic basis columns are based on nonnegative sparse regression and self dictionaries, and require the solution of large-scale convex optimization problems. In this paper we study a particular nonnegative sparse regression model with self dictionary. As opposed to previously proposed models, this model yields a smooth optimization problem where the sparsity is enforced through linear constraints. We show that the Euclidean projection on the polyhedron defined by these constraints can be computed efficiently, and propose a fast gradient method to solve our model. We compare our algorithm with several state-of-the-art methods on synthetic data sets and real-world hyperspectral images.
Recommendations
- Novel proximal gradient methods for nonnegative matrix factorization with sparsity constraints
- Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization
- A sparsity preserving stochastic gradient methods for sparse regression
- Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum
- Sparse and nonnegative sparse D-MORPH regression
- Non-convex sparse regularisation
- Nonparametric sparsity and regularization
- Enhanced Sparsity by Non-Separable Regularization
- Matrix-wise _0-constrained sparse nonnegative least squares
Cited in
(4)
This page was built for publication: A Fast Gradient Method for Nonnegative Sparse Regression With Self-Dictionary
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4616947)
