Learning evaluation functions to improve optimization by local search

This paper describes algorithms that learn to improve search performance on large-scale optimization tasks. The main algorithm, Stage, works by learning an evaluation function that predicts the outcome of a local search algorithm, such as hillclimbing or Walksat, from features of states visited during search. The learned evaluation function is then used to bias future search trajectories toward better optima on the same problem. An-other algorithm,X-Stage, transfers previously learned evaluation functions to new, similar optimization problems. Empirical results are provided on seven large-scale optimization domains: bin-packing, channel routing, Bayesian network structure-nding, radiotherapy treatment planning, cartogram design, Boolean satisability, and Boggle board setup