Parameterized Algorithms for the Matrix Completion Problem

04/10/2018
by   Robert Ganian, et al.
0

We consider two matrix completion problems, in which we are given a matrix with missing entries and the task is to complete the matrix in a way that (1) minimizes the rank, or (2) minimizes the number of distinct rows. recommender systems, machine learning, sensing, computer vision, data science, and predictive analytics, among others. In particular, the first problem is a fundamental problem that has undergone a tremendous amount of research. We study the parameterized complexity of the two aforementioned problems with respect to several parameters of interest, including the minimum number of matrix rows, columns, and rows plus columns needed to cover all missing entries. We obtain new algorithmic results showing that, for the bounded domain case, both problems are fixed-parameter tractable with respect to all aforementioned parameters. We complement these results with a lower-bound result for the unbounded domain case that rules out fixed-parameter tractability w.r.t. some of the parameters under consideration.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/04/2019

On Clustering Incomplete Data

We study fundamental clustering problems for incomplete data. In this se...
research
08/07/2014

Matrix Completion on Graphs

The problem of finding the missing values of a matrix given a few of its...
research
02/03/2020

Parameterized Algorithms for Matrix Completion With Radius Constraints

Considering matrices with missing entries, we study NP-hard matrix compl...
research
02/10/2011

Matrix completion with column manipulation: Near-optimal sample-robustness-rank tradeoffs

This paper considers the problem of matrix completion when some number o...
research
10/06/2017

Covering vectors by spaces: Regular matroids

Seymour's decomposition theorem for regular matroids is a fundamental re...
research
02/12/2020

Complexity of Combinatorial Matrix Completion With Diameter Constraints

We thoroughly study a novel and still basic combinatorial matrix complet...
research
08/04/2023

Matrix Completion When Missing Is Not at Random and Its Applications in Causal Panel Data Models

This paper develops an inferential framework for matrix completion when ...

Please sign up or login with your details

Forgot password? Click here to reset