.png){kind=icon}
.png){kind=icon}
Return
Bi-level algorithm for optimizing hyperparameters in penalized nonnegative matrix factorization
.png){kind=icon}
OA
AI
DOI：10.1016/j.amc.2023.128184.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Learning approaches rely on hyperparameters that impact the algorithm's performance and affect the knowledge extraction process from data. Recently, Nonnegative Matrix Factoriza-tion (NMF) has attracted a growing interest as a learning algorithm. This technique cap-tures the latent information embedded in large datasets while preserving feature proper-ties. NMF can be formalized as a penalized optimization task in which tuning the penalty hyperparameters is an open issue. The current literature does not provide any general framework addressing this task. This study proposes to express the penalty hyperparam-eters problem in NMF in terms of a bi-level optimization. We design a novel algorithm, named Alternating Bi-level (AltBi), which incorporates the hyperparameters tuning proce-dure into the updates of NMF factors. Results of the existence and convergence of numer-ical solutions, under appropriate assumptions, are studied, and numerical experiments are provided.& COPY; 2023 Elsevier Inc. All rights reserved.
Keywords:
Nonnegative matrix factorization
Hyperparameter optimization
Penalty coefficient
Low -rank approximation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W