Regularizing Autoencoder-Based Matrix Completion Models via Manifold Learning
Autoencoders are popular among neural-network-based matrix completion models due to their ability to retrieve potential latent factors from the partially observed matrices. Nevertheless, when training data is scarce their performance is significantly degraded due to overfitting. In this paper, we mit- igate overfitting with a data-dependent regularization technique that relies on the principles of multi-task learning. Specifically, we propose an autoencoder-based matrix completion model that performs prediction of the unknown matrix values as a main task, and manifold learning as an auxiliary task. The latter acts as an inductive bias, leading to solutions that generalize better. The proposed model outperforms the existing autoencoder-based models designed for matrix completion, achieving high reconstruction accuracy in well-known datasets.
Code (0)
등록된 구현이 없습니다.
Tasks
Inductive BiasMatrix CompletionMulti-Task LearningSimilar Papers 제목 키워드 기반
Scaled Gradients on Grassmann Manifolds for Matrix Completion
This paper describes gradient methods based on a scaled metric on the Grassmann manifold for low-rank matrix completion. The proposed methods significantly improve canonical gradient methods especially on ill-conditioned…
Low-Rank Matrix CompletionMatrix CompletionLatent Space Characterization of Autoencoder Variants
Understanding the latent spaces learned by deep learning models is crucial in exploring how they represent and generate complex data. Autoencoders (AEs) have played a key role in the area of representation learning, with…
DenoisingRepresentation LearningMatrix Completion for Structured Observations
The need to predict or fill-in missing data, often referred to as matrix completion, is a common challenge in today's data-driven world. Previous strategies typically assume that no structural difference between observed…
Matrix CompletionRobust Low-rank Matrix Completion via an Alternating Manifold Proximal Gradient Continuation Method
Robust low-rank matrix completion (RMC), or robust principal component analysis with partially observed data, has been studied extensively for computer vision, signal processing and machine learning applications. This pr…
Low-Rank Matrix CompletionMatrix CompletionRiemannian optimizationA Riemannian gossip approach to decentralized matrix completion
In this paper, we propose novel gossip algorithms for the low-rank decentralized matrix completion problem. The proposed approach is on the Riemannian Grassmann manifold that allows local matrix completion by different a…
Matrix Completion