BriefGPT.xyz
Feb, 2017
具有平方和形式的张量精确完成
Exact tensor completion with sum-of-squares
HTML
PDF
Aaron Potechin, David Steurer
TL;DR
本研究使用最优的多项式算法，仅依靠少量随机观察数据完成张量解析，并将通过球上的正交全局极值证明的事实证明到可以在和方法证明系统内进行。
Abstract
We obtain the first
polynomial-time algorithm
for exact
tensor completion
that improves over the bound implied by reduction to matrix completion. The algorithm recovers an unknown 3-tensor with $r$ incoherent, or
→