基于递归Gershgorin圆盘移位的矩阵完备化的图采样
Graph Sampling for Matrix Completion Using Recurrent Gershgorin Disc Shift
摘要:
矩阵补全算法在给定观测样本子集的情况下填充大矩阵中的缺失条目。然而,如何最好地预先选择信息矩阵条目给定的抽样预算在很大程度上是没有解决的。本文从图信号处理的角度提出了一种矩阵完备化的快速样本选择策略。具体来说,我们首先使用对偶图信号平滑先验来正则化矩阵重构目标,从而得到用于求解的线性方程组系统。然后,我们选择适当的样本,以最大化的最小特征值$λ_{\min}$的系数矩阵,从而最大限度地提高了线性系统的稳定性。为了有效地解决这个组合问题,我们得出一个贪婪的采样策略,利用Gershgorin圆定理,迭代地选择一个样本(相当于移动一个Gershgorin盘)的时间对应于修改后的图形拉普拉斯矩阵的第一特征向量中的最大幅度条目。我们的算法从计算上受益于热启动的第一个特征向量的增量拉普拉斯矩阵计算递归更多的样本。为了在对大矩阵进行采样时实现计算可扩展性,我们进一步将系数矩阵重写为两个单独分量的总和,每个分量都具有块对角结构,我们利用该结构进行交替块采样。在合成数据集和真实数据集上的大量实验表明,我们的图采样算法在与一系列现代矩阵补全算法相结合时,大大优于现有的矩阵补全采样方案,并降低了补全误差。
英文摘要:
Matrix completion algorithms fill missing entries in a large matrix given a subset of observed samples. However, how to best pre-select informative matrix entries given a sampling budget is largely unaddressed. In this paper, we propose a fast sample selection strategy for matrix completion from a graph signal processing perspective. Specifically, we first regularize the matrix reconstruction objective using a dual graph signal smoothness prior, resulting in a system of linear equations for solution. We then select appropriate samples to maximize the smallest eigenvalue $λ_{\min}$ of the coefficient matrix, thus maximizing the stability of the linear system. To efficiently solve this combinatorial problem, we derive a greedy sampling strategy, leveraging on Gershgorin circle theorem, that iteratively selects one sample (equivalent to shifting one Gershgorin disc) at a time corresponding to the largest magnitude entry in the first eigenvector of a modified graph Laplacian matrix. Our algorithm benefits computationally from warm start as the first eigenvectors of incremented Laplacian matrices are computed recurrently for more samples. To achieve computation scalability when sampling large matrices, we further rewrite the coefficient matrix as a sum of two separate components, each of which exhibits block-diagonal structure that we exploit for alternating block-wise sampling. Extensive experiments on both synthetic and real-world datasets show that our graph sampling algorithm substantially outperforms existing sampling schemes for matrix completion and reduces the completion error, when combined with a range of modern matrix completion algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。