arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2111.03084math.PRmath-phmath.MPstat.ML
收藏

二进制感知器:高效算法可以在罕见的连接良好的集群中找到解决方案

Binary perceptron: efficient algorithms can find solutions in a rare well-connected cluster

Emmanuel Abbe, Shuangping Li, Allan Sly

摘要:

最近的研究表明,即使在低约束密度下,对称二进制感知器中几乎所有的解都是孤立的,这表明很难找到典型的解。相比之下,一些算法已被证明是成功的,在低密度的解决方案。这种现象在数值上得到了证明,因为解的次优势和稠密连通区域的存在,可以通过简单的学习算法来访问。在本文中,我们正式建立这样的现象,对称和非对称的二元感知器。我们表明,在低约束密度(相当于overparametrized感知器),确实存在一个subdominant连接集群的解决方案,几乎最大直径,和一个有效的多尺度多数算法可以找到解决方案,在这样一个集群的概率很高,特别是解决一个开放的问题提出的Perkins-Xu '21。此外,即使接近临界阈值,我们表明,存在集群的线性直径的对称感知器,以及额外的假设下的非对称感知器。

英文摘要:

It was recently shown that almost all solutions in the symmetric binary perceptron are isolated, even at low constraint densities, suggesting that finding typical solutions is hard. In contrast, some algorithms have been shown empirically to succeed in finding solutions at low density. This phenomenon has been justified numerically by the existence of subdominant and dense connected regions of solutions, which are accessible by simple learning algorithms. In this paper, we establish formally such a phenomenon for both the symmetric and asymmetric binary perceptrons. We show that at low constraint density (equivalently for overparametrized perceptrons), there exists indeed a subdominant connected cluster of solutions with almost maximal diameter, and that an efficient multiscale majority algorithm can find solutions in such a cluster with high probability, settling in particular an open problem posed by Perkins-Xu '21. In addition, even close to the critical threshold, we show that there exist clusters of linear diameter for the symmetric perceptron, as well as for the asymmetric perceptron under additional assumptions.

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

↑