In this chapter we apply the CE method to several problems arising in machine learning, specifically with respect to optimization. In Section 8.1, adapted from , we apply CE to the well-known mastermind game. Section 8.2, based partly on , describes the application of the CE method to Markov decision processes. Finally, in Section 8.3 the CE method is applied to clustering problems. In addition to its simplicity, the advantage of using the CE method for machine learning is that it does not require direct estimation of the gradients, as many other algorithms do (for example, the stochastic approximation, steepest ascent, or conjugate gradient method). Moreover, as a global optimization procedure the CE method is quite robust with respect to starting conditions and sampling errors, in contrast to some other heuristics, such as simulated annealing or guided local search.
Weitere Kapitel dieses Buchs durch Wischen aufrufen
- Applications of CE to Machine Learning
Reuven Y. Rubinstein
Dirk P. Kroese
- Springer New York
Neuer Inhalt/© ITandMEDIA