On approximating the f-divergence between two Ising models
Not on the map. Why?
Abstract (arXiv)
The f-divergence is a fundamental notion that measures the difference between two distributions. In this paper, we study the problem of approximating the f-divergence between two Ising models, which is a generalization of recent work on approximating the TV-distance. Given two Ising models nu and μ, which are specified by their interaction matrices and external fields, the problem is to approximate the f-divergence Df(nu,|,μ) within an arbitrary relative error e± varepsilon. For chiα-divergence with a constant integer α, we establish both algorithmic and hardness results. The algorithm works in a parameter regime that matches the hardness result. Our algorithm can be extended to other f-divergences such as α-divergence, Kullback-Leibler divergence, R'enyi divergence, Jensen-Shannon divergence, and squared Hellinger distance.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 22 of its 34 references that are in the map. First posted on arXiv 5 Sep 2025.
Builds on
22 of 34 references.
References · 22
- 2014Efficiently learning Ising models on arbitrary graphscited by 50
- 2021Neural Estimation of Statistical Divergencescited by 25
- 2019Practical and Consistent Estimation of f-Divergencescited by 24
- 2016Testing Ising Modelscited by 23
- 2020Efficient Distance Approximation for Structured High-Dimensional Distributions via Learningcited by 14
- 2022On Approximating Total Variation Distancecited by 14
- 2020Optimal Mixing of Glauber Dynamics: Entropy Factorization via High-Dimensional Expansioncited by 12
- 2018On Computing the Total Variation Distance of Hidden Markov Modelscited by 8
- 2022A simple polynomial-time approximation algorithm for the total variation distance between two product distributionscited by 8
- 2023On Deterministically Approximating Total Variation Distancecited by 7
- 2023Total Variation Distance Meets Probabilistic Inferencecited by 5
- 2022Complexity of High-Dimensional Identity Testing with Coordinate Conditional Samplingcited by 4
10 more
- 2024Rapid Mixing at the Uniqueness Thresholdcited by 4
- 2021Computing Divergences between Discrete Decomposable Modelscited by 3
- 2024A Circus of Circuits: Connections Between Decision Diagrams, Circuits, and Automatacited by 3
- 2024Computational Explorations of Total Variation Distancecited by 3
- 2017The Ising Partition Function: Zeros and Deterministic Approximationcited by 2
- 2024Sharp bounds on aggregate expert errorcited by 2
- 2025Approximating the total variation distance between spin systemscited by 2
- 2025Algorithms and Hardness for Estimating Statistical Similaritycited by 1
- 2025Approximating the Total Variation Distance between Gaussianscited by 1
- 2025Sampling and Identity-Testing Without Approximate Tensorization of Entropycited by 1
Built on by
Not cited yet.