{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OTN7JZ6VDBSMHDYTZLHMGD2KLR","short_pith_number":"pith:OTN7JZ6V","schema_version":"1.0","canonical_sha256":"74dbf4e7d51864c38f13cacec30f4a5c4356b1136283ba80438943a871b44e4a","source":{"kind":"arxiv","id":"2406.03136","version":2},"attestation_state":"computed","paper":{"title":"Computational Limits of Low-Rank Adaptation (LoRA) Fine-Tuning for Transformer Models","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.CC","stat.ML"],"primary_cat":"cs.LG","authors_text":"En-Jui Kuo, Han Liu, Jerry Yao-Chieh Hu, Maojiang Su, Zhao Song","submitted_at":"2024-06-05T10:44:08Z","abstract_excerpt":"We study the computational limits of Low-Rank Adaptation (LoRA) for finetuning transformer-based models using fine-grained complexity theory. Our key observation is that the existence of low-rank decompositions within the gradient computation of LoRA adaptation leads to possible algorithmic speedup. This allows us to (i) identify a phase transition behavior of efficiency assuming the Strong Exponential Time Hypothesis (SETH), and (ii) prove the existence of almost linear algorithms by controlling the LoRA update computation term by term. For the former, we identify a sharp transition in the ef"},"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":"2406.03136","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2024-06-05T10:44:08Z","cross_cats_sorted":["cs.AI","cs.CC","stat.ML"],"title_canon_sha256":"2b438bdae3b8ba65de851520a779998fb51556caabb9c873ed5adf968dd0f405","abstract_canon_sha256":"0a3535ae0773c98c6552e3e71035add9f7c3b6b1118d15d9a70420efc57382d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:49.365893Z","signature_b64":"pveEFaUu43sxx5f3g9JbNgbL0E6WYpfFV8YX33mPXViv5R2+LuLyxflHfdDqNH5gV0/y7VLI1VaujSD7WBcFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74dbf4e7d51864c38f13cacec30f4a5c4356b1136283ba80438943a871b44e4a","last_reissued_at":"2026-07-05T11:16:49.365300Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:49.365300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational Limits of Low-Rank Adaptation (LoRA) Fine-Tuning for Transformer Models","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.CC","stat.ML"],"primary_cat":"cs.LG","authors_text":"En-Jui Kuo, Han Liu, Jerry Yao-Chieh Hu, Maojiang Su, Zhao Song","submitted_at":"2024-06-05T10:44:08Z","abstract_excerpt":"We study the computational limits of Low-Rank Adaptation (LoRA) for finetuning transformer-based models using fine-grained complexity theory. Our key observation is that the existence of low-rank decompositions within the gradient computation of LoRA adaptation leads to possible algorithmic speedup. This allows us to (i) identify a phase transition behavior of efficiency assuming the Strong Exponential Time Hypothesis (SETH), and (ii) prove the existence of almost linear algorithms by controlling the LoRA update computation term by term. For the former, we identify a sharp transition in the ef"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.03136","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/2406.03136/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":"2406.03136","created_at":"2026-07-05T11:16:49.365382+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.03136v2","created_at":"2026-07-05T11:16:49.365382+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.03136","created_at":"2026-07-05T11:16:49.365382+00:00"},{"alias_kind":"pith_short_12","alias_value":"OTN7JZ6VDBSM","created_at":"2026-07-05T11:16:49.365382+00:00"},{"alias_kind":"pith_short_16","alias_value":"OTN7JZ6VDBSMHDYT","created_at":"2026-07-05T11:16:49.365382+00:00"},{"alias_kind":"pith_short_8","alias_value":"OTN7JZ6V","created_at":"2026-07-05T11:16:49.365382+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.16284","citing_title":"Only Large Weights (And Not Skip Connections) Can Prevent the Perils of Rank Collapse","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OTN7JZ6VDBSMHDYTZLHMGD2KLR","json":"https://pith.science/pith/OTN7JZ6VDBSMHDYTZLHMGD2KLR.json","graph_json":"https://pith.science/api/pith-number/OTN7JZ6VDBSMHDYTZLHMGD2KLR/graph.json","events_json":"https://pith.science/api/pith-number/OTN7JZ6VDBSMHDYTZLHMGD2KLR/events.json","paper":"https://pith.science/paper/OTN7JZ6V"},"agent_actions":{"view_html":"https://pith.science/pith/OTN7JZ6VDBSMHDYTZLHMGD2KLR","download_json":"https://pith.science/pith/OTN7JZ6VDBSMHDYTZLHMGD2KLR.json","view_paper":"https://pith.science/paper/OTN7JZ6V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.03136&json=true","fetch_graph":"https://pith.science/api/pith-number/OTN7JZ6VDBSMHDYTZLHMGD2KLR/graph.json","fetch_events":"https://pith.science/api/pith-number/OTN7JZ6VDBSMHDYTZLHMGD2KLR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OTN7JZ6VDBSMHDYTZLHMGD2KLR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OTN7JZ6VDBSMHDYTZLHMGD2KLR/action/storage_attestation","attest_author":"https://pith.science/pith/OTN7JZ6VDBSMHDYTZLHMGD2KLR/action/author_attestation","sign_citation":"https://pith.science/pith/OTN7JZ6VDBSMHDYTZLHMGD2KLR/action/citation_signature","submit_replication":"https://pith.science/pith/OTN7JZ6VDBSMHDYTZLHMGD2KLR/action/replication_record"}},"created_at":"2026-07-05T11:16:49.365382+00:00","updated_at":"2026-07-05T11:16:49.365382+00:00"}