{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6IQEAZF7E6LNKNL3QZHTGHTG66","short_pith_number":"pith:6IQEAZF7","schema_version":"1.0","canonical_sha256":"f2204064bf2796d5357b864f331e66f793dff0c2ae223c52ba61c679056458d5","source":{"kind":"arxiv","id":"2403.09113","version":2},"attestation_state":"computed","paper":{"title":"AutoLoRA: Automatically Tuning Matrix Ranks in Low-Rank Adaptation Based on Meta Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Pengtao Xie, Ruiyi Zhang, Rushi Qiang, Sai Ashish Somayajula","submitted_at":"2024-03-14T05:29:35Z","abstract_excerpt":"Large-scale pretraining followed by task-specific finetuning has achieved great success in various NLP tasks. Since finetuning all parameters of large pretrained models poses substantial computational and memory challenges, several efficient finetuning methods have been developed. Among them, low-rank adaptation (LoRA), which finetunes low-rank incremental update matrices on top of frozen pretrained weights, has proven particularly effective. Nonetheless, LoRA's uniform rank assignment across all layers, along with its reliance on an exhaustive search to find the best rank, leads to high compu"},"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.09113","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-03-14T05:29:35Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"ba5b636652e5275297b65eeca5e9d3766c97321e2e4f461a1df673c1369ddc00","abstract_canon_sha256":"49461fc7f97e1bae3e76487119599be9e9ed04280293234ec80374fbabfbd26a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:57:02.215473Z","signature_b64":"xaZbLDVmeUDiy1zJ6sJLyFtsPhItwebBpLkdYMtp42zUi0GCCyP/2uB8tvAqd3ibXeRRZTzdE66Y4ZJAiOJSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2204064bf2796d5357b864f331e66f793dff0c2ae223c52ba61c679056458d5","last_reissued_at":"2026-07-05T07:57:02.214959Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:57:02.214959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AutoLoRA: Automatically Tuning Matrix Ranks in Low-Rank Adaptation Based on Meta Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Pengtao Xie, Ruiyi Zhang, Rushi Qiang, Sai Ashish Somayajula","submitted_at":"2024-03-14T05:29:35Z","abstract_excerpt":"Large-scale pretraining followed by task-specific finetuning has achieved great success in various NLP tasks. Since finetuning all parameters of large pretrained models poses substantial computational and memory challenges, several efficient finetuning methods have been developed. Among them, low-rank adaptation (LoRA), which finetunes low-rank incremental update matrices on top of frozen pretrained weights, has proven particularly effective. Nonetheless, LoRA's uniform rank assignment across all layers, along with its reliance on an exhaustive search to find the best rank, leads to high compu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.09113","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/2403.09113/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.09113","created_at":"2026-07-05T07:57:02.215018+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.09113v2","created_at":"2026-07-05T07:57:02.215018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.09113","created_at":"2026-07-05T07:57:02.215018+00:00"},{"alias_kind":"pith_short_12","alias_value":"6IQEAZF7E6LN","created_at":"2026-07-05T07:57:02.215018+00:00"},{"alias_kind":"pith_short_16","alias_value":"6IQEAZF7E6LNKNL3","created_at":"2026-07-05T07:57:02.215018+00:00"},{"alias_kind":"pith_short_8","alias_value":"6IQEAZF7","created_at":"2026-07-05T07:57:02.215018+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.29184","citing_title":"BaRA: Bayesian Adaptive Rank Allocation for Parameter-Efficient Fine-Tuning","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2403.14608","citing_title":"Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Survey","ref_index":86,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07850","citing_title":"MatryoshkaLoRA: Learning Accurate Hierarchical Low-Rank Representations for LLM Fine-Tuning","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6IQEAZF7E6LNKNL3QZHTGHTG66","json":"https://pith.science/pith/6IQEAZF7E6LNKNL3QZHTGHTG66.json","graph_json":"https://pith.science/api/pith-number/6IQEAZF7E6LNKNL3QZHTGHTG66/graph.json","events_json":"https://pith.science/api/pith-number/6IQEAZF7E6LNKNL3QZHTGHTG66/events.json","paper":"https://pith.science/paper/6IQEAZF7"},"agent_actions":{"view_html":"https://pith.science/pith/6IQEAZF7E6LNKNL3QZHTGHTG66","download_json":"https://pith.science/pith/6IQEAZF7E6LNKNL3QZHTGHTG66.json","view_paper":"https://pith.science/paper/6IQEAZF7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.09113&json=true","fetch_graph":"https://pith.science/api/pith-number/6IQEAZF7E6LNKNL3QZHTGHTG66/graph.json","fetch_events":"https://pith.science/api/pith-number/6IQEAZF7E6LNKNL3QZHTGHTG66/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6IQEAZF7E6LNKNL3QZHTGHTG66/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6IQEAZF7E6LNKNL3QZHTGHTG66/action/storage_attestation","attest_author":"https://pith.science/pith/6IQEAZF7E6LNKNL3QZHTGHTG66/action/author_attestation","sign_citation":"https://pith.science/pith/6IQEAZF7E6LNKNL3QZHTGHTG66/action/citation_signature","submit_replication":"https://pith.science/pith/6IQEAZF7E6LNKNL3QZHTGHTG66/action/replication_record"}},"created_at":"2026-07-05T07:57:02.215018+00:00","updated_at":"2026-07-05T07:57:02.215018+00:00"}