Update README.md

README.md

@@ -25,6 +25,7 @@ Moreover, we provide a [detailed recipe](https://github.com/RLHFlow/Online-DPO-R
 - Iterative DPO: Following the RLHF Workflow framework (https://arxiv.org/pdf/2405.07863), in each iteration, we sample multiple responses from the last trained policy, rank them via the ruled-based reward, and construct the preference pairs.
   Then, we optimize the policy by minimizing the DPO loss and enter the next iteration.
   Online iterative DPO can mitigate the issue of distribution shift and the limited coverage of offline data effectively
+  
 More detailed can be found in our [blog](https://www.notion.so/Online-DPO-R1-1908b9a70e7b80c3bc83f4cf04b2f175)!