3 citations · 6 across the 11 of their papers we have counts for
5 papers · 1 filter
Reinforcement Learning via Fixed-point Flow Matching
Denis Blessing, Onur Celik, Gerhard Neumann
In maximum entropy and behavior-constrained reinforcement learning (RL), the optimal policy is given by a Boltzmann distribution. Generating samples from this distribution can be c…
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…
PAWS: Preference Learning with Advantage-Weighted Segments
Aleksandar Taranovic, Onur Celik, Niklas Freymuth +6
Preference-based reinforcement learning (PbRL) learns policies from human trajectory-level comparisons, avoiding explicit reward design and expert demonstrations. Existing methods…
SEAR: Sample Efficient Action Chunking Reinforcement Learning
C. F. Maximilian Nagy, Onur Celik, Emiliyan Gospodinov +4
Action chunking improves exploration and accelerates value propagation in long-horizon reinforcement learning, but naively applying off-policy methods to the temporally extended ac…