Elastic adversarial deep nonnegative matrix factorization for matrix completion

Information Sciences(2023)

引用 4|浏览11
暂无评分
摘要
In recent years, matrix completion has attracted a lot of attention. Conventional matrix completions are shallow and ineffective when dealing with complex data structures. Researchers have recently tried to incorporate deep structures into matrix completion; however, considerable challenges still exist. Most matrix completion methods may fail to work effectively in the presence of limited observations. To enhance the generalization of the reconstruction, adversarial methods are proposed that attempt to fool models by providing deceptive input. The aim is to develop an adversarial training algorithm that resists attacks in a deep model, thus at the same time leading to enhancing the generaliza-tion. Therefore, in this paper, we propose an elastic adversarial training to design a high -capacity Deep Nonnegative Matrix Factorization (DNMF) model with proper discovery latent structure of the data and enhanced generalization abilities. In other words, the chal-lenges mentioned above are addressed by perturbing the inputs in DNMF with an elastic loss which is intercalated and adapted between Frobenius and '2;1 norms. This model not only dispenses with adversarial DNMF generation but also is robust towards a mixture of multiple attacks to attain improved accuracy. Extensive simulations show that the pro-posed approach outperforms state-of-the-art methods.(c) 2022 Elsevier Inc. All rights reserved.
更多
查看译文
关键词
Deep learning,Adversarial learning,Generalization,Elastic loss
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要