arXiv:0906.2027
Matrix Completion from Noisy Entries
원문 초록
Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of applications, from collaborative filtering (the `Netflix problem') to structure-from-motion and positioning. We study a low complexity algorithm introduced by Keshavan et al.(2009), based on a combination of spectral techniques and manifold optimization, that we call here OptSpace. We prove performance guarantees that are order-optimal in a number of circumstances.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
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
토론
이 논문과 연결된 포럼 글이 아직 없습니다.