{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LZHXRTPQFTEKHUIODTK6ZU33WA","short_pith_number":"pith:LZHXRTPQ","schema_version":"1.0","canonical_sha256":"5e4f78cdf02cc8a3d10e1cd5ecd37bb00bfe53521c2cc588f1807082228cfa1b","source":{"kind":"arxiv","id":"2409.14396","version":2},"attestation_state":"computed","paper":{"title":"Flat-LoRA: Low-Rank Adaptation over a Flat Loss Landscape","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Lifeng Shang, Tao Li, Xiaolin Huang, Yasheng Wang, Yujun Li, Zhengbao He","submitted_at":"2024-09-22T11:24:10Z","abstract_excerpt":"Fine-tuning large-scale pre-trained models is prohibitively expensive in terms of computation and memory costs. Low-Rank Adaptation (LoRA), a popular Parameter-Efficient Fine-Tuning (PEFT) method, offers an efficient solution by optimizing only low-rank matrices. Despite recent progress in improving LoRA's performance, the relationship between the LoRA optimization space and the full parameter space is often overlooked. A solution that appears flat in the loss landscape of the LoRA space may still exhibit sharp directions in the full parameter space, potentially compromising generalization. We"},"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":"2409.14396","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-09-22T11:24:10Z","cross_cats_sorted":[],"title_canon_sha256":"3a7400e818fd31700a745d29f2dcb4930a1b87133e7e0875e7eb0f8c5410914b","abstract_canon_sha256":"7616a205e5d11f23f597b195636fded87f384d9dc183a99bcaabc264bc4181d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:09:00.569754Z","signature_b64":"oRG5I9ai0TuAjtVbkUrYEbBlgQFiG0BvOQ4ZpJ7jnOnzJZ79T/SBCMHvj/PJUB57C5/OP4IXJlblx0SDlGUdCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e4f78cdf02cc8a3d10e1cd5ecd37bb00bfe53521c2cc588f1807082228cfa1b","last_reissued_at":"2026-07-05T11:09:00.569312Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:09:00.569312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flat-LoRA: Low-Rank Adaptation over a Flat Loss Landscape","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Lifeng Shang, Tao Li, Xiaolin Huang, Yasheng Wang, Yujun Li, Zhengbao He","submitted_at":"2024-09-22T11:24:10Z","abstract_excerpt":"Fine-tuning large-scale pre-trained models is prohibitively expensive in terms of computation and memory costs. Low-Rank Adaptation (LoRA), a popular Parameter-Efficient Fine-Tuning (PEFT) method, offers an efficient solution by optimizing only low-rank matrices. Despite recent progress in improving LoRA's performance, the relationship between the LoRA optimization space and the full parameter space is often overlooked. A solution that appears flat in the loss landscape of the LoRA space may still exhibit sharp directions in the full parameter space, potentially compromising generalization. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.14396","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.14396/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":"2409.14396","created_at":"2026-07-05T11:09:00.569382+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.14396v2","created_at":"2026-07-05T11:09:00.569382+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.14396","created_at":"2026-07-05T11:09:00.569382+00:00"},{"alias_kind":"pith_short_12","alias_value":"LZHXRTPQFTEK","created_at":"2026-07-05T11:09:00.569382+00:00"},{"alias_kind":"pith_short_16","alias_value":"LZHXRTPQFTEKHUIO","created_at":"2026-07-05T11:09:00.569382+00:00"},{"alias_kind":"pith_short_8","alias_value":"LZHXRTPQ","created_at":"2026-07-05T11:09:00.569382+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.12883","citing_title":"The Hidden Power of Scaling Factor in LoRA Optimization","ref_index":96,"is_internal_anchor":false},{"citing_arxiv_id":"2606.10488","citing_title":"5% > 100%: Flatness Preference is All You Need for Multimodal Parameter-Efficient Fine-Tuning","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13652","citing_title":"Beyond Perplexity: A Geometric and Spectral Study of Low-Rank Pre-Training","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13652","citing_title":"Beyond Perplexity: A Geometric and Spectral Study of Low-Rank Pre-Training","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2604.04516","citing_title":"GAIN: Multiplicative Modulation for Domain Adaptation","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LZHXRTPQFTEKHUIODTK6ZU33WA","json":"https://pith.science/pith/LZHXRTPQFTEKHUIODTK6ZU33WA.json","graph_json":"https://pith.science/api/pith-number/LZHXRTPQFTEKHUIODTK6ZU33WA/graph.json","events_json":"https://pith.science/api/pith-number/LZHXRTPQFTEKHUIODTK6ZU33WA/events.json","paper":"https://pith.science/paper/LZHXRTPQ"},"agent_actions":{"view_html":"https://pith.science/pith/LZHXRTPQFTEKHUIODTK6ZU33WA","download_json":"https://pith.science/pith/LZHXRTPQFTEKHUIODTK6ZU33WA.json","view_paper":"https://pith.science/paper/LZHXRTPQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.14396&json=true","fetch_graph":"https://pith.science/api/pith-number/LZHXRTPQFTEKHUIODTK6ZU33WA/graph.json","fetch_events":"https://pith.science/api/pith-number/LZHXRTPQFTEKHUIODTK6ZU33WA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LZHXRTPQFTEKHUIODTK6ZU33WA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LZHXRTPQFTEKHUIODTK6ZU33WA/action/storage_attestation","attest_author":"https://pith.science/pith/LZHXRTPQFTEKHUIODTK6ZU33WA/action/author_attestation","sign_citation":"https://pith.science/pith/LZHXRTPQFTEKHUIODTK6ZU33WA/action/citation_signature","submit_replication":"https://pith.science/pith/LZHXRTPQFTEKHUIODTK6ZU33WA/action/replication_record"}},"created_at":"2026-07-05T11:09:00.569382+00:00","updated_at":"2026-07-05T11:09:00.569382+00:00"}