{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZBSFJJDARVEVYOI6GUWSMC6BKD","short_pith_number":"pith:ZBSFJJDA","schema_version":"1.0","canonical_sha256":"c86454a4608d495c391e352d260bc150d4a8cbc732a046627b45256f270ebec6","source":{"kind":"arxiv","id":"2508.00230","version":1},"attestation_state":"computed","paper":{"title":"Towards Higher Effective Rank in Parameter-efficient Fine-tuning using Khatri--Rao Product","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.CV"],"primary_cat":"cs.LG","authors_text":"Anton van den Hengel, Ehsan Abbasnejad, Frederic Z. Zhang, Hemanth Saratchandran, Paul Albert","submitted_at":"2025-08-01T00:29:13Z","abstract_excerpt":"Parameter-efficient fine-tuning (PEFT) has become a standard approach for adapting large pre-trained models. Amongst PEFT methods, low-rank adaptation (LoRA) has achieved notable success. However, recent studies have highlighted its limitations compared against full-rank alternatives, particularly when applied to multimodal and large language models. In this work, we present a quantitative comparison amongst full-rank and low-rank PEFT methods using a synthetic matrix approximation benchmark with controlled spectral properties. Our results confirm that LoRA struggles to approximate matrices wi"},"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":"2508.00230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-01T00:29:13Z","cross_cats_sorted":["cs.CL","cs.CV"],"title_canon_sha256":"038633df893c0306f576a0e2be01d5fc83ad2504e6da7bf4dc63195b287f3da3","abstract_canon_sha256":"fa4d73a67a0fe8523bdbb9c119a00f8e68fb1a77301104ff3a891bbb60dc09ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:46:51.601741Z","signature_b64":"mdIYfDSCdxNGBS2CY7/yUUhlO2JBxJgg4clvEbg3VwE/o4GrBWgiWgLIAx1fNCosf9gktmMRTE4E5uYnsvIRAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c86454a4608d495c391e352d260bc150d4a8cbc732a046627b45256f270ebec6","last_reissued_at":"2026-07-05T11:46:51.601351Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:46:51.601351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Higher Effective Rank in Parameter-efficient Fine-tuning using Khatri--Rao Product","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.CV"],"primary_cat":"cs.LG","authors_text":"Anton van den Hengel, Ehsan Abbasnejad, Frederic Z. Zhang, Hemanth Saratchandran, Paul Albert","submitted_at":"2025-08-01T00:29:13Z","abstract_excerpt":"Parameter-efficient fine-tuning (PEFT) has become a standard approach for adapting large pre-trained models. Amongst PEFT methods, low-rank adaptation (LoRA) has achieved notable success. However, recent studies have highlighted its limitations compared against full-rank alternatives, particularly when applied to multimodal and large language models. In this work, we present a quantitative comparison amongst full-rank and low-rank PEFT methods using a synthetic matrix approximation benchmark with controlled spectral properties. Our results confirm that LoRA struggles to approximate matrices wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.00230","kind":"arxiv","version":1},"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/2508.00230/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":"2508.00230","created_at":"2026-07-05T11:46:51.601405+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.00230v1","created_at":"2026-07-05T11:46:51.601405+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.00230","created_at":"2026-07-05T11:46:51.601405+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZBSFJJDARVEV","created_at":"2026-07-05T11:46:51.601405+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZBSFJJDARVEVYOI6","created_at":"2026-07-05T11:46:51.601405+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZBSFJJDA","created_at":"2026-07-05T11:46:51.601405+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.29498","citing_title":"Mask the Target: A Plug-and-Play Regularizer Against LoRA Forgetting","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZBSFJJDARVEVYOI6GUWSMC6BKD","json":"https://pith.science/pith/ZBSFJJDARVEVYOI6GUWSMC6BKD.json","graph_json":"https://pith.science/api/pith-number/ZBSFJJDARVEVYOI6GUWSMC6BKD/graph.json","events_json":"https://pith.science/api/pith-number/ZBSFJJDARVEVYOI6GUWSMC6BKD/events.json","paper":"https://pith.science/paper/ZBSFJJDA"},"agent_actions":{"view_html":"https://pith.science/pith/ZBSFJJDARVEVYOI6GUWSMC6BKD","download_json":"https://pith.science/pith/ZBSFJJDARVEVYOI6GUWSMC6BKD.json","view_paper":"https://pith.science/paper/ZBSFJJDA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.00230&json=true","fetch_graph":"https://pith.science/api/pith-number/ZBSFJJDARVEVYOI6GUWSMC6BKD/graph.json","fetch_events":"https://pith.science/api/pith-number/ZBSFJJDARVEVYOI6GUWSMC6BKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZBSFJJDARVEVYOI6GUWSMC6BKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZBSFJJDARVEVYOI6GUWSMC6BKD/action/storage_attestation","attest_author":"https://pith.science/pith/ZBSFJJDARVEVYOI6GUWSMC6BKD/action/author_attestation","sign_citation":"https://pith.science/pith/ZBSFJJDARVEVYOI6GUWSMC6BKD/action/citation_signature","submit_replication":"https://pith.science/pith/ZBSFJJDARVEVYOI6GUWSMC6BKD/action/replication_record"}},"created_at":"2026-07-05T11:46:51.601405+00:00","updated_at":"2026-07-05T11:46:51.601405+00:00"}