{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:63ZZGNIMZJ2DGUSUOMPBJTTRS4","short_pith_number":"pith:63ZZGNIM","schema_version":"1.0","canonical_sha256":"f6f393350cca74335254731e14ce71972e501b2fa03c2c7b49b5160a5b407b46","source":{"kind":"arxiv","id":"2410.10179","version":2},"attestation_state":"computed","paper":{"title":"Is Parameter Collision Hindering Continual Learning in LLMs?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Jia-Yu Yao, Kun-Peng Ning, Li Yuan, Shuo Yang, Yi-Bing Song, Yong-Hong Tian, Yu-Yang Liu","submitted_at":"2024-10-14T05:54:11Z","abstract_excerpt":"Large Language Models (LLMs) often suffer from catastrophic forgetting when learning multiple tasks sequentially, making continual learning (CL) essential for their dynamic deployment. Existing state-of-the-art (SOTA) methods, such as O-LoRA, typically focus on constructing orthogonality tasks to decouple parameter interdependence from various domains.In this paper, we reveal that building non-collision parameters is a more critical factor in addressing CL challenges. Our theoretical and experimental analyses demonstrate that non-collision parameters can provide better task orthogonality, whic"},"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":"2410.10179","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-14T05:54:11Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"2d7fa9d52eb779d8d4a8cdc8c53e2bef6a55ad4f66b62152a1cf71b461c9b539","abstract_canon_sha256":"8fd42e4ea27923c03e13a12f6f54245beed17eadf8d00e937d8fa1b15e5448a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:53:44.681257Z","signature_b64":"Gua7WoAN2qlHBtY6ubYJ66p6A727M1tf9nIfB16IFBb+vqh6BnFpYQrdD657ReJUH+vbBHtuHrlzILQkWwlfDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6f393350cca74335254731e14ce71972e501b2fa03c2c7b49b5160a5b407b46","last_reissued_at":"2026-07-05T09:53:44.680642Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:53:44.680642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Is Parameter Collision Hindering Continual Learning in LLMs?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Jia-Yu Yao, Kun-Peng Ning, Li Yuan, Shuo Yang, Yi-Bing Song, Yong-Hong Tian, Yu-Yang Liu","submitted_at":"2024-10-14T05:54:11Z","abstract_excerpt":"Large Language Models (LLMs) often suffer from catastrophic forgetting when learning multiple tasks sequentially, making continual learning (CL) essential for their dynamic deployment. Existing state-of-the-art (SOTA) methods, such as O-LoRA, typically focus on constructing orthogonality tasks to decouple parameter interdependence from various domains.In this paper, we reveal that building non-collision parameters is a more critical factor in addressing CL challenges. Our theoretical and experimental analyses demonstrate that non-collision parameters can provide better task orthogonality, whic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.10179","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/2410.10179/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":"2410.10179","created_at":"2026-07-05T09:53:44.680720+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.10179v2","created_at":"2026-07-05T09:53:44.680720+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.10179","created_at":"2026-07-05T09:53:44.680720+00:00"},{"alias_kind":"pith_short_12","alias_value":"63ZZGNIMZJ2D","created_at":"2026-07-05T09:53:44.680720+00:00"},{"alias_kind":"pith_short_16","alias_value":"63ZZGNIMZJ2DGUSU","created_at":"2026-07-05T09:53:44.680720+00:00"},{"alias_kind":"pith_short_8","alias_value":"63ZZGNIM","created_at":"2026-07-05T09:53:44.680720+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.03934","citing_title":"SelfAug: Mitigating Catastrophic Forgetting in Retrieval-Augmented Generation via Distribution Self-Alignment","ref_index":90,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/63ZZGNIMZJ2DGUSUOMPBJTTRS4","json":"https://pith.science/pith/63ZZGNIMZJ2DGUSUOMPBJTTRS4.json","graph_json":"https://pith.science/api/pith-number/63ZZGNIMZJ2DGUSUOMPBJTTRS4/graph.json","events_json":"https://pith.science/api/pith-number/63ZZGNIMZJ2DGUSUOMPBJTTRS4/events.json","paper":"https://pith.science/paper/63ZZGNIM"},"agent_actions":{"view_html":"https://pith.science/pith/63ZZGNIMZJ2DGUSUOMPBJTTRS4","download_json":"https://pith.science/pith/63ZZGNIMZJ2DGUSUOMPBJTTRS4.json","view_paper":"https://pith.science/paper/63ZZGNIM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.10179&json=true","fetch_graph":"https://pith.science/api/pith-number/63ZZGNIMZJ2DGUSUOMPBJTTRS4/graph.json","fetch_events":"https://pith.science/api/pith-number/63ZZGNIMZJ2DGUSUOMPBJTTRS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/63ZZGNIMZJ2DGUSUOMPBJTTRS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/63ZZGNIMZJ2DGUSUOMPBJTTRS4/action/storage_attestation","attest_author":"https://pith.science/pith/63ZZGNIMZJ2DGUSUOMPBJTTRS4/action/author_attestation","sign_citation":"https://pith.science/pith/63ZZGNIMZJ2DGUSUOMPBJTTRS4/action/citation_signature","submit_replication":"https://pith.science/pith/63ZZGNIMZJ2DGUSUOMPBJTTRS4/action/replication_record"}},"created_at":"2026-07-05T09:53:44.680720+00:00","updated_at":"2026-07-05T09:53:44.680720+00:00"}