2013
JMLR
JMLR 2013
A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion
Abstract
We consider in this paper the problem of noisy 1-bit matrix completion under a general non-uniform sampling distribution using the max-norm as a convex relaxation for the rank. A max- norm constrained maximum likelihood estimate is introduced and studied. The rate of convergence for the estimate is obtained. Information-theoretical methods are used to establish a minimax lower bound under the general sampling model. The minimax upper and lower bounds together yield the optimal rate of convergence for the Frobenius norm loss. Computational algorithms and numerical performance are also discussed. [abs] [ pdf ][ bib ] © JMLR 2013. (edit, beta)
🌉
Interdisciplinary Bridge
— Data Science & Analytics and Machine Learning and Mathematics & Optimization
🐣
Hot Topic Early Bird
— maximum likelihood
🐝
Cross-Pollinator
— Artificial Intelligence, Computer Science, Computer Vision, Data Science & Analytics, Deep Learning, Healthcare & Medicine, Interdisciplinary, Knowledge & Reasoning, Machine Learning, Mathematics & Optimization, Natural Language Processing, Reinforcement Learning, Robotics, Security & Privacy, Speech & Audio