Copertina

Approximating the total variation distance between spin systems

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Feng, Weiming, Liu, Hongyang, Yang, Minji
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Data Structures and Algorithms Machine Learning Probability
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

On approximating the $f$-divergence between two Ising models
di: Feng, Weiming, et al.
Pubblicazione: (2025)

Rapid Mixing of Glauber Dynamics for Monotone Systems via Entropic Independence
di: Feng, Weiming, et al.
Pubblicazione: (2025)

Near-Optimal Parallel Approximate Counting via Sampling
di: Harris, David G., et al.
Pubblicazione: (2026)

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

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

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

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

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

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

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

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

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

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

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

Markov Chains Approximate Message Passing
di: Rajaraman, Amit, et al.
Pubblicazione: (2025)

On Unbiased Low-Rank Approximation with Minimum Distortion
di: Barnes, Leighton Pate, et al.
Pubblicazione: (2025)

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

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

Statistical Estimation in the Spiked Tensor Model via the Quantum Approximate Optimization Algorithm
di: Zhou, Leo, et al.
Pubblicazione: (2024)

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

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

Perspectives on Stochastic Localization
di: Shi, Bobby, et al.
Pubblicazione: (2025)

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

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

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

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

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

Functional Stochastic Localization
di: Gu, Anming, et al.
Pubblicazione: (2026)

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

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

Parallel Sampling via Counting
di: Anari, Nima, et al.
Pubblicazione: (2024)

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

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

Active Learning for Non-Parametric Choice Models
di: Susan, Fransisca, et al.
Pubblicazione: (2022)

Orthogonal Nonnegative Matrix Factorization with Sparsity Constraints
di: Basiri, Salar, et al.
Pubblicazione: (2022)

Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity
di: Chenakkod, Shabarish, et al.
Pubblicazione: (2024)

Learning Mixtures of Gaussians Using Diffusion Models
di: Gatmiry, Khashayar, et al.
Pubblicazione: (2024)