{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:S7TZDDARS7ILK3QXUAAOIYWVB5","short_pith_number":"pith:S7TZDDAR","schema_version":"1.0","canonical_sha256":"97e7918c1197d0b56e17a000e462d50f77493f763276ac4338f4bf47f2de15a9","source":{"kind":"arxiv","id":"2405.17604","version":3},"attestation_state":"computed","paper":{"title":"LoRA-XS: Low-Rank Adaptation with Extremely Small Number of Parameters","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Jacek Tabor, Karl Aberer, Klaudia Ba{\\l}azy, Mohammadreza Banaei","submitted_at":"2024-05-27T19:07:13Z","abstract_excerpt":"The growth of large language models underscores the need for parameter-efficient fine-tuning. Despite its popularity, LoRA encounters storage and computational challenges when deploying multiple task- or user-specific modules. To address this, we introduce LoRA-XS, a novel fine-tuning method backed by a theoretical derivation. LoRA-XS drastically reduces trainable parameters by incorporating a small, trainable weight matrix between frozen low-rank matrices derived from the Singular Value Decomposition of pre-trained weights. This design enables LoRA-XS to reduce storage requirements by over 10"},"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":"2405.17604","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-05-27T19:07:13Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"558eb99a3579427c1daf3b42cef4fa54dacf377fefc656746256b9260fd124f5","abstract_canon_sha256":"657c8ddac3fa165ee74dccbcd08d83a2b880549a9d25990bc249f4818352b244"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:56:14.308847Z","signature_b64":"AJTj24DahfZnwB5Dk7AZ1rnKVzLpPlALcn6knP/ocG+84YaYG/bF+xQDe+7YRQ90zJSkd+SL8qTcuo6SOR+wDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97e7918c1197d0b56e17a000e462d50f77493f763276ac4338f4bf47f2de15a9","last_reissued_at":"2026-07-05T11:56:14.308333Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:56:14.308333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LoRA-XS: Low-Rank Adaptation with Extremely Small Number of Parameters","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Jacek Tabor, Karl Aberer, Klaudia Ba{\\l}azy, Mohammadreza Banaei","submitted_at":"2024-05-27T19:07:13Z","abstract_excerpt":"The growth of large language models underscores the need for parameter-efficient fine-tuning. Despite its popularity, LoRA encounters storage and computational challenges when deploying multiple task- or user-specific modules. To address this, we introduce LoRA-XS, a novel fine-tuning method backed by a theoretical derivation. LoRA-XS drastically reduces trainable parameters by incorporating a small, trainable weight matrix between frozen low-rank matrices derived from the Singular Value Decomposition of pre-trained weights. This design enables LoRA-XS to reduce storage requirements by over 10"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.17604","kind":"arxiv","version":3},"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/2405.17604/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":"2405.17604","created_at":"2026-07-05T11:56:14.308396+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.17604v3","created_at":"2026-07-05T11:56:14.308396+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.17604","created_at":"2026-07-05T11:56:14.308396+00:00"},{"alias_kind":"pith_short_12","alias_value":"S7TZDDARS7IL","created_at":"2026-07-05T11:56:14.308396+00:00"},{"alias_kind":"pith_short_16","alias_value":"S7TZDDARS7ILK3QX","created_at":"2026-07-05T11:56:14.308396+00:00"},{"alias_kind":"pith_short_8","alias_value":"S7TZDDAR","created_at":"2026-07-05T11:56:14.308396+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.12883","citing_title":"The Hidden Power of Scaling Factor in LoRA Optimization","ref_index":75,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15916","citing_title":"LoCO: Low-rank Compositional Rotation Fine-tuning","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11872","citing_title":"LOFT: Low-Rank Orthogonal Fine-Tuning via Task-Aware Support Selection","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27308","citing_title":"BoostLoRA: Growing Effective Rank by Boosting Adapters","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08174","citing_title":"CERSA: Cumulative Energy-Retaining Subspace Adaptation for Memory-Efficient Fine-Tuning","ref_index":48,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21901","citing_title":"GiVA: Gradient-Informed Bases for Vector-Based Adaptation","ref_index":60,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07706","citing_title":"Bayesian Fine-tuning in Projected Subspaces","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S7TZDDARS7ILK3QXUAAOIYWVB5","json":"https://pith.science/pith/S7TZDDARS7ILK3QXUAAOIYWVB5.json","graph_json":"https://pith.science/api/pith-number/S7TZDDARS7ILK3QXUAAOIYWVB5/graph.json","events_json":"https://pith.science/api/pith-number/S7TZDDARS7ILK3QXUAAOIYWVB5/events.json","paper":"https://pith.science/paper/S7TZDDAR"},"agent_actions":{"view_html":"https://pith.science/pith/S7TZDDARS7ILK3QXUAAOIYWVB5","download_json":"https://pith.science/pith/S7TZDDARS7ILK3QXUAAOIYWVB5.json","view_paper":"https://pith.science/paper/S7TZDDAR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.17604&json=true","fetch_graph":"https://pith.science/api/pith-number/S7TZDDARS7ILK3QXUAAOIYWVB5/graph.json","fetch_events":"https://pith.science/api/pith-number/S7TZDDARS7ILK3QXUAAOIYWVB5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S7TZDDARS7ILK3QXUAAOIYWVB5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S7TZDDARS7ILK3QXUAAOIYWVB5/action/storage_attestation","attest_author":"https://pith.science/pith/S7TZDDARS7ILK3QXUAAOIYWVB5/action/author_attestation","sign_citation":"https://pith.science/pith/S7TZDDARS7ILK3QXUAAOIYWVB5/action/citation_signature","submit_replication":"https://pith.science/pith/S7TZDDARS7ILK3QXUAAOIYWVB5/action/replication_record"}},"created_at":"2026-07-05T11:56:14.308396+00:00","updated_at":"2026-07-05T11:56:14.308396+00:00"}