Adaptive simulated annealing: A near-optimal connection between sampling and counting
DOI10.1145/1516512.1516520zbMATH Open1325.68198OpenAlexW2088847343MaRDI QIDQ3452215FDOQ3452215
Authors: D. Štefankovič, Eric Vigoda, Santosh S. 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
Recommendations
- Optimal Sampling for Simulated Annealing Under Noise
- Simulated annealing methods with general acceptance probabilities
- Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems
- Simulated annealing for almost sure convergent random sequences
- Simulated annealing for discrete optimization with estimation
- Optimal acceptance probability for simulated annealing
- scientific article; zbMATH DE number 906530
Learning and adaptive systems in artificial intelligence (68T05) Sampling theory, sample surveys (62D05) Combinatorial probability (60C05)
Cited In (25)
- Likelihood-based inference for Matérn type-III repulsive point processes
- Convergence of MCMC and loopy BP in the tree uniqueness region for the hard-core model
- Simulation reduction of the Ising model to general matchings
- A practical volume algorithm
- Efficient sampling and counting algorithms for the Potts model on ℤd at all temperatures
- Fast algorithms at low temperatures via Markov chains†
- Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems
- Approximation algorithms for the normalizing constant of Gibbs distributions
- Quantum Chebyshev's Inequality and Applications
- Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs
- Improved mixing condition on the grid for counting and sampling independent sets
- Title not available (Why is that?)
- The Gibbs cloner for combinatorial optimization, counting and sampling
- Approximately counting bases of bicircular matroids
- Fast sampling of satisfying assignments from random \(k\)-SAT with applications to connectivity
- Title not available (Why is that?)
- Improved inapproximability results for counting independent sets in the hard-core model
- Randomly coloring constant degree graphs
- Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction
- Algorithms for hard-constraint point processes via discretization
- Random Construction of Interpolating Sets for High-Dimensional Integration
- Inapproximability of counting independent sets in linear hypergraphs
- Counting subsets of contingency tables
- Hardness of identity testing for restricted Boltzmann machines and Potts models
- Using TPA to count linear extensions
This page was built for publication: Adaptive simulated annealing: A near-optimal connection between sampling and counting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452215)
