| Artificial general intelligence B Goertzel Springer, 2007 | 400 | 2007 |
| AI safety gridworlds J Leike, M Martic, V Krakovna, PA Ortega, T Everitt, A Lefrancq, L Orseau, ... arXiv preprint arXiv:1711.09883, 2017 | 166 | 2017 |
| Safely Interruptible Agents L Orseau, S Armstrong Uncertainty in Artificial Intelligence, 557–566, 2016 | 85 | 2016 |
| Delusion, survival, and intelligent agents M Ring, L Orseau International Conference on Artificial General Intelligence, 11-20, 2011 | 72 | 2011 |
| Reinforcement learning with a corrupted reward channel T Everitt, V Krakovna, L Orseau, M Hutter, S Legg arXiv preprint arXiv:1705.08417, 2017 | 56 | 2017 |
| Self-modification and mortality in artificial agents L Orseau, M Ring International Conference on Artificial General Intelligence, 1-10, 2011 | 41 | 2011 |
| Space-Time Embedded Intelligence L Orseau, M Ring Artificial General Intelligence, 209-218, 2012 | 39 | 2012 |
| Universal knowledge-seeking agents for stochastic environments L Orseau, T Lattimore, M Hutter International Conference on Algorithmic Learning Theory, 158-172, 2013 | 37 | 2013 |
| 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 | 33 | 2019 |
| Thompson sampling is asymptotically optimal in general environments J Leike, T Lattimore, L Orseau, M Hutter arXiv preprint arXiv:1602.07905, 2016 | 26 | 2016 |
| Optimality issues of universal greedy agents with static priors L Orseau International Conference on Algorithmic Learning Theory, 345-359, 2010 | 22 | 2010 |
| Universal knowledge-seeking agents L Orseau Theoretical Computer Science 519, 127-139, 2014 | 21 | 2014 |
| Penalizing side effects using stepwise relative reachability V Krakovna, L Orseau, R Kumar, M Martic, S Legg arXiv preprint arXiv:1806.01186, 2018 | 19 | 2018 |
| Measuring and avoiding side effects using relative reachability V Krakovna, L Orseau, M Martic, S Legg arXiv preprint arXiv:1806.01186, 2018 | 14 | 2018 |
| Single-agent policy tree search with guarantees L Orseau, LHS Lelis, T Lattimore, T Weber arXiv preprint arXiv:1811.10928, 2018 | 13 | 2018 |
| Asymptotic non-learnability of universal agents with computable horizon functions L Orseau Theoretical Computer Science 473, 149-156, 2013 | 12 | 2013 |
| 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 | 8 | 2017 |
| Teleporting universal intelligent agents L Orseau International Conference on Artificial General Intelligence, 109-120, 2014 | 8 | 2014 |
| Iterative budgeted exponential search M Helmert, T Lattimore, LHS Lelis, L Orseau, NR Sturtevant arXiv preprint arXiv:1907.13062, 2019 | 6 | 2019 |
| Memory Issues of Intelligent Agents L Orseau, M Ring Artificial General Intelligence, 219-231, 2012 | 6 | 2012 |
Victoria (Viktoriya) KrakovnaSenior Research Scientist at DeepMindEmail verificata su google.com
