Noise-conditioned Energy-based Annealed Rewards (NEAR): A Generative Framework for Imitation Learning from Observation
Anish Abhijit Diwan, Julen Urain, Jens Kober, Jan Peters
Abstract
This paper introduces a new imitation learning framework based on energy-based generative models capable of learning complex, physics-dependent, robot motion policies through state-only expert motion trajectories. Our algorithm, called Noise-conditioned Energy-based Annealed Rewards (NEAR), constructs several perturbed versions of the expert's motion data distribution and learns smooth, and well-defined representations of the data distribution's energy function using denoising score matching. We propose to use these learnt energy functions as reward functions to learn imitation policies via reinforcement learning. We also present a strategy to gradually switch between the learnt energy functions, ensuring that the learnt rewards are always well-defined in the manifold of policy-generated samples. We evaluate our algorithm on complex humanoid tasks such as locomotion and martial arts and compare it with state-only adversarial imitation learning algorithms like Adversarial Motion Priors (AMP). Our framework sidesteps the optimisation challenges of adversarial imitation learning techniques and produces results comparable to AMP in several quantitative metrics across multiple imitation settings. Code and videos available at anishhdiwan.github.io/noise-conditionedenergy-based-annealed-rewards/
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext ab3606c8-71ed-4b2d-a979-4b07c8441ad9Cited by top-tier papers3
- IOSTOM: Offline Imitation Learning from Observations via State Transition Occupancy MatchingQuang Anh Pham, Janaka Chathuranga Brahmanage, Tien Mai, Akshat KumarNeurIPS 2025 · 2 citations
- Recovering Hidden Reward in Diffusion-Based PoliciesYanbiao Ji, Qiuchang Li, Yuting Hu, Shaokai Wu et al.ICML 2026
- Trust Region Inverse Reinforcement Learning: Explicit Dual Ascent using Local Policy UpdatesAnish Abhijit Diwan, Davide Tateo, Christopher Mower, Haitham Bou Ammar et al.ICML 2026
Builds on5
- Improved Techniques for Training Score-Based Generative ModelsYang Song, Stefano ErmonNeurIPS 2020 · 1,527 citations
- AMP: adversarial motion priors for stylized physics-based character controlXue Bin Peng, Ze Ma, Pieter Abbeel, Sergey Levine et al.SIGGRAPH 2021 · 392 citations
- DiffAIL: Diffusion Adversarial Imitation LearningBingzheng Wang, Guoqiang Wu, Teng Pang, Yan Zhang et al.AAAI 2024 · 24 citations
- Diffusion Imitation from ObservationBo-Ruei Huang, Chun-Kai Yang, Chun-Mao Lai, Dai-Jie Wu et al.NeurIPS 2024 · 15 citations
- Pink Noise Is All You Need: Colored Noise Exploration in Deep Reinforcement LearningOnno Eberhard, Jakob J. Hollenstein, Cristina Pinneri, Georg MartiusICLR 2023
Related papers
- Mimicking Better by Matching the Approximate Action DistributionJoão A. Cândido Ramos, Lionel Blondé, Naoya Takeishi, Alexandros KalousisICML 2024 · 4 citations
- NIL: No-data Imitation LearningMert Albaba, Chenhao Li, Markos Diomataris, Omid Taheri et al.CVPR 2026
- SMP: Reusable Score-Matching Motion Priors for Physics-Based Character ControlYuxuan Mu, Ziyu Zhang, Yi Shi, Dun Yang et al.SIGGRAPH 2026
- Learning non-Markovian Decision-Making from State-only SequencesAoyang Qin, Feng Gao, Qing Li, Song-Chun Zhu et al.NeurIPS 2023 · 13 citations
- Strictly Batch Imitation Learning by Energy-based Distribution MatchingDaniel Jarrett, Ioana Bica, Mihaela van der SchaarNeurIPS 2020 · 74 citations
