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

利用矩阵分解的数学方法求解植入团与最大团问题

Harnessing the mathematics of matrix decomposition to solve planted and maximum clique problem

Salma Omer, Montaz Ali

AI总结:

本文提出一种邻接矩阵低秩加稀疏分解模型,用加权 ℓ1 范数和 ADMM 求解最大团,并给出恢复、唯一性与最优性理论保证,实验验证其优势。

摘要:

我们考虑在给定图中识别最大团的问题。我们针对该问题提出了一个数学模型。该模型类似于给定图邻接矩阵的矩阵分解。数学模型的目标函数包含分解所得稀疏矩阵的加权 ℓ1 范数,与已知的 ℓ1 范数相比,它在降低误差方面具有优势。文中论证了对 ℓ1 范数采用动态变化权重的动机。我们在 ADMM(交替方向乘子法)算法的迭代过程中使用近端算子来求解该优化问题,并给出了所提出 ADMM 算法的收敛性。通过采用 golfing scheme(高尔夫方案)构造近似对偶证书,我们还以低秩矩阵的形式建立了最大团的理论保证。我们构造了保证解的恢复与唯一性的条件,以及验证最优性条件的对偶矩阵紧界。文中给出了植入团的数值结果,表明与近期两个数学模型相比,我们的模型具有明显优势。同时还给出了随机生成图的结果,其误差极小。这些误差通过我们基于团大小提出的公式计算得到。此外,我们将算法应用于真实世界图,并成功恢复了其中的团。这些团大小的有效性来自于将输入图分解为一个秩一矩阵(对应于团)和一个稀疏矩阵。

英文摘要:

We consider the problem of identifying a maximum clique in a given graph. We have proposed a mathematical model for this problem. The model resembles the matrix decomposition of the adjacency matrix of a given graph. The objective function of the mathematical model includes a weighted $\ell_{1}$-norm of the sparse matrix of the decomposition, which has an advantage over the known $\ell_{1}-$norm in reducing the error. The use of dynamically changing the weights for the $\ell_{1}$-norm has been motivated. We have used proximal operators within the iterates of the ADMM (alternating direction method of multipliers) algorithm to solve the optimization problem. Convergence of the proposed ADMM algorithm has been provided. The theoretical guarantee of the maximum clique in the form of the low-rank matrix has also been established using the golfing scheme to construct approximate dual certificates. We have constructed conditions that guarantee the recovery and uniqueness of the solution, as well as a tight bound on the dual matrix that validates optimality conditions. Numerical results for planted cliques are presented showing clear advantages of our model when compared with two recent mathematical models. Results are also presented for randomly generated graphs with minimal errors. These errors are found using a formula we have proposed based on the size of the clique. Moreover, we have applied our algorithm to real-world graphs for which cliques have been recovered successfully. The validity of these clique sizes comes from the decomposition of input graph into a rank-one matrix (corresponds to the clique) and a sparse matrix.

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

↑