{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XJ54KQLKJ3QHEFFRRCN5DZAE6U","short_pith_number":"pith:XJ54KQLK","schema_version":"1.0","canonical_sha256":"ba7bc5416a4ee07214b1889bd1e404f53fa65aa90811b00a34036e2886fca3bb","source":{"kind":"arxiv","id":"2405.03003","version":1},"attestation_state":"computed","paper":{"title":"Parameter-Efficient Fine-Tuning with Discrete Fourier Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Aochuan Chen, Bingzhe Wu, Jia Li, Liang Chen, Qichao Wang, Zijing Liu, Ziqi Gao","submitted_at":"2024-05-05T17:15:24Z","abstract_excerpt":"Low-rank adaptation~(LoRA) has recently gained much interest in fine-tuning foundation models. It effectively reduces the number of trainable parameters by incorporating low-rank matrices $A$ and $B$ to represent the weight change, i.e., $\\Delta W=BA$. Despite LoRA's progress, it faces storage challenges when handling extensive customization adaptations or larger base models. In this work, we aim to further compress trainable parameters by enjoying the powerful expressiveness of the Fourier transform. Specifically, we introduce FourierFT, which treats $\\Delta W$ as a matrix in the spatial doma"},"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":"2405.03003","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-05-05T17:15:24Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"797283006a152b890cb394dab398248201eec01b160f0b344945f2f78fd22261","abstract_canon_sha256":"b66ccbfd2055f8c452bc358f4e1e1b48841e59eb92c02daea06bba6132a80f53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:15:57.132383Z","signature_b64":"s/q/5gGwPusPrL8Zzd2cGreEG4i8uiCtQfRzYXrWAUWMXSiKmIK6M/+V86zYHGlLrRDbaOlvyYJqlBecuHArDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba7bc5416a4ee07214b1889bd1e404f53fa65aa90811b00a34036e2886fca3bb","last_reissued_at":"2026-07-05T08:15:57.131938Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:15:57.131938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameter-Efficient Fine-Tuning with Discrete Fourier Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Aochuan Chen, Bingzhe Wu, Jia Li, Liang Chen, Qichao Wang, Zijing Liu, Ziqi Gao","submitted_at":"2024-05-05T17:15:24Z","abstract_excerpt":"Low-rank adaptation~(LoRA) has recently gained much interest in fine-tuning foundation models. It effectively reduces the number of trainable parameters by incorporating low-rank matrices $A$ and $B$ to represent the weight change, i.e., $\\Delta W=BA$. Despite LoRA's progress, it faces storage challenges when handling extensive customization adaptations or larger base models. In this work, we aim to further compress trainable parameters by enjoying the powerful expressiveness of the Fourier transform. Specifically, we introduce FourierFT, which treats $\\Delta W$ as a matrix in the spatial doma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.03003","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/2405.03003/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":"2405.03003","created_at":"2026-07-05T08:15:57.131998+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.03003v1","created_at":"2026-07-05T08:15:57.131998+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.03003","created_at":"2026-07-05T08:15:57.131998+00:00"},{"alias_kind":"pith_short_12","alias_value":"XJ54KQLKJ3QH","created_at":"2026-07-05T08:15:57.131998+00:00"},{"alias_kind":"pith_short_16","alias_value":"XJ54KQLKJ3QHEFFR","created_at":"2026-07-05T08:15:57.131998+00:00"},{"alias_kind":"pith_short_8","alias_value":"XJ54KQLK","created_at":"2026-07-05T08:15:57.131998+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2603.20410","citing_title":"SLE-FNO: Single-Layer Extensions for Task-Agnostic Continual Learning in Fourier Neural Operators","ref_index":92,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08589","citing_title":"S2FT: Parameter-Efficient Fine-Tuning in Sparse Spectrum Domain","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XJ54KQLKJ3QHEFFRRCN5DZAE6U","json":"https://pith.science/pith/XJ54KQLKJ3QHEFFRRCN5DZAE6U.json","graph_json":"https://pith.science/api/pith-number/XJ54KQLKJ3QHEFFRRCN5DZAE6U/graph.json","events_json":"https://pith.science/api/pith-number/XJ54KQLKJ3QHEFFRRCN5DZAE6U/events.json","paper":"https://pith.science/paper/XJ54KQLK"},"agent_actions":{"view_html":"https://pith.science/pith/XJ54KQLKJ3QHEFFRRCN5DZAE6U","download_json":"https://pith.science/pith/XJ54KQLKJ3QHEFFRRCN5DZAE6U.json","view_paper":"https://pith.science/paper/XJ54KQLK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.03003&json=true","fetch_graph":"https://pith.science/api/pith-number/XJ54KQLKJ3QHEFFRRCN5DZAE6U/graph.json","fetch_events":"https://pith.science/api/pith-number/XJ54KQLKJ3QHEFFRRCN5DZAE6U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XJ54KQLKJ3QHEFFRRCN5DZAE6U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XJ54KQLKJ3QHEFFRRCN5DZAE6U/action/storage_attestation","attest_author":"https://pith.science/pith/XJ54KQLKJ3QHEFFRRCN5DZAE6U/action/author_attestation","sign_citation":"https://pith.science/pith/XJ54KQLKJ3QHEFFRRCN5DZAE6U/action/citation_signature","submit_replication":"https://pith.science/pith/XJ54KQLKJ3QHEFFRRCN5DZAE6U/action/replication_record"}},"created_at":"2026-07-05T08:15:57.131998+00:00","updated_at":"2026-07-05T08:15:57.131998+00:00"}