Improvements in Monte Carlo Tree Search for Inductive Program Synthesis

Improvements in Monte Carlo Tree Search for Inductive Program Synthesis

van de Werken, Nathalie (TU Delft Electrical Engineering, Mathematics and Computer Science)

Dumančić, S. (mentor)
Molenaar, M.L. (graduation committee)

Delft University of Technology

Computer Science and Engineering

CSE3000 Research Project

2022-06-24

A recent development in program synthesis is using Monte Carlo Tree Search to traverse the search tree of possible programs in order to efficiently find a program that will successfully transform the given input to the desired output. Previous research has shown promising results as Monte Carlo Tree Search is able to escape local optima that occur during the search. I have continued this previous research by changing some components of Monte
Carlo Tree Search and testing them on three different domains; robot planning, string transformations and ASCII art.
Most notable, I have found that by changing the exploration constant Cp to slowly decrease during the running of the algorithm, you can improve the algorithm’s accuracy. This makes it easier for the algorithm to escape local optima, however here it is crucial the parameters are tuned well. Furthermore, I have also found that improvements can still be made in the expansion step of MCTS. However, changes to which values are backpropagated have not shown an improvement in the accuracy of MCTS in program synthesis.

Monte Carlo Tree Search
Program Synthesis
MUTE
Inductive Program Synthesis
Balancing exploration and exploitation
Backpropagation

http://resolver.tudelft.nl/uuid:b41df59e-b7a2-40bf-a46b-edcca368528a

Student theses

bachelor thesis

© 2022 Nathalie van de Werken