Cover Image

On approximating the $f$-divergence between two Ising models

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Feng, Weiming, Fu, Yucheng
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Machine Learning Probability
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On Computing Total Variation Distance Between Mixtures of Product Distributions
by: Feng, Weiming, et al.
Published: (2026)

Approximating the Total Variation Distance between Gaussians
by: Bhattacharyya, Arnab, et al.
Published: (2025)

Approximating the total variation distance between spin systems
by: Feng, Weiming, et al.
Published: (2025)

Rapid mixing in positively weighted restricted Boltzmann machines
by: Feng, Weiming, et al.
Published: (2026)

A computational phase transition for learning-to-sample from Ising models
by: Risteski, Andrej, et al.
Published: (2026)

Rapid Mixing via Coupling Independence for Spin Systems with Unbounded Degree
by: Chen, Xiaoyu, et al.
Published: (2024)

Fast mixing in Ising models with a negative spectral outlier via Gaussian approximation
by: Mikulincer, Dan, et al.
Published: (2025)

Improved sampling algorithms and functional inequalities for non-log-concave distributions
by: He, Yuchen, et al.
Published: (2025)

Private Synthetic Graph Generation and Fused Gromov-Wasserstein Distance
by: Wirth, Leoni Carla, et al.
Published: (2025)

Leaf Stripping on Uniform Attachment Trees
by: Addario-Berry, Louigi, et al.
Published: (2024)

Simple, unified analysis of Johnson-Lindenstrauss with applications
by: Li, Yingru
Published: (2024)

Efficiently learning and sampling multimodal distributions with data-based initialization
by: Koehler, Frederic, et al.
Published: (2024)

A General Reduction for High-Probability Analysis with General Light-Tailed Distributions
by: Attia, Amit, et al.
Published: (2024)

The graph alignment problem: fundamental limits and efficient algorithms
by: Ganassali, Luca
Published: (2024)

On Sampling from Ising Models with Spectral Constraints
by: Galanis, Andreas, et al.
Published: (2024)

Fixed-magnetization Ising on random graphs up to reconstruction
by: Gheissari, Reza, et al.
Published: (2025)

Quality control in sublinear time: a case study via random graphs
by: Marcussen, Cassandra, et al.
Published: (2025)

The Transient Cost of Learning in Queueing Systems
by: Freund, Daniel, et al.
Published: (2023)

Log-Sobolev inequality for near critical Ising models
by: Bauerschmidt, Roland, et al.
Published: (2022)

Fast Mixing in Sparse Random Ising Models
by: Liu, Kuikui, et al.
Published: (2024)

Hardness of sampling for the anti-ferromagnetic Ising model on random graphs
by: Huang, Neng, et al.
Published: (2024)

Data organization limits the predictability of binary classification
by: Jing, Fei, et al.
Published: (2024)

Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree
by: Carlson, Charlie, et al.
Published: (2024)

Learning CNF formulas from uniform random solutions in the local lemma regime
by: Feng, Weiming, et al.
Published: (2025)

Low coordinate degree algorithms II: Categorical signals and generalized stochastic block models
by: Kunisky, Dmitriy
Published: (2024)

Thinning to improve two-sample discrepancy
by: Smirnov, Gleb, et al.
Published: (2025)

Power laws and power-of-two-choices
by: Redlich, Amanda
Published: (2026)

Nonlinear Laplacians: Tunable principal component analysis under directional prior information
by: Ma, Yuxin, et al.
Published: (2025)

Perspectives on Stochastic Localization
by: Shi, Bobby, et al.
Published: (2025)

Computational and statistical lower bounds for low-rank estimation under general inhomogeneous noise
by: De, Debsurya, et al.
Published: (2025)

Optimal Subspace Embeddings: Resolving Nelson-Nguyen Conjecture Up to Sub-Polylogarithmic Factors
by: Chenakkod, Shabarish, et al.
Published: (2025)

Efficient Diffusion Models for Symmetric Manifolds
by: Mangoubi, Oren, et al.
Published: (2025)

Beyond Non-Degeneracy: Revisiting Certainty Equivalent Heuristic for Online Linear Programming
by: Chen, Yilun, et al.
Published: (2025)

A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation
by: Ding, Jian, et al.
Published: (2022)

Functional Stochastic Localization
by: Gu, Anming, et al.
Published: (2026)

High-accuracy log-concave sampling with stochastic queries
by: Chen, Fan, et al.
Published: (2026)

Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling
by: Blanca, Antonio, et al.
Published: (2022)

Parallel Sampling via Counting
by: Anari, Nima, et al.
Published: (2024)

Adversarially-Robust Inference on Trees via Belief Propagation
by: Hopkins, Samuel B., et al.
Published: (2024)

Learning bounded-degree polytrees with known skeleton
by: Choo, Davin, et al.
Published: (2023)