Laurent Orseau
Laurent Orseau
Research Scientist at Google DeepMind
Нет подтвержденного адреса электронной почты
Название
Процитировано
Процитировано
Год
AI safety gridworlds
J Leike, M Martic, V Krakovna, PA Ortega, T Everitt, A Lefrancq, L Orseau, ...
arXiv preprint arXiv:1711.09883, 2017
2002017
Safely Interruptible Agents
L Orseau, S Armstrong
Uncertainty in Artificial Intelligence, 557–566, 2016
992016
Delusion, survival, and intelligent agents
M Ring, L Orseau
International Conference on Artificial General Intelligence, 11-20, 2011
762011
Reinforcement learning with a corrupted reward channel
T Everitt, V Krakovna, L Orseau, M Hutter, S Legg
arXiv preprint arXiv:1705.08417, 2017
652017
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
512019
Universal knowledge-seeking agents for stochastic environments
L Orseau, T Lattimore, M Hutter
International conference on algorithmic learning theory, 158-172, 2013
422013
Space-Time Embedded Intelligence
L Orseau, M Ring
Artificial General Intelligence, 209-218, 2012
422012
Self-modification and mortality in artificial agents
L Orseau, M Ring
International Conference on Artificial General Intelligence, 1-10, 2011
402011
Thompson sampling is asymptotically optimal in general environments
J Leike, T Lattimore, L Orseau, M Hutter
arXiv preprint arXiv:1602.07905, 2016
322016
Artificial General Intelligence
J Schmidhuber, KR Thorisson, M Looks
Proceedings, 2011
262011
Penalizing side effects using stepwise relative reachability
V Krakovna, L Orseau, R Kumar, M Martic, S Legg
arXiv preprint arXiv:1806.01186, 2018
252018
Universal knowledge-seeking agents
L Orseau
Theoretical Computer Science 519, 127-139, 2014
232014
Optimality issues of universal greedy agents with static priors
L Orseau
International Conference on Algorithmic Learning Theory, 345-359, 2010
232010
Single-agent policy tree search with guarantees
L Orseau, LHS Lelis, T Lattimore, T Weber
arXiv preprint arXiv:1811.10928, 2018
192018
Measuring and avoiding side effects using relative reachability
V Krakovna, L Orseau, M Martic, S Legg
arXiv preprint arXiv:1806.01186, 2018
142018
Asymptotic non-learnability of universal agents with computable horizon functions
L Orseau
Theoretical Computer Science 473, 149-156, 2013
122013
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
102017
Logarithmic pruning is all you need
L Orseau, M Hutter, O Rivasplata
Advances in Neural Information Processing Systems 33, 2020
92020
Iterative budgeted exponential search
M Helmert, T Lattimore, LHS Lelis, L Orseau, NR Sturtevant
arXiv preprint arXiv:1907.13062, 2019
92019
Teleporting universal intelligent agents
L Orseau
International Conference on Artificial General Intelligence, 109-120, 2014
82014
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20