Short Term Memories and Forcing the Re-use of Knowledge for Generalization. - Laurent Orseau (ICANN (2), 2005)

Learning to Count by Think Aloud Imitation. - Laurent Orseau (IJCAI, 2007)

Imitation algorithmique: apprentissage incrémental en-ligne de séquences. (Algorithmic imitation: online incremental leaning of sequences). - Laurent Orseau (2007)

Optimality Issues of Universal Greedy Agents with Static Priors. - Laurent Orseau (ALT, 2010)

Self-Modification and Mortality in Artificial Agents. - Laurent Orseau; Mark B. Ring (AGI, 2011)

Delusion, Survival, and Intelligent Agents. - Mark B. Ring; Laurent Orseau (AGI, 2011)

Space-Time Embedded Intelligence. - Laurent Orseau; Mark B. Ring (AGI, 2012)

Memory Issues of Intelligent Agents. - Laurent Orseau; Mark B. Ring (AGI, 2012)

Universal Knowledge-Seeking Agents for Stochastic Environments. - Laurent Orseau; Tor Lattimore; Marcus Hutter (ALT, 2013)

Reinforcement Learning (Dagstuhl Seminar 13321). - Peter Auer; Marcus Hutter; Laurent Orseau (Dagstuhl Reports, 2013)

Asymptotic non-learnability of universal agents with computable horizon functions. - Laurent Orseau (Theor. Comput. Sci., 2013)

The Multi-slot Framework: A Formal Model for Multiple, Copiable AIs. - Laurent Orseau (AGI, 2014)

Teleporting Universal Intelligent Agents. - Laurent Orseau (AGI, 2014)

Universal knowledge-seeking agents. - Laurent Orseau (Theor. Comput. Sci., 2014)

Online Learning of k-CNF Boolean Functions. - Joel Veness; Marcus Hutter; Laurent Orseau; Marc G. Bellemare (IJCAI, 2015)

Thompson Sampling is Asymptotically Optimal in General Environments. - Jan Leike; Tor Lattimore; Laurent Orseau; Marcus Hutter (UAI, 2016)

Safely Interruptible Agents. - Laurent Orseau; Stuart Armstrong (UAI, 2016)

Soft-Bayes: Prod for Mixtures of Experts with Log-Loss. - Laurent Orseau; Tor Lattimore; Shane Legg (ALT, 2017)

Reinforcement Learning with a Corrupted Reward Channel. - Tom Everitt; Victoria Krakovna; Laurent Orseau; Shane Legg (IJCAI, 2017)

On Thompson Sampling and Asymptotic Optimality. - Jan Leike; Tor Lattimore; Laurent Orseau; Marcus Hutter (IJCAI, 2017)

Reinforcement Learning with a Corrupted Reward Channel. - Tom Everitt; Victoria Krakovna; Laurent Orseau; Marcus Hutter; Shane Legg (CoRR, 2017)

AI Safety Gridworlds. - Jan Leike; Miljan Martic; Victoria Krakovna; Pedro A. Ortega; Tom Everitt; Andrew Lefrancq; Laurent Orseau; Shane Legg (CoRR, 2017)

Single-Agent Policy Tree Search With Guarantees. - Laurent Orseau; Levi Lelis; Tor Lattimore; Theophane Weber (NeurIPS, 2018)

Agents and Devices: A Relative Definition of Agency. - Laurent Orseau; Simon McGregor McGill; Shane Legg (CoRR, 2018)

Measuring and avoiding side effects using relative reachability. - Victoria Krakovna; Laurent Orseau; Miljan Martic; Shane Legg (CoRR, 2018)

An Investigation of Model-Free Planning. - Arthur Guez; Mehdi Mirza; Karol Gregor; Rishabh Kabra; Sébastien Racanière; Theophane Weber; David Raposo; Adam Santoro; Laurent Orseau; Tom Eccles; Greg Wayne; David Silver; et al. (ICML, 2019)

Iterative Budgeted Exponential Search. - Malte Helmert; Tor Lattimore; Levi H. S. Lelis; Laurent Orseau; Nathan R. Sturtevant (IJCAI, 2019)

Penalizing Side Effects using Stepwise Relative Reachability. - Victoria Krakovna; Laurent Orseau; Miljan Martic; Shane Legg (AISafety@IJCAI, 2019)

Zooming Cautiously: Linear-Memory Heuristic Search With Node Expansion Guarantees. - Laurent Orseau; Levi H. S. Lelis; Tor Lattimore (CoRR, 2019)

Pitfalls of Learning a Reward Function Online. - Stuart Armstrong; Jan Leike; Laurent Orseau; Shane Legg (IJCAI, 2020)

Avoiding Side Effects By Considering Future Tasks. - Victoria Krakovna; Laurent Orseau; Richard Ngo; Miljan Martic; Shane Legg (NeurIPS, 2020)

Logarithmic Pruning is All You Need. - Laurent Orseau; Marcus Hutter; Omar Rivasplata (NeurIPS, 2020)

Learning to Prove from Synthetic Theorems. - Eser Aygün; Zafarali Ahmed; Ankit Anand; Vlad Firoiu; Xavier Glorot; Laurent Orseau; Doina Precup; Shibl Mourad (CoRR, 2020)

Policy-Guided Heuristic Search with Guarantees. - Laurent Orseau; Levi H. S. Lelis (AAAI, 2021)

Training a First-Order Theorem Prover from Synthetic Data. - Vlad Firoiu; Eser Aygün; Ankit Anand; Zafarali Ahmed; Xavier Glorot; Laurent Orseau; Lei M. Zhang; Doina Precup; Shibl Mourad (CoRR, 2021)

Proving Theorems using Incremental Learning and Hindsight Experience Replay. - Eser Aygün; Laurent Orseau; Ankit Anand; Xavier Glorot; Vlad Firoiu; Lei M. Zhang; Doina Precup; Shibl Mourad (CoRR, 2021)

Isotuning With Applications To Scale-Free Online Learning. - Laurent Orseau; Marcus Hutter (CoRR, 2021)

Proving Theorems using Incremental Learning and Hindsight Experience Replay. - Eser Aygün; Ankit Anand; Laurent Orseau; Xavier Glorot; Stephen Marcus McAleer; Vlad Firoiu; Lei M. Zhang; Doina Precup; Shibl Mourad (ICML, 2022)

Memory-Based Meta-Learning on Non-Stationary Distributions. - Tim Genewein; Grégoire Delétang; Anian Ruoss; Li Kevin Wenliang; Elliot Catt; Vincent Dutordoir; Jordi Grau-Moya; Laurent Orseau; Marcus Hutter; Joel Veness (ICML, 2023)

Levin Tree Search with Context Models. - Laurent Orseau; Marcus Hutter; Levi H. S. Lelis (IJCAI, 2023)

Line Search for Convex Minimization. - Laurent Orseau; Marcus Hutter (CoRR, 2023)

Language Modeling Is Compression. - Grégoire Delétang; Anian Ruoss; Paul-Ambroise Duquenne; Elliot Catt; Tim Genewein; Christopher Mattern; Jordi Grau-Moya; Li Kevin Wenliang; Matthew Aitchison; Laurent Orseau; Marcus Hutter; Joel Veness (ICLR, 2024)

Learning Universal Predictors. - Jordi Grau-Moya; Tim Genewein; Marcus Hutter; Laurent Orseau; Grégoire Delétang; Elliot Catt; Anian Ruoss; Li Kevin Wenliang; Christopher Mattern; Matthew Aitchison; Joel Veness (ICML, 2024)

Finding Increasingly Large Extremal Graphs with AlphaZero and Tabu Search. - Abbas Mehrabian; Ankit Anand; Hyunjik Kim; Nicolas Sonnerat; Matej Balog; Gheorghe Comanici; Tudor Berariu; Andrew Lee; Anian Ruoss; Anna Bulanova; Daniel Toyama; Sam Blackwell; et al. (IJCAI, 2024)

Super-Exponential Regret for UCT, AlphaGo and Variants. - Laurent Orseau; Rémi Munos (CoRR, 2024)

Exponential Speedups by Rerooting Levin Tree Search. - Laurent Orseau; Marcus Hutter; Levi H. S. Lelis (CoRR, 2024)

Understanding Prompt Tuning and In-Context Learning via Meta-Learning. - Tim Genewein; Li Kevin Wenliang; Jordi Grau-Moya; Anian Ruoss; Laurent Orseau; Marcus Hutter (CoRR, 2025)