A Generalized Latent Factor Model Approach to Mixed-data Matrix Completion with Entrywise Consistency
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Amplify Graph Learning for Recommendation via Sparsity Completion
Subspace-Informed Matrix Completion
Online Policy Learning and Inference by Matrix Completion
Structured Conformal Inference for Matrix Completion with Applications to Group Recommender Systems
NLGCL: Naturally Existing Neighbor Layers Graph Contrastive Learning for Recommendation
From ID-based to ID-free: Rethinking ID Effectiveness in Multimodal Collaborative Filtering Recommendation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.