2018
DOI: 10.1103/physreve.98.053308
|View full text |Cite
|
Sign up to set email alerts
|

Optimization of population annealing Monte Carlo for large-scale spin-glass simulations

Abstract: Population annealing Monte Carlo is an efficient sequential algorithm for simulating k-local Boolean Hamiltonians. Because of its structure, the algorithm is inherently parallel and therefore well suited for large-scale simulations of computationally hard problems. Here we present various ways of optimizing population annealing Monte Carlo using 2-local spin-glass Hamiltonians as a case study. We demonstrate how the algorithm can be optimized from an implementation, algorithmic accelerator, as well as scalable… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
28
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
8

Relationship

3
5

Authors

Journals

citations
Cited by 32 publications
(29 citation statements)
references
References 34 publications
1
28
0
Order By: Relevance
“…The new algorithm introduced here, which we call EPA, is not based on Markov chains but on the sequential Monte Carlo method. PA was first studied in [53,54] and more recently developed further in [55][56][57][58][59][60][61]. It is based on the initialization of a population of replicas drawn from the equilibrium distribution at high temperatures, which is then subsequently cooled to lower and lower temperatures.…”
Section: Entropic Population Annealingmentioning
confidence: 99%
“…The new algorithm introduced here, which we call EPA, is not based on Markov chains but on the sequential Monte Carlo method. PA was first studied in [53,54] and more recently developed further in [55][56][57][58][59][60][61]. It is based on the initialization of a population of replicas drawn from the equilibrium distribution at high temperatures, which is then subsequently cooled to lower and lower temperatures.…”
Section: Entropic Population Annealingmentioning
confidence: 99%
“…This ensures that the system is equilibrated according to the Gibbs distribution at each temperature. For the simulations we use particle-conserving dynamics to ensure that the lattice half filling is kept constant, together with a hybrid temperature schedule linear in β and linear in T [57]. We use the family entropy of population annealing [55] as an equilibration criterion.…”
Section: Simulation Detailsmentioning
confidence: 99%
“…ρ s similarly to ρ f converges at a finite R. The population size at which the convergence is achieved is a function of the number of temperatures N T as well as the number of Metropolis sweeps M . Optimization of PAMC is studied in great detail in the context of spin glasses [56,57] much of which can be carried over to the CG simulations. As an example we show in Figs.…”
Section: Appendix A: Equilibrationmentioning
confidence: 99%
See 1 more Smart Citation
“…These results * camey@physics.umass.edu † machta@physics.umass.edu naturally lead to several optimization ideas that we test in the context of the 3D Edwards-Anderson spin glass. Related optimization ideas are explored in [20]. In Sec.…”
Section: Introductionmentioning
confidence: 99%