Simulated Annealing in Bayesian Decision Theory
Since the seminal paper by Kirkpatrick, Gelatt and Vechhi (1983), a number of papers in the scientific literature refer to simulated annealing as a powerful random optimization method which promises to deliver, within reasonable computing times, optimal or nearly optimal solutions to complex decision problems hitherto forbidding. The algorithm, which uses the physical process of annealing as a metaphor, is special in that, at each iteration, one may move with positive probability to solutions with higher values of the function to minimize, rather than directly jumping to the point with the smallest value within the neighborhood, thus drastically reducing the chances of getting trapped in local minima. This paper describes a variation of this algorithm within the Bayesian context of minimizing the expected loss in complex decision problems. The procedure is then applied to the identification of good designs for political sample surveys, aimed at predicting the behaviour of the electorate in future elections.
KeywordsSimulated Annealing Global Result Expected Loss Logarithmic Divergence Reasonable Computing Time
Unable to display preview. Download preview PDF.
- Bernardo, J. M. and Girón, F. J. (1992). Robust sequential prediction form non-random samples: the election night forecasting case. Bayesian Statistics 4 (J. M. Bernardo, J. O. Berger, A. P. Dawid and A. F. M. Smith, eds.), Oxford: University Press, 61–77, (with discussion).Google Scholar
- Good, I. J. (1952). Rational decisions. J. Roy. Statist. Soc. B 14, 107–114.Google Scholar
- Haines, L. M. (1987). The application of the annealing algorithm to the construction of exact optimal designs for linear regression models. Technometrics 29, 439–447.Google Scholar