We lifted 3 functions out of this paper's own repositories and ran 0 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| ku-dmlab/vpo | canonical | 0 of 3 |
| Function | Status | Where it lives |
|---|---|---|
| get_remote_file | Not yet run | ku-dmlab/vpo/utils.py code served (permissive licence) · get_code("e7ce4c19888c6df6") |
| pad_to_length | Not yet run | ku-dmlab/vpo/utils.py code served (permissive licence) · get_code("513a6b6aa9a3c83e") |
| slice_and_move_batch_for_device | Not yet run | ku-dmlab/vpo/utils.py code served (permissive licence) · get_code("e5b14d12b64c08c2") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Direct Preference Optimization (DPO) trains a language model using human preference data, bypassing the explicit reward modeling phase of Reinforcement Learning from Human Feedback (RLHF). By iterating over sentence pairs in a preference dataset, DPO enhances generation quality by increasing the likelihood of producing preferred sentences over less favored ones. Preference datasets are typically created by selecting preferred sentences through a voting process involving multiple individuals, as opinions can vary due to the subjective nature of human preferences. While the number of votes offers insight into whether a sentence pair is clearly preferable or controversial, current methods do not fully leverage this information. In this paper, we introduce a technique that leverages user voting data to better align with diverse subjective preferences. We employ the Bayesian Minimum Mean Square Error (Bayesian MMSE) estimator to model the probability that one generation is preferable to another. Using this estimated probability as a target, we develop the Vote-based Preference Optimization (VPO) framework, which incorporates the number of votes on both sides to distinguish between controversial and obvious generation pairs. We show that previous algorithms, such as DPO and Identity Preference Optimization (IPO), can be extended using the proposed framework, termed VDPO and VIPO. Our experiments demonstrate that these proposed algorithms outperform various existing methods, including their base algorithms.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2410.22891")
get_code_for_paper("2410.22891")
have("2410.22891")
Connect an agent — have() is free.