paper-with-me

Papers

Selective Timestep Weighting and Advantage-Based Replay for Sample-Efficient Diffusion RLHF

2026-07-08 · Eric Zhu, Abhinav Shrivastava, Soumik Mukhopadhyay arxiv

Reinforcement learning from human feedback (RLHF) has emerged as a powerful paradigm for aligning generative models with human preferences. However, applying RLHF to diffusion models remains highly feedback inefficient, as existing approaches typically require large amounts of human or reward model evaluations. This limitation reduces the practicality of diffusion RLHF in realworld settings where feedback is the primary bottleneck. In this paper, we propose two complementary strategies that substantially improve the feedback efficiency of diffusion RLHF while preserving generalization to unseen prompts. Our key observation is that reward information in diffusion trajectories is unevenly distributed: not all denoising timesteps or trajectories contribute equally to learning from a reward signal. By emphasizing informative timesteps and trajectories during optimization, we obtain more effective gradient updates. First, we introduce a per-timestep weighting scheme that reweights denoising steps during policy optimization. We theoretically connect this weighting to the optimal convergence properties of proximal policy optimization (PPO) and approximate the resulting weighting trend empirically. Second, we introduce a replay mechanism that prioritizes informative trajectories, enabling the model to reuse past samples instead of repeatedly querying new rewards. Together, these strategies significantly improve the feedback efficiency of diffusion RLHF. Under identical hyperparameter settings, our approach achieves up to a 6$\times$ improvement in sample efficiency compared to widely used diffusion RLHF baselines.

📄 PDF Abstract BibTeX arXiv:2607.07693

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement Learning

Similar Papers 제목 키워드 기반

Not All Timesteps Matter Equally: Selective Alignment Knowledge Distillation for Spiking Neural Networks

2026-05-14 · Kai Sun, Peibo Duan, Yongsheng Huang, Guowei Zhang 외 arxiv

Spiking neural networks (SNNs), which are brain-inspired and spike-driven, achieve high energy efficiency. However, a performance gap between SNNs and artificial neural networks (ANNs) still remains. Knowledge distillati…

Knowledge Distillation

Watch Your Step: Optimal Retrieval for Continual Learning at Scale

2024-04-16 · Truman Hickok, Dhireesha Kudithipudi

In continual learning, a model learns incrementally over time while minimizing interference between old and new tasks. One of the most widely used approaches in continual learning is referred to as replay. Replay methods…

Continual Learningobject-detectionObject DetectionOpen-vocabulary object detection+2

When Generative Replay Meets Evolving Deepfakes: Domain-Aware Relative Weighting for Incremental Face Forgery Detection

2025-11-23 · Hao Shen, Jikang Cheng, Renye Yan, Zhongyuan Wang 외 arxiv

The rapid advancement of face generation techniques has led to a growing variety of forgery methods. Incremental forgery detection aims to gradually update existing models with new forgery data, yet current sample replay…

Incremental Learning

Learning Expected Emphatic Traces for Deep RL

2021-07-12 · Ray Jiang, Shangtong Zhang, Veronica Chelu, Adam White 외

Off-policy sampling and experience replay are key for improving sample efficiency and scaling model-free temporal difference learning methods. When combined with function approximation, such as neural networks, this comb…

Adiabatic replay for continual learning

2023-03-23 · Alexander Krawczyk, Alexander Gepperth

Conventional replay-based approaches to continual learning (CL) require, for each learning phase with new data, the replay of samples representing all of the previously learned knowledge in order to avoid catastrophic fo…

Continual Learning