{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/lipo-listwise-preference-optimization-through","title":"LiPO: Listwise Preference Optimization through Learning-to-Rank","arxiv_id":"2402.01878","date":"2024-02-02","proceeding":null,"authors":["Tianqi Liu","Zhen Qin","Junru Wu","Jiaming Shen","Misha Khalman","Rishabh Joshi","Yao Zhao","Mohammad Saleh","Simon Baumgartner","Jialu Liu","Peter J. Liu","Xuanhui Wang"],"abstract":"Aligning language models (LMs) with curated human feedback is critical to control their behaviors in real-world applications. Several recent policy optimization methods, such as DPO and SLiC, serve as promising alternatives to the traditional Reinforcement Learning from Human Feedback (RLHF) approach. In practice, human feedback often comes in a format of a ranked list over multiple responses to amortize the cost of reading prompt. Multiple responses can also be ranked by reward models or AI feedback. There lacks such a thorough study on directly fitting upon a list of responses. In this work, we formulate the LM alignment as a \\textit{listwise} ranking problem and describe the LiPO framework, where the policy can potentially learn more effectively from a ranked list of plausible responses given the prompt. This view draws an explicit connection to Learning-to-Rank (LTR), where most existing preference optimization work can be mapped to existing ranking objectives. Following this connection, we provide an examination of ranking objectives that are not well studied for LM alignment with DPO and SLiC as special cases when list size is two. In particular, we highlight a specific method, LiPO-$\\lambda$, which leverages a state-of-the-art \\textit{listwise} ranking objective and weights each preference pair in a more advanced manner. We show that LiPO-$\\lambda$ can outperform DPO variants and SLiC by a clear margin on several preference alignment tasks with both curated and real rankwise preference data.","url_abs":"https://arxiv.org/abs/2402.01878v3","url_pdf":"https://arxiv.org/pdf/2402.01878v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"lipo-listwise-preference-optimization-through","repo_url":"https://github.com/CyberAgentAILab/annotation-efficient-po","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"learning-to-rank","task_name":"Learning-To-Rank"}],"methods":[{"method_slug":"dpo","method_name":"DPO"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2402.01878","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.01878"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/CyberAgentAILab/annotation-efficient-po","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":6},"by_repo_kind":{"listed":{"samples":6,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"c36696fde0a4d9a9","entry":"compute_mbr","repo":"CyberAgentAILab/annotation-efficient-po","repo_kind":"listed","path":"aepo/mbr/policy/mbr.py","file_url":"https://github.com/CyberAgentAILab/annotation-efficient-po/blob/HEAD/aepo/mbr/policy/mbr.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"c36696fde0a4d9a9"}},{"code_sha256_prefix":"4fa31ca890d1bad2","entry":"compute_score_matrix","repo":"CyberAgentAILab/annotation-efficient-po","repo_kind":"listed","path":"aepo/mbr/policy/mbr.py","file_url":"https://github.com/CyberAgentAILab/annotation-efficient-po/blob/HEAD/aepo/mbr/policy/mbr.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"4fa31ca890d1bad2"}},{"code_sha256_prefix":"c3e7b6a5e02cc75a","entry":"gbfs","repo":"CyberAgentAILab/annotation-efficient-po","repo_kind":"listed","path":"aepo/mbr/policy/diverse_mbr.py","file_url":"https://github.com/CyberAgentAILab/annotation-efficient-po/blob/HEAD/aepo/mbr/policy/diverse_mbr.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"c3e7b6a5e02cc75a"}},{"code_sha256_prefix":"d870256602e7e4e3","entry":"generate_objective","repo":"CyberAgentAILab/annotation-efficient-po","repo_kind":"listed","path":"aepo/mbr/policy/diverse_mbr.py","file_url":"https://github.com/CyberAgentAILab/annotation-efficient-po/blob/HEAD/aepo/mbr/policy/diverse_mbr.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"d870256602e7e4e3"}},{"code_sha256_prefix":"ce435137db62a83c","entry":"local_search","repo":"CyberAgentAILab/annotation-efficient-po","repo_kind":"listed","path":"aepo/mbr/policy/diverse_mbr.py","file_url":"https://github.com/CyberAgentAILab/annotation-efficient-po/blob/HEAD/aepo/mbr/policy/diverse_mbr.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"ce435137db62a83c"}},{"code_sha256_prefix":"2286661176238829","entry":"read_dataset","repo":"CyberAgentAILab/annotation-efficient-po","repo_kind":"listed","path":"aepo/preprocess.py","file_url":"https://github.com/CyberAgentAILab/annotation-efficient-po/blob/HEAD/aepo/preprocess.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"2286661176238829"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}