大规模二元二次优化的半定松弛法及其应用
Large-scale Binary Quadratic Optimization Using Semidefinite Relaxation and Applications
摘要:
在计算机视觉中,许多问题如图像分割、像素标记和场景解析都可以用二进制二次规划(BQP)来表示。对于子模块化问题,基于割集的方法可以有效地解决大规模问题。然而,一般的非次模问题要解决的挑战性要大得多。然而,当问题的规模很大时,要找到一个解决方案才能有实际意义,通常需要放松。两种标准的松弛方法被广泛用于求解一般的BQP-谱方法和半定规划(SDP),每一个都有自己的优点和缺点。谱松弛方法简单易行,但其边界较松。半定松弛法有一个更紧的界,但它的计算复杂性很高,特别是对于大规模问题。在这项工作中,我们提出了一个新的SDP制定BQP,具有两个理想的属性。首先,它具有与常规SDP公式类似的松弛约束。其次,与传统的SDP方法相比,新的SDP制定导致一个显着更有效的和可扩展的双重优化方法,它具有相同程度的复杂度的谱方法。然后,我们提出了两个解决方案,即拟牛顿法和光滑牛顿法,对偶问题。这两种方法都比标准的相邻点方法有效得多。实际上,对于密集或中等大小的问题,平滑牛顿求解器比拟牛顿求解器更快,而拟牛顿求解器更适合大型稀疏/结构化问题。我们的实验上的几个计算机视觉应用,包括聚类,图像分割,共分割和注册显示我们的SDP制定解决大规模BQP的潜力。
英文摘要:
In computer vision, many problems such as image segmentation, pixel labelling, and scene parsing can be formulated as binary quadratic programs (BQPs). For submodular problems, cuts based methods can be employed to efficiently solve large-scale problems. However, general nonsubmodular problems are significantly more challenging to solve. Finding a solution when the problem is of large size to be of practical interest, however, typically requires relaxation. Two standard relaxation methods are widely used for solving general BQPs--spectral methods and semidefinite programming (SDP), each with their own advantages and disadvantages. Spectral relaxation is simple and easy to implement, but its bound is loose. Semidefinite relaxation has a tighter bound, but its computational complexity is high, especially for large scale problems. In this work, we present a new SDP formulation for BQPs, with two desirable properties. First, it has a similar relaxation bound to conventional SDP formulations. Second, compared with conventional SDP methods, the new SDP formulation leads to a significantly more efficient and scalable dual optimization approach, which has the same degree of complexity as spectral methods. We then propose two solvers, namely, quasi-Newton and smoothing Newton methods, for the dual problem. Both of them are significantly more efficiently than standard interior-point methods. In practice, the smoothing Newton solver is faster than the quasi-Newton solver for dense or medium-sized problems, while the quasi-Newton solver is preferable for large sparse/structured problems. Our experiments on a few computer vision applications including clustering, image segmentation, co-segmentation and registration show the potential of our SDP formulation for solving large-scale BQPs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。