← Search

Christian Daniel

10 accepted papers

2023

Accurate Bayesian Meta-Learning by Accurate Task Posterior Inference

ICLR 2023poster

Bayesian meta-learning (BML) enables fitting expressive generative models to small datasets by incorporating inductive priors learned from a set of related tasks. The Neural Process (NP) is a prominent deep neural network-based BML architecture, which has shown remarkable results in recent years. In…

Cited by 4SourcePDFScholar
2021

Bayesian Context Aggregation for Neural Processes

ICLR 2021poster

Formulating scalable probabilistic regression models with reliable uncertainty estimates has been a long-standing challenge in machine learning research. Recently, casting probabilistic regression as a multi-task learning problem in terms of conditional latent variable (CLV) models such as the Neur…

Cited by 38SourcePDFScholar
2020

Differentiable Likelihoods for Fast Inversion of ’Likelihood-Free’ Dynamical Systems

ICML 2020poster

Likelihood-free (a.k.a. simulation-based) inference problems are inverse problems with expensive, or intractable, forward models. ODE inverse problems are commonly treated as likelihood-free, as their forward map has to be numerically approximated by an ODE solver. This, however, is not a fundamenta…

Cited by 26SourcePDFScholar
2020

Meta-Learning Acquisition Functions for Transfer Learning in Bayesian Optimization

ICLR 2020spotlight

Transferring knowledge across tasks to improve data-efficiency is one of the open key challenges in the field of global black-box optimization. Readily available algorithms are typically designed to be universal optimizers and, therefore, often suboptimal for specific tasks. We propose a novel trans…

Cited by 100SourceScholar
2020

Noisy-Input Entropy Search for Efficient Robust Bayesian Optimization

AISTATS 2020poster

We consider the problem of robust optimization within the well-established Bayesian Optimization (BO) framework.While BO is intrinsically robust to noisy evaluations of the objective function, standard approaches do not consider the case of uncertainty about the input parameters.In this paper, we pr…

2019

Trajectory-Based Off-Policy Deep Reinforcement Learning

ICML 2019oral

Policy gradient methods are powerful reinforcement learning algorithms and have been demonstrated to solve many complex tasks. However, these methods are also data-inefficient, afflicted with high variance gradient estimates, and frequently get stuck in local optima. This work addresses these weakne…

2018

Probabilistic Recurrent State-Space Models

ICML 2018oral

State-space models (SSMs) are a highly expressive model class for learning patterns in time series data and for system identification. Deterministic versions of SSMs (e.g., LSTMs) proved extremely successful in modeling complex time series data. Fully probabilistic SSMs, however, are often found har…

2017

Optimizing Long-term Predictions for Model-based Policy Search

CoRL 2017

We propose a novel long-term optimization criterion to improve the robustness of model-based reinforcement learning in real-world scenarios. Learning a dynamics model to derive a solution promises much greater data-efficiency and reusability compared to model-free alternatives. In practice, however,

2015

Reinforcement learning vs human programming in tetherball robot games

IROS 2015poster

Reinforcement learning of motor skills is an important challenge in order to endow robots with the ability to learn a wide range of skills and solve complex tasks. However, comparing reinforcement learning against human programming is not straightforward. In this paper, we create a motor learning fr…

Cited by 20SourceScholar
2015

Towards learning hierarchical skills for multi-phase manipulation tasks

ICRA 2015poster

Most manipulation tasks can be decomposed into a sequence of phases, where the robot's actions have different effects in each phase. The robot can perform actions to transition between phases and, thus, alter the effects of its actions, e.g. grasp an object in order to then lift it. The robot can th…

Cited by 163SourceScholar