{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MX4W7FYLDQ2P2KZWZUQK5CB6HT","short_pith_number":"pith:MX4W7FYL","schema_version":"1.0","canonical_sha256":"65f96f970b1c34fd2b36cd20ae883e3ce2a1232640d98c9df872d7b85e5f6bb6","source":{"kind":"arxiv","id":"2406.12832","version":1},"attestation_state":"computed","paper":{"title":"LaMDA: Large Model Fine-Tuning via Spectrally Decomposed Low-Dimensional Adaptation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Massoud Pedram, Seyedarmin Azizi, Souvik Kundu","submitted_at":"2024-06-18T17:52:59Z","abstract_excerpt":"Low-rank adaptation (LoRA) has become the default approach to fine-tune large language models (LLMs) due to its significant reduction in trainable parameters. However, trainable parameter demand for LoRA increases with increasing model embedding dimensions, leading to high compute costs. Additionally, its backward updates require storing high-dimensional intermediate activations and optimizer states, demanding high peak GPU memory. In this paper, we introduce large model fine-tuning via spectrally decomposed low-dimensional adaptation (LaMDA), a novel approach to fine-tuning large language mod"},"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.12832","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2024-06-18T17:52:59Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"bbd3b1a73ea1c2f3ffa2d04437517e358c8dc6aaa5153c6271e4356a72ef32e9","abstract_canon_sha256":"3bec1276374cf4280ff1c27919a0933a560cd0dde5dfb0d944423650f253d93c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:33:51.843769Z","signature_b64":"c0qAblyhfAKslK9VBpL/Be3TzTnwKqDx/zTTyGhlkNeiEQRVRGR906DIjGv+ZDwNM9kVIqhGU1tv+ri/9CQlDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65f96f970b1c34fd2b36cd20ae883e3ce2a1232640d98c9df872d7b85e5f6bb6","last_reissued_at":"2026-07-05T08:33:51.843335Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:33:51.843335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LaMDA: Large Model Fine-Tuning via Spectrally Decomposed Low-Dimensional Adaptation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CL","authors_text":"Massoud Pedram, Seyedarmin Azizi, Souvik Kundu","submitted_at":"2024-06-18T17:52:59Z","abstract_excerpt":"Low-rank adaptation (LoRA) has become the default approach to fine-tune large language models (LLMs) due to its significant reduction in trainable parameters. However, trainable parameter demand for LoRA increases with increasing model embedding dimensions, leading to high compute costs. Additionally, its backward updates require storing high-dimensional intermediate activations and optimizer states, demanding high peak GPU memory. In this paper, we introduce large model fine-tuning via spectrally decomposed low-dimensional adaptation (LaMDA), a novel approach to fine-tuning large language mod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.12832","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/2406.12832/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.12832","created_at":"2026-07-05T08:33:51.843397+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.12832v1","created_at":"2026-07-05T08:33:51.843397+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.12832","created_at":"2026-07-05T08:33:51.843397+00:00"},{"alias_kind":"pith_short_12","alias_value":"MX4W7FYLDQ2P","created_at":"2026-07-05T08:33:51.843397+00:00"},{"alias_kind":"pith_short_16","alias_value":"MX4W7FYLDQ2P2KZW","created_at":"2026-07-05T08:33:51.843397+00:00"},{"alias_kind":"pith_short_8","alias_value":"MX4W7FYL","created_at":"2026-07-05T08:33:51.843397+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.06769","citing_title":"Containerized In-Storage Processing and Computing-Enabled SSD Disaggregation","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MX4W7FYLDQ2P2KZWZUQK5CB6HT","json":"https://pith.science/pith/MX4W7FYLDQ2P2KZWZUQK5CB6HT.json","graph_json":"https://pith.science/api/pith-number/MX4W7FYLDQ2P2KZWZUQK5CB6HT/graph.json","events_json":"https://pith.science/api/pith-number/MX4W7FYLDQ2P2KZWZUQK5CB6HT/events.json","paper":"https://pith.science/paper/MX4W7FYL"},"agent_actions":{"view_html":"https://pith.science/pith/MX4W7FYLDQ2P2KZWZUQK5CB6HT","download_json":"https://pith.science/pith/MX4W7FYLDQ2P2KZWZUQK5CB6HT.json","view_paper":"https://pith.science/paper/MX4W7FYL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.12832&json=true","fetch_graph":"https://pith.science/api/pith-number/MX4W7FYLDQ2P2KZWZUQK5CB6HT/graph.json","fetch_events":"https://pith.science/api/pith-number/MX4W7FYLDQ2P2KZWZUQK5CB6HT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MX4W7FYLDQ2P2KZWZUQK5CB6HT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MX4W7FYLDQ2P2KZWZUQK5CB6HT/action/storage_attestation","attest_author":"https://pith.science/pith/MX4W7FYLDQ2P2KZWZUQK5CB6HT/action/author_attestation","sign_citation":"https://pith.science/pith/MX4W7FYLDQ2P2KZWZUQK5CB6HT/action/citation_signature","submit_replication":"https://pith.science/pith/MX4W7FYLDQ2P2KZWZUQK5CB6HT/action/replication_record"}},"created_at":"2026-07-05T08:33:51.843397+00:00","updated_at":"2026-07-05T08:33:51.843397+00:00"}