Different solvers for computationally difficult problems such as satisfiability (SAT) perform best on different instances. Algorithm portfolios exploit this phenomenon by predicting solvers' performance on specific problem instances, then shifting computational resources to the solvers that appear best suited. This paper develops a new approach to the problem of making such performance predictions: natural generative models of solver behavior. Two are proposed, both following from an assumption that problem instances cluster into latent classes: a mixture of multinomial distributions, and a mixture of Dirichlet compound multinomial distributions. The latter model extends the former to capture burstiness, the tendency of solver outcomes to recur. These models are integrated into an algorithm portfolio architecture and used to run standard SAT solvers on competition benchmarks. This approach is found competitive with the most prominent existing portfolio, SATzilla, which relies on domain-specific, hand-selected problem features; the latent class models, in contrast, use minimal domain knowledge. Their success suggests that these models can lead to more powerful and more general algorithm portfolio methods.

PDF

In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence 2010.

@InProceedings{silverthorn:aaai2010, title={Latent Class Models for Algorithm Portfolio Methods}, author={Bryan Silverthorn and Risto Miikkulainen}, booktitle={Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence}, url="http://www.cs.utexas.edu/users/ai-lab?silverthorn:aaai2010", year={2010} }

Slides (PDF)