D 2018

Parameterized Algorithms for the Matrix Completion Problem

GANIAN, Robert, Iyad KANJ, Sebastian ORDYNIAK and Stefan SZEIDER

Basic information

Original name

Parameterized Algorithms for the Matrix Completion Problem

Authors

GANIAN, Robert (203 Czech Republic, guarantor, belonging to the institution), Iyad KANJ (840 United States of America), Sebastian ORDYNIAK (276 Germany) and Stefan SZEIDER (40 Austria)

Edition

USA, Proceedings of the 35th International Conference on Machine Learning (ICML), p. 1642-1651, 10 pp. 2018

Publisher

PMLR

Other information

Language

English

Type of outcome

Stať ve sborníku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

United States of America

Confidentiality degree

není předmětem státního či obchodního tajemství

Publication form

electronic version available online

References:

RIV identification code

RIV/00216224:14330/18:00106817

Organization unit

Faculty of Informatics

ISBN

978-1-5108-6796-3

UT WoS

000683379201078

Keywords in English

Matrix Completion; Parameterized Complexity

Tags

Tags

International impact, Reviewed
Změněno: 18/5/2022 10:35, Mgr. Michal Petr

Abstract

V originále

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. 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.