二元感知器模型中的强冻结现象
Strong freezing in the binary perceptron model
浏览论文内容
中文总结 AI 辅助
本文证明了二元感知器模型在任意固定正约束密度和边际下以高概率表现出强冻结现象，即典型解相互孤立且汉明距离为n阶，方法基于植入模型和受限配分函数，并利用FKG不等式完成证明。
中文摘要 AI 辅助
二元感知器模型研究随机高斯半空间与离散超立方体{-1,+1}^n相交所得的解集。该模型由Krauth和Mézard在20世纪80年代的开创性工作[KM89]中提出，其最引人注目的物理预测之一是强冻结现象，即典型解是孤立的。此外，该猜想后来被进一步强化，断言典型解与任何其他解的汉明距离为n阶[HWK13]、[HK14]。这一现象多年来引起了广泛关注，部分原因在于它与统计物理和计算复杂性之间的复杂联系。我们证明，在任意固定的正约束密度和任意固定边际下，二元感知器模型以高概率表现出强冻结现象。我们的证明基于植入模型和一个受限配分函数，该函数计算与植入解具有非负重叠的解的数量。与完整配分函数不同，这个受限配分函数在植入方向上具有单调性，因此FKG不等式将其与孤立性解耦，而限制仅付出n+1的因子代价。这些因素共同使我们能够将植入解的孤立性转移给典型解，从而完成了强冻结的证明。
英文摘要
The binary perceptron model studies the set of solutions obtained by intersecting random Gaussian half-spaces with the discrete hypercube {-1,+1}^n. Pioneered in the work by Krauth and M{é}zard in the 1980s [KM89], one of the most striking physics predictions for this model is strong freezing, which says that typical solutions are isolated. Moreover, the conjecture was sharpened later to assert that typical solutions are at Hamming distance of order $n$ from every other solution [HWK13],[HK14]. This phenomenon has attracted a lot of attention over the years, partly due to its intricate connections to statistical physics and computational complexity. We prove that the binary perceptron model exhibits strong freezing with high probability at every fixed positive constraint density and every fixed margin. Our proof is based on the planted model and a restricted partition function that counts solutions having nonnegative overlap with the planted solution. Unlike the full partition function, this restricted one is monotone in the planted direction, so the FKG inequality decouples it from isolation, while the restriction costs only a factor of n+1. Together, these allow us to transfer the isolation of the planted solution to typical solutions, which completes the proof of strong freezing.
发表机构
- Yale University（耶鲁大学）
机构由 AI 辅助整理，请以论文原文为准。
