Matrix Completion under Interval Uncertainty

원문 초록

Matrix completion under interval uncertainty can be cast as matrix completion with element-wise box constraints. We present an efficient alternating-direction parallel coordinate-descent method for the problem. We show that the method outperforms any other known method on a benchmark in image in-painting in terms of signal-to-noise ratio, and that it provides high-quality solutions for an instance of collaborative filtering with 100,198,805 recommendations within 5 minutes.

함께 살펴볼 논문

공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.

arXiv:2406.18984공통 태그 Matrix Completion, Collaborative Filtering 등록 2024-06-27

Amplify Graph Learning for Recommendation via Sparsity Completion

arXiv:2405.07890공통 태그 Matrix Completion, Collaborative Filtering 등록 2024-05-13

Subspace-Informed Matrix Completion

arXiv:2404.17398공통 태그 Matrix Completion, Collaborative Filtering 등록 2024-04-26

Online Policy Learning and Inference by Matrix Completion

arXiv:2404.17561공통 태그 Matrix Completion, Collaborative Filtering 등록 2024-04-26

Structured Conformal Inference for Matrix Completion with Applications to Group Recommender Systems

arXiv:2507.07522공통 태그 Collaborative Filtering공식 코드 · Papers with Code 등록 2025-07-10

NLGCL: Naturally Existing Neighbor Layers Graph Contrastive Learning for Recommendation

arXiv:2507.05715공통 태그 Collaborative Filtering공식 코드 · Papers with Code 등록 2025-07-08

From ID-based to ID-free: Rethinking ID Effectiveness in Multimodal Collaborative Filtering Recommendation

토론

이 논문과 연결된 포럼 글이 아직 없습니다.

포럼에서 토론 찾기