Search Results for author:
Found 5 papers, 2 papers with code
Ordinal Monte Carlo Tree Search
In this paper we take a look at MCTS, a popular algorithm to solve MDPs, highlight a reoccurring problem concerning its use of rewards, and show that an ordinal treatment of the rewards overcomes this problem.
Ordinal Bucketing for Game Trees using Dynamic Quantile Approximation
In this paper, we present a simple and cheap ordinal bucketing algorithm that approximately generates $q$-quantiles from an incremental data stream.
Deep Ordinal Reinforcement Learning
Reinforcement learning usually makes use of numerical rewards, which have nice properties but also come with drawbacks and difficulties.
Ordinal Monte Carlo Tree Search
In many problem settings, most notably in game playing, an agent receives a possibly delayed reward for its actions.
Preference-Based Monte Carlo Tree Search
To deal with such cases, the experimenter has to supply an additional numeric feedback signal in the form of a heuristic, which intrinsically guides the agent.
