Sharpe Ratio-Guided Active Learning for Preference Optimization in RLHF
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917969566629888 |
|---|---|
| author | Belakaria, Syrine Kazdan, Joshua Marx, Charles Cundy, Chris Neiswanger, Willie Koyejo, Sanmi Engelhardt, Barbara E. Ermon, Stefano |
| author_facet | Belakaria, Syrine Kazdan, Joshua Marx, Charles Cundy, Chris Neiswanger, Willie Koyejo, Sanmi Engelhardt, Barbara E. Ermon, Stefano |
| contents | Reinforcement learning from human feedback (RLHF) has become a cornerstone of the training and alignment pipeline for large language models (LLMs). Recent advances, such as direct preference optimization (DPO), have simplified the preference learning step. However, collecting preference data remains a challenging and costly process, often requiring expert annotation. This cost can be mitigated by carefully selecting the data points presented for annotation. In this work, we propose an active learning approach to efficiently select prompt and preference pairs using a risk assessment strategy based on the Sharpe Ratio. To address the challenge of unknown preferences prior to annotation, our method evaluates the gradients of all potential preference annotations to assess their impact on model updates. These gradient-based evaluations enable risk assessment of data points regardless of the annotation outcome. By leveraging the DPO loss derivations, we derive a closed-form expression for computing these Sharpe ratios on a per-tuple basis, ensuring our approach remains both tractable and computationally efficient. We also introduce two variants of our method, each making different assumptions about prior information. Experimental results demonstrate that our method outperforms the baseline by up to 5% in win rates against the chosen completion with limited human preference data across several language models and real-world datasets. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_22137 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Sharpe Ratio-Guided Active Learning for Preference Optimization in RLHF Belakaria, Syrine Kazdan, Joshua Marx, Charles Cundy, Chris Neiswanger, Willie Koyejo, Sanmi Engelhardt, Barbara E. Ermon, Stefano Artificial Intelligence Machine Learning Reinforcement learning from human feedback (RLHF) has become a cornerstone of the training and alignment pipeline for large language models (LLMs). Recent advances, such as direct preference optimization (DPO), have simplified the preference learning step. However, collecting preference data remains a challenging and costly process, often requiring expert annotation. This cost can be mitigated by carefully selecting the data points presented for annotation. In this work, we propose an active learning approach to efficiently select prompt and preference pairs using a risk assessment strategy based on the Sharpe Ratio. To address the challenge of unknown preferences prior to annotation, our method evaluates the gradients of all potential preference annotations to assess their impact on model updates. These gradient-based evaluations enable risk assessment of data points regardless of the annotation outcome. By leveraging the DPO loss derivations, we derive a closed-form expression for computing these Sharpe ratios on a per-tuple basis, ensuring our approach remains both tractable and computationally efficient. We also introduce two variants of our method, each making different assumptions about prior information. Experimental results demonstrate that our method outperforms the baseline by up to 5% in win rates against the chosen completion with limited human preference data across several language models and real-world datasets. |
| title | Sharpe Ratio-Guided Active Learning for Preference Optimization in RLHF |
| topic | Artificial Intelligence Machine Learning |
| url | https://arxiv.org/abs/2503.22137 |