{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/dpo-loss","entry":"dpo_loss","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":21,"n_papers_ran":20,"n_papers_ran_no_instrument_failure":13,"n_papers_ran_instrument_only":7,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":17,"n_samples_ran":16,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":6,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":21,"n_places_pointer_only":8,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":5,"ran":10,"unverified":1},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2604.18966","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-18966","title":"Self-Improving Tabular Language Models via Iterative Reward-Guided Post-Training","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"Yunbo-max/Post-Training-Tabular-Language-Models","path":"loss.py","file_url":"https://github.com/Yunbo-max/Post-Training-Tabular-Language-Models/blob/HEAD/loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5aa6cff234d655cd","code_sha256_prefix":"5aa6cff234d655cd","mcp_get_code":{"code_sha256":"5aa6cff234d655cd"}},{"arxiv_id":"2506.11712","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2506.11712","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"Liuwq-bit/SymMPO","path":"muffin/train/trainers.py","file_url":"https://github.com/Liuwq-bit/SymMPO/blob/HEAD/muffin/train/trainers.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Liuwq-bit/SymMPO when it was checked","code_sha256":"a9ca56191b3904f6","code_sha256_prefix":"a9ca56191b3904f6","mcp_get_code":{"code_sha256":"a9ca56191b3904f6"}},{"arxiv_id":"2412.12497","arxiv_id_is_arxiv":true,"paper":"/paper/nlsr-neuron-level-safety-realignment-of-large","title":"NLSR: Neuron-Level Safety Realignment of Large Language Models Against Harmful Fine-Tuning","date":"2024-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xinykou/nlsr","path":"src/prune_regions/modeling_llama.py","file_url":"https://github.com/xinykou/nlsr/blob/HEAD/src/prune_regions/modeling_llama.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xinykou/nlsr when it was checked","code_sha256":"b8d15a97350e90e6","code_sha256_prefix":"b8d15a97350e90e6","mcp_get_code":{"code_sha256":"b8d15a97350e90e6"}},{"arxiv_id":"2411.06424","arxiv_id_is_arxiv":true,"paper":"/paper/ablation-is-not-enough-to-emulate-dpo-how","title":"Beyond Toxic Neurons: A Mechanistic Analysis of DPO for Toxicity Reduction","date":"2024-11-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yushi-y/dpo-toxic-neurons","path":"train_dpo/trainers.py","file_url":"https://github.com/yushi-y/dpo-toxic-neurons/blob/HEAD/train_dpo/trainers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6e420696373414b1","code_sha256_prefix":"6e420696373414b1","mcp_get_code":{"code_sha256":"6e420696373414b1"}},{"arxiv_id":"2410.23223","arxiv_id_is_arxiv":true,"paper":"/paper/comal-a-convergent-meta-algorithm-for","title":"COMAL: A Convergent Meta-Algorithm for Aligning LLMs with General Preferences","date":"2024-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yale-nlp/comal","path":"losses.py","file_url":"https://github.com/yale-nlp/comal/blob/HEAD/losses.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yale-nlp/comal when it was checked","code_sha256":"a71ddf2f2e1209ca","code_sha256_prefix":"a71ddf2f2e1209ca","mcp_get_code":{"code_sha256":"a71ddf2f2e1209ca"}},{"arxiv_id":"2410.21662","arxiv_id_is_arxiv":true,"paper":"/paper/f-po-generalizing-preference-optimization","title":"$f$-PO: Generalizing Preference Optimization with $f$-divergence Minimization","date":"2024-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minkaixu/fpo","path":"src/align_stage/loss.py","file_url":"https://github.com/minkaixu/fpo/blob/HEAD/src/align_stage/loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f87ec21e6cc554fb","code_sha256_prefix":"f87ec21e6cc554fb","mcp_get_code":{"code_sha256":"f87ec21e6cc554fb"}},{"arxiv_id":"2410.16208","arxiv_id_is_arxiv":true,"paper":"/paper/compute-constrained-data-selection","title":"Compute-Constrained Data Selection","date":"2024-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oseyosey/CCDS","path":"ccds/evaluation/open_instruct/dpo_utils.py","file_url":"https://github.com/oseyosey/CCDS/blob/HEAD/ccds/evaluation/open_instruct/dpo_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"48ff6fdc0e5dae2e","code_sha256_prefix":"48ff6fdc0e5dae2e","mcp_get_code":{"code_sha256":"48ff6fdc0e5dae2e"}},{"arxiv_id":"2408.04568","arxiv_id_is_arxiv":true,"paper":"/paper/learning-fine-grained-grounded-citations-for","title":"Learning Fine-Grained Grounded Citations for Attributed Large Language Models","date":"2024-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luckyyysta/fine-grained-attribution","path":"training/stage2_consistency_aware_alignment/dpo_utils.py","file_url":"https://github.com/luckyyysta/fine-grained-attribution/blob/HEAD/training/stage2_consistency_aware_alignment/dpo_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, luckyyysta/fine-grained-attribution when it was checked","code_sha256":"b2b6de249cebe189","code_sha256_prefix":"b2b6de249cebe189","mcp_get_code":{"code_sha256":"b2b6de249cebe189"}},{"arxiv_id":"2407.13709","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-reference-policies-in-direct","title":"Understanding Reference Policies in Direct Preference Optimization","date":"2024-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yale-nlp/refdpo","path":"dpo_utils.py","file_url":"https://github.com/yale-nlp/refdpo/blob/HEAD/dpo_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yale-nlp/refdpo when it was checked","code_sha256":"8c5617ecaa98baa1","code_sha256_prefix":"8c5617ecaa98baa1","mcp_get_code":{"code_sha256":"8c5617ecaa98baa1"}},{"arxiv_id":"2406.16797","arxiv_id_is_arxiv":true,"paper":"/paper/lottery-ticket-adaptation-mitigating","title":"Lottery Ticket Adaptation: Mitigating Destructive Interference in LLMs","date":"2024-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kiddyboots216/lottery-ticket-adaptation","path":"rlaif/single_gpu_trainers.py","file_url":"https://github.com/kiddyboots216/lottery-ticket-adaptation/blob/HEAD/rlaif/single_gpu_trainers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"16a2450aff4a3577","code_sha256_prefix":"16a2450aff4a3577","mcp_get_code":{"code_sha256":"16a2450aff4a3577"}},{"arxiv_id":"2406.09279","arxiv_id_is_arxiv":true,"paper":"/paper/unpacking-dpo-and-ppo-disentangling-best","title":"Unpacking DPO and PPO: Disentangling Best Practices for Learning from Preference Feedback","date":"2024-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hamishivi/EasyLM","path":"EasyLM/models/llama/llama_train_dpo.py","file_url":"https://github.com/hamishivi/EasyLM/blob/HEAD/EasyLM/models/llama/llama_train_dpo.py","status":"unverified","verification_level":0,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a6d706f6e0699b5c","code_sha256_prefix":"a6d706f6e0699b5c","mcp_get_code":{"code_sha256":"a6d706f6e0699b5c"}},{"arxiv_id":"2405.14734","arxiv_id_is_arxiv":true,"paper":"/paper/simpo-simple-preference-optimization-with-a","title":"SimPO: Simple Preference Optimization with a Reference-Free Reward","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openpsi-project/realhf","path":"realhf/impl/model/utils/dpo_functional.py","file_url":"https://github.com/openpsi-project/realhf/blob/HEAD/realhf/impl/model/utils/dpo_functional.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6b05e6f1ad3cb9b6","code_sha256_prefix":"6b05e6f1ad3cb9b6","mcp_get_code":{"code_sha256":"6b05e6f1ad3cb9b6"}},{"arxiv_id":"2405.05008","arxiv_id_is_arxiv":true,"paper":"/paper/adelie-aligning-large-language-models-on","title":"ADELIE: Aligning Large Language Models on Information Extraction","date":"2024-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"THU-KEG/ADELIE","path":"train4llama/open_instruct/dpo_utils.py","file_url":"https://github.com/THU-KEG/ADELIE/blob/HEAD/train4llama/open_instruct/dpo_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, THU-KEG/ADELIE when it was checked","code_sha256":"b2b6de249cebe189","code_sha256_prefix":"b2b6de249cebe189","mcp_get_code":{"code_sha256":"b2b6de249cebe189"}},{"arxiv_id":"2402.12366","arxiv_id_is_arxiv":true,"paper":"/paper/a-critical-evaluation-of-ai-feedback-for","title":"A Critical Evaluation of AI Feedback for Aligning Large Language Models","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"architsharma97/dpo-rlaif","path":"trainers.py","file_url":"https://github.com/architsharma97/dpo-rlaif/blob/HEAD/trainers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"16a2450aff4a3577","code_sha256_prefix":"16a2450aff4a3577","mcp_get_code":{"code_sha256":"16a2450aff4a3577"}},{"arxiv_id":"2402.00856","arxiv_id_is_arxiv":true,"paper":"/paper/towards-efficient-and-exact-optimization-of","title":"Towards Efficient Exact Optimization of Language Model Alignment","date":"2024-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haozheji/exact-optimization","path":"src/align_stage/loss.py","file_url":"https://github.com/haozheji/exact-optimization/blob/HEAD/src/align_stage/loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f87ec21e6cc554fb","code_sha256_prefix":"f87ec21e6cc554fb","mcp_get_code":{"code_sha256":"f87ec21e6cc554fb"}},{"arxiv_id":"2401.01967","arxiv_id_is_arxiv":true,"paper":"/paper/a-mechanistic-understanding-of-alignment","title":"A Mechanistic Understanding of Alignment Algorithms: A Case Study on DPO and Toxicity","date":"2024-01-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ajyl/dpo_toxic","path":"toxicity/train_dpo/trainers.py","file_url":"https://github.com/ajyl/dpo_toxic/blob/HEAD/toxicity/train_dpo/trainers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6e420696373414b1","code_sha256_prefix":"6e420696373414b1","mcp_get_code":{"code_sha256":"6e420696373414b1"}},{"arxiv_id":"2312.00267","arxiv_id_is_arxiv":true,"paper":"/paper/sample-efficient-reinforcement-learning-from","title":"Sample Efficient Preference Alignment in LLMs via Active Exploration","date":"2023-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"belakaria/active-llm-alignment","path":"trainers.py","file_url":"https://github.com/belakaria/active-llm-alignment/blob/HEAD/trainers.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cb2b1a4a7f1ecabf","code_sha256_prefix":"cb2b1a4a7f1ecabf","mcp_get_code":{"code_sha256":"cb2b1a4a7f1ecabf"}},{"arxiv_id":"2311.16714","arxiv_id_is_arxiv":true,"paper":"/paper/embodied-multi-modal-agent-trained-by-an-llm","title":"Embodied Multi-Modal Agent trained by an LLM from a Parallel TextWorld","date":"2023-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stevenyangyj/emma-alfworld","path":"LAVIS/lavis/models/blip2_models/blip2_emma.py","file_url":"https://github.com/stevenyangyj/emma-alfworld/blob/HEAD/LAVIS/lavis/models/blip2_models/blip2_emma.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, stevenyangyj/emma-alfworld when it was checked","code_sha256":"112c839f24908701","code_sha256_prefix":"112c839f24908701","mcp_get_code":{"code_sha256":"112c839f24908701"}},{"arxiv_id":"2310.12304","arxiv_id_is_arxiv":true,"paper":"/paper/preference-optimization-for-molecular","title":"Preference Optimization for Molecular Language Models","date":"2023-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"harmonic-discovery/pref-opt-for-mols","path":"pref_opt_for_mols/models/dpo.py","file_url":"https://github.com/harmonic-discovery/pref-opt-for-mols/blob/HEAD/pref_opt_for_mols/models/dpo.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, harmonic-discovery/pref-opt-for-mols when it was checked","code_sha256":"3d3a8ce9515f501f","code_sha256_prefix":"3d3a8ce9515f501f","mcp_get_code":{"code_sha256":"3d3a8ce9515f501f"}},{"arxiv_id":"2309.16240","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-reverse-kl-generalizing-direct","title":"Beyond Reverse KL: Generalizing Direct Preference Optimization with Diverse Divergence Constraints","date":"2023-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alecwangcq/f-divergence-dpo","path":"trainers.py","file_url":"https://github.com/alecwangcq/f-divergence-dpo/blob/HEAD/trainers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fc5f3e7e6f97a222","code_sha256_prefix":"fc5f3e7e6f97a222","mcp_get_code":{"code_sha256":"fc5f3e7e6f97a222"}},{"arxiv_id":"2305.14718","arxiv_id_is_arxiv":true,"paper":"/paper/improving-language-models-with-advantage","title":"Leftover Lunch: Advantage-based Offline Reinforcement Learning for Language Models","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abaheti95/LoL-RL","path":"dpo_qlora_llama_hh.py","file_url":"https://github.com/abaheti95/LoL-RL/blob/HEAD/dpo_qlora_llama_hh.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1ed7c9ceaa90eb2c","code_sha256_prefix":"1ed7c9ceaa90eb2c","mcp_get_code":{"code_sha256":"1ed7c9ceaa90eb2c"}}],"record_sha256":"33890d8e40cec06716232032f7d556e9156f1b74ebd8bbaa8c8348a46a406993","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}