Binary Optimization: On the Probability of a Local Minimum Detection in Random Search

Authors:
Boris Kryzhanovsky;Vladimir Kryzhanovsky
Affiliations:
Center of Optical Neural Technologies, SR Institute of System Analysis Russian Academy of Sciences, Moscow, Russia 119333;Center of Optical Neural Technologies, SR Institute of System Analysis Russian Academy of Sciences, Moscow, Russia 119333
Venue:
ICAISC '08 Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing
Year:
2006

Citing 8
Cited 4

Neural Networks for Combinatorial Optimization: a Review of More Than a Decade of Research

INFORMS Journal on Computing
New Optimization Algorithms in Physics

New Optimization Algorithms in Physics
Application of domain neural network to optimization tasks

ICANN'05 Proceedings of the 15th international conference on Artificial neural networks: formal models and their applications - Volume Part II
A hybrid Hopfield network-simulated annealing approach for frequency assignment in satellite communications systems

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A noisy chaotic neural network for solving combinatorial optimization problems: stochastic chaotic simulated annealing

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A noisy self-organizing neural network with bifurcation dynamics for combinatorial optimization

IEEE Transactions on Neural Networks
A columnar competitive model for solving combinatorial optimization problems

IEEE Transactions on Neural Networks
A gradual noisy chaotic neural network for solving the broadcast scheduling problem in packet radio networks

IEEE Transactions on Neural Networks

Transformations in the scale of behavior and the global optimization of constraints in adaptive networks

Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems
Global adaptation in networks of selfish components: Emergent associative memory at the system scale

Artificial Life
Binary perceptron learning algorithm using simplex-method

ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part I
Vector perceptron learning algorithm using linear programming

ICANN'12 Proceedings of the 22nd international conference on Artificial Neural Networks and Machine Learning - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of binary optimization of a quadratic functional is discussed. By analyzing the generalized Hopfield model we obtain expressions describing the relationship between the depth of a local minimum and the size of the basin of attraction. Based on this, we present the probability of finding a local minimum as a function of the depth of the minimum. Such a relation can be used in optimization applications: it allows one, basing on a series of already found minima, to estimate the probability of finding a deeper minimum, and to decide in favor of or against further running the program. The iterative algorithm that allows us to represent any symmetric N×Nmatrix as a weighted Hebbian series of bipolar vectors with a given accuracy is proposed. It so proves that all conclusions about neural networks and optimization algorithms that are based on Hebbian matrices are true for any other type of matrix. The theory is in a good agreement with experimental results.