{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VZBV5DNCKJQV4ZSQCFGULSUP23","short_pith_number":"pith:VZBV5DNC","schema_version":"1.0","canonical_sha256":"ae435e8da252615e6650114d45ca8fd6e92a710749faf83b523355f6b74be5e8","source":{"kind":"arxiv","id":"2405.17357","version":3},"attestation_state":"computed","paper":{"title":"DoRA: Enhancing Parameter-Efficient Fine-Tuning with Dynamic Rank Distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Changhao Guan, Fengran Mo, Ganglin Bao, Jinan Xu, Kaiyu Huang, Yulong Mao","submitted_at":"2024-05-27T17:02:27Z","abstract_excerpt":"Fine-tuning large-scale pre-trained models is inherently a resource-intensive task. While it can enhance the capabilities of the model, it also incurs substantial computational costs, posing challenges to the practical application of downstream tasks. Existing parameter-efficient fine-tuning (PEFT) methods such as Low-Rank Adaptation (LoRA) rely on a bypass framework that ignores the differential parameter budget requirements across weight matrices, which may lead to suboptimal fine-tuning outcomes. To address this issue, we introduce the Dynamic Low-Rank Adaptation (DoRA) method. DoRA decompo"},"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":"2405.17357","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-05-27T17:02:27Z","cross_cats_sorted":[],"title_canon_sha256":"cf8cb46cc2a420b0c1244f79679a5e097a36fe2a12fcc04457256dca702a8070","abstract_canon_sha256":"df9de06eebae9d0d1f022ccfa61f227674e6be72dc66f3725bb44ba113b32e98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:37:07.006553Z","signature_b64":"CZJ9Q1I9cFx7QR/P3e1gRcAsolvXdh8sIJqgeCPSJxc1uesAAPh79J/QHyY1vjtpvZX0AVugmu5+P0cJ4UcPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae435e8da252615e6650114d45ca8fd6e92a710749faf83b523355f6b74be5e8","last_reissued_at":"2026-07-05T08:37:07.005767Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:37:07.005767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DoRA: Enhancing Parameter-Efficient Fine-Tuning with Dynamic Rank Distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Changhao Guan, Fengran Mo, Ganglin Bao, Jinan Xu, Kaiyu Huang, Yulong Mao","submitted_at":"2024-05-27T17:02:27Z","abstract_excerpt":"Fine-tuning large-scale pre-trained models is inherently a resource-intensive task. While it can enhance the capabilities of the model, it also incurs substantial computational costs, posing challenges to the practical application of downstream tasks. Existing parameter-efficient fine-tuning (PEFT) methods such as Low-Rank Adaptation (LoRA) rely on a bypass framework that ignores the differential parameter budget requirements across weight matrices, which may lead to suboptimal fine-tuning outcomes. To address this issue, we introduce the Dynamic Low-Rank Adaptation (DoRA) method. DoRA decompo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.17357","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/2405.17357/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":"2405.17357","created_at":"2026-07-05T08:37:07.005824+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.17357v3","created_at":"2026-07-05T08:37:07.005824+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.17357","created_at":"2026-07-05T08:37:07.005824+00:00"},{"alias_kind":"pith_short_12","alias_value":"VZBV5DNCKJQV","created_at":"2026-07-05T08:37:07.005824+00:00"},{"alias_kind":"pith_short_16","alias_value":"VZBV5DNCKJQV4ZSQ","created_at":"2026-07-05T08:37:07.005824+00:00"},{"alias_kind":"pith_short_8","alias_value":"VZBV5DNC","created_at":"2026-07-05T08:37:07.005824+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.27796","citing_title":"Post-Optimization Adaptive Rank Allocation for LoRA","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18124","citing_title":"TLoRA: Task-aware Low Rank Adaptation of Large Language Models","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VZBV5DNCKJQV4ZSQCFGULSUP23","json":"https://pith.science/pith/VZBV5DNCKJQV4ZSQCFGULSUP23.json","graph_json":"https://pith.science/api/pith-number/VZBV5DNCKJQV4ZSQCFGULSUP23/graph.json","events_json":"https://pith.science/api/pith-number/VZBV5DNCKJQV4ZSQCFGULSUP23/events.json","paper":"https://pith.science/paper/VZBV5DNC"},"agent_actions":{"view_html":"https://pith.science/pith/VZBV5DNCKJQV4ZSQCFGULSUP23","download_json":"https://pith.science/pith/VZBV5DNCKJQV4ZSQCFGULSUP23.json","view_paper":"https://pith.science/paper/VZBV5DNC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.17357&json=true","fetch_graph":"https://pith.science/api/pith-number/VZBV5DNCKJQV4ZSQCFGULSUP23/graph.json","fetch_events":"https://pith.science/api/pith-number/VZBV5DNCKJQV4ZSQCFGULSUP23/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VZBV5DNCKJQV4ZSQCFGULSUP23/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VZBV5DNCKJQV4ZSQCFGULSUP23/action/storage_attestation","attest_author":"https://pith.science/pith/VZBV5DNCKJQV4ZSQCFGULSUP23/action/author_attestation","sign_citation":"https://pith.science/pith/VZBV5DNCKJQV4ZSQCFGULSUP23/action/citation_signature","submit_replication":"https://pith.science/pith/VZBV5DNCKJQV4ZSQCFGULSUP23/action/replication_record"}},"created_at":"2026-07-05T08:37:07.005824+00:00","updated_at":"2026-07-05T08:37:07.005824+00:00"}