Learning Episodes for Optimization

Abstract

Real-world problems often require optimizing a solution for various constraints. Application systems for many of these optimization problems already exist. These systems efficiently encode a core set of knowledge for solving problems in their domain. Where these systems fail is at dealing with the exceptions to the core knowledge. By learning to recognize these exceptions, the quality of the solutions can be further improved. In this paper we describe EASe, a method for learning these exceptions. EASe uses search on simple problems to learn episodes where improvement on a solution was possible. These are then reapplied to improve the quality of more complex solutions. We demonstrate EASe with empirical results from experiments with a set of benchmark problems from the logic synthesis domain.

Cite

Text

Ruby and Kibler. "Learning Episodes for Optimization." International Conference on Machine Learning, 1992. doi:10.1016/B978-1-55860-247-2.50054-1

Markdown

[Ruby and Kibler. "Learning Episodes for Optimization." International Conference on Machine Learning, 1992.](https://mlanthology.org/icml/1992/ruby1992icml-learning/) doi:10.1016/B978-1-55860-247-2.50054-1

BibTeX

@inproceedings{ruby1992icml-learning,
  title     = {{Learning Episodes for Optimization}},
  author    = {Ruby, David and Kibler, Dennis F.},
  booktitle = {International Conference on Machine Learning},
  year      = {1992},
  pages     = {379-384},
  doi       = {10.1016/B978-1-55860-247-2.50054-1},
  url       = {https://mlanthology.org/icml/1992/ruby1992icml-learning/}
}