Searched for: subject%3A%22Monte%255C%2BCarlo%255C%2BTree%255C%2BSearch%22
(1 - 8 of 8)
document
Filius, Bas (author)
Machine learning pipelines encompass various sequential steps involved in tasks such as data extraction, preprocessing, model training, and deployment. Manual construction of these pipelines demands expert knowledge and can be time-consuming. To address this challenge, program synthesis offers an automated approach to generate computer programs...
bachelor thesis 2023
document
van de Werken, Nathalie (author)
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...
bachelor thesis 2022
document
Matulewicz, Nadia (author)
Recently, a new and promising Inductive Program Synthesis (IPS) system, Brute, showed the potential of using a heuristic-based loss function. However, Brute also has its limitations and struggles with escaping local optima. The Monte Carlo Tree Search might offer a solution to this problem since it balances between exploitation and exploration....
bachelor thesis 2022
document
Schiet, Thomas (author)
We consider a simplified version of the Monte Carlo tree search (MCTS) problem, a problem where, given a game tree with stochastic reward, one is tasked with finding the best move from the root. This problem is well studied, and recently impressive results have been obtained. For example, in 2016, when the AlphaGo program beat the professional...
master thesis 2020
document
Engelke, Anna (author)
In recent years, airlines have increasingly developed the ability to monitor the condition of aircraft components by means of sensors. In turn, aircraft maintenance aims to use this sensor data to predict component failures. However, the challenge remains to make use of these prognostics to generate appropriate maintenance schedules. In this...
master thesis 2019
document
Deichler, Anna (author)
Recently, the AlphaGo algorithm has managed to defeat the top level human player in the game of Go. Achieving professional level performance in the game of Go has long been considered as an AI milestone. The challenging properties of high state-space complexity, long reward horizon and high action branching factor in the game of Go are also...
master thesis 2019
document
Katt, Sammie (author), Oliehoek, F.A. (author), Amato, Christopher (author)
Model-based Bayesian Reinforcement Learning (BRL) provides a principled solution to dealing with the exploration-exploitation trade-off, but such methods typically assume a fully observable environments. The few Bayesian RL methods that are applicable in partially observable domains, such as the Bayes-Adaptive POMDP (BA-POMDP), scale poorly. To...
conference paper 2019
document
Starre, Rolf (author)
Recent Reinforcement Learning methods have combined function approximation and Monte Carlo Tree Search and are able to learn by self-play up to a very high level in several games such as Go and Hex. One aspect in this combination<br/>that has not had a lot of attention is the action selection policy during self-play, which could influence the...
master thesis 2018
Searched for: subject%3A%22Monte%255C%2BCarlo%255C%2BTree%255C%2BSearch%22
(1 - 8 of 8)