一种用于平衡图割的简单逆幂法
A simple inverse power method for balanced graph cut
AI总结:
本文提出一种简单逆幂法(SIP)求解平衡图割,通过等价连续形式和显式解析解实现局部收敛,并扩展至θ-平衡割及局部突破改进SIP-perturb,实验表明其比IP更快且优于Gurobi。
摘要:
现有的用于求解平衡图割的逆幂($\mathbf{IP}$)方法缺乏局部收敛性,且其内部子问题需要非光滑凸求解器。为解决这些问题,我们利用平衡图割的一种新的等价连续形式,开发了一种简单逆幂($\mathbf{SIP}$)方法,其内部子问题具有显式解析解,这是相对于$\mathbf{IP}$的最大优势,也是我们称之为“简单”的主要原因。通过充分利用内部子问题解的闭式形式,我们设计了一种边界检测的次梯度选择,使得$\mathbf{SIP}$被证明是局部收敛的。我们表明,$\mathbf{SIP}$也适用于一种新的三值$\theta$-平衡割,当$\theta=1$时,它退化为平衡割。当$\mathbf{SIP}$达到其局部最优时,我们在完全相同的迭代算法框架内无缝地转移到求解$\theta$-平衡割,从而得到$\mathbf{SIP}$-$\mathbf{perturb}$——这是$\mathbf{SIP}$的一种高效的局部突破改进,它通过可调的$\theta$将一些“已划分”的顶点转换回“未划分”的顶点。在G-set上针对Cheeger割和Sparsest割的数值实验表明,$\mathbf{SIP}$比$\mathbf{IP}$显著更快,同时保持近似解质量相当,且$\mathbf{SIP}$-$\mathbf{perturb}$在计算成本和求解质量方面均优于$\mathtt{Gurobi}$。
英文摘要:
The existing inverse power ($\mathbf{IP}$) method for solving the balanced graph cut lacks local convergence and its inner subproblem requires a nonsmooth convex solver. To address these issues, we develop a simple inverse power ($\mathbf{SIP}$) method using a novel equivalent continuous formulation of the balanced graph cut, and its inner subproblem allows an explicit analytic solution, which is the biggest advantage over $\mathbf{IP}$ and constitutes the main reason why we call it $\mathit{simple}$. By fully exploiting the closed-form of the inner subproblem solution, we design a boundary-detected subgradient selection with which $\mathbf{SIP}$ is proved to be locally converged. We show that $\mathbf{SIP}$ is also applicable to a new ternary valued $θ$-balanced cut which reduces to the balanced cut when $θ=1$. When $\mathbf{SIP}$ reaches its local optimum, we seamlessly transfer to solve the $θ$-balanced cut within exactly the same iteration algorithm framework and thus obtain $\mathbf{SIP}$-$\mathbf{perturb}$ -- an efficient local breakout improvement of $\mathbf{SIP}$, which transforms some ``partitioned" vertices back to the ``un-partitioned" ones through the adjustable $θ$. Numerical experiments on G-set for Cheeger cut and Sparsest cut demonstrate that $\mathbf{SIP}$ is significantly faster than $\mathbf{IP}$ while maintaining approximate solutions of comparable quality, and $\mathbf{SIP}$-$\mathbf{perturb}$ outperforms $\mathtt{Gurobi}$ in terms of both computational cost and solution quality.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。