{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:UGKPSNQWEAYJTMST64FM2EZCA4","short_pith_number":"pith:UGKPSNQW","schema_version":"1.0","canonical_sha256":"a194f93616203099b253f70acd13220738ba2490e1d6ab2704a42a79273d5c94","source":{"kind":"arxiv","id":"2412.09250","version":3},"attestation_state":"computed","paper":{"title":"GeLoRA: Geometric Adaptive Ranks For Efficient LoRA Fine-tuning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.GT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Abdessalam Ed-dib, Amine Mohamed Aboussalah, Zhanibek Datbayev","submitted_at":"2024-12-12T13:04:54Z","abstract_excerpt":"Fine-tuning large language models (LLMs) is computationally intensive because it requires updating all parameters. Low-Rank Adaptation (LoRA) improves efficiency by modifying only a subset of weights but introduces a trade-off between expressivity and computational cost: lower ranks reduce resources but limit expressiveness, while higher ranks enhance expressivity at increased cost. Despite recent advances in adaptive LoRA techniques, existing methods fail to provide a theoretical basis for optimizing the trade-off between model performance and efficiency. We propose Geometric Low-Rank Adaptat"},"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":"2412.09250","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-12T13:04:54Z","cross_cats_sorted":["math.GT","stat.ML"],"title_canon_sha256":"5e7cd535b02c3d6818e491f3e3e39ff0b60741b7d2c017550743e5ba7f933936","abstract_canon_sha256":"fbd18714092d79000a4d47af2048590b3ce86292841947c102a40b8051ab6718"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:50:55.498205Z","signature_b64":"TKE4tvvCJDq+fRcInv5kwZQidTO+fK39GE5BVtiQrtAuN4Afm5eO3Exo/ebhZ4nltUcfqfAIp402WES4jLkXDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a194f93616203099b253f70acd13220738ba2490e1d6ab2704a42a79273d5c94","last_reissued_at":"2026-07-05T09:50:55.497725Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:50:55.497725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GeLoRA: Geometric Adaptive Ranks For Efficient LoRA Fine-tuning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.GT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Abdessalam Ed-dib, Amine Mohamed Aboussalah, Zhanibek Datbayev","submitted_at":"2024-12-12T13:04:54Z","abstract_excerpt":"Fine-tuning large language models (LLMs) is computationally intensive because it requires updating all parameters. Low-Rank Adaptation (LoRA) improves efficiency by modifying only a subset of weights but introduces a trade-off between expressivity and computational cost: lower ranks reduce resources but limit expressiveness, while higher ranks enhance expressivity at increased cost. Despite recent advances in adaptive LoRA techniques, existing methods fail to provide a theoretical basis for optimizing the trade-off between model performance and efficiency. We propose Geometric Low-Rank Adaptat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.09250","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/2412.09250/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":"2412.09250","created_at":"2026-07-05T09:50:55.497781+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.09250v3","created_at":"2026-07-05T09:50:55.497781+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.09250","created_at":"2026-07-05T09:50:55.497781+00:00"},{"alias_kind":"pith_short_12","alias_value":"UGKPSNQWEAYJ","created_at":"2026-07-05T09:50:55.497781+00:00"},{"alias_kind":"pith_short_16","alias_value":"UGKPSNQWEAYJTMST","created_at":"2026-07-05T09:50:55.497781+00:00"},{"alias_kind":"pith_short_8","alias_value":"UGKPSNQW","created_at":"2026-07-05T09:50:55.497781+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.07404","citing_title":"Reversible Foundations: Training a 120B Sparse MoE through State-Preserving Scaling","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21901","citing_title":"GiVA: Gradient-Informed Bases for Vector-Based Adaptation","ref_index":53,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UGKPSNQWEAYJTMST64FM2EZCA4","json":"https://pith.science/pith/UGKPSNQWEAYJTMST64FM2EZCA4.json","graph_json":"https://pith.science/api/pith-number/UGKPSNQWEAYJTMST64FM2EZCA4/graph.json","events_json":"https://pith.science/api/pith-number/UGKPSNQWEAYJTMST64FM2EZCA4/events.json","paper":"https://pith.science/paper/UGKPSNQW"},"agent_actions":{"view_html":"https://pith.science/pith/UGKPSNQWEAYJTMST64FM2EZCA4","download_json":"https://pith.science/pith/UGKPSNQWEAYJTMST64FM2EZCA4.json","view_paper":"https://pith.science/paper/UGKPSNQW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.09250&json=true","fetch_graph":"https://pith.science/api/pith-number/UGKPSNQWEAYJTMST64FM2EZCA4/graph.json","fetch_events":"https://pith.science/api/pith-number/UGKPSNQWEAYJTMST64FM2EZCA4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UGKPSNQWEAYJTMST64FM2EZCA4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UGKPSNQWEAYJTMST64FM2EZCA4/action/storage_attestation","attest_author":"https://pith.science/pith/UGKPSNQWEAYJTMST64FM2EZCA4/action/author_attestation","sign_citation":"https://pith.science/pith/UGKPSNQWEAYJTMST64FM2EZCA4/action/citation_signature","submit_replication":"https://pith.science/pith/UGKPSNQWEAYJTMST64FM2EZCA4/action/replication_record"}},"created_at":"2026-07-05T09:50:55.497781+00:00","updated_at":"2026-07-05T09:50:55.497781+00:00"}