{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:IFBCINLPM3U6AKME53FS4JJIQB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fcf512e5c42b77855d754b0475b808b5764cbdcc4ccb7a38d2455463752883a9","cross_cats_sorted":["cs.CR","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-08-05T05:55:20Z","title_canon_sha256":"cc2188d9fb3c78c641eefda1d35b6298bd32ba8b04842bfc038c7f6e8366eac7"},"schema_version":"1.0","source":{"id":"2108.02391","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.02391","created_at":"2026-07-05T03:03:32Z"},{"alias_kind":"arxiv_version","alias_value":"2108.02391v1","created_at":"2026-07-05T03:03:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.02391","created_at":"2026-07-05T03:03:32Z"},{"alias_kind":"pith_short_12","alias_value":"IFBCINLPM3U6","created_at":"2026-07-05T03:03:32Z"},{"alias_kind":"pith_short_16","alias_value":"IFBCINLPM3U6AKME","created_at":"2026-07-05T03:03:32Z"},{"alias_kind":"pith_short_8","alias_value":"IFBCINLP","created_at":"2026-07-05T03:03:32Z"}],"graph_snapshots":[{"event_id":"sha256:f65bd088f93ed6672f908dc23c8bf8568c1f7aaf74102119501a0518301bb0e7","target":"graph","created_at":"2026-07-05T03:03:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2108.02391/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We develop algorithms for private stochastic convex optimization that adapt to the hardness of the specific function we wish to optimize. While previous work provide worst-case bounds for arbitrary convex functions, it is often the case that the function at hand belongs to a smaller class that enjoys faster rates. Concretely, we show that for functions exhibiting $\\kappa$-growth around the optimum, i.e., $f(x) \\ge f(x^*) + \\lambda \\kappa^{-1} \\|x-x^*\\|_2^\\kappa$ for $\\kappa > 1$, our algorithms improve upon the standard ${\\sqrt{d}}/{n\\varepsilon}$ privacy rate to the faster $({\\sqrt{d}}/{n\\var","authors_text":"Daniel Levy, Hilal Asi, John Duchi","cross_cats":["cs.CR","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-08-05T05:55:20Z","title":"Adapting to Function Difficulty and Growth Conditions in Private Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.02391","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:45e59e09f8ea1da6a46bec0a46be4830de002353ec318ab11b317c6979ac3db3","target":"record","created_at":"2026-07-05T03:03:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fcf512e5c42b77855d754b0475b808b5764cbdcc4ccb7a38d2455463752883a9","cross_cats_sorted":["cs.CR","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-08-05T05:55:20Z","title_canon_sha256":"cc2188d9fb3c78c641eefda1d35b6298bd32ba8b04842bfc038c7f6e8366eac7"},"schema_version":"1.0","source":{"id":"2108.02391","kind":"arxiv","version":1}},"canonical_sha256":"414224356f66e9e02984eecb2e25288045292c79b699b29ca30f956bb330aac5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"414224356f66e9e02984eecb2e25288045292c79b699b29ca30f956bb330aac5","first_computed_at":"2026-07-05T03:03:32.572340Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:03:32.572340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fgUOrvzRXgMsuZHOOQIVpu4tCHzSeauaLcSsTDW6ZOB6qITJZAxc9AsGIs8mvvIxcVKGCtDKSeUtQzKIlp1VBw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:03:32.572814Z","signed_message":"canonical_sha256_bytes"},"source_id":"2108.02391","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45e59e09f8ea1da6a46bec0a46be4830de002353ec318ab11b317c6979ac3db3","sha256:f65bd088f93ed6672f908dc23c8bf8568c1f7aaf74102119501a0518301bb0e7"],"state_sha256":"3641466cdb7cc094d491e481f92a6b5fb5aba32ec5a06d831524878b89c5d959"}