Extendable Neural Matrix Completion
원문 초록
Matrix completion is one of the key problems in signal processing and machine learning, with applications ranging from image pro- cessing and data gathering to classification and recommender sys- tems. Recently, deep neural networks have been proposed as la- tent factor models for matrix completion and have achieved state- of-the-art performance. Nevertheless, a major problem with existing neural-network-based models is their limited capabilities to extend to samples unavailable at the training stage. In this paper, we propose a deep two-branch neural network model for matrix completion. The proposed model not only inherits the predictive power of neural net- works, but is also capable of extending to partially observed samples outside the training set, without the need of retraining or fine-tuning. Experimental studies on popular movie rating datasets prove the ef- fectiveness of our model compared to the state of the art, in terms of both accuracy and extendability.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Contrastive Matrix Completion with Denoising and Augmented Graph Views for Robust Recommendation
N$^2$: A Unified Python Package and Test Bench for Nearest Neighbor-Based Matrix Completion
An extrapolated and provably convergent algorithm for nonlinear matrix decomposition with the ReLU function
Interference-Aware Edge Runtime Prediction with Conformal Matrix Completion
Robust Matrix Completion for Discrete Rating-Scale Data
Efficient and Robust Freeway Traffic Speed Estimation under Oblique Grid using Vehicle Trajectory Data
토론
이 논문과 연결된 포럼 글이 아직 없습니다.