12 papers · 1 filter
Scalable Maximum Entropy Reinforcement Learning for Diffusion Policies via Adjoint Matching
Serge Thilges, Onur Celik, Denis Blessing +2
Diffusion policies have recently emerged as a powerful paradigm for representing complex action distributions in reinforcement learning (RL). However, their application to online R…
Trust-Region Diffusion Policies for Massively Parallel On-Policy RL
Huy Le, Onur Celik, Denis Blessing +6
Reinforcement learning with massively parallel simulations has become a standard framework for developing robust, deployable policies; however, most existing approaches still rely…
Trust Region Constrained Measure Transport in Path Space for Stochastic Optimal Control and Inference
Denis Blessing, Julius Berner, Lorenz Richter +4
Solving stochastic optimal control problems with quadratic control costs can be viewed as approximating a target path space measure, e.g. via gradient-based optimization. In practi…
Learning Boltzmann Generators via Constrained Mass Transport
Christopher von Klitzing, Denis Blessing, Henrik Schopmans +2
Efficient sampling from high-dimensional and multimodal unnormalized probability distributions is a central challenge in many areas of science and machine learning. We focus on Bol…
Bridge Matching Sampler: Scalable Sampling via Generalized Fixed-Point Diffusion Matching
Denis Blessing, Lorenz Richter, Julius Berner +2
Sampling from unnormalized densities using diffusion models has emerged as a powerful paradigm. However, while recent approaches that use least-squares `matching' objectives have i…
MaNGO - Adaptable Graph Network Simulators via Meta-Learning
Philipp Dahlinger, Tai Hoang, Denis Blessing +2
Accurately simulating physics is crucial across scientific domains, with applications spanning from robotics to materials science. While traditional mesh-based simulations are prec…