Abstract
Meta-reasoning can improve numerous search algorithms, but necessitates collection of statistics to be used as probability distributions, and involves restrictive meta-reasoning assumptions. The recently suggested scheme of type systems in search algorithms is used in this paper for collecting these statistics. The statistics are then used to better estimate the unknown quantity of expected regret of computing a heuristic in Rational Lazy IDA* (RLIDA*), and also facilitate a second improvement due to relaxing one of the unrealistic meta-reasoning assumptions in RLIDA*.
Original language | English |
---|---|
Title of host publication | Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015 |
Editors | Levi Lelis, Roni Stern |
Publisher | AAAI press |
Pages | 151-155 |
Number of pages | 5 |
ISBN (Electronic) | 9781577357322 |
State | Published - 2015 |
Externally published | Yes |
Event | 8th Annual Symposium on Combinatorial Search, SoCS 2015 - Ein Gedi, Israel Duration: 11 Jun 2015 → 13 Jun 2015 |
Publication series
Name | Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015 |
---|---|
Volume | 2015-January |
Conference
Conference | 8th Annual Symposium on Combinatorial Search, SoCS 2015 |
---|---|
Country/Territory | Israel |
City | Ein Gedi |
Period | 11/06/15 → 13/06/15 |
Bibliographical note
Publisher Copyright:Copyright © 2015, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
Funding
Acknowledgments. This research was supported by the Israel Science Foundation (ISF) grant #417/13 and the Frankel Center For Computer Science.
Funders | Funder number |
---|---|
Frankel Center for Computer Science | |
Israel Science Foundation | 417/13 |