{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6NW7ARLRISRBXSVJLMH4BZF5WX","short_pith_number":"pith:6NW7ARLR","schema_version":"1.0","canonical_sha256":"f36df0457144a21bcaa95b0fc0e4bdb5f323cead1159017193f5a7a984eac1b2","source":{"kind":"arxiv","id":"2407.18242","version":3},"attestation_state":"computed","paper":{"title":"LoRA-Pro: Are Low-Rank Adapters Properly Optimized?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Jian Liang, Ran He, Tieniu Tan, Zhengbo Wang, Zilei Wang","submitted_at":"2024-07-25T17:57:12Z","abstract_excerpt":"Low-rank adaptation, also known as LoRA, has emerged as a prominent method for parameter-efficient fine-tuning of foundation models. Despite its computational efficiency, LoRA still yields inferior performance compared to full fine-tuning. In this paper, we first uncover a fundamental connection between the optimization processes of LoRA and full fine-tuning: using LoRA for optimization is mathematically equivalent to full fine-tuning using a low-rank gradient for parameter updates. And this low-rank gradient can be expressed in terms of the gradients of the two low-rank matrices in LoRA. Leve"},"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":"2407.18242","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-07-25T17:57:12Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"43647d1a8c70ad82d3d37ea696ccb7aac4a6447a3f5ad72bb37b8ee2217fc898","abstract_canon_sha256":"ee2ae20354c9949c60ce8780122a36c9ba51d89ea2c369fc7ed9ceb3c541ce3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:37:31.337340Z","signature_b64":"BpVu+FmlGKGq9Jueao1KWN2a2QHWKgTec1+ToTQ+0c7/Ov/qzOWjVhF44cBEr28RlH9eYMSPCROZBzdyq9qgBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f36df0457144a21bcaa95b0fc0e4bdb5f323cead1159017193f5a7a984eac1b2","last_reissued_at":"2026-07-05T10:37:31.336341Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:37:31.336341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LoRA-Pro: Are Low-Rank Adapters Properly Optimized?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Jian Liang, Ran He, Tieniu Tan, Zhengbo Wang, Zilei Wang","submitted_at":"2024-07-25T17:57:12Z","abstract_excerpt":"Low-rank adaptation, also known as LoRA, has emerged as a prominent method for parameter-efficient fine-tuning of foundation models. Despite its computational efficiency, LoRA still yields inferior performance compared to full fine-tuning. In this paper, we first uncover a fundamental connection between the optimization processes of LoRA and full fine-tuning: using LoRA for optimization is mathematically equivalent to full fine-tuning using a low-rank gradient for parameter updates. And this low-rank gradient can be expressed in terms of the gradients of the two low-rank matrices in LoRA. Leve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.18242","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/2407.18242/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":"2407.18242","created_at":"2026-07-05T10:37:31.336453+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.18242v3","created_at":"2026-07-05T10:37:31.336453+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.18242","created_at":"2026-07-05T10:37:31.336453+00:00"},{"alias_kind":"pith_short_12","alias_value":"6NW7ARLRISRB","created_at":"2026-07-05T10:37:31.336453+00:00"},{"alias_kind":"pith_short_16","alias_value":"6NW7ARLRISRBXSVJ","created_at":"2026-07-05T10:37:31.336453+00:00"},{"alias_kind":"pith_short_8","alias_value":"6NW7ARLR","created_at":"2026-07-05T10:37:31.336453+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.14970","citing_title":"Zero-order Parameter-free Optimization for LMO-based Methods: Novel Approach for Efficient Fine-tuning","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2605.29460","citing_title":"FedSmoothLoRA: Toward Smoother and Faster Convergence in Federated Low-Rank Adaptation","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26388","citing_title":"SplitFT: An Adaptive Federated Split Learning System For LLMs Fine-Tuning","ref_index":50,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17051","citing_title":"Efficient Task Adaptation in Large Language Models via Selective Parameter Optimization","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6NW7ARLRISRBXSVJLMH4BZF5WX","json":"https://pith.science/pith/6NW7ARLRISRBXSVJLMH4BZF5WX.json","graph_json":"https://pith.science/api/pith-number/6NW7ARLRISRBXSVJLMH4BZF5WX/graph.json","events_json":"https://pith.science/api/pith-number/6NW7ARLRISRBXSVJLMH4BZF5WX/events.json","paper":"https://pith.science/paper/6NW7ARLR"},"agent_actions":{"view_html":"https://pith.science/pith/6NW7ARLRISRBXSVJLMH4BZF5WX","download_json":"https://pith.science/pith/6NW7ARLRISRBXSVJLMH4BZF5WX.json","view_paper":"https://pith.science/paper/6NW7ARLR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.18242&json=true","fetch_graph":"https://pith.science/api/pith-number/6NW7ARLRISRBXSVJLMH4BZF5WX/graph.json","fetch_events":"https://pith.science/api/pith-number/6NW7ARLRISRBXSVJLMH4BZF5WX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6NW7ARLRISRBXSVJLMH4BZF5WX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6NW7ARLRISRBXSVJLMH4BZF5WX/action/storage_attestation","attest_author":"https://pith.science/pith/6NW7ARLRISRBXSVJLMH4BZF5WX/action/author_attestation","sign_citation":"https://pith.science/pith/6NW7ARLRISRBXSVJLMH4BZF5WX/action/citation_signature","submit_replication":"https://pith.science/pith/6NW7ARLRISRBXSVJLMH4BZF5WX/action/replication_record"}},"created_at":"2026-07-05T10:37:31.336453+00:00","updated_at":"2026-07-05T10:37:31.336453+00:00"}