2005
DOI: 10.1007/s10479-005-5724-z
|View full text |Cite
|
Sign up to set email alerts
|

A Tutorial on the Cross-Entropy Method

Abstract: Abstract:The cross-entropy method is a recent versatile Monte Carlo technique. This article provides a brief introduction to the cross-entropy method and discusses how it can be used for rare-event probability estimation and for solving combinatorial, continuous, constrained and noisy optimization problems. A comprehensive list of references on cross-entropy methods and applications is included.Keywords: cross-entropy, Kullback-Leibler divergence, rare events, importance sampling, stochastic search.The cross-e… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
1,120
0
12

Year Published

2008
2008
2016
2016

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 2,221 publications
(1,142 citation statements)
references
References 37 publications
1
1,120
0
12
Order By: Relevance
“…A gentle tutorial can be found in [8]. The Cross-Entropy (CE) method is an iterative method that involves the following two phases:…”
Section: Ce Methods For Optimal Controlmentioning
confidence: 99%
“…A gentle tutorial can be found in [8]. The Cross-Entropy (CE) method is an iterative method that involves the following two phases:…”
Section: Ce Methods For Optimal Controlmentioning
confidence: 99%
“…We use the same approach suggested by Rubinstein [22], and De Boer et al [23] for solving these problems. Each distance matrix D is given an initial state probability transition matrix, whose (i, j)th element specifies the probability of transitioning from city i to city j.…”
Section: Combinatorial Optimization: Atspmentioning
confidence: 99%
“…Without loss of generality, we will assume the samples are sorted according to their values (i.e., H x i k < H x j k if and only if i < j). A detailed discussion of the admissible tour generation process can be found in de Boer et al [23]. The CWO algorithm differs from other algorithms in how it updates its transition matrix.…”
Section: Combinatorial Optimization: Atspmentioning
confidence: 99%
“…Like the Genetic Algorithm [34] CE is a population based method of optimization. It can be described as an iterative procedure composed of two steps [35]; firstly a large portion of the population of solutions with high objective function values is culled; secondly, the remaining solutions are used to generate a new population. The CE method is used here to determine those global stiffness and mass matrices of the FE plate model that give a best fit of theoretical to measured strains for all runs of the pre-weighed calibration truck(s).…”
Section: Calculating the Materials Propertiesmentioning
confidence: 99%