Binary minimization: increasing the attraction area of the global minimum in the binary optimization problem

  • Authors:
  • Yakov Karandashev;Boris Kryzhanovsky

  • Affiliations:
  • Moscow Institute of Physics and Technology, Dolgoprudny, Russia and Center of Optical Neural Technologies, SRISA, RAS, Moscow;Center of Optical Neural Technologies, SRISA, RAS, Moscow

  • Venue:
  • ICANN'10 Proceedings of the 20th international conference on Artificial neural networks: Part II
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

The paper deals with the minimization of a quadratic functional in the configuration space of binary states. To increase the efficiency of the random-search algorithm, we offer changing the functional by raising the matrix it is based on to a power. We demonstrate that this brings about changes of the energy surface: deep minima displace slightly in the space and become still deeper and their attraction areas grow significantly. The experiment shows that use of the approach results in a considerable displacement of the spectrum of sought-for minima to the area of greater depths, while the probability to find the global minimum increases abruptly (by a factor of 103 in the case of a two-dimensional Ising model).