Optimization Algorithms Based on Renormalization Group
Naoki Kawashima
Abstract
Global changes of states are of crucial importance in optimization algorithms. We review some heuristic algorithms in which global updates are realized by a sort of real-space renormalization group transformation. Emphasis is on the relationship between the structure of low-energy excitations and ``block-spins'' appearing in the algorithms. We also discuss the implication of existence of a finite-temperature phase transition on the computational complexity of the ground-state problem.
Create a lesson
Related papers
Low-temperature magnetism and spin dynamics in the disordered triangular-lattice Yb3+ compound LiCaYb5(BO3)6
Monika Jawale, Saikat Nandi, Prashanta K. Mukharjee et al.
Neural Renormalization Group Flow for Percolation
Anaclara Alvez, Luca Camagna, Sergio Chibbaro et al.
Dynamical phase selection controls compute scaling in looped transformers
Gunn Kim
Semi-localized ground state in a 1D system with long-range hopping
Murod S. Bahovadinov, Faridun N. Jalolov, Vladimir E. Kravtsov et al.
Defect states in three-dimensional diamond photonic band gap crystals
Julia Rocha, Bart A. van Tiggelen, Ad Lagendijk et al.
Disorder-induced conducting edges on Kagomé lattice
A. Chmeruk, D. Jones, L. Chioncel