{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:QRLTVU7ZECX2BYOEXONX7YELH6","short_pith_number":"pith:QRLTVU7Z","schema_version":"1.0","canonical_sha256":"84573ad3f920afa0e1c4bb9b7fe08b3f963b620ecd06af949686ee452f438c72","source":{"kind":"arxiv","id":"2310.17513","version":3},"attestation_state":"computed","paper":{"title":"The Expressive Power of Low-Rank Adaptation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Kangwook Lee, Yuchen Zeng","submitted_at":"2023-10-26T16:08:33Z","abstract_excerpt":"Low-Rank Adaptation (LoRA), a parameter-efficient fine-tuning method that leverages low-rank adaptation of weight matrices, has emerged as a prevalent technique for fine-tuning pre-trained models such as large language models and diffusion models. Despite its huge success in practice, the theoretical underpinnings of LoRA have largely remained unexplored. This paper takes the first step to bridge this gap by theoretically analyzing the expressive power of LoRA. We prove that, for fully connected neural networks, LoRA can adapt any model $f$ to accurately represent any smaller target model $\\ov"},"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":"2310.17513","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-26T16:08:33Z","cross_cats_sorted":["cs.AI","cs.CL","stat.ML"],"title_canon_sha256":"0175515db0d4d0d31659bd23b17150ecc7f159b5995747b2cabddf8ad1174566","abstract_canon_sha256":"0badba7f391c4f445896617adbe3cfaa6d58887ed263b009b8da48f73f111150"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:56:55.592738Z","signature_b64":"dOWxa7ZQE2blZQgt6UKijqbkLCiEACZdNJO/5PyN49Nl3Vjnj8O84Ar3HzksAeI1EeejbjsAQsy12m+d2eN1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84573ad3f920afa0e1c4bb9b7fe08b3f963b620ecd06af949686ee452f438c72","last_reissued_at":"2026-07-05T07:56:55.592266Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:56:55.592266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Expressive Power of Low-Rank Adaptation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Kangwook Lee, Yuchen Zeng","submitted_at":"2023-10-26T16:08:33Z","abstract_excerpt":"Low-Rank Adaptation (LoRA), a parameter-efficient fine-tuning method that leverages low-rank adaptation of weight matrices, has emerged as a prevalent technique for fine-tuning pre-trained models such as large language models and diffusion models. Despite its huge success in practice, the theoretical underpinnings of LoRA have largely remained unexplored. This paper takes the first step to bridge this gap by theoretically analyzing the expressive power of LoRA. We prove that, for fully connected neural networks, LoRA can adapt any model $f$ to accurately represent any smaller target model $\\ov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.17513","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/2310.17513/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":"2310.17513","created_at":"2026-07-05T07:56:55.592324+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.17513v3","created_at":"2026-07-05T07:56:55.592324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.17513","created_at":"2026-07-05T07:56:55.592324+00:00"},{"alias_kind":"pith_short_12","alias_value":"QRLTVU7ZECX2","created_at":"2026-07-05T07:56:55.592324+00:00"},{"alias_kind":"pith_short_16","alias_value":"QRLTVU7ZECX2BYOE","created_at":"2026-07-05T07:56:55.592324+00:00"},{"alias_kind":"pith_short_8","alias_value":"QRLTVU7Z","created_at":"2026-07-05T07:56:55.592324+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21935","citing_title":"CoRDE: Concept-Prior Routed Diffusion Experts for Structural Generalization in Robot Manipulation","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2606.06814","citing_title":"The Effect of Training Task Diversity on In-Context Learning through the Lens of Low-Dimensional Subspaces","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2606.05899","citing_title":"High-Dimensional Theory of LoRA Fine-Tuning in a Solvable Attention Model","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2606.04754","citing_title":"Beyond Structural Symmetries: Linear Mode Connectivity via Neuron Identifiability","ref_index":78,"is_internal_anchor":false},{"citing_arxiv_id":"2606.31397","citing_title":"Mixture-of-Control: State-Aware Fine-Tuning for Transformer-based Models","ref_index":96,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04079","citing_title":"Efficient Handwriting-Based Alzheimer,s Disease Diagnosis Using a Low-Rank Mixture of Experts Deep Learning Framework","ref_index":29,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QRLTVU7ZECX2BYOEXONX7YELH6","json":"https://pith.science/pith/QRLTVU7ZECX2BYOEXONX7YELH6.json","graph_json":"https://pith.science/api/pith-number/QRLTVU7ZECX2BYOEXONX7YELH6/graph.json","events_json":"https://pith.science/api/pith-number/QRLTVU7ZECX2BYOEXONX7YELH6/events.json","paper":"https://pith.science/paper/QRLTVU7Z"},"agent_actions":{"view_html":"https://pith.science/pith/QRLTVU7ZECX2BYOEXONX7YELH6","download_json":"https://pith.science/pith/QRLTVU7ZECX2BYOEXONX7YELH6.json","view_paper":"https://pith.science/paper/QRLTVU7Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.17513&json=true","fetch_graph":"https://pith.science/api/pith-number/QRLTVU7ZECX2BYOEXONX7YELH6/graph.json","fetch_events":"https://pith.science/api/pith-number/QRLTVU7ZECX2BYOEXONX7YELH6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QRLTVU7ZECX2BYOEXONX7YELH6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QRLTVU7ZECX2BYOEXONX7YELH6/action/storage_attestation","attest_author":"https://pith.science/pith/QRLTVU7ZECX2BYOEXONX7YELH6/action/author_attestation","sign_citation":"https://pith.science/pith/QRLTVU7ZECX2BYOEXONX7YELH6/action/citation_signature","submit_replication":"https://pith.science/pith/QRLTVU7ZECX2BYOEXONX7YELH6/action/replication_record"}},"created_at":"2026-07-05T07:56:55.592324+00:00","updated_at":"2026-07-05T07:56:55.592324+00:00"}