Embedding-perturbed Exploration Preference Optimization for Flow Models
Abstract
Recent advancements have established Reinforcement Learning (RL) as a pivotal paradigm for aligning generative models with human intent. However, group-based optimization frameworks (e.g., GRPO) face a critical limitation: the rapid decay of intra-group variance. As the distinctiveness among samples within a group diminishes, the variance approaches zero. This eliminates the very learning signal required for optimization, rendering the process unstable and forcing the policy into premature stagnation or reward hacking. Existing strategies, such as varying the initial noise or increasing group sizes, often fail to address this fundamental issue, resulting in training instability or diminishing returns. To overcome these challenges, we propose , a novel framework that sustains optimization through embedding-level perturbation. Our method introduces structured, embedding-level perturbations within sample groups, guaranteeing a robust variance that preserves the discriminative signal throughout the training process. Extensive experiments demonstrate that our approach significantly outperforms state-of-the-art baselines, achieving a more faithful alignment with human preference.
Cite
@article{arxiv.2605.15803,
title = {Embedding-perturbed Exploration Preference Optimization for Flow Models},
author = {Sujie Hu and Chubin Chen and Jiashu Zhu and Jiahong Wu and Xiangxiang Chu and Xiu Li},
journal= {arXiv preprint arXiv:2605.15803},
year = {2026}
}
Comments
Accepted by ICML 2026