{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:Z7XQFR2VM7HHCTMGLXXL4NICRN","short_pith_number":"pith:Z7XQFR2V","schema_version":"1.0","canonical_sha256":"cfef02c75567ce714d865deebe35028b71b84a652ee1626225ac1fc6836bab56","source":{"kind":"arxiv","id":"2501.04315","version":2},"attestation_state":"computed","paper":{"title":"RoRA: Efficient Fine-Tuning of LLM with Reliability Optimization for Rank Adaptation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Changdi Yang, Dong Huang, Geng Yuan, Hao Tang, Jun Liu, Peiyan Dong, Pu Zhao, Wei Niu, Wenbin Zhang, Xuan Shen, Xue Lin, Yanzhi Wang, Zhenglun Kong","submitted_at":"2025-01-08T07:13:52Z","abstract_excerpt":"Fine-tuning helps large language models (LLM) recover degraded information and enhance task performance. Although Low-Rank Adaptation (LoRA) is widely used and effective for fine-tuning, we have observed that its scaling factor can limit or even reduce performance as the rank size increases. To address this issue, we propose RoRA (Rank-adaptive Reliability Optimization), a simple yet effective method for optimizing LoRA's scaling factor. By replacing $\\alpha/r$ with $\\alpha/\\sqrt{r}$, RoRA ensures improved performance as rank size increases. Moreover, RoRA enhances low-rank adaptation in fine-"},"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":"2501.04315","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-08T07:13:52Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"58a53bbe66677eaf74583e2a39faaae0e85cf5f7c4ae3a936be3e30678d0c41a","abstract_canon_sha256":"7692a6d5a4751a12fc80674e86d37ad0127392fb7147057a1f8a0636dcd4df85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:59:59.228186Z","signature_b64":"+Z7NQl4FMJWpesY2eszgoUQZCgMQlORXdnq19bMQha8pztz9I6kGTrar+Xt9zw7ar7KWjA9O3jc+L7riZv+qCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfef02c75567ce714d865deebe35028b71b84a652ee1626225ac1fc6836bab56","last_reissued_at":"2026-07-05T09:59:59.227728Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:59:59.227728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RoRA: Efficient Fine-Tuning of LLM with Reliability Optimization for Rank Adaptation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Changdi Yang, Dong Huang, Geng Yuan, Hao Tang, Jun Liu, Peiyan Dong, Pu Zhao, Wei Niu, Wenbin Zhang, Xuan Shen, Xue Lin, Yanzhi Wang, Zhenglun Kong","submitted_at":"2025-01-08T07:13:52Z","abstract_excerpt":"Fine-tuning helps large language models (LLM) recover degraded information and enhance task performance. Although Low-Rank Adaptation (LoRA) is widely used and effective for fine-tuning, we have observed that its scaling factor can limit or even reduce performance as the rank size increases. To address this issue, we propose RoRA (Rank-adaptive Reliability Optimization), a simple yet effective method for optimizing LoRA's scaling factor. By replacing $\\alpha/r$ with $\\alpha/\\sqrt{r}$, RoRA ensures improved performance as rank size increases. Moreover, RoRA enhances low-rank adaptation in fine-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.04315","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/2501.04315/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":"2501.04315","created_at":"2026-07-05T09:59:59.227792+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.04315v2","created_at":"2026-07-05T09:59:59.227792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.04315","created_at":"2026-07-05T09:59:59.227792+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z7XQFR2VM7HH","created_at":"2026-07-05T09:59:59.227792+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z7XQFR2VM7HHCTMG","created_at":"2026-07-05T09:59:59.227792+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z7XQFR2V","created_at":"2026-07-05T09:59:59.227792+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.23844","citing_title":"Enabling Flexible Multi-LLM Integration for Scalable Knowledge Aggregation","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z7XQFR2VM7HHCTMGLXXL4NICRN","json":"https://pith.science/pith/Z7XQFR2VM7HHCTMGLXXL4NICRN.json","graph_json":"https://pith.science/api/pith-number/Z7XQFR2VM7HHCTMGLXXL4NICRN/graph.json","events_json":"https://pith.science/api/pith-number/Z7XQFR2VM7HHCTMGLXXL4NICRN/events.json","paper":"https://pith.science/paper/Z7XQFR2V"},"agent_actions":{"view_html":"https://pith.science/pith/Z7XQFR2VM7HHCTMGLXXL4NICRN","download_json":"https://pith.science/pith/Z7XQFR2VM7HHCTMGLXXL4NICRN.json","view_paper":"https://pith.science/paper/Z7XQFR2V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.04315&json=true","fetch_graph":"https://pith.science/api/pith-number/Z7XQFR2VM7HHCTMGLXXL4NICRN/graph.json","fetch_events":"https://pith.science/api/pith-number/Z7XQFR2VM7HHCTMGLXXL4NICRN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z7XQFR2VM7HHCTMGLXXL4NICRN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z7XQFR2VM7HHCTMGLXXL4NICRN/action/storage_attestation","attest_author":"https://pith.science/pith/Z7XQFR2VM7HHCTMGLXXL4NICRN/action/author_attestation","sign_citation":"https://pith.science/pith/Z7XQFR2VM7HHCTMGLXXL4NICRN/action/citation_signature","submit_replication":"https://pith.science/pith/Z7XQFR2VM7HHCTMGLXXL4NICRN/action/replication_record"}},"created_at":"2026-07-05T09:59:59.227792+00:00","updated_at":"2026-07-05T09:59:59.227792+00:00"}