{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JO4MAD3BFUBQOWZ335ANYUGSLV","short_pith_number":"pith:JO4MAD3B","schema_version":"1.0","canonical_sha256":"4bb8c00f612d03075b3bdf40dc50d25d698e44b96cd9ca524a4f7a519d794316","source":{"kind":"arxiv","id":"2506.03044","version":1},"attestation_state":"computed","paper":{"title":"On the Benefits of Accelerated Optimization in Robust and Private Estimation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Laurentiu Andrei Marchis, Po-Ling Loh","submitted_at":"2025-06-03T16:26:30Z","abstract_excerpt":"We study the advantages of accelerated gradient methods, specifically based on the Frank-Wolfe method and projected gradient descent, for privacy and heavy-tailed robustness. Our approaches are as follows: For the Frank-Wolfe method, our technique is based on a tailored learning rate and a uniform lower bound on the gradient of the $\\ell_2$-norm over the constraint set. For accelerating projected gradient descent, we use the popular variant based on Nesterov's momentum, and we optimize our objective over $\\mathbb{R}^p$. These accelerations reduce iteration complexity, translating into stronger"},"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.03044","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2025-06-03T16:26:30Z","cross_cats_sorted":["cs.LG","stat.ML","stat.TH"],"title_canon_sha256":"36723a2348dd7afe886ae82567dce6e4437d2b70eca914b501f2dc867a4cb810","abstract_canon_sha256":"ea3087b18c7c2c780d72ac80cd334678a6093eb7f8518260704d692ce0580fce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:13.890906Z","signature_b64":"kDiGpEF2420Op7807Mqejhfe5L2K1smS4e40OkXVaRhTrf5NcDTTHmbJCCkzqkMg6k0dLCtP6XdBJlUvfx68BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bb8c00f612d03075b3bdf40dc50d25d698e44b96cd9ca524a4f7a519d794316","last_reissued_at":"2026-07-05T11:15:13.890389Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:13.890389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Benefits of Accelerated Optimization in Robust and Private Estimation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Laurentiu Andrei Marchis, Po-Ling Loh","submitted_at":"2025-06-03T16:26:30Z","abstract_excerpt":"We study the advantages of accelerated gradient methods, specifically based on the Frank-Wolfe method and projected gradient descent, for privacy and heavy-tailed robustness. Our approaches are as follows: For the Frank-Wolfe method, our technique is based on a tailored learning rate and a uniform lower bound on the gradient of the $\\ell_2$-norm over the constraint set. For accelerating projected gradient descent, we use the popular variant based on Nesterov's momentum, and we optimize our objective over $\\mathbb{R}^p$. These accelerations reduce iteration complexity, translating into stronger"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.03044","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/2506.03044/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.03044","created_at":"2026-07-05T11:15:13.890456+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.03044v1","created_at":"2026-07-05T11:15:13.890456+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03044","created_at":"2026-07-05T11:15:13.890456+00:00"},{"alias_kind":"pith_short_12","alias_value":"JO4MAD3BFUBQ","created_at":"2026-07-05T11:15:13.890456+00:00"},{"alias_kind":"pith_short_16","alias_value":"JO4MAD3BFUBQOWZ3","created_at":"2026-07-05T11:15:13.890456+00:00"},{"alias_kind":"pith_short_8","alias_value":"JO4MAD3B","created_at":"2026-07-05T11:15:13.890456+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.05905","citing_title":"Quadratic Objective Perturbation: Curvature-Based Differential Privacy","ref_index":37,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JO4MAD3BFUBQOWZ335ANYUGSLV","json":"https://pith.science/pith/JO4MAD3BFUBQOWZ335ANYUGSLV.json","graph_json":"https://pith.science/api/pith-number/JO4MAD3BFUBQOWZ335ANYUGSLV/graph.json","events_json":"https://pith.science/api/pith-number/JO4MAD3BFUBQOWZ335ANYUGSLV/events.json","paper":"https://pith.science/paper/JO4MAD3B"},"agent_actions":{"view_html":"https://pith.science/pith/JO4MAD3BFUBQOWZ335ANYUGSLV","download_json":"https://pith.science/pith/JO4MAD3BFUBQOWZ335ANYUGSLV.json","view_paper":"https://pith.science/paper/JO4MAD3B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.03044&json=true","fetch_graph":"https://pith.science/api/pith-number/JO4MAD3BFUBQOWZ335ANYUGSLV/graph.json","fetch_events":"https://pith.science/api/pith-number/JO4MAD3BFUBQOWZ335ANYUGSLV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JO4MAD3BFUBQOWZ335ANYUGSLV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JO4MAD3BFUBQOWZ335ANYUGSLV/action/storage_attestation","attest_author":"https://pith.science/pith/JO4MAD3BFUBQOWZ335ANYUGSLV/action/author_attestation","sign_citation":"https://pith.science/pith/JO4MAD3BFUBQOWZ335ANYUGSLV/action/citation_signature","submit_replication":"https://pith.science/pith/JO4MAD3BFUBQOWZ335ANYUGSLV/action/replication_record"}},"created_at":"2026-07-05T11:15:13.890456+00:00","updated_at":"2026-07-05T11:15:13.890456+00:00"}