{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:K7H4TONGXZSBCIPVEWXM6RUGE6","short_pith_number":"pith:K7H4TONG","schema_version":"1.0","canonical_sha256":"57cfc9b9a6be641121f525aecf468627a92d0885e9c56fcca6ad665ecafa21c0","source":{"kind":"arxiv","id":"2407.05000","version":2},"attestation_state":"computed","paper":{"title":"LoRA-GA: Low-Rank Adaptation with Gradient Approximation","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Jian Li, Linxi Yu, Shaowen Wang","submitted_at":"2024-07-06T08:37:21Z","abstract_excerpt":"Fine-tuning large-scale pretrained models is prohibitively expensive in terms of computational and memory costs. LoRA, as one of the most popular Parameter-Efficient Fine-Tuning (PEFT) methods, offers a cost-effective alternative by fine-tuning an auxiliary low-rank model that has significantly fewer parameters. Although LoRA reduces the computational and memory requirements significantly at each iteration, extensive empirical evidence indicates that it converges at a considerably slower rate compared to full fine-tuning, ultimately leading to increased overall compute and often worse test per"},"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.05000","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2024-07-06T08:37:21Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"33feb2546a18123593eceda9e016fda20bebc02d77269d00bc6dff7a3308c8a1","abstract_canon_sha256":"db2f7819155cee6899819ac8570638ac6cd6e4cab714274905bb71dd5608af47"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:44:15.440791Z","signature_b64":"oipxliJuxonua4R+9fn+8Z+mIlNkP9HYk2MEbk/SWbEUR4jh/g003jMDD0U3vuaprx7TW5i/LSNDQCrbOS12Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57cfc9b9a6be641121f525aecf468627a92d0885e9c56fcca6ad665ecafa21c0","last_reissued_at":"2026-07-05T08:44:15.440354Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:44:15.440354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LoRA-GA: Low-Rank Adaptation with Gradient Approximation","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Jian Li, Linxi Yu, Shaowen Wang","submitted_at":"2024-07-06T08:37:21Z","abstract_excerpt":"Fine-tuning large-scale pretrained models is prohibitively expensive in terms of computational and memory costs. LoRA, as one of the most popular Parameter-Efficient Fine-Tuning (PEFT) methods, offers a cost-effective alternative by fine-tuning an auxiliary low-rank model that has significantly fewer parameters. Although LoRA reduces the computational and memory requirements significantly at each iteration, extensive empirical evidence indicates that it converges at a considerably slower rate compared to full fine-tuning, ultimately leading to increased overall compute and often worse test per"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.05000","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/2407.05000/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.05000","created_at":"2026-07-05T08:44:15.440412+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.05000v2","created_at":"2026-07-05T08:44:15.440412+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.05000","created_at":"2026-07-05T08:44:15.440412+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7H4TONGXZSB","created_at":"2026-07-05T08:44:15.440412+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7H4TONGXZSBCIPV","created_at":"2026-07-05T08:44:15.440412+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7H4TONG","created_at":"2026-07-05T08:44:15.440412+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.22019","citing_title":"Channel Location Constrains the Auditability of Subliminal Learning","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2606.02079","citing_title":"FACT: A Simple and Efficient Framework for Active Finetuning","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2605.29460","citing_title":"FedSmoothLoRA: Toward Smoother and Faster Convergence in Federated Low-Rank Adaptation","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2509.18629","citing_title":"HyperAdapt: Simple High-Rank Adaptation","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2604.13368","citing_title":"TLoRA+: A Low-Rank Parameter-Efficient Fine-Tuning Method for Large Language Models","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K7H4TONGXZSBCIPVEWXM6RUGE6","json":"https://pith.science/pith/K7H4TONGXZSBCIPVEWXM6RUGE6.json","graph_json":"https://pith.science/api/pith-number/K7H4TONGXZSBCIPVEWXM6RUGE6/graph.json","events_json":"https://pith.science/api/pith-number/K7H4TONGXZSBCIPVEWXM6RUGE6/events.json","paper":"https://pith.science/paper/K7H4TONG"},"agent_actions":{"view_html":"https://pith.science/pith/K7H4TONGXZSBCIPVEWXM6RUGE6","download_json":"https://pith.science/pith/K7H4TONGXZSBCIPVEWXM6RUGE6.json","view_paper":"https://pith.science/paper/K7H4TONG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.05000&json=true","fetch_graph":"https://pith.science/api/pith-number/K7H4TONGXZSBCIPVEWXM6RUGE6/graph.json","fetch_events":"https://pith.science/api/pith-number/K7H4TONGXZSBCIPVEWXM6RUGE6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7H4TONGXZSBCIPVEWXM6RUGE6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7H4TONGXZSBCIPVEWXM6RUGE6/action/storage_attestation","attest_author":"https://pith.science/pith/K7H4TONGXZSBCIPVEWXM6RUGE6/action/author_attestation","sign_citation":"https://pith.science/pith/K7H4TONGXZSBCIPVEWXM6RUGE6/action/citation_signature","submit_replication":"https://pith.science/pith/K7H4TONGXZSBCIPVEWXM6RUGE6/action/replication_record"}},"created_at":"2026-07-05T08:44:15.440412+00:00","updated_at":"2026-07-05T08:44:15.440412+00:00"}