profile-pic
profile-pic
UCL ELLIS
UCL, a global leader in AI and machine learning, is a core component of the ELLIS network through its ELLIS Unit. ELLIS is a European AI network of excellence comprising Units within 30 research institutions. It focuses on fundamental science, technical innovation and societal impact. The ELLIS Unit at UCL spans across multiple departments (Gatsby Computational Neuroscience Unit, Department of Computer Science, Department of Statistical Science and Department of Electronic and Electrical Engineering).

“Some of the most effective learning algorithms are those that combine perspectives from many different models or parameters. This has always seemed a fitting metaphor for effective research. And now ELLIS will provide a new architecture to keep our real-life committee machine functioning --- reinforcing, deepening and enlarging the channels that connect us to colleagues throughout Europe At UCL we're excited to be a part of this movement to grow together. We look forward to sharing new collaborations, workshops, exchanges, joint studentships and more, and to the insight and breakthroughs that will undoubtedly follow. ”

Prof Maneesh Sahani
Director, Gatsby Computational Neuroscience Unit

“Advances in AI that benefit people and planet require global cooperation across disciplines and sectors. The ELLIS network is a vital part of that effort and UCL is proud to be a contributor. ”

Prof Geraint Rees
UCL Pro-Vice-Provost (AI)

News


Events


Open-Ended Discovery via Setter-Solver Games

Speaker: Michael Dennis
Event Date: 14 January 2026

There is immense value in using RL for resettable virtual environments to improve tool-use, computer-use, Math, and Coding. Even in physical settings, the Genie models have paved a path for training within resettable virtual environments. This presents an opportunity for setter-solver algorithms, like those used in Unsupervised Environment Design (UED) to drive efficient learning, transfer, and to lead to open-ended discovery. In this talk, we address several challenges with generalising setter-solver auto-curricula past the symmetric 2-player zero-sum setting which drove AlphaGo. We present a setter-solver algorithm (PAIRED) fit for asymmetric settings where the setter may be able to create unsolvable tasks for the solver. We then discuss a refinement of this approach (ReMiDi) which performs better in the presence of trade-offs between tasks, ensuring that progress continues until there is no way to improve the policy on any task without decreasing it on some other task. Finally, we present an approach to generalise arbitrary setter-solver algorithms to general-sum games (Rational Policy Gradient) while preventing the setter from producing opponents which self-sabotage -- which go against their incentives in the underlying game -- thus ensuring the setter only produces rational opponents. Together, by generalizing setter-solver algorithms beyond narrow games, these methods lay the groundwork for setter solver algorithms to drive discovery in general open-ended environments.

People


Unit Directors

Computer Science

Gatsby Computational Neuroscience Unit

Department of Statistical Science

Department of Electronic and Electrical Engineering

Mathematics

UCL Energy Institute

Division of Psychology and Language Sciences