{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:I3MA2CSQD42ZVIJUKU7XIWJEAJ","short_pith_number":"pith:I3MA2CSQ","schema_version":"1.0","canonical_sha256":"46d80d0a501f359aa134553f7459240271e95d7510d6785a6fb18d4c833ac3f0","source":{"kind":"arxiv","id":"2501.12067","version":1},"attestation_state":"computed","paper":{"title":"EDoRA: Efficient Weight-Decomposed Low-Rank Adaptation via Singular Value Decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Hamid Nasiri, Peter Garraghan","submitted_at":"2025-01-21T11:42:09Z","abstract_excerpt":"Parameter-efficient fine-tuning methods, such as LoRA, reduces the number of trainable parameters. However, they often suffer from scalability issues and differences between their learning pattern and full fine-tuning. To overcome these limitations, we propose Efficient Weight-Decomposed Low-Rank Adaptation (EDoRA): a novel PEFT method that decomposes pre-trained weights into magnitude and directional components. By freezing low-rank matrices, initializing them by singular value decomposition, and introducing a small trainable matrix between them, EDoRA achieves substantial reduction in traina"},"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":"2501.12067","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-21T11:42:09Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"228b839dff1101fc4f5fbd8cd87c0968e42d684836b6680a2cca437e4e1b3685","abstract_canon_sha256":"2c8b0ec29194d75893979d93abd9036fccfd53714dbc0af4255a61b36d33582e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:03:31.284219Z","signature_b64":"X8G8zp6OX3l6ZiAOIAdPzDHPDsZLxlApSumBd1hM4LVfqceQ6kUXf3kqtfs3uvY3b3piBD1L220xcwtR6J0KDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46d80d0a501f359aa134553f7459240271e95d7510d6785a6fb18d4c833ac3f0","last_reissued_at":"2026-07-05T10:03:31.283845Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:03:31.283845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EDoRA: Efficient Weight-Decomposed Low-Rank Adaptation via Singular Value Decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Hamid Nasiri, Peter Garraghan","submitted_at":"2025-01-21T11:42:09Z","abstract_excerpt":"Parameter-efficient fine-tuning methods, such as LoRA, reduces the number of trainable parameters. However, they often suffer from scalability issues and differences between their learning pattern and full fine-tuning. To overcome these limitations, we propose Efficient Weight-Decomposed Low-Rank Adaptation (EDoRA): a novel PEFT method that decomposes pre-trained weights into magnitude and directional components. By freezing low-rank matrices, initializing them by singular value decomposition, and introducing a small trainable matrix between them, EDoRA achieves substantial reduction in traina"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.12067","kind":"arxiv","version":1},"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/2501.12067/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":"2501.12067","created_at":"2026-07-05T10:03:31.283900+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.12067v1","created_at":"2026-07-05T10:03:31.283900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.12067","created_at":"2026-07-05T10:03:31.283900+00:00"},{"alias_kind":"pith_short_12","alias_value":"I3MA2CSQD42Z","created_at":"2026-07-05T10:03:31.283900+00:00"},{"alias_kind":"pith_short_16","alias_value":"I3MA2CSQD42ZVIJU","created_at":"2026-07-05T10:03:31.283900+00:00"},{"alias_kind":"pith_short_8","alias_value":"I3MA2CSQ","created_at":"2026-07-05T10:03:31.283900+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.01049","citing_title":"Taming LLMs by Scaling Learning Rates with Gradient Grouping","ref_index":61,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I3MA2CSQD42ZVIJUKU7XIWJEAJ","json":"https://pith.science/pith/I3MA2CSQD42ZVIJUKU7XIWJEAJ.json","graph_json":"https://pith.science/api/pith-number/I3MA2CSQD42ZVIJUKU7XIWJEAJ/graph.json","events_json":"https://pith.science/api/pith-number/I3MA2CSQD42ZVIJUKU7XIWJEAJ/events.json","paper":"https://pith.science/paper/I3MA2CSQ"},"agent_actions":{"view_html":"https://pith.science/pith/I3MA2CSQD42ZVIJUKU7XIWJEAJ","download_json":"https://pith.science/pith/I3MA2CSQD42ZVIJUKU7XIWJEAJ.json","view_paper":"https://pith.science/paper/I3MA2CSQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.12067&json=true","fetch_graph":"https://pith.science/api/pith-number/I3MA2CSQD42ZVIJUKU7XIWJEAJ/graph.json","fetch_events":"https://pith.science/api/pith-number/I3MA2CSQD42ZVIJUKU7XIWJEAJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I3MA2CSQD42ZVIJUKU7XIWJEAJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I3MA2CSQD42ZVIJUKU7XIWJEAJ/action/storage_attestation","attest_author":"https://pith.science/pith/I3MA2CSQD42ZVIJUKU7XIWJEAJ/action/author_attestation","sign_citation":"https://pith.science/pith/I3MA2CSQD42ZVIJUKU7XIWJEAJ/action/citation_signature","submit_replication":"https://pith.science/pith/I3MA2CSQD42ZVIJUKU7XIWJEAJ/action/replication_record"}},"created_at":"2026-07-05T10:03:31.283900+00:00","updated_at":"2026-07-05T10:03:31.283900+00:00"}