{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DRRUJNA2MNQ5FTSSRA74WE5PVW","short_pith_number":"pith:DRRUJNA2","schema_version":"1.0","canonical_sha256":"1c6344b41a6361d2ce52883fcb13afada8e98f83b41346cb3f23dfa2d25d79cf","source":{"kind":"arxiv","id":"2605.11480","version":2},"attestation_state":"computed","paper":{"title":"Efficient Adjoint Matching for Fine-tuning Diffusion Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"By reformulating the stochastic optimal control problem with linear base drift, Efficient Adjoint Matching speeds up reward fine-tuning of diffusion models up to 4x while matching performance.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dongsoo Shin, Jaemoo Choi, Jaewoong Choi, Jeongwoo Shin, Joonseok Lee, Wei Guo, Yongxin Chen, Yuchen Zhu","submitted_at":"2026-05-12T03:55:12Z","abstract_excerpt":"Reward fine-tuning has become a common approach for aligning pretrained diffusion and flow models with human preferences in text-to-image generation. Among reward-gradient-based methods, Adjoint Matching (AM) provides a principled formulation by casting reward fine-tuning as a stochastic optimal control (SOC) problem. However, AM inevitably requires a substantial computational cost: it requires (i) stochastic simulation of full generative trajectories under memoryless dynamics, resulting in a large number of function evaluations, and (ii) backward ODE simulation of the adjoint state along each"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.11480","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-12T03:55:12Z","cross_cats_sorted":[],"title_canon_sha256":"e028ad2b04f7a6bf7c642840e73e0505b7bf462617a717256e69d84b17bbc50d","abstract_canon_sha256":"ad3fd56b0337e4767d78b763ec3dc90a9f4b8d0ca658ae3e3d0b8a5f7124f420"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:17.801137Z","signature_b64":"kzIHdJHIhD2Eo5ApozkV+0L73WjsyeK39ONkA7y3rKQdyB8yKd1qRy9OUmy1GgBP7Iuu6NG32q7dtwY9V4R/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c6344b41a6361d2ce52883fcb13afada8e98f83b41346cb3f23dfa2d25d79cf","last_reissued_at":"2026-05-20T00:03:17.800309Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:17.800309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Adjoint Matching for Fine-tuning Diffusion Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"By reformulating the stochastic optimal control problem with linear base drift, Efficient Adjoint Matching speeds up reward fine-tuning of diffusion models up to 4x while matching performance.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dongsoo Shin, Jaemoo Choi, Jaewoong Choi, Jeongwoo Shin, Joonseok Lee, Wei Guo, Yongxin Chen, Yuchen Zhu","submitted_at":"2026-05-12T03:55:12Z","abstract_excerpt":"Reward fine-tuning has become a common approach for aligning pretrained diffusion and flow models with human preferences in text-to-image generation. Among reward-gradient-based methods, Adjoint Matching (AM) provides a principled formulation by casting reward fine-tuning as a stochastic optimal control (SOC) problem. However, AM inevitably requires a substantial computational cost: it requires (i) stochastic simulation of full generative trajectories under memoryless dynamics, resulting in a large number of function evaluations, and (ii) backward ODE simulation of the adjoint state along each"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"On standard text-to-image reward fine-tuning benchmarks, EAM converges up to 4x faster than AM and matches or surpasses it across various metrics including PickScore, ImageReward, HPSv2.1, CLIPScore and Aesthetics.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That reformulating the SOC problem with linear base drift and modified terminal cost preserves the original alignment objective and solution quality without introducing bias or loss of expressivity.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"EAM speeds up adjoint matching for diffusion model reward fine-tuning by switching to linear base drift, allowing deterministic few-step solvers and closed-form adjoints with up to 4x faster convergence on text-to-image benchmarks.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"By reformulating the stochastic optimal control problem with linear base drift, Efficient Adjoint Matching speeds up reward fine-tuning of diffusion models up to 4x while matching performance.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"961c7d085c483c52d90646cb223e319207fdb86ce2ae1cd1ed15150b6693adca"},"source":{"id":"2605.11480","kind":"arxiv","version":2},"verdict":{"id":"c0d06026-e430-4267-9e7d-ca052735b6cd","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-13T01:48:08.979614Z","strongest_claim":"On standard text-to-image reward fine-tuning benchmarks, EAM converges up to 4x faster than AM and matches or surpasses it across various metrics including PickScore, ImageReward, HPSv2.1, CLIPScore and Aesthetics.","one_line_summary":"EAM speeds up adjoint matching for diffusion model reward fine-tuning by switching to linear base drift, allowing deterministic few-step solvers and closed-form adjoints with up to 4x faster convergence on text-to-image benchmarks.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That reformulating the SOC problem with linear base drift and modified terminal cost preserves the original alignment objective and solution quality without introducing bias or loss of expressivity.","pith_extraction_headline":"By reformulating the stochastic optimal control problem with linear base drift, Efficient Adjoint Matching speeds up reward fine-tuning of diffusion models up to 4x while matching performance."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.11480/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-19T12:35:13.612761Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T09:31:19.317994Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T08:21:51.152392Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"d69ab342a34e23f0fa3d59dbf3f9abaaeb4205df9b42b33269cb10e1ad50b6d3"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"8405a874ae7dfca82d3f39c9630be4e76245a017cfbd2d5282edded404646bb0"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.11480","created_at":"2026-05-20T00:03:17.800419+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.11480v2","created_at":"2026-05-20T00:03:17.800419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.11480","created_at":"2026-05-20T00:03:17.800419+00:00"},{"alias_kind":"pith_short_12","alias_value":"DRRUJNA2MNQ5","created_at":"2026-05-20T00:03:17.800419+00:00"},{"alias_kind":"pith_short_16","alias_value":"DRRUJNA2MNQ5FTSS","created_at":"2026-05-20T00:03:17.800419+00:00"},{"alias_kind":"pith_short_8","alias_value":"DRRUJNA2","created_at":"2026-05-20T00:03:17.800419+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DRRUJNA2MNQ5FTSSRA74WE5PVW","json":"https://pith.science/pith/DRRUJNA2MNQ5FTSSRA74WE5PVW.json","graph_json":"https://pith.science/api/pith-number/DRRUJNA2MNQ5FTSSRA74WE5PVW/graph.json","events_json":"https://pith.science/api/pith-number/DRRUJNA2MNQ5FTSSRA74WE5PVW/events.json","paper":"https://pith.science/paper/DRRUJNA2"},"agent_actions":{"view_html":"https://pith.science/pith/DRRUJNA2MNQ5FTSSRA74WE5PVW","download_json":"https://pith.science/pith/DRRUJNA2MNQ5FTSSRA74WE5PVW.json","view_paper":"https://pith.science/paper/DRRUJNA2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.11480&json=true","fetch_graph":"https://pith.science/api/pith-number/DRRUJNA2MNQ5FTSSRA74WE5PVW/graph.json","fetch_events":"https://pith.science/api/pith-number/DRRUJNA2MNQ5FTSSRA74WE5PVW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DRRUJNA2MNQ5FTSSRA74WE5PVW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DRRUJNA2MNQ5FTSSRA74WE5PVW/action/storage_attestation","attest_author":"https://pith.science/pith/DRRUJNA2MNQ5FTSSRA74WE5PVW/action/author_attestation","sign_citation":"https://pith.science/pith/DRRUJNA2MNQ5FTSSRA74WE5PVW/action/citation_signature","submit_replication":"https://pith.science/pith/DRRUJNA2MNQ5FTSSRA74WE5PVW/action/replication_record"}},"created_at":"2026-05-20T00:03:17.800419+00:00","updated_at":"2026-05-20T00:03:17.800419+00:00"}