6 citations · 18 across the 5 of their papers we have counts for
5 papers
Nonparametric General Reinforcement Learning
Jan Leike
Reinforcement learning (RL) problems are often phrased in terms of Markov decision processes (MDPs). In this thesis we go beyond MDPs and consider RL in environments that are non-M…
A Formal Solution to the Grain of Truth Problem
Jan Leike, Jessica Taylor, Benya Fallenstein
A Bayesian agent acting in a multi-agent environment learns to predict the other agents' policies if its prior assigns positive probability to them (in other words, its prior conta…
Exploration Potential
Jan Leike
We introduce exploration potential, a quantity that measures how much a reinforcement learning agent has explored its environment class. In contrast to information gain, exploratio…
Indefinitely Oscillating Martingales
Jan Leike, Marcus Hutter
We construct a class of nonnegative martingale processes that oscillate indefinitely with high probability. For these processes, we state a uniform rate of the number of oscillatio…
Geometric Series as Nontermination Arguments for Linear Lasso Programs
Jan Leike, Matthias Heizmann
We present a new kind of nontermination argument for linear lasso programs, called geometric nontermination argument. A geometric nontermination argument is a finite representation…