Adaptive simulated annealing: A near-optimal connection between sampling and counting
From MaRDI portal
Publication:3452215
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
Cited in
(23)- scientific article; zbMATH DE number 7378644 (Why is no real title available?)
- Convergence of MCMC and loopy BP in the tree uniqueness region for the hard-core model
- Approximately counting bases of bicircular matroids
- Random Construction of Interpolating Sets for High-Dimensional Integration
- Likelihood-based inference for Matérn type-III repulsive point processes
- Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction
- Counting subsets of contingency tables
- Fast algorithms at low temperatures via Markov chains†
- Hardness of identity testing for restricted Boltzmann machines and Potts models
- Algorithms for hard-constraint point processes via discretization
- Simulation reduction of the Ising model to general matchings
- scientific article; zbMATH DE number 7650108 (Why is no real title available?)
- Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems
- Quantum Chebyshev's Inequality and Applications
- Approximation algorithms for the normalizing constant of Gibbs distributions
- Using TPA to count linear extensions
- Randomly coloring constant degree graphs
- Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs
- Fast sampling of satisfying assignments from random \(k\)-SAT with applications to connectivity
- A practical volume algorithm
- Inapproximability of counting independent sets in linear hypergraphs
- Efficient sampling and counting algorithms for the Potts model on ℤd at all temperatures
- The Gibbs cloner for combinatorial optimization, counting and sampling
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)
