Follow
Laurent Orseau
Laurent Orseau
Research Scientist at Google DeepMind
Verified email at google.com
Title
Cited by
Cited by
Year
AI safety gridworlds
J Leike, M Martic, V Krakovna, PA Ortega, T Everitt, A Lefrancq, L Orseau, ...
arXiv preprint arXiv:1711.09883, 2017
2482017
Safely Interruptible Agents
L Orseau, S Armstrong
Uncertainty in Artificial Intelligence, 557–566, 2016
1132016
Reinforcement learning with a corrupted reward channel
T Everitt, V Krakovna, L Orseau, M Hutter, S Legg
arXiv preprint arXiv:1705.08417, 2017
842017
Delusion, survival, and intelligent agents
M Ring, L Orseau
International Conference on Artificial General Intelligence, 11-20, 2011
812011
An investigation of model-free planning
A Guez, M Mirza, K Gregor, R Kabra, S Racanière, T Weber, D Raposo, ...
International Conference on Machine Learning, 2464-2473, 2019
632019
Universal knowledge-seeking agents for stochastic environments
L Orseau, T Lattimore, M Hutter
International conference on algorithmic learning theory, 158-172, 2013
452013
Space-Time Embedded Intelligence
L Orseau, M Ring
Artificial General Intelligence, 209-218, 2012
432012
Self-modification and mortality in artificial agents
L Orseau, M Ring
International Conference on Artificial General Intelligence, 1-10, 2011
412011
Logarithmic pruning is all you need
L Orseau, M Hutter, O Rivasplata
Advances in Neural Information Processing Systems 33, 2925-2934, 2020
392020
Penalizing side effects using stepwise relative reachability
V Krakovna, L Orseau, R Kumar, M Martic, S Legg
arXiv preprint arXiv:1806.01186, 2018
382018
Thompson sampling is asymptotically optimal in general environments
J Leike, T Lattimore, L Orseau, M Hutter
arXiv preprint arXiv:1602.07905, 2016
352016
Artificial general intelligence
B Goertzel, L Orseau, J Snaider
Scholarpedia 10 (11), 31847, 2015
262015
Universal knowledge-seeking agents
L Orseau
Theoretical Computer Science 519, 127-139, 2014
252014
Single-agent policy tree search with guarantees
L Orseau, L Lelis, T Lattimore, T Weber
Advances in Neural Information Processing Systems 31, 2018
242018
Optimality issues of universal greedy agents with static priors
L Orseau
International Conference on Algorithmic Learning Theory, 345-359, 2010
232010
Avoiding side effects by considering future tasks
V Krakovna, L Orseau, R Ngo, M Martic, S Legg
Advances in Neural Information Processing Systems 33, 19064-19074, 2020
212020
Learning to prove from synthetic theorems
E Aygün, Z Ahmed, A Anand, V Firoiu, X Glorot, L Orseau, D Precup, ...
arXiv preprint arXiv:2006.11259, 2020
162020
Soft-bayes: Prod for mixtures of experts with log-loss
L Orseau, T Lattimore, S Legg
International Conference on Algorithmic Learning Theory, 372-399, 2017
152017
Pitfalls of learning a reward function online
S Armstrong, J Leike, L Orseau, S Legg
arXiv preprint arXiv:2004.13654, 2020
142020
Measuring and avoiding side effects using relative reachability
V Krakovna, L Orseau, M Martic, S Legg
arXiv preprint arXiv:1806.01186, 2018
142018
The system can't perform the operation now. Try again later.
Articles 1–20