Parameter estimation for Gibbs distributions

DOI10.1145/3685676MaRDI QIDQ7023532zbMATH OpenFDO

Authors David G. Harris, Vladimir Kolmogorov

Publication date 21 February 2025

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3685676

zbMATH Keywords

Gibbs distributionparameter estimationpartition ratio

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08)

Cites work

• A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability
• Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems
• Adaptive simulated annealing: A near-optimal connection between sampling and counting
• Approximate counting and sampling via local central limit theorems
• Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs
• Approximating the Permanent
• Approximation algorithms for the normalizing constant of Gibbs distributions
• Computational thresholds for the fixed-magnetization Ising model
• Convergence of the Wang-Landau algorithm
• Hodge theory for combinatorial geometries
• Log-concave polynomials. II: High-dimensional walks and an FPRAS for counting bases of a matroid
• Noisy binary search and its applications
• Random Construction of Interpolating Sets for High-Dimensional Integration
• Tight bounds for popping algorithms
• Unimodality, log-concavity, real-rootedness and beyond

This page was built for publication: Parameter estimation for Gibbs distributions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7023532)