Image de couverture de livre

Rapid mixing in positively weighted restricted Boltzmann machines

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Feng, Weiming, Guo, Heng, Yang, Minji
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms Machine Learning Probability
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Approximating the total variation distance between spin systems
par: Feng, Weiming, et autres
Publié: (2025)

On Computing Total Variation Distance Between Mixtures of Product Distributions
par: Feng, Weiming, et autres
Publié: (2026)

Rapid Mixing of Glauber Dynamics for Monotone Systems via Entropic Independence
par: Feng, Weiming, et autres
Publié: (2025)

On approximating the $f$-divergence between two Ising models
par: Feng, Weiming, et autres
Publié: (2025)

Approximating the Total Variation Distance between Gaussians
par: Bhattacharyya, Arnab, et autres
Publié: (2025)

Rapid Mixing via Coupling Independence for Spin Systems with Unbounded Degree
par: Chen, Xiaoyu, et autres
Publié: (2024)

Improved sampling algorithms and functional inequalities for non-log-concave distributions
par: He, Yuchen, et autres
Publié: (2025)

Leaf Stripping on Uniform Attachment Trees
par: Addario-Berry, Louigi, et autres
Publié: (2024)

Simple, unified analysis of Johnson-Lindenstrauss with applications
par: Li, Yingru
Publié: (2024)

Efficiently learning and sampling multimodal distributions with data-based initialization
par: Koehler, Frederic, et autres
Publié: (2024)

Private Synthetic Graph Generation and Fused Gromov-Wasserstein Distance
par: Wirth, Leoni Carla, et autres
Publié: (2025)

A General Reduction for High-Probability Analysis with General Light-Tailed Distributions
par: Attia, Amit, et autres
Publié: (2024)

The graph alignment problem: fundamental limits and efficient algorithms
par: Ganassali, Luca
Publié: (2024)

Rapid Mixing at the Uniqueness Threshold
par: Chen, Xiaoyu, et autres
Publié: (2024)

The Transient Cost of Learning in Queueing Systems
par: Freund, Daniel, et autres
Publié: (2023)

Quality control in sublinear time: a case study via random graphs
par: Marcussen, Cassandra, et autres
Publié: (2025)

Learning CNF formulas from uniform random solutions in the local lemma regime
par: Feng, Weiming, et autres
Publié: (2025)

Rapid Mixing on Random Regular Graphs beyond Uniqueness
par: Chen, Xiaoyu, et autres
Publié: (2025)

Discrete Optimal Transport: Rapid Convergence of Simulated Annealing Algorithms
par: He, Yuchen, et autres
Publié: (2026)

Learning bounded-degree polytrees with known skeleton
par: Choo, Davin, et autres
Publié: (2023)

An FPRAS for two terminal reliability in directed acyclic graphs
par: Feng, Weiming, et autres
Publié: (2023)

Data organization limits the predictability of binary classification
par: Jing, Fei, et autres
Publié: (2024)

Edge-Tilting Field Dynamics: Rapid Mixing at the Uniqueness Threshold and Optimal Mixing for Swendsen-Wang Dynamics
par: Chen, Xiaoyu, et autres
Publié: (2026)

Optimal Mixing for Randomly Sampling Edge Colorings on Trees Down to the Max Degree
par: Carlson, Charlie, et autres
Publié: (2024)

Functional Stochastic Localization
par: Gu, Anming, et autres
Publié: (2026)

High-accuracy log-concave sampling with stochastic queries
par: Chen, Fan, et autres
Publié: (2026)

A computational phase transition for learning-to-sample from Ising models
par: Risteski, Andrej, et autres
Publié: (2026)

Well-Conditioned Oblivious Perturbations in Linear Space
par: Chenakkod, Shabarish, et autres
Publié: (2026)

Universality of first-order methods on random and deterministic matrices
par: Gorini, Nicola, et autres
Publié: (2026)

SCaLE: Switching Cost aware Learning and Exploration
par: Bhuyan, Neelkamal, et autres
Publié: (2026)

A polynomial time iterative algorithm for matching Gaussian matrices with non-vanishing correlation
par: Ding, Jian, et autres
Publié: (2022)

Complexity of High-Dimensional Identity Testing with Coordinate Conditional Sampling
par: Blanca, Antonio, et autres
Publié: (2022)

Parallel Sampling via Counting
par: Anari, Nima, et autres
Publié: (2024)

Adversarially-Robust Inference on Trees via Belief Propagation
par: Hopkins, Samuel B., et autres
Publié: (2024)

Nonlinear Laplacians: Tunable principal component analysis under directional prior information
par: Ma, Yuxin, et autres
Publié: (2025)

Perspectives on Stochastic Localization
par: Shi, Bobby, et autres
Publié: (2025)

Computational and statistical lower bounds for low-rank estimation under general inhomogeneous noise
par: De, Debsurya, et autres
Publié: (2025)

Active Learning for Non-Parametric Choice Models
par: Susan, Fransisca, et autres
Publié: (2022)

Orthogonal Nonnegative Matrix Factorization with Sparsity Constraints
par: Basiri, Salar, et autres
Publié: (2022)

Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity
par: Chenakkod, Shabarish, et autres
Publié: (2024)