{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:7KLEXAZOJANRGZK3ZQ7EA5BASP","short_pith_number":"pith:7KLEXAZO","schema_version":"1.0","canonical_sha256":"fa964b832e481b13655bcc3e40742093ce6b36c604488227fdf99c6b36f33eaa","source":{"kind":"arxiv","id":"2310.11454","version":2},"attestation_state":"computed","paper":{"title":"VeRA: Vector-based Random Matrix Adaptation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Dawid J. Kopiczko, Tijmen Blankevoort, Yuki M. Asano","submitted_at":"2023-10-17T17:59:46Z","abstract_excerpt":"Low-rank adapation (LoRA) is a popular method that reduces the number of trainable parameters when finetuning large language models, but still faces acute storage challenges when scaling to even larger models or deploying numerous per-user or per-task adapted models. In this work, we present Vector-based Random Matrix Adaptation (VeRA), which significantly reduces the number of trainable parameters compared to LoRA, yet maintains the same performance. It achieves this by using a single pair of low-rank matrices shared across all layers and learning small scaling vectors instead. We demonstrate"},"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":"2310.11454","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-10-17T17:59:46Z","cross_cats_sorted":[],"title_canon_sha256":"25b6e4d31d98df36fde98ef5c42c65c3c3c785b56669b1290ca8d7ec47492120","abstract_canon_sha256":"218bc5c1d85690616717e6b635125101df7dbaa92692d31654a93ede9ea64929"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:33:56.045614Z","signature_b64":"vF1NpGxDmUpqk8bTEkQu6Y0k5xYDqS5WDlqvB7xxUEOL3i1S08C5oSaWm/JsqZKsL41yyEzfwOYEg8wP8OfPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa964b832e481b13655bcc3e40742093ce6b36c604488227fdf99c6b36f33eaa","last_reissued_at":"2026-07-05T07:33:56.045222Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:33:56.045222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"VeRA: Vector-based Random Matrix Adaptation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Dawid J. Kopiczko, Tijmen Blankevoort, Yuki M. Asano","submitted_at":"2023-10-17T17:59:46Z","abstract_excerpt":"Low-rank adapation (LoRA) is a popular method that reduces the number of trainable parameters when finetuning large language models, but still faces acute storage challenges when scaling to even larger models or deploying numerous per-user or per-task adapted models. In this work, we present Vector-based Random Matrix Adaptation (VeRA), which significantly reduces the number of trainable parameters compared to LoRA, yet maintains the same performance. It achieves this by using a single pair of low-rank matrices shared across all layers and learning small scaling vectors instead. We demonstrate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.11454","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/2310.11454/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":"2310.11454","created_at":"2026-07-05T07:33:56.045270+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.11454v2","created_at":"2026-07-05T07:33:56.045270+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.11454","created_at":"2026-07-05T07:33:56.045270+00:00"},{"alias_kind":"pith_short_12","alias_value":"7KLEXAZOJANR","created_at":"2026-07-05T07:33:56.045270+00:00"},{"alias_kind":"pith_short_16","alias_value":"7KLEXAZOJANRGZK3","created_at":"2026-07-05T07:33:56.045270+00:00"},{"alias_kind":"pith_short_8","alias_value":"7KLEXAZO","created_at":"2026-07-05T07:33:56.045270+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":12,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24937","citing_title":"The Hitchhiker's Guide to Agentic AI: From Foundations to Systems","ref_index":109,"is_internal_anchor":false},{"citing_arxiv_id":"2606.19079","citing_title":"ARIADNE: Agnostic Routing for Inference-time Adapter DyNamic sElection","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2606.31397","citing_title":"Mixture-of-Control: State-Aware Fine-Tuning for Transformer-based Models","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2606.29184","citing_title":"BaRA: Bayesian Adaptive Rank Allocation for Parameter-Efficient Fine-Tuning","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2605.29498","citing_title":"Mask the Target: A Plug-and-Play Regularizer Against LoRA Forgetting","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2511.11051","citing_title":"NP-LoRA: Null Space Projection for Subject-Style LoRA Fusion","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2412.02125","citing_title":"Preference Goal Tuning: Post-Training as Latent Control for Frozen Policies","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21147","citing_title":"SMoA: Spectrum Modulation Adapter for Parameter-Efficient Fine-Tuning","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2509.18629","citing_title":"HyperAdapt: Simple High-Rank Adaptation","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2403.14608","citing_title":"Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Survey","ref_index":80,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27308","citing_title":"BoostLoRA: Growing Effective Rank by Boosting Adapters","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18124","citing_title":"TLoRA: Task-aware Low Rank Adaptation of Large Language Models","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7KLEXAZOJANRGZK3ZQ7EA5BASP","json":"https://pith.science/pith/7KLEXAZOJANRGZK3ZQ7EA5BASP.json","graph_json":"https://pith.science/api/pith-number/7KLEXAZOJANRGZK3ZQ7EA5BASP/graph.json","events_json":"https://pith.science/api/pith-number/7KLEXAZOJANRGZK3ZQ7EA5BASP/events.json","paper":"https://pith.science/paper/7KLEXAZO"},"agent_actions":{"view_html":"https://pith.science/pith/7KLEXAZOJANRGZK3ZQ7EA5BASP","download_json":"https://pith.science/pith/7KLEXAZOJANRGZK3ZQ7EA5BASP.json","view_paper":"https://pith.science/paper/7KLEXAZO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.11454&json=true","fetch_graph":"https://pith.science/api/pith-number/7KLEXAZOJANRGZK3ZQ7EA5BASP/graph.json","fetch_events":"https://pith.science/api/pith-number/7KLEXAZOJANRGZK3ZQ7EA5BASP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7KLEXAZOJANRGZK3ZQ7EA5BASP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7KLEXAZOJANRGZK3ZQ7EA5BASP/action/storage_attestation","attest_author":"https://pith.science/pith/7KLEXAZOJANRGZK3ZQ7EA5BASP/action/author_attestation","sign_citation":"https://pith.science/pith/7KLEXAZOJANRGZK3ZQ7EA5BASP/action/citation_signature","submit_replication":"https://pith.science/pith/7KLEXAZOJANRGZK3ZQ7EA5BASP/action/replication_record"}},"created_at":"2026-07-05T07:33:56.045270+00:00","updated_at":"2026-07-05T07:33:56.045270+00:00"}