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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms(Addison-Wesley, Reading, MA, 1974).
S.B. Akers, Binary decision diagrams, IEEE Transactions on Computers 27 (1978) 509-516.
D. Angluin, Learning regular sets from queries and counterexamples, Information and Computation 75 (1987) 87-106.
A. Blumer, A. Ehrenfeucht, D. Haussler and M. Warmuth, Occam's Razor, Information Processing Letters 24 (1987) 377-380.
R.E. Bryant, Graph-based algorithms for Boolean function manipulation, IEEE Transactions on Computers 35 (1986) 677-691.
R.E. Bryant, Symbolic Boolean manipulation with ordered binary decision diagrams, ACM Computing Surveys 24(3) (1992) 293-318.
O. Coudert, C. Berthet and J.C. Madre, Verification of synchronous sequential machines based on symbolic execution, in: Proceedings of the Workshop on Automatic Verification Methods for Finite State Systems(1989) pp. 111-128.
P. Fischer and H.U. Simon, An approximation preserving reduction from graph coloring to the consistency problem of OBDDs, Unpublished manuscript (1994).
R. Gavald`a and D. Guijarro, Learning ordered binary decision diagrams, in: Proceedings of the 6th International Workshop on Algorithmic Learning Theory(Springer, Berlin, 1995) pp. 228-239.
E.M. Gold, Complexity of automaton identification from given data, Information and Control 37 (1978) 302-320.
J.E. Hopcroft, An nlog nalgorithm for minimizing states in a finite automaton, in: Theory of Machines and Computations, eds. Z. Kohavi and A. Paz (Academic Press, New York, 1971) pp. 189-196.
J.E. Hopcroft and R.M. Karp, An algorithm for testing the equivalence of finite automata, Research Report TR-71-114, Cornell University, Ithaca, NY (1971).
M.J. Kearns and L. Valiant, Cryptographic limitations on learning boolean formulae and finite automata, Journal of the ACM 41 (1994) 67-95.
M.J. Kearns and U.V. Vazirani, An Introduction to Computational Learning Theory(MIT Press, Cambridge, MA, 1994).
K. Lang, Random DFAs can be approximately learned from sparse uniform examples, in: Proceedings of the 5th Annual ACM Workshop on Computational Learning Theory(1992) pp. 45-52.
C.Y. Lee, Representation of switching circuits by binary decision programs, Bell Systems Technical Journal 38 (1959) 985-999.
C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, in: Proceedings of the 25th Annual Symposium on Theory of Computing(1993) pp. 286-293.
L. Bäumer, A. Birkendorf, P. Bollweg, J. Forster, K. Freitag, O. Giel, J. Harms, U. Kleine-Vogelpoth, K. Kneupner, I. Kubbilun, N. Masri, M. Rips, H.U. Simon and M. Wehle, Endbericht der Projektgruppe “Algorithmische Lernstrategien als Werkzeug für kombinatorische Optimierung”, Technical report, Universität Dortmund (1997).
L. Pitt and M.K. Warmuth, The minimum consistent DFA problem cannot be approximated within any polynomial, in: Proceedings of the 21st Annual Symposium on Theory of Computing(1989) pp. 421-432.
R.L. Rivest and R.E. Schapire, Inference of finite automata using homing sequences, Information and Computation 103 (1993) 299-347.
D. Sieling and I. Wegener, Reduction of OBDDs in linear time, Information Processing Letters 48 (1993) 139-144.
H.U. Simon, On approximate solutions for combinatorial optimization problems, SIAM Journal on Discrete Mathematics 3(2) (1990) 294-310.
B.A. Traktenbrot and Y.M. Barzdi{ie257-01}, Finite Automata (Behavior and Synthesis)(North-Holland, Amsterdam, 1973).
Y. Takenaga and S. Yajima, NP-completeness of minimum binary decision diagram identification, Technical Report Comp92-99, SS92-46, Department of Information Science, Faculty of Engineering, Kyoto University, Kyoto, Japan (March 1993).
L. Valiant, A theory of the learnable, Communications of the ACM 27 (1984) 1134-1142.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Birkendorf, A., Ulrich Simon, H. Using computational learning strategies as a tool for combinatorial optimization. Annals of Mathematics and Artificial Intelligence 22, 237–257 (1998). https://doi.org/10.1023/A:1018991519323
Issue Date:
DOI: https://doi.org/10.1023/A:1018991519323