arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1705.00399cs.LGcs.SI
收藏

带查询的矩阵补全

Matrix completion with queries

Boston University(波士顿大学)

Natali Ruchansky, Mark Crovella, Evimaria Terzi

摘要:

在许多应用中,例如,在推荐系统和流量监控中,数据以矩阵的形式出现,该矩阵仅被部分观察到并且等级较低。这些数据集的一个基本数据分析任务是矩阵补全,其目标是准确地推断矩阵中缺失的条目。即使当数据满足低秩假设时,经典的矩阵补全方法也可能输出具有显著错误的补全-因为重构的矩阵与真实的底层矩阵显著不同。通常,这是由于观察到的条目中包含的信息不足。在这项工作中,我们解决这个问题,提出了一个积极的版本的矩阵完成,查询可以真正的底层矩阵。随后,我们设计了Order&Extend,这是第一个将矩阵完成方法和查询策略统一到单个算法中的算法。Order&Extend能够通过明智地查询少量额外的条目来识别和缓解信息不足。在对真实世界数据集的广泛实验评估中,我们证明了我们的算法是有效的,并且能够准确地重建真实矩阵,同时只要求少量的查询。

英文摘要:

In many applications, e.g., recommender systems and traffic monitoring, the data comes in the form of a matrix that is only partially observed and low rank. A fundamental data-analysis task for these datasets is matrix completion, where the goal is to accurately infer the entries missing from the matrix. Even when the data satisfies the low-rank assumption, classical matrix-completion methods may output completions with significant error -- in that the reconstructed matrix differs significantly from the true underlying matrix. Often, this is due to the fact that the information contained in the observed entries is insufficient. In this work, we address this problem by proposing an active version of matrix completion, where queries can be made to the true underlying matrix. Subsequently, we design Order&Extend, which is the first algorithm to unify a matrix-completion approach and a querying strategy into a single algorithm. Order&Extend is able identify and alleviate insufficient information by judiciously querying a small number of additional entries. In an extensive experimental evaluation on real-world datasets, we demonstrate that our algorithm is efficient and is able to accurately reconstruct the true matrix while asking only a small number of queries.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑