Stable Rank-One Matrix Completion is Solved by the Level 2 Lasserre Relaxation.

Augustin Cosse Laurent Demanet

Published in: Found. Comput. Math. (2021)

Keyphrases

matrix completion
semidefinite
convex relaxation
stable set
low rank
singular values
rank aggregation
semidefinite programming
convex optimization
kernel matrix
higher order
ranked list
machine learning
multi label
semi supervised learning
markov random field
worst case
knn
pairwise
feature extraction