Bi-level algorithm for optimizing hyperparameters in penalized nonnegative matrix factorization
DOI10.1016/j.amc.2023.128184arXiv2203.13129OpenAlexW4381189616MaRDI QIDQ6096278
Flavia Esposito, Nicoletta Del Buono, Rafal Zdunek, Laura Selicato
Publication date: 11 September 2023
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.13129
low-rank approximationnonnegative matrix factorizationpenalty coefficienthyperparameter optimization
Computational learning theory (68Q32) Factorization of matrices (15A23) Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Formalization of mathematics in connection with theorem provers (68V20) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interior-point gradient method for large-scale totally nonnegative least squares problems
- Nonnegative matrix factorization with constrained second-order optimization
- Algorithms and applications for approximate nonnegative matrix factorization
- Orthogonal joint sparse NMF for microarray data analysis
- Regularized nonnegative matrix factorization: geometrical interpretation and application to spectral unmixing
- Algorithms for Nonnegative Matrix Factorization with the β-Divergence
- Large-Scale Machine Learning with Stochastic Gradient Descent
- A Generalized Divergence Measure for Nonnegative Matrix Factorization
- Nonnegative Matrix Factorization with the Itakura-Saito Divergence: With Application to Music Analysis
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
- An Alternating Rank-k Nonnegative Least Squares Framework (ARkNLS) for Nonnegative Matrix Factorization
- Learning the parts of objects by non-negative matrix factorization
- Projected Gradient Methods for Nonnegative Matrix Factorization