Marecek, Jakub

Richtarik, Peter

Takac, Martin

English

We propose imposing box constraints on the individual elements of the unknown matrix in the matrix completion problem and present a number of natural applications, ranging from collaborative filtering under interval uncertainty to computer vision. Moreover, we design an alternating direction parallel coordinate descent method (MACO) for a smooth unconstrained optimization reformulation of the problem. In large scale numerical experiments in collaborative filtering under uncertainty, our method obtains solution with considerably smaller errors compared to classical matrix completion with equalities. We show that, surprisingly, seemingly obvious and trivial inequality constraints, when added to the formulation, can have a large impact. This is demonstrated on a number of machine learning problems

Edinburgh Research Explorer

Inequality-Constrained Matrix Completion:Adding the Obvious Helps!

https://www.pure.ed.ac.uk/ws/files/17206960/1408.2467v1

Inequality-Constrained Matrix Completion:Adding the Obvious Helps!

Abstract

Similar works

Full text

Available Versions

Edinburgh Research Explorer