Exponential Family Matrix Completion under Structural Constraints
Suriya Gunasekar, Pradeep Ravikumar, Joydeep Ghosh

TL;DR
This paper introduces a unified convex regularized M-estimator framework for matrix completion that handles diverse data types, noise models, and structural constraints, extending beyond low-rank assumptions.
Contribution
It develops a generalized matrix completion method applicable to exponential family distributions with various structural constraints, supported by a unified statistical analysis.
Findings
The proposed estimator performs well on simulated datasets.
The framework accommodates heterogeneous data types and noise models.
Theoretical guarantees are established for the estimator.
Abstract
We consider the matrix completion problem of recovering a structured matrix from noisy and partial measurements. Recent works have proposed tractable estimators with strong statistical guarantees for the case where the underlying matrix is low--rank, and the measurements consist of a subset, either of the exact individual entries, or of the entries perturbed by additive Gaussian noise, which is thus implicitly suited for thin--tailed continuous data. Arguably, common applications of matrix completion require estimators for (a) heterogeneous data--types, such as skewed--continuous, count, binary, etc., (b) for heterogeneous noise models (beyond Gaussian), which capture varied uncertainty in the measurements, and (c) heterogeneous structural constraints beyond low--rank, such as block--sparsity, or a superposition structure of low--rank plus elementwise sparseness, among others. In this…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Distributed Sensor Networks and Detection Algorithms · Blind Source Separation Techniques
