{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GA5KJEDUCIFUAE2A575AWMYCJM","short_pith_number":"pith:GA5KJEDU","schema_version":"1.0","canonical_sha256":"303aa49074120b401340effa0b33024b3e56ddd13b2df7fd623c68ecb6433f92","source":{"kind":"arxiv","id":"2407.08056","version":2},"attestation_state":"computed","paper":{"title":"Pareto Low-Rank Adapters: Efficient Multi-Task Learning with Preferences","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Francois Fleuret, Nikolaos Dimitriadis, Pascal Frossard","submitted_at":"2024-07-10T21:25:51Z","abstract_excerpt":"Multi-task trade-offs in machine learning can be addressed via Pareto Front Learning (PFL) methods that parameterize the Pareto Front (PF) with a single model. PFL permits to select the desired operational point during inference, contrary to traditional Multi-Task Learning (MTL) that optimizes for a single trade-off decided prior to training. However, recent PFL methodologies suffer from limited scalability, slow convergence, and excessive memory requirements, while exhibiting inconsistent mappings from preference to objective space. We introduce PaLoRA, a novel parameter-efficient method that"},"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":false},"canonical_record":{"source":{"id":"2407.08056","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-07-10T21:25:51Z","cross_cats_sorted":[],"title_canon_sha256":"bb6e34c22b1e7fa20a4539de9fe050c264827e44e59466590281d3faaab9fbce","abstract_canon_sha256":"d59fa5fb484f4dd7d765da633876ed86202a700f140c4a38dd39f8198c2a6e63"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:20:13.616848Z","signature_b64":"8TmzbQ7+VomoukPL28KO60hMKUpeW70olOoCTf+pR9gX5LQ7S9PCCwOCFA3TC8SuiecYbyelE7ZDVoYKnB20Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"303aa49074120b401340effa0b33024b3e56ddd13b2df7fd623c68ecb6433f92","last_reissued_at":"2026-07-05T10:20:13.616336Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:20:13.616336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pareto Low-Rank Adapters: Efficient Multi-Task Learning with Preferences","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Francois Fleuret, Nikolaos Dimitriadis, Pascal Frossard","submitted_at":"2024-07-10T21:25:51Z","abstract_excerpt":"Multi-task trade-offs in machine learning can be addressed via Pareto Front Learning (PFL) methods that parameterize the Pareto Front (PF) with a single model. PFL permits to select the desired operational point during inference, contrary to traditional Multi-Task Learning (MTL) that optimizes for a single trade-off decided prior to training. However, recent PFL methodologies suffer from limited scalability, slow convergence, and excessive memory requirements, while exhibiting inconsistent mappings from preference to objective space. We introduce PaLoRA, a novel parameter-efficient method that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.08056","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.08056/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"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":"2407.08056","created_at":"2026-07-05T10:20:13.616398+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.08056v2","created_at":"2026-07-05T10:20:13.616398+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.08056","created_at":"2026-07-05T10:20:13.616398+00:00"},{"alias_kind":"pith_short_12","alias_value":"GA5KJEDUCIFU","created_at":"2026-07-05T10:20:13.616398+00:00"},{"alias_kind":"pith_short_16","alias_value":"GA5KJEDUCIFUAE2A","created_at":"2026-07-05T10:20:13.616398+00:00"},{"alias_kind":"pith_short_8","alias_value":"GA5KJEDU","created_at":"2026-07-05T10:20:13.616398+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.22602","citing_title":"One Rank at a Time: Cascading Error Dynamics in Sequential Learning","ref_index":85,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GA5KJEDUCIFUAE2A575AWMYCJM","json":"https://pith.science/pith/GA5KJEDUCIFUAE2A575AWMYCJM.json","graph_json":"https://pith.science/api/pith-number/GA5KJEDUCIFUAE2A575AWMYCJM/graph.json","events_json":"https://pith.science/api/pith-number/GA5KJEDUCIFUAE2A575AWMYCJM/events.json","paper":"https://pith.science/paper/GA5KJEDU"},"agent_actions":{"view_html":"https://pith.science/pith/GA5KJEDUCIFUAE2A575AWMYCJM","download_json":"https://pith.science/pith/GA5KJEDUCIFUAE2A575AWMYCJM.json","view_paper":"https://pith.science/paper/GA5KJEDU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.08056&json=true","fetch_graph":"https://pith.science/api/pith-number/GA5KJEDUCIFUAE2A575AWMYCJM/graph.json","fetch_events":"https://pith.science/api/pith-number/GA5KJEDUCIFUAE2A575AWMYCJM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GA5KJEDUCIFUAE2A575AWMYCJM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GA5KJEDUCIFUAE2A575AWMYCJM/action/storage_attestation","attest_author":"https://pith.science/pith/GA5KJEDUCIFUAE2A575AWMYCJM/action/author_attestation","sign_citation":"https://pith.science/pith/GA5KJEDUCIFUAE2A575AWMYCJM/action/citation_signature","submit_replication":"https://pith.science/pith/GA5KJEDUCIFUAE2A575AWMYCJM/action/replication_record"}},"created_at":"2026-07-05T10:20:13.616398+00:00","updated_at":"2026-07-05T10:20:13.616398+00:00"}