Katalog Plus
Bibliothek der Frankfurt UAS
Bald neuer Katalog: sichern Sie sich schon vorab Ihre persönlichen Merklisten im Nutzerkonto: Anleitung.
Dieses Ergebnis aus BASE kann Gästen nicht angezeigt werden.  Login für vollen Zugriff.

Can meta-interpretive learning outperform deep reinforcement learning of evaluable game strategies?

Title: Can meta-interpretive learning outperform deep reinforcement learning of evaluable game strategies?
Authors: Hocquette, C; Muggleton, SH
Contributors: Royal Academy Of Engineering; Engineering & Physical Science Research Council (EPSRC)
Publisher Information: arXiv
Publication Year: 2019
Collection: Imperial College London: Spiral
Description: World-class human players have been outperformed in a number of complex two person games (Go, Chess, Checkers) by Deep Reinforcement Learning systems. However, owing to tractability considerations minimax regret of a learning system cannot be evaluated in such games. In this paper we consider simple games (Noughts-and-Crosses and Hexapawn) in which minimax regret can be efficiently evaluated. We use these games to compare Cumulative Minimax Regret for variants of both standard and deep reinforcement learning against two variants of a new Meta-Interpretive Learning system called MIGO. In our experiments all tested variants of both normal and deep reinforcement learning have worse performance (higher cumulative minimax regret) than both variants of MIGO on Noughts-and-Crosses and Hexapawn. Additionally, MIGO's learned rules are relatively easy to comprehend, and are demonstrated to achieve significant transfer learning in both directions between Noughts-and-Crosses and Hexapawn.
Document Type: report
Language: unknown
Relation: http://hdl.handle.net/10044/1/80304; 10145/88; EP/R0222091/1
Availability: http://hdl.handle.net/10044/1/80304
Rights: © 2020 The Author(s)
Accession Number: edsbas.2CCB77F7
Database: BASE