{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:H4STVMCDLWKLNMSI6NUQXINJDN","short_pith_number":"pith:H4STVMCD","schema_version":"1.0","canonical_sha256":"3f253ab0435d94b6b248f3690ba1a91b6c7637220b37db2a619fb431fe432796","source":{"kind":"arxiv","id":"2506.15588","version":2},"attestation_state":"computed","paper":{"title":"Memory-Efficient Differentially Private Training with Gradient Random Projection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alex Mulrooney, Devansh Gupta, Huanyu Zhang, James Flemings, Meisam Razaviyayn, Murali Annavaram, Xinwei Zhang","submitted_at":"2025-06-18T16:05:09Z","abstract_excerpt":"Differential privacy (DP) protects sensitive data during neural network training, but standard methods like DP-Adam suffer from high memory overhead due to per-sample gradient clipping, limiting scalability. We introduce DP-GRAPE (Gradient RAndom ProjEction), a DP training method that significantly reduces memory usage while maintaining utility on par with first-order DP approaches. DP-GRAPE is motivated by our finding that privatization flattens the gradient singular value spectrum, making SVD-based projections (as in GaLore (Zhao et al., 2024)) unnecessary. Consequently, DP-GRAPE employs thr"},"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":"2506.15588","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-18T16:05:09Z","cross_cats_sorted":[],"title_canon_sha256":"dee5ae6d767b2e88f8a0f2289d27cd251dd321acc6bf12927e854f24c5f42b0f","abstract_canon_sha256":"9c806ea55dfaeee5a04bb4d8daa59ed5a97e27a25561c30c92a453bf08b1df9e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:30.281577Z","signature_b64":"vhbUFCQAVEMe3hURUA7+b2beJ/sJWLuKWK4jyw862B94e8sSdszNKKyBkGH278WFQBCY69lBVYDDYCREspbnAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f253ab0435d94b6b248f3690ba1a91b6c7637220b37db2a619fb431fe432796","last_reissued_at":"2026-05-20T00:05:30.280812Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:30.280812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Memory-Efficient Differentially Private Training with Gradient Random Projection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alex Mulrooney, Devansh Gupta, Huanyu Zhang, James Flemings, Meisam Razaviyayn, Murali Annavaram, Xinwei Zhang","submitted_at":"2025-06-18T16:05:09Z","abstract_excerpt":"Differential privacy (DP) protects sensitive data during neural network training, but standard methods like DP-Adam suffer from high memory overhead due to per-sample gradient clipping, limiting scalability. We introduce DP-GRAPE (Gradient RAndom ProjEction), a DP training method that significantly reduces memory usage while maintaining utility on par with first-order DP approaches. DP-GRAPE is motivated by our finding that privatization flattens the gradient singular value spectrum, making SVD-based projections (as in GaLore (Zhao et al., 2024)) unnecessary. Consequently, DP-GRAPE employs thr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.15588","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/2506.15588/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":"2506.15588","created_at":"2026-05-20T00:05:30.280925+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.15588v2","created_at":"2026-05-20T00:05:30.280925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.15588","created_at":"2026-05-20T00:05:30.280925+00:00"},{"alias_kind":"pith_short_12","alias_value":"H4STVMCDLWKL","created_at":"2026-05-20T00:05:30.280925+00:00"},{"alias_kind":"pith_short_16","alias_value":"H4STVMCDLWKLNMSI","created_at":"2026-05-20T00:05:30.280925+00:00"},{"alias_kind":"pith_short_8","alias_value":"H4STVMCD","created_at":"2026-05-20T00:05:30.280925+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.12958","citing_title":"Forget What's Sensitive, Remember What Matters: Token-Level Differential Privacy in Memory Sculpting for Continual Learning","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H4STVMCDLWKLNMSI6NUQXINJDN","json":"https://pith.science/pith/H4STVMCDLWKLNMSI6NUQXINJDN.json","graph_json":"https://pith.science/api/pith-number/H4STVMCDLWKLNMSI6NUQXINJDN/graph.json","events_json":"https://pith.science/api/pith-number/H4STVMCDLWKLNMSI6NUQXINJDN/events.json","paper":"https://pith.science/paper/H4STVMCD"},"agent_actions":{"view_html":"https://pith.science/pith/H4STVMCDLWKLNMSI6NUQXINJDN","download_json":"https://pith.science/pith/H4STVMCDLWKLNMSI6NUQXINJDN.json","view_paper":"https://pith.science/paper/H4STVMCD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.15588&json=true","fetch_graph":"https://pith.science/api/pith-number/H4STVMCDLWKLNMSI6NUQXINJDN/graph.json","fetch_events":"https://pith.science/api/pith-number/H4STVMCDLWKLNMSI6NUQXINJDN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H4STVMCDLWKLNMSI6NUQXINJDN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H4STVMCDLWKLNMSI6NUQXINJDN/action/storage_attestation","attest_author":"https://pith.science/pith/H4STVMCDLWKLNMSI6NUQXINJDN/action/author_attestation","sign_citation":"https://pith.science/pith/H4STVMCDLWKLNMSI6NUQXINJDN/action/citation_signature","submit_replication":"https://pith.science/pith/H4STVMCDLWKLNMSI6NUQXINJDN/action/replication_record"}},"created_at":"2026-05-20T00:05:30.280925+00:00","updated_at":"2026-05-20T00:05:30.280925+00:00"}