Abstract
Recent empirical studies show that runtime distributions of backtrack procedures for solving hard combinatorial problems often have intriguing properties. Unlike standard distributions (such as the normal), such distributions decay slower than exponentially and have “heavy tails”. Procedures characterized by heavy-tailed runtime distributions exhibit large variability in efficiency, but a very straightforward method called rapid randomized restarts has been designed to essentially improve their average performance. We show on two experimental domains that heavy-tailed phenomena can be observed in ILP, namely in the search for a clause in the subsumption lattice. We also reformulate the technique of randomized rapid restarts to make it applicable in ILP and show that it can reduce the average search-time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L. Breiman, J. Friedman, R. Olshen, and C. Stone. Classification and Regression Trees. Wadsworth, Belmont, 1984.
Daniel Frost, Irina Rish, and Lluis Vila. Summarizing CSP hardness with continuous probability distributions. In AAAI/IAAI, pages 327–333, 1997.
A. Giordana and L. Saitta. Phase transitions in relational learning. Machine Learning, 2000.
C. P. Gomes, B. Selman, N. Crato, and H. A. Kautz. Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Journal of Automated Reasoning, 24(1/2):67–100, 2000.
C. P. Gomes, B. Selman, and H. A. Kautz. Boosting combinatorial search through randomization. In AAAI/IAAI, pages 431–437, 1998.
J. Maloberti and M. Sebag. Theta-subsumption in a constraint satisfaction perspective. volume 2157 of Lecture Notes in Artificial Intelligence, pages 164–178. Springer-Verlag, September 2001.
M. Botta, A. Giordana, L. Saitta, and M. Sebag. Relational learning: hard problems and phase transitions. In 6th Congress of the Italian Association for Artificial Intelligence. Springer-Verlag, 1999.
S. Muggleton. Inverse entailment and Progol. New Generation Computing, Special issue on Inductive Logic Programming, 13(3–4):245–286, 1995.
S. Muggleton and L. De Raedt. Inductive logic programming: Theory and methods. Journal of Logic Programming, 19/20:629–679, 1994.
Michele Sebag and Celine Rouveirol. Resource-bounded relational reasoning: Induction and deduction through stochastic matching. Machine Learning, 38(1/2):41–62, January 2000.
A. Serra, A. Giordana, and L. Saitta. Learning on the phase transition edge. In Proceedings of the 17th International Joint Conference on Artificial Intelligence, pages 921–926. Morgan Kaufmann, 2001.
Barbara M. Smith and Martin E. Dyer. Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence, 81(1–2):155–181, 1996.
A. Srinivasan. A study of two probabilistic methods for searching large spaces with ILP. Technical Report PRG-TR-16-00, Oxford University Computing Laboratory, Oxford, 2000.
A. Srinivasan and R. King. Carcinogenesis predictions using ilp. In S. Džeroski and N. Lavrač, editors, Proceedings of the 7th International Workshop on Inductive Logic Programming, volume 1297 of Lecture Notes in Artificial Intelligence, pages 3–16. Springer-Verlag, 1997.
A. Srinivasan and R.D. King. Feature construction with Inductive Logic Programming: a study of quantitative predictions of biological activity aided by structural attributes. Data Mining and Knowledge Discovery, 3(1):37–57, 1999.
A. Srinivasan, S. Muggleton, M.J.E. Sternberg, and R.D. King. Theories for mutagenicity: A study in first-order and feature-based induction. Artificial Intelligence, 85(1,2), 1996.
R. Walpole and R. Myers. Probability and Statistics for Engineers and Scientists. Collier Macmillan, New York, 1978.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Železný, F., Srinivasan, A., Page, D. (2003). Lattice-Search Runtime Distributions May Be Heavy-Tailed. In: Matwin, S., Sammut, C. (eds) Inductive Logic Programming. ILP 2002. Lecture Notes in Computer Science(), vol 2583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36468-4_22
Download citation
DOI: https://doi.org/10.1007/3-540-36468-4_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00567-4
Online ISBN: 978-3-540-36468-9
eBook Packages: Springer Book Archive