Collaborative Filtering in a Non-Uniform World: Learning with the Weighted Trace Norm

Abstract

We show that matrix completion with trace-norm regularization can be significantly hurt when entries of the matrix are sampled non-uniformly. We introduce a weighted version of the trace-norm regularizer that works well also with non-uniform sampling. Our experimental results demonstrate that the weighted trace-norm regularization indeed yields significant gains on the (highly non-uniformly sampled) Netflix dataset.

9 pages

References in corpus (1)

• Matrix Completion With Noise

Cited by in corpus (15)

• Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
• Matrix Completion from Noisy Entries
• A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion
• Matrix Completion via Max-Norm Constrained Optimization
• Concentration-Based Guarantees for Low-Rank Matrix Reconstruction
• Gap Filling in the Plant Kingdom---Trait Prediction Using Hierarchical Probabilistic Matrix Factorization
• Learning with the Weighted Trace-norm under Arbitrary Sampling Distributions
• A Combinatorial Algebraic Approach for the Identifiability of Low-Rank Matrix Completion
• Low Rank Matrix Completion with Exponential Family Noise
• Convex Optimization without Projection Steps
• Top-N Recommender System via Matrix Completion
• Completing Any Low-rank Matrix, Provably
• Classification with Low Rank and Missing Data
• Matrix reconstruction with the local max norm
• Structured Matrix Completion with Applications to Genomic Data Integration