惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Apple Machine Learning Research
Apple Machine Learning Research
爱范儿
爱范儿
博客园_首页
博客园 - 【当耐特】
V
Visual Studio Blog
博客园 - 叶小钗
月光博客
月光博客
美团技术团队
J
Java Code Geeks
小众软件
小众软件
Y
Y Combinator Blog
博客园 - Franky
Martin Fowler
Martin Fowler
博客园 - 聂微东
Microsoft Azure Blog
Microsoft Azure Blog
IT之家
IT之家
MyScale Blog
MyScale Blog
人人都是产品经理
人人都是产品经理
Microsoft Security Blog
Microsoft Security Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
阮一峰的网络日志
阮一峰的网络日志
酷 壳 – CoolShell
酷 壳 – CoolShell
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
云风的 BLOG
云风的 BLOG

cs.DS updates on arXiv.org

PAC Learning with Bandit Feedback: Sharp Sample Complexity in the Realizable Setting Algorithms with Polynomially-Improved Approximation Factors for the $2 \rightarrow q$ Norm, and Applications A computational phase transition for learning-to-sample from Ising models Covering vertices by sequential stars Fermi-Dirac machines as quantizations of neurons A Comprehensive Evaluation of Vertex Elimination Algorithms for Algorithmic Differentiation A Tight Bound on Localization of Electrical Flows Optimal Dimension-Free Sampling for Regularized Classification Reducing the Randomness in Partition Oracles for Bounded Degree Minor-Free Graphs Beyond the Half-Approximation: Fair and Efficient Online Class Matching Efficient Uniform Sampling of Surjections via their Profiles Tractable Maximization of Budgeted Phylogenetic Diversity on Networks Utilizing Node Scanwidth Fairness in Aggregation: Optimal Top-$k$ and Improved Full Ranking Learning-Augmented Online Scheduling with Parsimonious Preemption Entropy Equivalence Testing Lumberjack: Better Differentially Private Random Forests through Heavy Hitter Detection in Trees The Secretary Problem with a Stochastic Precursor Polynomial-Time Robust Multiclass Linear Classification under Gaussian Marginals Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification Block-Sphere Vector Quantization An Approximation Algorithm for Graph Label Selection Iterative Chow Filtering for Learning with Distribution Shift Complexity of Non-Log-Concave Sampling in Fisher Information Stochastic Matching via Local Sparsification Finite Sample Bounds for Learning with Score Matching What is Learnable in Valiant's Theory of the Learnable? Provable Quantization with Randomized Hadamard Transform Min-Max Optimization Requires Exponentially Many Queries Fast and Compact Graph Cuts for the Boykov-Kolmogorov Algorithm A proximal gradient algorithm for composite log-concave sampling
Strong Spatial Mixing for General 2-Spin Systems: A Unifi...
[Submitted on 17 Jan 2024 (v1), last revised 16 Jul 2026 (this v · 2024-01-18 · via cs.DS updates on arXiv.org

View PDF HTML (experimental)

Abstract:We study the algorithmic implications of zero-free regions for the partition functions of 2-spin systems. While Barvinok's algorithm yields FPTASes in such regions, the applicability of Weitz's algorithm is limited to parameter regimes where strong spatial mixing (SSM) can be established. It remains open whether Weitz's algorithm can be applied to general zero-free regions, particularly in settings where no standard tree-recurrence-based proof of SSM is known. We establish new SSM results and thereby extend the applicability of Weitz's FPTAS to all currently known zero-free regions of 2-spin systems with pinned vertices. We achieve this through a unified approach to deriving SSM from zero-freeness in the most general settings of 2-spin systems. Our work features two key innovations.
this http URL SSM results cover parts of the celebrated Lee-Yang zero-free region for the ferromagnetic Ising model, where no tree-recurrence-based proof of SSM is currently known or considered feasible. The tree recurrence method typically relies on carefully designed potential functions, the construction and analysis of which can be highly challenging. For ferromagnetic 2-spin systems, it remains an open challenge whether such potential functions can be constructed. We circumvent this difficulty by deriving SSM directly from zero-freeness.
this http URL prior approach to deriving SSM from zero-freeness relies on cluster expansions, which are model-specific and known only for a few restricted parameter settings such as the hard-core model near vertex activity $\lambda=1$. We overcome this obstacle by introducing a purely combinatorial approach based on a novel Christoffel-Darboux-type identity that holds universally for 2-spin systems. This provides a broadly applicable framework for handling general 2-spin systems with arbitrary multivariate parameters and zero-free regions of arbitrary shape in a unified manner.

Submission history

From: Xiaowei Ye [view email]
[v1] Wed, 17 Jan 2024 16:41:57 UTC (561 KB)
[v2] Wed, 10 Apr 2024 15:00:11 UTC (561 KB)
[v3] Sat, 8 Feb 2025 12:06:16 UTC (757 KB)
[v4] Thu, 16 Jul 2026 15:46:41 UTC (306 KB)