arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1407.2774cs.DSmath.COmath.PR
收藏

下采样幂迭代:块模型和种植CSP的统一算法

Subsampled Power Iteration: a Unified Algorithm for Block Models and Planted CSP's

Vitaly Feldman, Will Perkins, Santosh Vempala

摘要:

我们提出了一个算法,恢复种植的解决方案,在两个著名的模型,随机块模型和种植约束满足问题,通过一个共同的推广随机二分图。我们的算法匹配到一个常数因子的边缘(或约束)的数量完美的恢复所需的最知名的界限,其运行时间是线性的边缘使用的数量。该方法的时间复杂度明显优于基于频谱和基于SDP的方法。该算法的主要贡献是在大小不等的情况下的bipartition(对应于奇均匀CSP)。在这里,我们的算法成功地在一个显着较低的密度比谱的方法,超越了障碍的基础上的谱范数的随机矩阵。算法和分析的其他重要特征包括:(i)关键使用子采样的幂迭代,这可能是独立的兴趣;其分析需要跟踪演化解决方案的多个范数;(ii)它可以统计地实现,即,在对输入分布的访问非常有限的情况下(iii)该算法实现起来非常简单,并且在线性时间内运行,因此即使对于非常大的实例也是实用的。

英文摘要:

We present an algorithm for recovering planted solutions in two well-known models, the stochastic block model and planted constraint satisfaction problems, via a common generalization in terms of random bipartite graphs. Our algorithm matches up to a constant factor the best-known bounds for the number of edges (or constraints) needed for perfect recovery and its running time is linear in the number of edges used. The time complexity is significantly better than both spectral and SDP-based approaches. The main contribution of the algorithm is in the case of unequal sizes in the bipartition (corresponding to odd uniformity in the CSP). Here our algorithm succeeds at a significantly lower density than the spectral approaches, surpassing a barrier based on the spectral norm of a random matrix. Other significant features of the algorithm and analysis include (i) the critical use of power iteration with subsampling, which might be of independent interest; its analysis requires keeping track of multiple norms of an evolving solution (ii) it can be implemented statistically, i.e., with very limited access to the input distribution (iii) the algorithm is extremely simple to implement and runs in linear time, and thus is practical even for very large instances.

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

↑