On Extending Direct Preference Optimization to Accommodate Ties
<|reference_start|>On Extending Direct Preference Optimization to Accommodate Ties: We derive and investigate two DPO variants that explicitly model the possibility of declaring a tie in pair-wise comparisons. We replace the Bradley-Terry model in DPO with two well-known modeling extensions, by Rao and Kupper and by Davidson, that assign probability to ties as alternatives to clear preferences. Our experiments in neural machine translation and summarization show that explicitly labeled ties can be added to the datasets for these DPO variants without the degradation in task performance that is observed when the same tied pairs are presented to DPO. We find empirically that the inclusion of ties leads to stronger regularization with respect to the reference policy as measured by KL divergence, and we see this even for DPO in its original form. These findings motivate and enable the inclusion of tied pairs in preference optimization as opposed to simply discarding them.<|reference_end|>
@article{chen2024on,
    title={On Extending Direct Preference Optimization to Accommodate Ties},
    author={Jinghong Chen, Guangyu Yang, Weizhe Lin, Jingbiao Mei, Bill Byrne},
    journal={arXiv preprint arXiv:2409.17431},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.17431},
    primaryClass={cs.CL}
}