BriefGPT.xyz
Sep, 2018
非凸优化遇见低秩矩阵分解:概述
Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
HTML
PDF
Yuejie Chi, Yue M. Lu, Yuxin Chen
TL;DR
本文从统计模型的角度出发,系统地讨论低秩矩阵分解非凸优化的可靠解法,总结出了两种方法:1. 根据问题特征设计初始值,进行迭代求解;2. 利用全局凸性分析,无需初始值,直接求解。文章阐述了这些方法在各种场景下的应用并剖析了其理论基础。
Abstract
Substantial progress has been made recently on developing provably accurate and efficient algorithms for
low-rank matrix factorization
via
nonconvex optimization
. While conventional wisdom often takes a dim view
→