Adaptive simulated annealing: A near-optimal connection between sampling and counting
From MaRDI portal
Publication:3452215
DOI10.1145/1516512.1516520zbMath1325.68198MaRDI QIDQ3452215
Eric Vigoda, Daniel Štefanković, Santosh Vempala
Publication date: 11 November 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.211.9581
62D05: Sampling theory, sample surveys
68T05: Learning and adaptive systems in artificial intelligence
60C05: Combinatorial probability
Related Items
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model, Unnamed Item, Approximately counting bases of bicircular matroids, Unnamed Item, Quantum Chebyshev's Inequality and Applications, Random Construction of Interpolating Sets for High-Dimensional Integration, Unnamed Item, Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction, Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs, Efficient sampling and counting algorithms for the Potts model on ℤd at all temperatures, Fast algorithms at low temperatures via Markov chains†, Algorithms for hard-constraint point processes via discretization, A practical volume algorithm, Using TPA to count linear extensions, Improved mixing condition on the grid for counting and sampling independent sets, Counting subsets of contingency tables, Approximation algorithms for the normalizing constant of Gibbs distributions, Randomly coloring constant degree graphs, Improved inapproximability results for counting independent sets in the hard-core model, Likelihood-based inference for Matérn type-III repulsive point processes
