title: Dynamic weighting in Monte Carlo and optimization.
abstract: Dynamic importance weighting is proposed as a Monte Carlo method that has the capability to sample relevant parts of the configuration space even in the presence of many steep energy minima. The method relies on an additional dynamic variable (the importance weight) to help the system overcome steep barriers. A non-Metropolis theory is developed for the construction of such weighted samplers. Algorithms based on this method are designed for simulation and global optimization tasks arising from multimodal sampling, neural network training, and the traveling salesman problem. Numerical tests on these problems confirm the effectiveness of the method.
authors.affiliation: Interdivisional Program in Statistics, 8142 Mathematical Sciences, University of California, Los Angeles, CA 90095-1554, USA.
authors.forename: W H
authors.initials: WH
authors.lastname: Wong
authors.forename: F
authors.initials: F
authors.lastname: Liang