Matrix Completion with Model-free Weighting

by   Jiayi Wang, et al.

In this paper, we propose a novel method for matrix completion under general non-uniform missing structures. By controlling an upper bound of a novel balancing error, we construct weights that can actively adjust for the non-uniformity in the empirical risk without explicitly modeling the observation probabilities, and can be computed efficiently via convex optimization. The recovered matrix based on the proposed weighted empirical risk enjoys appealing theoretical guarantees. In particular, the proposed method achieves a stronger guarantee than existing work in terms of the scaling with respect to the observation probabilities, under asymptotically heterogeneous missing settings (where entry-wise observation probabilities can be of different orders). These settings can be regarded as a better theoretical model of missing patterns with highly varying probabilities. We also provide a new minimax lower bound under a class of heterogeneous settings. Numerical experiments are also provided to demonstrate the effectiveness of the proposed method.



There are no comments yet.


page 1

page 2

page 3

page 4


Weighted matrix completion from non-random, non-uniform sampling patterns

We study the matrix completion problem when the observation pattern is d...

Matrix Completion under Low-Rank Missing Mechanism

This paper investigates the problem of matrix completion from corrupted ...

Missing Not at Random in Matrix Completion: The Effectiveness of Estimating Missingness Probabilities Under a Low Nuclear Norm Assumption

Matrix completion is often applied to data with entries missing not at r...

A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion

We consider in this paper the problem of noisy 1-bit matrix completion u...

Learning Parameters for Weighted Matrix Completion via Empirical Estimation

Recently theoretical guarantees have been obtained for matrix completion...

Median Matrix Completion: from Embarrassment to Optimality

In this paper, we consider matrix completion with absolute deviation los...

Learning to Recommend Using Non-Uniform Data

Learning user preferences for products based on their past purchases or ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.