← Search

Jonas Rothfuss

15 accepted papers

2024

Bridging the Sim-to-Real Gap with Bayesian Inference

IROS 2024poster

We present Sim-FSVGD for learning robot dynamics from data. As opposed to traditional methods, Sim-FSVGD leverages low-fidelity physical priors, e.g., in the form of simulators, to regularize the training of neural network models. While learning accurate dynamics already in the low data regime, Sim-…

Cited by 12SourceScholar
2024

Data-Efficient Task Generalization via Probabilistic Model-Based Meta Reinforcement Learning

RA-L 2024

We introduce PACOH-RL, a novel model-based Meta-Reinforcement Learning (Meta-RL) algorithm designed to efficiently adapt control policies to changing dynamics. PACOH-RL meta-learns priors for the dynamics model, allowing swift adaptation to new dynamics with minimal interaction data. Existing Meta-R

Cited by 10SourceScholar
2023

BaCaDI: Bayesian Causal Discovery with Unknown Interventions

AISTATS 2023poster

Inferring causal structures from experimentation is a central task in many domains. For example, in biology, recent advances allow us to obtain single-cell expression data under multiple interventions such as drugs or gene knockouts. However, the targets of the interventions are often uncertain or u…

2023

Hallucinated adversarial control for conservative offline policy evaluation

UAI 2023poster

We study the problem of conservative off-policy evaluation (COPE) where given an offline dataset of environment interactions, collected by other agents, we seek to obtain a (tight) lower bound on a policy’s performance. This is crucial when deciding whether a given policy satisfies certain minimal p…

2023

Lifelong bandit optimization: no prior and no regret

UAI 2023poster

Machine learning algorithms are often repeatedly. applied to problems with similar structure over and over again. We focus on solving a sequence of bandit optimization tasks and develop LIBO, an algorithm which adapts to the environment by learning from past experience and becomes more sample-effici…

Cited by 7SourcePDFScholar
2023

MARS: Meta-learning as Score Matching in the Function Space

ICLR 2023top-25%

Meta-learning aims to extract useful inductive biases from a set of related datasets. In Bayesian meta-learning, this is typically achieved by constructing a prior distribution over neural network parameters. However, specifying families of computationally viable prior distributions over the high-di…

2022

Amortized Inference for Causal Structure Learning

NeurIPS 2022accept

Inferring causal structure poses a combinatorial search problem that typically involves evaluating structures with a score or independence test. The resulting search is costly, and designing suitable scores or tests that capture prior knowledge is difficult. In this work, we propose to amortize caus…

2022

Meta-Learning Hypothesis Spaces for Sequential Decision-making

ICML 2022spotlight

Obtaining reliable, adaptive confidence sets for prediction functions (hypotheses) is a central challenge in sequential decision-making tasks, such as bandits and model-based reinforcement learning. These confidence sets typically rely on prior assumptions on the hypothesis space, e.g., the known ke…

Cited by 10SourcePDFScholar
2021

DiBS: Differentiable Bayesian Structure Learning

NeurIPS 2021spotlight

Bayesian structure learning allows inferring Bayesian network structure from data while reasoning about the epistemic uncertainty---a key element towards enabling active causal discovery and designing interventions in real world systems. In this work, we propose a general, fully differentiable frame…

2021

Meta-Learning Reliable Priors in the Function Space

NeurIPS 2021poster

Meta-Learning promises to enable more data-efficient inference by harnessing previous experience from related learning tasks. While existing meta-learning methods help us to improve the accuracy of our predictions in face of data scarcity, they fail to supply reliable uncertainty estimates, often be…

Cited by 37SourcePDFScholar
2021

PACOH: Bayes-Optimal Meta-Learning with PAC-Guarantees

ICML 2021spotlight

Meta-learning can successfully acquire useful inductive biases from data. Yet, its generalization properties to unseen learning tasks are poorly understood. Particularly if the number of meta-training tasks is small, this raises concerns about overfitting. We provide a theoretical analysis using the…

2019

ProMP: Proximal Meta-Policy Search

ICLR 2019poster

Credit assignment in Meta-reinforcement learning (Meta-RL) is still poorly understood. Existing methods either neglect credit assignment to pre-adaptation behavior or implement it naively. This leads to poor sample-efficiency during meta-training as well as ineffective task identification strategies…

2018

Deep Episodic Memory: Encoding, Recalling, and Predicting Episodic Experiences for Robot Action Execution

RA-L 2018

We present a novel deep neural network architecture for representing robot experiences in an episodic-like memory that facilitates encoding, recalling, and predicting action experiences. Our proposed unsupervised deep episodic memory model as follows: First, encodes observed actions in a latent vect

Cited by 39SourcecodeScholar
2018

Model-Based Reinforcement Learning via Meta-Policy Optimization

CoRL 2018

Model-based reinforcement learning approaches carry the promise of being data efficient. However, due to challenges in learning dynamics models that sufficiently match the real-world dynamics, they struggle to achieve the same asymptotic performance as model-free methods. We propose Model-Based Meta

Cited by 0SourcePDFScholar