{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:RMW47YIMMSZRJS7EZQTY3BSHEX","short_pith_number":"pith:RMW47YIM","schema_version":"1.0","canonical_sha256":"8b2dcfe10c64b314cbe4cc278d864725da076849af636790b8116d51093a46eb","source":{"kind":"arxiv","id":"2403.13269","version":3},"attestation_state":"computed","paper":{"title":"AFLoRA: Adaptive Freezing of Low Rank Adaptation in Parameter Efficient Fine-Tuning of Large Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Anni Li, Junrui Wan, Lianghao Jiang, Peter Anthony Beerel, Souvik Kundu, Zeyu Liu","submitted_at":"2024-03-20T03:07:50Z","abstract_excerpt":"We present a novel Parameter-Efficient Fine-Tuning (PEFT) method, dubbed as Adaptive Freezing of Low Rank Adaptation (AFLoRA). Specifically, for each pre-trained frozen weight tensor, we add a parallel path of trainable low-rank matrices, namely a down-projection and an up-projection matrix, each of which is followed by a feature transformation vector. Based on a novel freezing score, we the incrementally freeze these projection matrices during fine-tuning to reduce the computation and alleviate over-fitting. Our experimental results demonstrate that we can achieve state-of-the-art performance"},"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":"2403.13269","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-03-20T03:07:50Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"23eaecf73a6c94b831f0326dc6ecdebdac57fc20ff060c6856584d45d2e14b2f","abstract_canon_sha256":"13ef398d9e9b97aad1f2ac1c2566dfef1b3c333594fb609399c51afeb3dbb42a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:08:41.232876Z","signature_b64":"Qs8atdGYO/69CKJ0HsNmdAiG8y/WHq94mILUpZs3TYeLD51EbQ8CCK3n8Lsct/4wthzbCSK2q8XubLW3QTNZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b2dcfe10c64b314cbe4cc278d864725da076849af636790b8116d51093a46eb","last_reissued_at":"2026-07-05T08:08:41.232404Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:08:41.232404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AFLoRA: Adaptive Freezing of Low Rank Adaptation in Parameter Efficient Fine-Tuning of Large Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Anni Li, Junrui Wan, Lianghao Jiang, Peter Anthony Beerel, Souvik Kundu, Zeyu Liu","submitted_at":"2024-03-20T03:07:50Z","abstract_excerpt":"We present a novel Parameter-Efficient Fine-Tuning (PEFT) method, dubbed as Adaptive Freezing of Low Rank Adaptation (AFLoRA). Specifically, for each pre-trained frozen weight tensor, we add a parallel path of trainable low-rank matrices, namely a down-projection and an up-projection matrix, each of which is followed by a feature transformation vector. Based on a novel freezing score, we the incrementally freeze these projection matrices during fine-tuning to reduce the computation and alleviate over-fitting. Our experimental results demonstrate that we can achieve state-of-the-art performance"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.13269","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/2403.13269/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":"2403.13269","created_at":"2026-07-05T08:08:41.232460+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.13269v3","created_at":"2026-07-05T08:08:41.232460+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.13269","created_at":"2026-07-05T08:08:41.232460+00:00"},{"alias_kind":"pith_short_12","alias_value":"RMW47YIMMSZR","created_at":"2026-07-05T08:08:41.232460+00:00"},{"alias_kind":"pith_short_16","alias_value":"RMW47YIMMSZRJS7E","created_at":"2026-07-05T08:08:41.232460+00:00"},{"alias_kind":"pith_short_8","alias_value":"RMW47YIM","created_at":"2026-07-05T08:08:41.232460+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.02829","citing_title":"Compress Then Adapt? No, Do It Together via Task-aware Union of Subspaces","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RMW47YIMMSZRJS7EZQTY3BSHEX","json":"https://pith.science/pith/RMW47YIMMSZRJS7EZQTY3BSHEX.json","graph_json":"https://pith.science/api/pith-number/RMW47YIMMSZRJS7EZQTY3BSHEX/graph.json","events_json":"https://pith.science/api/pith-number/RMW47YIMMSZRJS7EZQTY3BSHEX/events.json","paper":"https://pith.science/paper/RMW47YIM"},"agent_actions":{"view_html":"https://pith.science/pith/RMW47YIMMSZRJS7EZQTY3BSHEX","download_json":"https://pith.science/pith/RMW47YIMMSZRJS7EZQTY3BSHEX.json","view_paper":"https://pith.science/paper/RMW47YIM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.13269&json=true","fetch_graph":"https://pith.science/api/pith-number/RMW47YIMMSZRJS7EZQTY3BSHEX/graph.json","fetch_events":"https://pith.science/api/pith-number/RMW47YIMMSZRJS7EZQTY3BSHEX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RMW47YIMMSZRJS7EZQTY3BSHEX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RMW47YIMMSZRJS7EZQTY3BSHEX/action/storage_attestation","attest_author":"https://pith.science/pith/RMW47YIMMSZRJS7EZQTY3BSHEX/action/author_attestation","sign_citation":"https://pith.science/pith/RMW47YIMMSZRJS7EZQTY3BSHEX/action/citation_signature","submit_replication":"https://pith.science/pith/RMW47YIMMSZRJS7EZQTY3BSHEX/action/replication_record"}},"created_at":"2026-07-05T08:08:41.232460+00:00","updated_at":"2026-07-05T08:08:41.232460+00:00"}