Laurent Orseau
Laurent Orseau
Research Scientist at Google DeepMind
Подтвержден адрес электронной почты в домене agroparistech.fr
Название
Процитировано
Процитировано
Год
Artificial general intelligence
B Goertzel
Springer, 2007
3852007
AI safety gridworlds
J Leike, M Martic, V Krakovna, PA Ortega, T Everitt, A Lefrancq, L Orseau, ...
arXiv preprint arXiv:1711.09883, 2017
1622017
Safely Interruptible Agents
L Orseau, S Armstrong
Uncertainty in Artificial Intelligence, 557–566, 2016
882016
Delusion, survival, and intelligent agents
M Ring, L Orseau
International Conference on Artificial General Intelligence, 11-20, 2011
752011
Reinforcement learning with a corrupted reward channel
T Everitt, V Krakovna, L Orseau, M Hutter, S Legg
arXiv preprint arXiv:1705.08417, 2017
552017
Self-modification and mortality in artificial agents
L Orseau, M Ring
International Conference on Artificial General Intelligence, 1-10, 2011
442011
Universal knowledge-seeking agents for stochastic environments
L Orseau, T Lattimore, M Hutter
International Conference on Algorithmic Learning Theory, 158-172, 2013
372013
Space-Time Embedded Intelligence
L Orseau, M Ring
Artificial General Intelligence, 209-218, 2012
372012
An investigation of model-free planning
A Guez, M Mirza, K Gregor, R Kabra, S Racanière, T Weber, D Raposo, ...
arXiv preprint arXiv:1901.03559, 2019
312019
Thompson sampling is asymptotically optimal in general environments
J Leike, T Lattimore, L Orseau, M Hutter
arXiv preprint arXiv:1602.07905, 2016
262016
Universal knowledge-seeking agents
L Orseau
Theoretical Computer Science 519, 127-139, 2014
242014
Optimality issues of universal greedy agents with static priors
L Orseau
International Conference on Algorithmic Learning Theory, 345-359, 2010
222010
Penalizing side effects using stepwise relative reachability
V Krakovna, L Orseau, R Kumar, M Martic, S Legg
arXiv preprint arXiv:1806.01186, 2018
162018
Measuring and avoiding side effects using relative reachability
V Krakovna, L Orseau, M Martic, S Legg
arXiv preprint arXiv:1806.01186, 2018
132018
Asymptotic non-learnability of universal agents with computable horizon functions
L Orseau
Theoretical Computer Science 473, 149-156, 2013
122013
Single-agent policy tree search with guarantees
L Orseau, L Lelis, T Lattimore, T Weber
Advances in Neural Information Processing Systems, 3201-3211, 2018
112018
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
82017
Teleporting universal intelligent agents
L Orseau
International Conference on Artificial General Intelligence, 109-120, 2014
82014
Memory Issues of Intelligent Agents
L Orseau, M Ring
Artificial General Intelligence, 219-231, 2012
62012
Short term memories and forcing the re-use of knowledge for generalization
L Orseau
International Conference on Artificial Neural Networks, 39-44, 2005
62005
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20