[论文解读] On Sampling from Ising Models with Spectral Constraints

Andreas Galanis, Alkis Kalavasis+1 more|arXiv (Cornell University)|Jan 1, 2024

Markov Chains and Monte Carlo Methods被引用 1

一句话总结

本文驗證了Kunisky的猜想：當伊辛模型的譜間隔γ > 1時，即使在指數級近似因子內，其抽樣仍是NP難題。作者透過在鐵磁性隨機正則圖中引入溫和的反鐵磁耦合，利用雙峰分佈將問題簡化為反鐵磁系統的不可近似性結果，從而確立了在譜約束下，近似抽樣與計數的強NP難度。

ABSTRACT

We consider the problem of sampling from the Ising model when the underlying interaction matrix has eigenvalues lying within an interval of length $γ$. Recent work in this setting has shown various algorithmic results that apply roughly when $γ< 1$, notably with nearly-linear running times based on the classical Glauber dynamics. However, the optimality of the range of $γ$ was not clear since previous inapproximability results developed for the antiferromagnetic case (where the matrix has entries $\leq 0$) apply only for $γ>2$. To this end, Kunisky (SODA'24) recently provided evidence that the problem becomes hard already when $γ>1$ based on the low-degree hardness for an inference problem on random matrices. Based on this, he conjectured that sampling from the Ising model in the same range of $γ$ is NP-hard. Here we confirm this conjecture, complementing in particular the known algorithmic results by showing NP-hardness results for approximately counting and sampling when $γ>1$, with strong inapproximability guarantees; we also obtain a more refined hardness result for matrices where only a constant number of entries per row are allowed to be non-zero. The main observation in our reductions is that, for $γ>1$, Glauber dynamics mixes slowly when the interactions are all positive (ferromagnetic) for the complete and random regular graphs, due to a bimodality in the underlying distribution. While ferromagnetic interactions typically preclude NP-hardness results, here we work around this by introducing in an appropriate way mild antiferromagnetism, keeping the spectrum roughly within the same range. This allows us to exploit the bimodality of the aforementioned graphs and show the target NP-hardness by adapting suitably previous inapproximability techniques developed for antiferromagnetic systems.

研究动机与目标

• 解決關於伊辛模型抽樣在譜間隔γ超過1時是否仍為NP難題的開放問題，彌補已知演算法結果與不可近似性邊界之間的差距。
• 為在譜約束下（特別是γ > 1時）伊辛模型的近似抽樣與計數提供正式的NP難度證明。
• 克服鐵磁性相互作用通常阻礙NP難度的典型障礙，透過引入受控的反鐵磁耦合，同時保持譜邊界。
• 將現有的反鐵磁系統不可近似性技術擴展至更廣泛的譜區間，利用具有雙峰行為的圖形接頭。
• 確立在譜約束下Glauber動態與通用伊辛模型抽樣的緊緻計算複雜度邊界。

提出的方法

• 構建一個具有鐵磁性相互作用（β > 0）與微小反鐵磁性擾動（−η）的d-正則隨機圖接頭，以打破對稱性，同時保持譜範圍。
• 利用譜理論來界定相互作用矩陣的特徵值範圍：λ_max(J) − λ_min(J) ≤ β(λ_d−1 + 2√(d−2)) + ε，其中λ_d−1 = (d−1) + 2√(d−2)。
• 利用接頭中自旋配置的雙峰分佈（因對稱性與大規模結構）確保正負全局相位具有相等機率。
• 對全局相位條件化自旋分佈，證明其近似於具有小誤差（1 ± ε）的乘積分佈，進而實現向MaxCut的歸約。
• 透過以反鐵磁性邊連接接頭，將問題從MaxCut歸約至BoundedSpectralIsing問題，確保整體相互作用矩陣的譜間隔小於γ。
• 應用反鐵磁系統中已知的不可近似性技術，證明在指數級因子內近似分區函數是NP難題。

实验结果

研究问题

• RQ1 當譜間隔γ超過1時，伊辛模型抽樣是否仍為NP難題，即使近期已有針對γ < 1的近乎線性時間演算法？
• RQ2 能否在γ > 1的譜區間內確立近似抽樣與計數的NP難度，而此前的不可近似性結果僅適用於γ > 2？
• RQ3 如何調整鐵磁系統（通常不具備NP難度）以在譜約束下產生NP難度？
• RQ4 能否利用隨機正則圖中的雙峰行為，構建從MaxCut到譜間隔有界的伊辛模型的歸約？
• RQ5 NP難度在伊辛模型抽樣中成立的最緊緻譜約束γ為何？

主要发现

• 本文驗證了Kunisky的猜想：當譜間隔γ > 1時，伊辛模型的抽樣即使在指數級近似因子內也為NP難題。
• 對於任意d ≥ 4，當γ > (1/2)ln(1 + 2/(d−3)) · (d−1 + 2√(d−2))時，問題BoundedSpectralIsing(d, γ)為NP難題，提供了NP難度的緊緻閾值。
• 作者構建了一個具有鐵磁性相互作用與微小反鐵磁性擾動的d-正則圖，其在保持譜邊界之餘誘導出雙峰自旋分佈。
• 在給定全局相位條件下，對頂點子集S的自旋分佈被證明與乘積分佈（1±ε）接近，從而實現穩健的歸約。
• 利用Weyr–Wielandt與Weyl不等式，將完整相互作用矩陣的譜間隔限制在γ以內，確保實例符合所需的譜約束。
• 該構造可推廣至d ≥ 3，僅需小幅修改，暗示硬性閾值可能進一步緊縮至γ > β_d λ_d（d-正則圖），其中β_d與λ_d以d表示。