.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Nonnegative matrix factorization
Hyperparameter optimization
Penalty coefficient
Low -rank approximation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
.png){kind=icon}
分享收藏Quantitative Performance Evaluation of Uncertainty-Aware Hybrid AADL Designs Using Statistical Model Checking使用统计模型检查对不确定性感知的混合AADL设计进行定量性能评估OAAI
OAAI分享收藏分享收藏
查看更多内容