Type System Based Rational Lazy IDA*

Oded Betzalel; Ariel Felner; Solomon Eyal Shimony

Type System Based Rational Lazy IDA*

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

5 Scopus citations

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 - 1 Jan 2015
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

ASJC Scopus subject areas

Computer Networks and Communications

Cite this

@inproceedings{30613483a99742b5b010169b3c4596be,

title = "Type System Based Rational Lazy IDA*",

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*.",

author = "Oded Betzalel and Ariel Felner and Shimony, \{Solomon Eyal\}",

note = "Funding Information: Acknowledgments. This research was supported by the Israel Science Foundation (ISF) grant \#417/13 and the Frankel Center For Computer Science. Publisher Copyright: Copyright {\textcopyright} 2015, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 8th Annual Symposium on Combinatorial Search, SoCS 2015 ; Conference date: 11-06-2015 Through 13-06-2015",

year = "2015",

month = jan,

day = "1",

language = "English",

series = "Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015",

publisher = "AAAI press",

pages = "151--155",

editor = "Levi Lelis and Roni Stern",

booktitle = "Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015",

}

Betzalel, O, Felner, A & Shimony, SE 2015, Type System Based Rational Lazy IDA*. in L Lelis & R Stern (eds), Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015. Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015, vol. 2015-January, AAAI press, pp. 151-155, 8th Annual Symposium on Combinatorial Search, SoCS 2015, Ein Gedi, Israel, 11/06/15.

Type System Based Rational Lazy IDA*. / Betzalel, Oded; Felner, Ariel ; Shimony, Solomon Eyal.
Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015. ed. / Levi Lelis; Roni Stern. AAAI press, 2015. p. 151-155 (Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015; Vol. 2015-January).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Type System Based Rational Lazy IDA*

AU - Betzalel, Oded

AU - Felner, Ariel

AU - Shimony, Solomon Eyal

N1 - Funding Information: Acknowledgments. This research was supported by the Israel Science Foundation (ISF) grant #417/13 and the Frankel Center For Computer Science. Publisher Copyright: Copyright © 2015, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

PY - 2015/1/1

Y1 - 2015/1/1

N2 - 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*.

AB - 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*.

UR - https://www.scopus.com/pages/publications/85007206408

M3 - Conference contribution

AN - SCOPUS:85007206408

T3 - Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015

SP - 151

EP - 155

BT - Proceedings of the 8th Annual Symposium on Combinatorial Search, SoCS 2015

A2 - Lelis, Levi

A2 - Stern, Roni

PB - AAAI press

T2 - 8th Annual Symposium on Combinatorial Search, SoCS 2015

Y2 - 11 June 2015 through 13 June 2015

ER -

Type System Based Rational Lazy IDA*

Abstract

Publication series

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this