Matrix Completion under Interval Uncertainty
Matrix completion under interval uncertainty can be cast as matrix completion with element-wise box constraints. We present an efficient alternating-direction parallel coordinate-descent method for the problem. We show that the method outperforms any other known method on a benchmark in image in-painting in terms of signal-to-noise ratio, and that it provides high-quality solutions for an instance of collaborative filtering with 100,198,805 recommendations within 5 minutes.
Code (0)
등록된 구현이 없습니다.
Tasks
Collaborative FilteringMatrix CompletionSimilar Papers 제목 키워드 기반
Inference and Uncertainty Quantification for Noisy Matrix Completion
Noisy matrix completion aims at estimating a low-rank matrix given only partial and corrupted entries. Despite substantial progress in designing efficient estimation algorithms, it remains largely unclear how to assess t…
Matrix CompletionUncertainty QuantificationvalidStatistical Inference for Matching Decisions via Matrix Completion under Dependent Missingness
This paper studies decision-making and statistical inference for two-sided matching markets via matrix completion. In contrast to the independent sampling assumed in classical matrix completion literature, the observed e…
Matrix Completion in the Unit Hypercube via Structured Matrix Factorization
Several complex tasks that arise in organizations can be simplified by mapping them into a matrix completion problem. In this paper, we address a key challenge faced by our company: predicting the efficiency of artists i…
Matrix CompletionMatrix Completion with Quantified Uncertainty through Low Rank Gaussian Copula
Modern large scale datasets are often plagued with missing entries. For tabular data with missing values, a flurry of imputation algorithms solve for a complete matrix which minimizes some penalized reconstruction error.…
ImputationMatrix CompletionMissing ValuesRecommendation SystemsUncertainty quantification for nonconvex tensor completion: Confidence intervals, heteroscedasticity and optimality
We study the distribution and uncertainty of nonconvex optimization for noisy tensor completion -- the problem of estimating a low-rank tensor given incomplete and corrupted observations of its entries. Focusing on a two…
Uncertainty Quantificationvalid