Cross-Entropy Algorithm
(Redirected from Cross-entropy method)
Jump to navigation
Jump to search
A Cross-Entropy Algorithm is a Monte-Carlo combinatorial optimization algorithm.
- See: Kullback–Leibler Divergence, Reuven Rubinstein, Monte Carlo Method, Combinatorial Optimization, Continuous Optimization, Optimization (Mathematics), Importance Sampling, Traveling Salesman Problem, Quadratic Assignment Problem, Sequence Alignment, Maxcut, Global Optimization.
References
2017
- (Wikipedia, 2017) ⇒ https://en.wikipedia.org/wiki/cross-entropy_method Retrieved:2017-6-7.
- The cross-entropy (CE) method attributed to Reuven Rubinstein is a general Monte Carlo approach to combinatorial and continuous multi-extremal optimization and importance sampling. The method originated from the field of rare event simulation, where very small probabilities need to be accurately estimated, for example in network reliability analysis, queueing models, or performance analysis of telecommunication systems. The CE method can be applied to static and noisy combinatorial optimization problems such as the traveling salesman problem, the quadratic assignment problem, DNA sequence alignment, the max-cut problem and the buffer allocation problem, as well as continuous global optimization problems with many local extrema.
In a nutshell the CE method consists of two phases:
- Generate a random data sample (trajectories, vectors, etc.) according to a specified mechanism.
- Update the parameters of the random mechanism based on the data to produce a "better" sample in the next iteration. This step involves minimizing the cross-entropy or Kullback–Leibler divergence.
- The cross-entropy (CE) method attributed to Reuven Rubinstein is a general Monte Carlo approach to combinatorial and continuous multi-extremal optimization and importance sampling. The method originated from the field of rare event simulation, where very small probabilities need to be accurately estimated, for example in network reliability analysis, queueing models, or performance analysis of telecommunication systems. The CE method can be applied to static and noisy combinatorial optimization problems such as the traveling salesman problem, the quadratic assignment problem, DNA sequence alignment, the max-cut problem and the buffer allocation problem, as well as continuous global optimization problems with many local extrema.