Matrix Completion with Sparse Noisy Rows

2022-04-01 · Jafar Jafarov

Exact matrix completion and low rank matrix estimation problems has been studied in different underlying conditions. In this work we study exact low-rank completion under non-degenerate noise model. Non-degenerate random noise model has been previously studied by many researchers under given condition that the noise is sparse and existing in some of the columns. In this paper, we assume that each row can receive random noise instead of columns and propose an interactive algorithm that is robust to this noise. We show that we use a parametrization technique to give a condition when the underlying matrix could be recoverable and suggest an algorithm which recovers the underlying matrix.

📄 PDF Abstract BibTeX arXiv:2204.01530

Code (0)

등록된 구현이 없습니다.

Tasks

Matrix Completion

Matrix Data Deep Decoder - Geometric Learning for Structured Data Completion

2021-01-01 · Maria Schmidt, Alexander Bronstein

In this work, we present a fully convolutional end to end method to reconstruct corrupted sparse matrices of Non-Euclidean data. The classic example for such matrices is recommender systems matrices where the rows/column…

Decoder Graph Neural Network Matrix Completion Recommendation Systems

Noisy Inductive Matrix Completion Under Sparse Factor Models

2016-09-13 · Akshay Soni, Troy Chevalier, Swayambhoo Jain

Inductive Matrix Completion (IMC) is an important class of matrix completion problems that allows direct inclusion of available features to enhance estimation capabilities. These models have found applications in persona…

Dictionary Learning Matrix Completion Recommendation Systems

Optimal Transfer Learning for Missing Not-at-Random Matrix Completion

2025-02-28 · Akhil Jalan, Yassir Jedra, Arya Mazumdar, Soumendu Sundar Mukherjee 외

We study transfer learning for matrix completion in a Missing Not-at-Random (MNAR) setting that is motivated by biological problems. The target matrix $Q$ has entire rows and columns missing, making estimation impossible…

Matrix Completion Transfer Learning

On Deterministic Sampling Patterns for Robust Low-Rank Matrix Completion

2017-12-05 · Morteza Ashraphijuo, Vaneet Aggarwal, Xiaodong Wang

In this letter, we study the deterministic sampling patterns for the completion of low rank matrix, when corrupted with a sparse noise, also known as robust matrix completion. We extend the recent results on the determin…

Low-Rank Matrix Completion Matrix Completion valid

Fast Methods for Recovering Sparse Parameters in Linear Low Rank Models

2016-06-26 · Ashkan Esmaeili, Arash Amini, Farokh Marvasti

In this paper, we investigate the recovery of a sparse weight vector (parameters vector) from a set of noisy linear combinations. However, only partial information about the matrix representing the linear combinations is…

compressed sensing Matrix Completion