activity
20162023
most citedAn Algorithmic Perspective on Imitation Learning

382 citations · 801 across the 48 of their papers we have counts for

collaborators
Showing cs.LGShow all

21 papers · 1 filter

cs.LG2023

MP3: Movement Primitive-Based (Re-)Planning Policy

Fabian Otto, Hongyi Zhou, Onur Celik +3

We introduce a novel deep reinforcement learning (RL) approach called Movement Primitive-based Planning Policy (MP3). By integrating movement primitives (MPs) into the deep RL fram…

cs.LG2023★ 2 cited

Beyond Deep Ensembles: A Large-Scale Evaluation of Bayesian Deep Learning under Distribution Shift

Florian Seligmann, Philipp Becker, Michael Volpp +1

Bayesian deep learning (BDL) is a promising approach to achieve well-calibrated predictions on distribution-shifted data. Nevertheless, there exists no large-scale survey that eval…

cs.LG2023★ 1 cited

Curriculum-Based Imitation of Versatile Skills

Maximilian Xiling Li, Onur Celik, Philipp Becker +3

Learning skills by imitation is a promising concept for the intuitive teaching of robots. A common way to learn such skills is to learn a parametric model by maximizing the likelih…

cs.LG2023★ 1 cited

Grounding Graph Network Simulators using Physical Sensor Observations

Jonas Linkerhägner, Niklas Freymuth, Paul Maria Scheikl +2

Physical simulations that accurately model reality are crucial for many engineering disciplines such as mechanical engineering and robotic motion planning. In recent years, learned…

cs.LG2023

Combining Reconstruction and Contrastive Methods for Multimodal Representations in RL

Philipp Becker, Sebastian Mossburger, Fabian Otto +1

Learning self-supervised representations using reconstruction or contrastive losses improves performance and sample complexity of image-based and multimodal reinforcement learning…

cs.LG2022★ 5 cited

Deep Black-Box Reinforcement Learning with Movement Primitives

Fabian Otto, Onur Celik, Hongyi Zhou +3

\Episode-based reinforcement learning (ERL) algorithms treat reinforcement learning (RL) as a black-box optimization problem where we learn to select a parameter vector of a contro…

cs.LG2022★ 3 cited

On Uncertainty in Deep State Space Models for Model-Based Reinforcement Learning

Philipp Becker, Gerhard Neumann

Improved state space models, such as Recurrent State Space Models (RSSMs), are a key factor behind recent advances in model-based reinforcement learning (RL). Yet, despite their em…

cs.LG2022★ 1 cited

A Unified Perspective on Natural Gradient Variational Inference with Gaussian Mixture Models

Oleg Arenz, Philipp Dahlinger, Zihan Ye +2

Variational inference with Gaussian mixture models (GMMs) enables learning of highly tractable yet multi-modal approximations of intractable target distributions with up to a few h…

cs.LG2022

Robot Policy Learning from Demonstration Using Advantage Weighting and Early Termination

Abdalkarim Mohtasib, Gerhard Neumann, Heriberto Cuayahuitl

Learning robotic tasks in the real world is still highly challenging and effective practical solutions remain to be found. Traditional methods used in this area are imitation learn…

cs.LG2022★ 1 cited

Hidden Parameter Recurrent State Space Models For Changing Dynamics Scenarios

Vaisakh Shaj, Dieter Buchler, Rohit Sonker +2

Recurrent State-space models (RSSMs) are highly expressive models for learning patterns in time series data and system identification. However, these models assume that the dynamic…

cs.LG2022★ 3 cited

Specializing Versatile Skill Libraries using Local Mixture of Experts

Onur Celik, Dongzhuoran Zhou, Ge Li +2

A long-cherished vision in robotics is to equip robots with skills that match the versatility and precision of humans. For example, when playing table tennis, a robot should be cap…

cs.LG2021

Switching Recurrent Kalman Networks

Giao Nguyen-Quynh, Philipp Becker, Chen Qiu +2

Forecasting driving behavior or other sensor measurements is an essential component of autonomous driving systems. Often real-world multivariate time series data is hard to model b…

cs.LG2021

Versatile Inverse Reinforcement Learning via Cumulative Rewards

Niklas Freymuth, Philipp Becker, Gerhard Neumann

Inverse Reinforcement Learning infers a reward function from expert demonstrations, aiming to encode the behavior and intentions of the expert. Current approaches usually do this w…

cs.LG2021★ 6 cited

Differentiable Trust Region Layers for Deep Reinforcement Learning

Fabian Otto, Philipp Becker, Ngo Anh Vien +2

Trust region methods are a popular tool in reinforcement learning as they yield robust policy updates in continuous and discrete action spaces. However, enforcing such trust region…

cs.LG2020★ 6 cited

Non-Adversarial Imitation Learning and its Connections to Adversarial Methods

Oleg Arenz, Gerhard Neumann

Many modern methods for imitation learning and inverse reinforcement learning, such as GAIL or AIRL, are based on an adversarial formulation. These methods apply GANs to match the…

cs.LG2020★ 6 cited

Expected Information Maximization: Using the I-Projection for Mixture Density Estimation

Philipp Becker, Oleg Arenz, Gerhard Neumann

Modelling highly multi-modal data is a challenging problem in machine learning. Most algorithms are based on maximizing the likelihood, which corresponds to the M(oment)-projection…

cs.LG2019★ 4 cited

Trust-Region Variational Inference with Gaussian Mixture Models

Oleg Arenz, Mingjun Zhong, Gerhard Neumann

Many methods for machine learning rely on approximate inference from intractable probability distributions. Variational inference approximates such distributions by tractable model…

cs.LG2019★ 29 cited

Recurrent Kalman Networks: Factorized Inference in High-Dimensional Deep Feature Spaces

Philipp Becker, Harit Pandya, Gregor Gebhardt +3

In order to integrate uncertainty estimates into deep time-series modelling, Kalman Filters (KFs) (Kalman et al., 1960) have been integrated with deep learning models, however, suc…

cs.LG2019

Compatible Natural Gradient Policy Search

Joni Pajarinen, Hong Linh Thai, Riad Akrour +2

Trust-region methods have yielded state-of-the-art results in policy search. A common approach is to use KL-divergence to bound the region of trust resulting in a natural gradient…

cs.LG2018

Adaptation and Robust Learning of Probabilistic Movement Primitives

Sebastian Gomez-Gonzalez, Gerhard Neumann, Bernhard Schölkopf +1

Probabilistic representations of movement primitives open important new possibilities for machine learning in robotics. These representations are able to capture the variability of…

cs.LG2016★ 18 cited

Model-Free Trajectory-based Policy Optimization with Monotonic Improvement

Riad Akrour, Abbas Abdolmaleki, Hany Abdulsamad +2

Many of the recent trajectory optimization algorithms alternate between linear approximation of the system dynamics around the mean trajectory and conservative policy update. One w…