Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Using computational learning strategies as a tool for combinatorial optimization

Using computational learning strategies as a tool for combinatorial optimization In this paper, we describe how a basic strategy from computational learning theory can be used to attack a class of NP‐hard combinatorial optimization problems. It turns out that the learning strategy can be used as an iterative booster: given a solution to the combinatorial problem, we will start an efficient simulation of a learning algorithm which has a “good chance” to output an improved solution. This boosting technique is a new and surprisingly simple application of an existing learning strategy. It yields a novel heuristic approach to attack NP‐hard optimization problems. It does not apply to each combinatorial problem, but we are able to exactly formalize some sufficient conditions. The new technique applies, for instance, to the problems of minimizing a deterministic finite automaton relative to a given domain, the analogous problem for ordered binary decision diagrams, and to graph coloring. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Annals of Mathematics and Artificial Intelligence Springer Journals

Using computational learning strategies as a tool for combinatorial optimization

Download PDF
21 pages

Loading next page...
 
/lp/springer-journals/using-computational-learning-strategies-as-a-tool-for-combinatorial-iZ4r9SOMsj
Publisher
Springer Journals
Copyright
Copyright © 1998 by Kluwer Academic Publishers
Subject
Computer Science; Computer Science, general; Artificial Intelligence (incl. Robotics); Mathematics, general; Complexity
ISSN
1012-2443
eISSN
1573-7470
DOI
10.1023/A:1018991519323
Publisher site
See Article on Publisher Site

Abstract

In this paper, we describe how a basic strategy from computational learning theory can be used to attack a class of NP‐hard combinatorial optimization problems. It turns out that the learning strategy can be used as an iterative booster: given a solution to the combinatorial problem, we will start an efficient simulation of a learning algorithm which has a “good chance” to output an improved solution. This boosting technique is a new and surprisingly simple application of an existing learning strategy. It yields a novel heuristic approach to attack NP‐hard optimization problems. It does not apply to each combinatorial problem, but we are able to exactly formalize some sufficient conditions. The new technique applies, for instance, to the problems of minimizing a deterministic finite automaton relative to a given domain, the analogous problem for ordered binary decision diagrams, and to graph coloring.

Journal

Annals of Mathematics and Artificial Intelligence – Springer Journals

Published: Oct 4, 2004

References

  • The Design and Analysis of Computer Algorithms
    Aho, A.V.; Hopcroft, J.E.; Ullman, J.D.
  • Binary decision diagrams
    Akers, S.B.
  • Learning regular sets from queries and counterexamples
    Angluin, D.
  • Occam's Razor
    Blumer, A.; Ehrenfeucht, A.; Haussler, D.; Warmuth, M.
  • Graph-based algorithms for Boolean function manipulation
    Bryant, R.E.
  • Symbolic Boolean manipulation with ordered binary decision diagrams
    Bryant, R.E.
  • Proceedings of the 6th International Workshop on Algorithmic Learning Theory
    Gavald`a, R.; Guijarro, D.
  • Complexity of automaton identification from given data
    Gold, E.M.
  • Theory of Machines and Computations
    Hopcroft, J.E.
  • An algorithm for testing the equivalence of finite automata
    Hopcroft, J.E.; Karp, R.M.
  • Cryptographic limitations on learning boolean formulae and finite automata
    Kearns, M.J.; Valiant, L.
  • An Introduction to Computational Learning Theory
    Kearns, M.J.; Vazirani, U.V.
  • Representation of switching circuits by binary decision programs
    Lee, C.Y.
  • Inference of finite automata using homing sequences
    Rivest, R.L.; Schapire, R.E.
  • Reduction of OBDDs in linear time
    Sieling, D.; Wegener, I.
  • On approximate solutions for combinatorial optimization problems
    Simon, H.U.
  • Finite Automata (Behavior and Synthesis)
    Traktenbrot, B.A.; Barzdi, Y.M.
  • NP-completeness of minimum binary decision diagram identification
    Takenaga, Y.; Yajima, S.
  • A theory of the learnable
    Valiant, L.