Matrix Completion with Heterogonous Cost

03/23/2022
by   Ilqar ramazanli, et al.
0

Matrix completion problem has been studied extensively under the condition that each entry has uniform observation cost. And the problem has been explored withing adaptive or nonadaptive, exact or estimation categories. In this paper, we propose a method that approaches to problem in a different category that, price of checking different entries varies accross the matrix. We study under two type of cost model, first one is each column has different cost, but withing a column, every entry has different cost of observation. Also, another cost model is each entry within the matrix are different no matter if they are in the same column or row.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/18/2022

Optimal Exact Matrix Completion Under new Parametrization

We study the problem of exact completion for m×n sized matrix of rank r ...
research
10/18/2016

Going off the Grid: Iterative Model Selection for Biclustered Matrix Completion

We consider the problem of performing matrix completion with side inform...
research
02/15/2018

Active Feature Acquisition with Supervised Matrix Completion

Feature missing is a serious problem in many applications, which may lea...
research
02/06/2020

Optimal Adaptive Matrix Completion

We study the problem of exact completion for m × n sized matrix of rank ...
research
07/29/2009

An Explicit Construction of Gauss-Jordan Elimination Matrix

A constructive approach to get the reduced row echelon form of a given m...
research
03/23/2018

On the structure of matrices avoiding interval-minor patterns

We study the structure of 01-matrices avoiding a pattern P as an interva...
research
06/09/2021

Matrix Completion with Model-free Weighting

In this paper, we propose a novel method for matrix completion under gen...

Please sign up or login with your details

Forgot password? Click here to reset