{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7II4CS2Z2J4CLNUHYAVOLLNRJC","short_pith_number":"pith:7II4CS2Z","schema_version":"1.0","canonical_sha256":"fa11c14b59d27825b687c02ae5adb148baa3cbc95898c256ab0b802a7514e587","source":{"kind":"arxiv","id":"2504.07448","version":2},"attestation_state":"computed","paper":{"title":"LoRI: Reducing Cross-Task Interference in Multi-Task Low-Rank Adaptation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Ashwinee Panda, Jiacheng You, Juzheng Zhang, Tom Goldstein","submitted_at":"2025-04-10T04:46:04Z","abstract_excerpt":"Low-Rank Adaptation (LoRA) has emerged as a popular parameter-efficient fine-tuning (PEFT) method for Large Language Models (LLMs), yet it still incurs notable overhead and suffers from parameter interference in multi-task scenarios. We propose LoRA with Reduced Interference (LoRI), a simple yet effective approach that freezes the projection matrices $A$ as random projections and sparsifies the matrices $B$ using task-specific masks. This design substantially reduces the number of trainable parameters while maintaining strong task performance. Moreover, LoRI minimizes cross-task interference i"},"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":"2504.07448","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-04-10T04:46:04Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"b66c443dfa65c15be8b872d7d8a3a95293c29210c290897bdda54a60c672e393","abstract_canon_sha256":"241145c45119ec0abef65be646c34679888de494856aa803ceb5d9910924a92f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:47:21.751913Z","signature_b64":"bxGqjormhm3Cx3dg2ouLLULj7Vy9H/0tUDU4520UnR/4jtLFr6o3I/HVSj46QRZ1VQz+hm0FBES82mrx/xHvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa11c14b59d27825b687c02ae5adb148baa3cbc95898c256ab0b802a7514e587","last_reissued_at":"2026-07-05T11:47:21.751411Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:47:21.751411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LoRI: Reducing Cross-Task Interference in Multi-Task Low-Rank Adaptation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Ashwinee Panda, Jiacheng You, Juzheng Zhang, Tom Goldstein","submitted_at":"2025-04-10T04:46:04Z","abstract_excerpt":"Low-Rank Adaptation (LoRA) has emerged as a popular parameter-efficient fine-tuning (PEFT) method for Large Language Models (LLMs), yet it still incurs notable overhead and suffers from parameter interference in multi-task scenarios. We propose LoRA with Reduced Interference (LoRI), a simple yet effective approach that freezes the projection matrices $A$ as random projections and sparsifies the matrices $B$ using task-specific masks. This design substantially reduces the number of trainable parameters while maintaining strong task performance. Moreover, LoRI minimizes cross-task interference i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.07448","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/2504.07448/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":"2504.07448","created_at":"2026-07-05T11:47:21.751472+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.07448v2","created_at":"2026-07-05T11:47:21.751472+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.07448","created_at":"2026-07-05T11:47:21.751472+00:00"},{"alias_kind":"pith_short_12","alias_value":"7II4CS2Z2J4C","created_at":"2026-07-05T11:47:21.751472+00:00"},{"alias_kind":"pith_short_16","alias_value":"7II4CS2Z2J4CLNUH","created_at":"2026-07-05T11:47:21.751472+00:00"},{"alias_kind":"pith_short_8","alias_value":"7II4CS2Z","created_at":"2026-07-05T11:47:21.751472+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.08197","citing_title":"AlignFed: Alignment-Aware Asynchronous Federated Fine-Tuning for Large Language Models in Heterogeneous Edge Environments","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2606.28117","citing_title":"When One Adapter Speaks for Many: Discovering Low-Rank Redundancy in Continual Fine-Tuning","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18795","citing_title":"HELLoRA: Hot Experts Layer-Level Low-Rank Adaptation for Mixture-of-Experts Models","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7II4CS2Z2J4CLNUHYAVOLLNRJC","json":"https://pith.science/pith/7II4CS2Z2J4CLNUHYAVOLLNRJC.json","graph_json":"https://pith.science/api/pith-number/7II4CS2Z2J4CLNUHYAVOLLNRJC/graph.json","events_json":"https://pith.science/api/pith-number/7II4CS2Z2J4CLNUHYAVOLLNRJC/events.json","paper":"https://pith.science/paper/7II4CS2Z"},"agent_actions":{"view_html":"https://pith.science/pith/7II4CS2Z2J4CLNUHYAVOLLNRJC","download_json":"https://pith.science/pith/7II4CS2Z2J4CLNUHYAVOLLNRJC.json","view_paper":"https://pith.science/paper/7II4CS2Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.07448&json=true","fetch_graph":"https://pith.science/api/pith-number/7II4CS2Z2J4CLNUHYAVOLLNRJC/graph.json","fetch_events":"https://pith.science/api/pith-number/7II4CS2Z2J4CLNUHYAVOLLNRJC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7II4CS2Z2J4CLNUHYAVOLLNRJC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7II4CS2Z2J4CLNUHYAVOLLNRJC/action/storage_attestation","attest_author":"https://pith.science/pith/7II4CS2Z2J4CLNUHYAVOLLNRJC/action/author_attestation","sign_citation":"https://pith.science/pith/7II4CS2Z2J4CLNUHYAVOLLNRJC/action/citation_signature","submit_replication":"https://pith.science/pith/7II4CS2Z2J4CLNUHYAVOLLNRJC/action/replication_record"}},"created_at":"2026-07-05T11:47:21.751472+00:00","updated_at":"2026-07-05T11:47:21.751472+00:00"}