Bandit-Based genetic programming

Authors:
Jean-Baptiste Hoock;Olivier Teytaud
Affiliations:
TAO (Inria), LRI, UMR 8623(CNRS - Univ. Paris-Sud), Orsay, France;TAO (Inria), LRI, UMR 8623(CNRS - Univ. Paris-Sud), Orsay, France
Venue:
EuroGP'10 Proceedings of the 13th European conference on Genetic Programming
Year:
2010

Citing 11
Cited 1

Genetic programming: on the programming of computers by means of natural selection

Genetic programming: on the programming of computers by means of natural selection
GO Is Polynomial-Space Hard

Journal of the ACM (JACM)
Finite-time Analysis of the Multiarmed Bandit Problem

Machine Learning
On the Complexity of Tsume-Go

CG '98 Proceedings of the First International Conference on Computers and Games
Combining online and offline knowledge in UCT

Proceedings of the 24th international conference on Machine learning
Empirical Bernstein stopping

Proceedings of the 25th international conference on Machine learning
Parallel Monte-Carlo Tree Search

CG '08 Proceedings of the 6th international conference on Computers and Games
Grid Coevolution for Adaptive Simulations: Application to the Building of Opening Books in the Game of Go

EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
Continuous Lunches Are Free Plus the Design of Optimal Optimization Algorithms

Algorithmica - Including a Special Section on Genetic and Evolutionary Computation; Guest Editors: Benjamin Doerr, Frank Neumann and Ingo Wegener
Efficient selectivity and backup operators in Monte-Carlo tree search

CG'06 Proceedings of the 5th international conference on Computers and games
Bandit based monte-carlo planning

ECML'06 Proceedings of the 17th European conference on Machine Learning

Intelligent agents for the game of go

IEEE Computational Intelligence Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the validation of randomly generated patterns in a Monte-Carlo Tree Search program. Our bandit-based genetic programming (BGP) algorithm, with proved mathematical properties, outperformed a highly optimized handcrafted module of a well-known computer-Go program with several world records in the game of Go.