{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:W2LMOFKZ2XYU6MJIUO3KN2ZXCU","short_pith_number":"pith:W2LMOFKZ","schema_version":"1.0","canonical_sha256":"b696c71559d5f14f3128a3b6a6eb371522e6dff373026687fe377987b81b9ebc","source":{"kind":"arxiv","id":"2406.17740","version":3},"attestation_state":"computed","paper":{"title":"Structured Unrestricted-Rank Matrices for Parameter Efficient Fine-tuning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.LG","authors_text":"Arijit Sehanobish, Avinava Dubey, Deepali Jain, Krzysztof Choromanski, Snigdha Chaturvedi, Somnath Basu Roy Chowdhury, Vikas Sindhwani","submitted_at":"2024-06-25T17:26:05Z","abstract_excerpt":"Recent efforts to scale Transformer models have demonstrated rapid progress across a wide range of tasks (Wei et al., 2022). However, fine-tuning these models for downstream tasks is expensive due to their large parameter counts. Parameter-efficient fine-tuning (PEFT) approaches have emerged as a viable alternative by allowing us to fine-tune models by updating only a small number of parameters. In this work, we propose a general framework for parameter efficient fine-tuning (PEFT), based on structured unrestricted-rank matrices (SURM) which can serve as a drop-in replacement for popular appro"},"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":"2406.17740","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-06-25T17:26:05Z","cross_cats_sorted":["cs.AI","cs.CV"],"title_canon_sha256":"0e8a4acc485c423331751c2e80a2331e9498bcd57622d4ac984be89f4ad90274","abstract_canon_sha256":"73ebb04f5b373c7c1fe049a61060fc0e2c470d99fa4807f98788c0a26ce95697"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:50:49.081257Z","signature_b64":"JGGwMZApvYrCKo1uCfmqFAUiFIDc9LbqGANpEXuKJhv85DoOFnfcuK6zf634qaR5NW/Ln854uk0oxJpHmqQMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b696c71559d5f14f3128a3b6a6eb371522e6dff373026687fe377987b81b9ebc","last_reissued_at":"2026-07-05T09:50:49.080371Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:50:49.080371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structured Unrestricted-Rank Matrices for Parameter Efficient Fine-tuning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.LG","authors_text":"Arijit Sehanobish, Avinava Dubey, Deepali Jain, Krzysztof Choromanski, Snigdha Chaturvedi, Somnath Basu Roy Chowdhury, Vikas Sindhwani","submitted_at":"2024-06-25T17:26:05Z","abstract_excerpt":"Recent efforts to scale Transformer models have demonstrated rapid progress across a wide range of tasks (Wei et al., 2022). However, fine-tuning these models for downstream tasks is expensive due to their large parameter counts. Parameter-efficient fine-tuning (PEFT) approaches have emerged as a viable alternative by allowing us to fine-tune models by updating only a small number of parameters. In this work, we propose a general framework for parameter efficient fine-tuning (PEFT), based on structured unrestricted-rank matrices (SURM) which can serve as a drop-in replacement for popular appro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.17740","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/2406.17740/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":"2406.17740","created_at":"2026-07-05T09:50:49.080711+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.17740v3","created_at":"2026-07-05T09:50:49.080711+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.17740","created_at":"2026-07-05T09:50:49.080711+00:00"},{"alias_kind":"pith_short_12","alias_value":"W2LMOFKZ2XYU","created_at":"2026-07-05T09:50:49.080711+00:00"},{"alias_kind":"pith_short_16","alias_value":"W2LMOFKZ2XYU6MJI","created_at":"2026-07-05T09:50:49.080711+00:00"},{"alias_kind":"pith_short_8","alias_value":"W2LMOFKZ","created_at":"2026-07-05T09:50:49.080711+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.08727","citing_title":"Transformed Low-rank Adaptation via Tensor Decomposition and Its Applications to Text-to-image Models","ref_index":54,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W2LMOFKZ2XYU6MJIUO3KN2ZXCU","json":"https://pith.science/pith/W2LMOFKZ2XYU6MJIUO3KN2ZXCU.json","graph_json":"https://pith.science/api/pith-number/W2LMOFKZ2XYU6MJIUO3KN2ZXCU/graph.json","events_json":"https://pith.science/api/pith-number/W2LMOFKZ2XYU6MJIUO3KN2ZXCU/events.json","paper":"https://pith.science/paper/W2LMOFKZ"},"agent_actions":{"view_html":"https://pith.science/pith/W2LMOFKZ2XYU6MJIUO3KN2ZXCU","download_json":"https://pith.science/pith/W2LMOFKZ2XYU6MJIUO3KN2ZXCU.json","view_paper":"https://pith.science/paper/W2LMOFKZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.17740&json=true","fetch_graph":"https://pith.science/api/pith-number/W2LMOFKZ2XYU6MJIUO3KN2ZXCU/graph.json","fetch_events":"https://pith.science/api/pith-number/W2LMOFKZ2XYU6MJIUO3KN2ZXCU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W2LMOFKZ2XYU6MJIUO3KN2ZXCU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W2LMOFKZ2XYU6MJIUO3KN2ZXCU/action/storage_attestation","attest_author":"https://pith.science/pith/W2LMOFKZ2XYU6MJIUO3KN2ZXCU/action/author_attestation","sign_citation":"https://pith.science/pith/W2LMOFKZ2XYU6MJIUO3KN2ZXCU/action/citation_signature","submit_replication":"https://pith.science/pith/W2LMOFKZ2XYU6MJIUO3KN2ZXCU/action/replication_record"}},"created_at":"2026-07-05T09:50:49.080711+00:00","updated_at":"2026-07-05T09:50:49.080711+00:00"}