BriefGPT.xyz
Dec, 2012
交替最小化法实现低秩矩阵完成
Low-rank Matrix Completion using Alternating Minimization
HTML
PDF
Prateek Jain, Praneeth Netrapalli, Sujay Sanghavi
TL;DR
本文首次理论分析了交替极小化算法在矩阵完成和矩阵感知问题中的表现,证明了在满足某些条件下,该算法可以快速收敛到真实矩阵,同时具有更简单的分析方法。
Abstract
alternating minimization
represents a widely applicable and empirically successful approach for finding
low-rank matrices
that best fit the given data. For example, for the problem of low-rank
→