Guaranteed Matrix Completion via Non-Convex Factorization

Matrix factorization is a popular approach for large-scale matrix completion. The optimization formulation based on matrix factorization, even with huge size, can be solved very efficiently through the standard optimization algorithms in practice. However, due to the non-convexity caused by the fact...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on information theory Ročník 62; číslo 11; s. 6535 - 6579
Hlavní autori:	Sun, Ruoyu, Luo, Zhi-Quan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.11.2016 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Algorithm design and analysis Algorithms alternating minimization Complexity theory Economic conditions Factorization Geometry Information theory Iterative methods Mathematical models Matrix Matrix completion matrix factorization Minimization nonconvex optimization Optimization Partitioning algorithms perturbation analysis SGD
ISSN:	0018-9448, 1557-9654
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!