← Search

Oleg Arenz

13 accepted papers

2026

Discrete Variational Autoencoding via Policy Search

ICLR 2026poster

Discrete latent bottlenecks in variational autoencoders (VAEs) offer high bit efficiency and can be modeled with autoregressive discrete distributions, enabling parameter-efficient multimodal search with transformers. However, discrete random variables do not allow for exact differentiable parameter…

Cited by 0SourceScholar
2026

Floating-Base Deep Lagrangian Networks

ICRA 2026poster

Grey-box methods for system identification combine deep learning with physics-informed constraints, capturing complex dependencies while improving out-of-distribution generalization. Despite the growing importance of floating-base systems such as humanoids and quadrupeds, current grey-box models ign…

2026

GaussTwin: Unified Simulation and Correction with Gaussian Splatting for Robotic Digital Twins

ICRA 2026poster

Digital twins promise to enhance robotic manipulation by maintaining a consistent link between real-world perception and simulation. However, most existing systems struggle with the lack of a unified model, complex dynamic interactions, and the real-to-sim gap, which limits downstream applications s…

2026

Trust Region Inverse Reinforcement Learning

ICML 2026poster

Inverse reinforcement learning (IRL) is typically formulated as maximizing entropy subject to matching the distribution of expert trajectories. Classical (dual-ascent) IRL guarantees monotonic performance improvement but requires fully solving an RL problem each iteration to compute dual gradients. …

Cited by 0SourceScholar
2023

Digital Twin of a Driver-in-the-Loop Race Car Simulation With Contextual Reinforcement Learning

RA-L 2023

In order to facilitate rapid prototyping and testing in the advanced motorsport industry, we consider the problem of imitating and outperforming professional race car drivers based on demonstrations collected on a high-fidelity Driver-in-the-Loop (DiL) hardware simulator. We formulate a contextual r

Cited by 9SourceScholar
2023

LS-IQ: Implicit Reward Regularization for Inverse Reinforcement Learning

ICLR 2023poster

Recent methods for imitation learning directly learn a $Q$-function using an implicit reward formulation rather than an explicit reward function. However, these methods generally require implicit reward regularization to improve stability and often mistreat absorbing states. Previous works show that…

2020

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

ICLR 2020poster

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 of the data distribution to the model distribution. The M-projection forces the model to average over modes it cannot r…

Cited by 16SourcecodeScholar
2018

Efficient Gradient-Free Variational Inference using Policy Search

ICML 2018oral

Inference from complex distributions is a common problem in machine learning needed for many Bayesian methods. We propose an efficient, gradient-free method for learning general GMM approximations of multimodal distributions based on recent insights from stochastic search methods. Our method establi…