Matrix Completion Under Interval Uncertainty: Highlights

Jakub Marecek, Peter Richtarik, Martin Takac

Research output: Chapter in Book/Report/Conference proceedingConference contribution


We present an overview of inequality-constrained matrix completion, with a particular focus on alternating least-squares (ALS) methods. The simple and seemingly obvious addition of inequality constraints to matrix completion seems to improve the statistical performance of matrix completion in a number of applications, such as collaborative filtering under interval uncertainty, robust statistics, event detection, and background modelling in computer vision. An ALS algorithm MACO by Marecek et al. outperforms others, including Sparkler, the implementation of Li et al. Code related to this paper is available at:
Original languageEnglish (US)
Title of host publicationMachine Learning and Knowledge Discovery in Databases
PublisherSpringer Nature
Number of pages5
ISBN (Print)9783030109967
StatePublished - Jan 18 2019


Dive into the research topics of 'Matrix Completion Under Interval Uncertainty: Highlights'. Together they form a unique fingerprint.

Cite this