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

Jonas Degrave

dblp:143/0375 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
0since 2021 · last 2018
0000-0002-2738-6500ORCID · corroborated

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

Artificial intelligence and machine learning · 6 · 3 first-authorSystems, architecture and hardware · 1 · 1 first-author

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
2 papers
Reinforcement learning · 43% Probabilistic and Bayesian machine learning · 43% Deep learning architectures and training · 14%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
bayesian inference
0.312018
BRUNO: A Deep Recurrent Model for Exchangeable Data · NeurIPS 2018
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference › posterior inference
exact bayesian inference
0.312018
BRUNO: A Deep Recurrent Model for Exchangeable Data · NeurIPS 2018
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model › latent generative model
exchangeable variable model
0.312018
BRUNO: A Deep Recurrent Model for Exchangeable Data · NeurIPS 2018
Machine learning › Reinforcement learning
off-policy reinforcement learning
0.312018
Learning by Playing Solving Sparse Reward Tasks from Scratch · ICML 2018
Machine learning › Deep learning architectures and training
recurrent neural network
0.312018
BRUNO: A Deep Recurrent Model for Exchangeable Data · NeurIPS 2018
Machine learning › Reinforcement learning
sparse reward reinforcement learning
0.312018
Learning by Playing Solving Sparse Reward Tasks from Scratch · ICML 2018
Machine learning › Reinforcement learning › sparse reward reinforcement learning
sparse reward tasks
0.312018
Learning by Playing Solving Sparse Reward Tasks from Scratch · ICML 2018

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

permutation invariance · 0.3off-policy reinforcement learning · 0.3deep recurrent architecture · 0.3auxiliary task scheduling · 0.3
YearPublicationVenuePosition
2018 Learning by Playing Solving Sparse Reward Tasks from Scratch
abstract
We propose Scheduled Auxiliary Control (SAC-X), a new learning paradigm in the context of Reinforcement Learning (RL). SAC-X enables learning of complex behaviors - from scratch - in the presence of multiple sparse reward signals. To this end, the agent is equipped with a set of general auxiliary tasks, that it attempts to learn simultaneously via off-policy RL. The key idea behind our method is that active (learned) scheduling and execution of auxiliary policies allows the agent to efficiently explore its environment - enabling it to excel at sparse reward RL. Our experiments in several challenging robotic manipulation settings demonstrate the power of our approach.
Martin A. Riedmiller, Roland Hafner, Thomas Lampe, Michael Neunert, Jonas Degrave, Tom Van de Wiele, Volodymyr Mnih, Nicolas Heess, Jost Tobias Springenberg
ICML5
2018 BRUNO: A Deep Recurrent Model for Exchangeable Data
abstract
We present a novel model architecture which leverages deep learning tools to perform exact Bayesian inference on sets of high dimensional, complex observations. Our model is provably exchangeable, meaning that the joint distribution over observations is invariant under permutation: this property lies at the heart of Bayesian inference. The model does not require variational approximations to train, and new samples can be generated conditional on previous samples, with cost linear in the size of the conditioning set. The advantages of our architecture are demonstrated on learning tasks that require generalisation from short observed sequences while modelling sequence variability, such as conditional image generation, few-shot learning, and anomaly detection.
Iryna Korshunova, Jonas Degrave, Ferenc Huszar, Yarin Gal, Arthur Gretton, Joni Dambre
NeurIPS2
2018 Dual Rectified Linear Units (DReLUs): A replacement for tanh activation functions in Quasi-Recurrent Neural Networks
Fréderic Godin, Jonas Degrave, Joni Dambre, Wesley De Neve
Pattern Recognit. Lett.2
2016 Spatial Chirp-Z Transformer Networks
Jonas Degrave, Sander Dieleman, Joni Dambre, Francis Wyffels
ESANN1
2015 Developing an embodied gait on a compliant quadrupedal robot
abstract
Incorporating the body dynamics of compliant robots into their controller architectures can drastically reduce the complexity of locomotion control. An extreme version of this embodied control principle was demonstrated in highly compliant tensegrity robots, for which stable gait generation was achieved by using only optimized linear feedback from the robot's sensors to its actuators. The morphology of quadrupedal robots has previously been used for sensing and for control of a compliant spine, but never for gait generation. In this paper, we successfully apply embodied control to the compliant, quadrupedal Oncilla robot. As initial experiments indicated that mere linear feedback does not suffice, we explore the minimal requirements for robust gait generation in terms of memory and nonlinear complexity. Our results show that a memoryless feedback controller can generate a stable trot by learning the desired nonlinear relation between the input and the output signals. We believe this method can provide a very useful tool for transferring knowledge from open loop to closed loop control on compliant robots.
Jonas Degrave, Ken Caluwaerts, Joni Dambre, Francis Wyffels
IROS1
2013 Terrain Classification for a Quadruped Robot
abstract
Using data retrieved from the Puppy II robot at the University of Zurich (UZH), we show that machine learning techniques with non-linearities and fading memory are effective for terrain classification, both supervised and unsupervised, even with a limited selection of input sensors. The results indicate that most information for terrain classification is found in the combination of tactile sensors and proprioceptive joint angle sensors. The classification error is small enough to have a robot adapt the gait to the terrain and hence move more robustly.
Jonas Degrave, Robin Van Cauwenbergh, Francis Wyffels, Tim Waegeman, Benjamin Schrauwen
ICMLA (1)1