paper-with-me

Papers

Regularizing Autoencoder-Based Matrix Completion Models via Manifold Learning

2018-07-04 · Duc Minh Nguyen, Evaggelia Tsiligianni, Robert Calderbank, Nikos Deligiannis

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.

📄 PDF Abstract BibTeX arXiv:1807.01798

Code (0)

등록된 구현이 없습니다.

Tasks

Inductive BiasMatrix CompletionMulti-Task Learning

Similar Papers 제목 키워드 기반

Scaled Gradients on Grassmann Manifolds for Matrix Completion

2012-12-01 · NeurIPS 2012 12 · Thanh Ngo, Yousef Saad

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 Completion

Latent Space Characterization of Autoencoder Variants

2024-12-06 · Anika Shrivastava, Renu Rameshan, Samar Agnihotri

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 Learning

Matrix Completion for Structured Observations

2018-01-29 · Denali Molitor, Deanna Needell

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 Completion

Robust Low-rank Matrix Completion via an Alternating Manifold Proximal Gradient Continuation Method

2020-08-18 · Minhui Huang, Shiqian Ma, Lifeng Lai

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 optimization

A Riemannian gossip approach to decentralized matrix completion

2016-05-23 · Bamdev Mishra, Hiroyuki Kasai, Atul Saroop

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