A Generalized Latent Factor Model Approach to Mixed-data Matrix Completion with Entrywise Consistency
From MaRDI portal
Publication:6417528
arXiv2211.09272MaRDI QIDQ6417528
Author name not available (Why is that?)
Publication date: 16 November 2022
Abstract: Matrix completion is a class of machine learning methods that concerns the prediction of missing entries in a partially observed matrix. This paper studies matrix completion for mixed data, i.e., data involving mixed types of variables (e.g., continuous, binary, ordinal). We formulate it as a low-rank matrix estimation problem under a general family of non-linear factor models and then propose entrywise consistent estimators for estimating the low-rank matrix. Tight probabilistic error bounds are derived for the proposed estimators. The proposed methods are evaluated by simulation studies and real-data applications for collaborative filtering and large-scale educational assessment.
Has companion code repository: https://github.com/yunxiaochen/matrixcompletion_mixeddata
This page was built for publication: A Generalized Latent Factor Model Approach to Mixed-data Matrix Completion with Entrywise Consistency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6417528)