Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hubert Soyer

dblp:131/6291 · DBLP profile ↗
← Back
8ranked-venue papers
1as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 8 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
5 papers
Reinforcement learning · 84% Robot manipulation · 9% Robot navigation and mapping · 6%

Topics — the 14 heaviest of 14, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
exploration
0.412020
Making Efficient Use of Demonstrations to Solve Hard Exploration Problems · ICLR 2020
Machine learning › Reinforcement learning › exploration › exploration in markov decision processes
hard exploration
0.412020
Making Efficient Use of Demonstrations to Solve Hard Exploration Problems · ICLR 2020
Robotics › Robot manipulation
learning from demonstration
0.412020
Making Efficient Use of Demonstrations to Solve Hard Exploration Problems · ICLR 2020
Machine learning › Reinforcement learning › policy optimization
maximum a posteriori policy optimization
0.412020
V-MPO: On-Policy Maximum a Posteriori Policy Optimization for Discrete and Continuous Control · ICLR 2020
Machine learning › Reinforcement learning › policy optimization
on-policy optimization
0.412020
V-MPO: On-Policy Maximum a Posteriori Policy Optimization for Discrete and Continuous Control · ICLR 2020
Machine learning › Reinforcement learning
policy optimization
0.412020
V-MPO: On-Policy Maximum a Posteriori Policy Optimization for Discrete and Continuous Control · ICLR 2020
Machine learning › Reinforcement learning
deep reinforcement learning
0.412019
Multi-Task Deep Reinforcement Learning with PopArt · AAAI 2019
Machine learning › Reinforcement learning
multi-task reinforcement learning
0.412019
Multi-Task Deep Reinforcement Learning with PopArt · AAAI 2019
Machine learning › Reinforcement learning
value-based reinforcement learning
0.412019
Multi-Task Deep Reinforcement Learning with PopArt · AAAI 2019
Machine learning › Reinforcement learning › large-scale reinforcement learning › distributed reinforcement learning
actor-learner architecture
0.312018
IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architectures · ICML 2018
Machine learning › Reinforcement learning › large-scale reinforcement learning
distributed reinforcement learning
0.312018
IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architectures · ICML 2018
Robotics › Robot navigation and mapping
learning-based navigation
0.312017
Learning to Navigate in Complex Environments · ICLR (Poster) 2017
Machine learning › Reinforcement learning › reinforcement learning for control
navigation policy learning
0.312017
Learning to Navigate in Complex Environments · ICLR (Poster) 2017
Machine learning › Efficient and distributed learning
distributed training
0.112018
IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architectures · ICML 2018

Methods — techniques the papers use, named apart from their topics

trust region optimization · 0.4expectation-maximization · 0.4demonstration-based learning · 0.4popart · 0.4adaptive reward scaling · 0.4v-trace · 0.3off-policy correction · 0.3importance weighting · 0.3deep reinforcement learning · 0.3
YearPublicationVenuePosition
2020 Making Efficient Use of Demonstrations to Solve Hard Exploration Problems
Caglar Gulcehre, Tom Le Paine, Bobak Shahriari, Misha Denil, Matt Hoffman 0001, Hubert Soyer, Richard Tanburn, Steven Kapturowski, Neil C. Rabinowitz, Duncan Williams, Gabriel Barth-Maron, Ziyu Wang 0001, Nando de Freitas
ICLR6
2020 V-MPO: On-Policy Maximum a Posteriori Policy Optimization for Discrete and Continuous Control
H. Francis Song, Abbas Abdolmaleki, Jost Tobias Springenberg, Aidan Clark, Hubert Soyer, Jack W. Rae, Seb Noury, Arun Ahuja, Siqi Liu 0002, Dhruva Tirumala, Nicolas Heess, Daniel Belov, Martin A. Riedmiller, Matt M. Botvinick
ICLR5
2019 Multi-Task Deep Reinforcement Learning with PopArt
abstract
The reinforcement learning (RL) community has made great strides in designing algorithms capable of exceeding human performance on specific tasks. These algorithms are mostly trained one task at the time, each new task requiring to train a brand new agent instance. This means the learning algorithm is general, but each solution is not; each agent can only solve the one task it was trained on. In this work, we study the problem of learning to master not one but multiple sequentialdecision tasks at once. A general issue in multi-task learning is that a balance must be found between the needs of multiple tasks competing for the limited resources of a single learning system. Many learning algorithms can get distracted by certain tasks in the set of tasks to solve. Such tasks appear more salient to the learning process, for instance because of the density or magnitude of the in-task rewards. This causes the algorithm to focus on those salient tasks at the expense of generality. We propose to automatically adapt the contribution of each task to the agent’s updates, so that all tasks have a similar impact on the learning dynamics. This resulted in state of the art performance on learning to play all games in a set of 57 diverse Atari games. Excitingly, our method learned a single trained policy - with a single set of weights - that exceeds median human performance. To our knowledge, this was the first time a single agent surpassed human-level performance on this multi-task domain. The same approach also demonstrated state of the art performance on a set of 30 tasks in the 3D reinforcement learning platform DeepMind Lab.
Matteo Hessel, Hubert Soyer, Lasse Espeholt, Wojciech Czarnecki 0001, Simon Schmitt, Hado van Hasselt
AAAI2
2018 IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architectures
abstract
In this work we aim to solve a large collection of tasks using a single reinforcement learning agent with a single set of parameters. A key challenge is to handle the increased amount of data and extended training time. We have developed a new distributed agent IMPALA (Importance Weighted Actor-Learner Architecture) that not only uses resources more efficiently in single-machine training but also scales to thousands of machines without sacrificing data efficiency or resource utilisation. We achieve stable learning at high throughput by combining decoupled acting and learning with a novel off-policy correction method called V-trace. We demonstrate the effectiveness of IMPALA for multi-task reinforcement learning on DMLab-30 (a set of 30 tasks from the DeepMind Lab environment (Beattie et al., 2016)) and Atari57 (all available Atari games in Arcade Learning Environment (Bellemare et al., 2013a)). Our results show that IMPALA is able to achieve better performance than previous agents with less data, and crucially exhibits positive transfer between tasks as a result of its multi-task approach.
Lasse Espeholt, Hubert Soyer, Rémi Munos, Karen Simonyan, Volodymyr Mnih, Tom Ward, Yotam Doron, Vlad Firoiu, Tim Harley, Iain Dunning, Shane Legg, Koray Kavukcuoglu
ICML2
2017 Learning to reinforcement learn
Jane X. Wang, Zeb Kurth-Nelson, Hubert Soyer, Joel Z. Leibo, Dhruva Tirumala, Rémi Munos, Charles Blundell, Dharshan Kumaran, Matt M. Botvinick
CogSci3
2017 Learning to Navigate in Complex Environments
Piotr Mirowski, Razvan Pascanu, Fabio Viola, Hubert Soyer, Andrew J. Ballard, Andrea Banino, Misha Denil, Ross Goroshin, Laurent Sifre, Koray Kavukcuoglu, Dharshan Kumaran, Raia Hadsell
ICLR (Poster)4
2015 CroVeWA: Crosslingual Vector-Based Writing Assistance
abstract
We present an interactive web-based writing assistance system that is based on recent advances in crosslingual compositional distributed semantics. Given queries in Japanese or English, our system can retrieve semantically related sentences from high quality English corpora. By employing crosslingually constrained vector space models to represent phrases, our system naturally sidesteps several difficulties that would arise from direct word-to-text matching, and is able to provide novel functionality like the visualization of semantic relationships between phrases interlingually and intralingually.
Hubert Soyer, Goran Topic, Pontus Stenetorp, Akiko Aizawa
HLT-NAACL1
2014 Image Super-Resolution with Fast Approximate Convolutional Sparse Coding
Christian Osendorfer, Hubert Soyer, Patrick van der Smagt
ICONIP (3)2