{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NKOBSWLPTFWFDCZSJMGVCJYJUB","short_pith_number":"pith:NKOBSWLP","schema_version":"1.0","canonical_sha256":"6a9c19596f996c518b324b0d512709a063fe7dbcb4f41dc55d428d30cd218077","source":{"kind":"arxiv","id":"2503.06982","version":1},"attestation_state":"computed","paper":{"title":"Understanding the Learning Dynamics of LoRA: A Gradient Flow Perspective on Low-Rank Adaptation in Matrix Factorization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Enrique Mallada, Hancheng Min, Jinqi Luo, Lachlan Ewen MacDonald, Rene Vidal, Salma Tarmoun, Ziqing Xu","submitted_at":"2025-03-10T06:57:10Z","abstract_excerpt":"Despite the empirical success of Low-Rank Adaptation (LoRA) in fine-tuning pre-trained models, there is little theoretical understanding of how first-order methods with carefully crafted initialization adapt models to new tasks. In this work, we take the first step towards bridging this gap by theoretically analyzing the learning dynamics of LoRA for matrix factorization (MF) under gradient flow (GF), emphasizing the crucial role of initialization. For small initialization, we theoretically show that GF converges to a neighborhood of the optimal solution, with smaller initialization leading to"},"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":"2503.06982","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-03-10T06:57:10Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d5112c6ded60ef0661b2a8cbf503c0424a6cc439692ed62f9f1ed2e9f106d82a","abstract_canon_sha256":"7d9d169da7f258511b9e22ee4dd894c2792ff4d9586b99ad7103fcaca653ee2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:27:47.101506Z","signature_b64":"JT6nmH7W0nm76tmK5C5x5VkLfQOr9WA725WZad9lzlqcHfKXhTFOiIMTkTT7MPUE92RhdgEGvoBOBDu+SbZXCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a9c19596f996c518b324b0d512709a063fe7dbcb4f41dc55d428d30cd218077","last_reissued_at":"2026-07-05T10:27:47.100969Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:27:47.100969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Understanding the Learning Dynamics of LoRA: A Gradient Flow Perspective on Low-Rank Adaptation in Matrix Factorization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Enrique Mallada, Hancheng Min, Jinqi Luo, Lachlan Ewen MacDonald, Rene Vidal, Salma Tarmoun, Ziqing Xu","submitted_at":"2025-03-10T06:57:10Z","abstract_excerpt":"Despite the empirical success of Low-Rank Adaptation (LoRA) in fine-tuning pre-trained models, there is little theoretical understanding of how first-order methods with carefully crafted initialization adapt models to new tasks. In this work, we take the first step towards bridging this gap by theoretically analyzing the learning dynamics of LoRA for matrix factorization (MF) under gradient flow (GF), emphasizing the crucial role of initialization. For small initialization, we theoretically show that GF converges to a neighborhood of the optimal solution, with smaller initialization leading to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.06982","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/2503.06982/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":"2503.06982","created_at":"2026-07-05T10:27:47.101028+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.06982v1","created_at":"2026-07-05T10:27:47.101028+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.06982","created_at":"2026-07-05T10:27:47.101028+00:00"},{"alias_kind":"pith_short_12","alias_value":"NKOBSWLPTFWF","created_at":"2026-07-05T10:27:47.101028+00:00"},{"alias_kind":"pith_short_16","alias_value":"NKOBSWLPTFWFDCZS","created_at":"2026-07-05T10:27:47.101028+00:00"},{"alias_kind":"pith_short_8","alias_value":"NKOBSWLP","created_at":"2026-07-05T10:27:47.101028+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.05899","citing_title":"High-Dimensional Theory of LoRA Fine-Tuning in a Solvable Attention Model","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08846","citing_title":"Dictionary-Aligned Concept Control for Safeguarding Multimodal LLMs","ref_index":114,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NKOBSWLPTFWFDCZSJMGVCJYJUB","json":"https://pith.science/pith/NKOBSWLPTFWFDCZSJMGVCJYJUB.json","graph_json":"https://pith.science/api/pith-number/NKOBSWLPTFWFDCZSJMGVCJYJUB/graph.json","events_json":"https://pith.science/api/pith-number/NKOBSWLPTFWFDCZSJMGVCJYJUB/events.json","paper":"https://pith.science/paper/NKOBSWLP"},"agent_actions":{"view_html":"https://pith.science/pith/NKOBSWLPTFWFDCZSJMGVCJYJUB","download_json":"https://pith.science/pith/NKOBSWLPTFWFDCZSJMGVCJYJUB.json","view_paper":"https://pith.science/paper/NKOBSWLP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.06982&json=true","fetch_graph":"https://pith.science/api/pith-number/NKOBSWLPTFWFDCZSJMGVCJYJUB/graph.json","fetch_events":"https://pith.science/api/pith-number/NKOBSWLPTFWFDCZSJMGVCJYJUB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NKOBSWLPTFWFDCZSJMGVCJYJUB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NKOBSWLPTFWFDCZSJMGVCJYJUB/action/storage_attestation","attest_author":"https://pith.science/pith/NKOBSWLPTFWFDCZSJMGVCJYJUB/action/author_attestation","sign_citation":"https://pith.science/pith/NKOBSWLPTFWFDCZSJMGVCJYJUB/action/citation_signature","submit_replication":"https://pith.science/pith/NKOBSWLPTFWFDCZSJMGVCJYJUB/action/replication_record"}},"created_at":"2026-07-05T10:27:47.101028+00:00","updated_at":"2026-07-05T10:27:47.101028+00:00"}