{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:DQ4PIA4VUHVCKRPHALJPAXQSND","short_pith_number":"pith:DQ4PIA4V","schema_version":"1.0","canonical_sha256":"1c38f40395a1ea2545e702d2f05e1268e30ad89b1f09e2e9c3256b8dad40d809","source":{"kind":"arxiv","id":"2510.23818","version":2},"attestation_state":"computed","paper":{"title":"ScaLoRA: Optimally Scaled Low-Rank Adaptation for Efficient High-Rank Fine-Tuning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Georgios B. Giannakis, Xiaodong Yang, Yilang Zhang, Yiwei Cai","submitted_at":"2025-10-27T19:59:46Z","abstract_excerpt":"As large language models (LLMs) continue to scale in size, the computational overhead has become a major bottleneck for task-specific fine-tuning. While low-rank adaptation (LoRA) effectively curtails this cost by confining the weight updates to a low-dimensional subspace, such a restriction can hinder effectiveness and slow convergence. This contribution deals with these limitations by accumulating progressively a high-rank weight update from consecutive low-rank increments. Specifically, the per update optimal low-rank matrix is identified to minimize the loss function and closely approximat"},"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":"2510.23818","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-10-27T19:59:46Z","cross_cats_sorted":[],"title_canon_sha256":"1f1b40527a4170e6d332884a97e1e2cdb203417c4a198865c7b41f5763cf0c1a","abstract_canon_sha256":"1c3a4f19027077411f1630df07f80ad1889f7caa9c15764ca0b28bdb5a3f2924"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:00.967372Z","signature_b64":"vxNvtvUAsI57UJtbbbI8KCC4Yaa96f0rB3CjVJCQdeYQ583Ly1X1D9eK+uwRoz6gOAr7fwGWX08EzVSv+jmlAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c38f40395a1ea2545e702d2f05e1268e30ad89b1f09e2e9c3256b8dad40d809","last_reissued_at":"2026-05-17T23:39:00.966544Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:00.966544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ScaLoRA: Optimally Scaled Low-Rank Adaptation for Efficient High-Rank Fine-Tuning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Georgios B. Giannakis, Xiaodong Yang, Yilang Zhang, Yiwei Cai","submitted_at":"2025-10-27T19:59:46Z","abstract_excerpt":"As large language models (LLMs) continue to scale in size, the computational overhead has become a major bottleneck for task-specific fine-tuning. While low-rank adaptation (LoRA) effectively curtails this cost by confining the weight updates to a low-dimensional subspace, such a restriction can hinder effectiveness and slow convergence. This contribution deals with these limitations by accumulating progressively a high-rank weight update from consecutive low-rank increments. Specifically, the per update optimal low-rank matrix is identified to minimize the loss function and closely approximat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.23818","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":""},"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":"2510.23818","created_at":"2026-05-17T23:39:00.966672+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.23818v2","created_at":"2026-05-17T23:39:00.966672+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.23818","created_at":"2026-05-17T23:39:00.966672+00:00"},{"alias_kind":"pith_short_12","alias_value":"DQ4PIA4VUHVC","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"DQ4PIA4VUHVCKRPH","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"DQ4PIA4V","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.21905","citing_title":"Low-Rank Adaptation Redux for Large Models","ref_index":240,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DQ4PIA4VUHVCKRPHALJPAXQSND","json":"https://pith.science/pith/DQ4PIA4VUHVCKRPHALJPAXQSND.json","graph_json":"https://pith.science/api/pith-number/DQ4PIA4VUHVCKRPHALJPAXQSND/graph.json","events_json":"https://pith.science/api/pith-number/DQ4PIA4VUHVCKRPHALJPAXQSND/events.json","paper":"https://pith.science/paper/DQ4PIA4V"},"agent_actions":{"view_html":"https://pith.science/pith/DQ4PIA4VUHVCKRPHALJPAXQSND","download_json":"https://pith.science/pith/DQ4PIA4VUHVCKRPHALJPAXQSND.json","view_paper":"https://pith.science/paper/DQ4PIA4V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.23818&json=true","fetch_graph":"https://pith.science/api/pith-number/DQ4PIA4VUHVCKRPHALJPAXQSND/graph.json","fetch_events":"https://pith.science/api/pith-number/DQ4PIA4VUHVCKRPHALJPAXQSND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DQ4PIA4VUHVCKRPHALJPAXQSND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DQ4PIA4VUHVCKRPHALJPAXQSND/action/storage_attestation","attest_author":"https://pith.science/pith/DQ4PIA4VUHVCKRPHALJPAXQSND/action/author_attestation","sign_citation":"https://pith.science/pith/DQ4PIA4VUHVCKRPHALJPAXQSND/action/citation_signature","submit_replication":"https://pith.science/pith/DQ4PIA4VUHVCKRPHALJPAXQSND/action/replication_record"}},"created_at":"2026-05-17T23:39:00.966672+00:00","updated_at":"2026-05-17T23:39:00.966672+00:00"}