首页> 外文期刊>JMLR: Workshop and Conference Proceedings >Provable Alternating Gradient Descent for Non-negative Matrix Factorization with Strong Correlations
【24h】

Provable Alternating Gradient Descent for Non-negative Matrix Factorization with Strong Correlations

机译:具有强相关性的非负矩阵分解的可证明交替梯度下降

获取原文
       

摘要

Non-negative matrix factorization is a basic tool for decomposing data into the feature and weight matrices under non-negativity constraints, and in practice is often solved in the alternating minimization framework. However, it is unclear whether such algorithms can recover the ground-truth feature matrix when the weights for different features are highly correlated, which is common in applications. This paper proposes a simple and natural alternating gradient descent based algorithm, and shows that with a mild initialization it provably recovers the ground-truth in the presence of strong correlations. In most interesting cases, the correlation can be in the same order as the highest possible. Our analysis also reveals its several favorable features including robustness to noise. We complement our theoretical results with empirical studies on semi-synthetic datasets, demonstrating its advantage over several popular methods in recovering the ground-truth.
机译:非负矩阵分解是在非负约束下将数据分解为特征矩阵和权重矩阵的基本工具,在实践中通常在交替最小化框架中解决。然而,尚不清楚当不同特征的权重高度相关时,这种算法是否可以恢复地面真相特征矩阵,这在应用中很常见。本文提出了一种简单而自然的基于梯度下降的算法,并证明了在进行轻度初始化的情况下,它在存在强相关性的情况下可恢复地面真相。在最有趣的情况下,相关性可能与可能的最高相关性相同。我们的分析还揭示了它的几个有利功能,包括对噪声的鲁棒性。我们通过对半合成数据集进行的经验研究来补充理论结果,证明了它在恢复地面真相方面优于几种流行的方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号