Working toward greater generalisability in artificial intelligence
Today, conference season is kicking off with The Tenth International Conference on Learning Representations (ICLR 2022), running virtually from 25-29 April, 2022. Participants from around the world are gathering to share their cutting-edge work in representational learning, from advancing the state of the art in artificial intelligence to data science, machine vision, robotics, and more.
On the first day of the conference, Pushmeet Kohli, our head of AI for Science and Robust and Verified AI teams, is delivering a talk on how AI can dramatically improve solutions to a wide range of scientific problems, from genomics and structural biology to quantum chemistry and even pure mathematics.
Beyond supporting the event as sponsors and regular workshop organisers, our research teams are presenting 29 papers, including 10 collaborations this year. Here’s a brief glimpse into our upcoming oral, spotlight, and poster presentations:
A number of key papers focus on the critical ways we’re making the learning process of our AI systems more efficient. This ranges from increasing performance, advancing few shot learning, and creating data efficient systems that reduce computational costs.
In “Bootstrapped meta-learning”, an ICLR 2022 Outstanding Paper Award winner, we propose an algorithm that enables an agent to learn how to learn by teaching itself. We also present a policy improvement algorithm that redesigns AlphaZero – our system that taught itself from scratch to master chess, shogi, and Go – to continue improving even when training with a small number of simulations; a regulariser that mitigates the risk of capacity loss in a broad range of RL agents and environments; and an improved architecture to efficiently train attentional models.
Curiosity is a key part of human learning, helping to advance knowledge and skill. Similarly, exploration mechanisms allow AI agents to go beyond preexisting knowledge and discover the unknown or try something new.
Advancing the question “When should agents explore?”, we investigate when agents should switch into exploration mode, at what timescales it makes sense to switch, and which signals best determine how long and frequent exploration periods should be. In another paper, we introduce an “information gain exploration bonus” that allows agents to break out of the limitations of intrinsic rewards in RL to be able to learn more skills.
To deploy ML models in the real world, they must be effective when shifting between training, testing, and across new datasets. Understanding the causal mechanisms is essential, allowing some systems to adapt, while others struggle to face new challenges.
Expanding the research into these mechanisms, we present an experimental framework that enables a fine-grained analysis of robustness to distribution shifts. Robustness also helps protect against adversarial harms, whether unintended or targeted. In the case of image corruptions, we propose a technique that theoretically optimises the parameters of image-to-image models to decrease the effects of blurring, fog, and other common issues.
In addition to helping ML researchers understand how agents evolve their own communication to complete tasks, AI agents have the potential to reveal insights into linguistic behaviours within populations, which could lead to more interactive and useful AI.
Working with researchers at Inria, Google Research, and Meta AI, we connect the role of diversity within human populations on shaping language to partially solve an apparent contradiction in computer simulations with neural agents. Then, because building better representations of language in AI is so vital to understanding emergent communication, we also investigate the importance of scaling up the dataset, task complexity, and population size as independent aspects. Moreover, we also studied the tradeoffs of expressivity, complexity, and unpredictability in games where multiple agents communicate to achieve a single goal.
See the full range of our work at ICLR 2022 here.