{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:IFBCINLPM3U6AKME53FS4JJIQB","short_pith_number":"pith:IFBCINLP","schema_version":"1.0","canonical_sha256":"414224356f66e9e02984eecb2e25288045292c79b699b29ca30f956bb330aac5","source":{"kind":"arxiv","id":"2108.02391","version":1},"attestation_state":"computed","paper":{"title":"Adapting to Function Difficulty and Growth Conditions in Private Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Levy, Hilal Asi, John Duchi","submitted_at":"2021-08-05T05:55:20Z","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"},"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":"2108.02391","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-08-05T05:55:20Z","cross_cats_sorted":["cs.CR","math.OC","stat.ML"],"title_canon_sha256":"cc2188d9fb3c78c641eefda1d35b6298bd32ba8b04842bfc038c7f6e8366eac7","abstract_canon_sha256":"fcf512e5c42b77855d754b0475b808b5764cbdcc4ccb7a38d2455463752883a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:03:32.572814Z","signature_b64":"fgUOrvzRXgMsuZHOOQIVpu4tCHzSeauaLcSsTDW6ZOB6qITJZAxc9AsGIs8mvvIxcVKGCtDKSeUtQzKIlp1VBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"414224356f66e9e02984eecb2e25288045292c79b699b29ca30f956bb330aac5","last_reissued_at":"2026-07-05T03:03:32.572340Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:03:32.572340Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adapting to Function Difficulty and Growth Conditions in Private Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Levy, Hilal Asi, John Duchi","submitted_at":"2021-08-05T05:55:20Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.02391","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/2108.02391/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":"2108.02391","created_at":"2026-07-05T03:03:32.572409+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.02391v1","created_at":"2026-07-05T03:03:32.572409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.02391","created_at":"2026-07-05T03:03:32.572409+00:00"},{"alias_kind":"pith_short_12","alias_value":"IFBCINLPM3U6","created_at":"2026-07-05T03:03:32.572409+00:00"},{"alias_kind":"pith_short_16","alias_value":"IFBCINLPM3U6AKME","created_at":"2026-07-05T03:03:32.572409+00:00"},{"alias_kind":"pith_short_8","alias_value":"IFBCINLP","created_at":"2026-07-05T03:03:32.572409+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IFBCINLPM3U6AKME53FS4JJIQB","json":"https://pith.science/pith/IFBCINLPM3U6AKME53FS4JJIQB.json","graph_json":"https://pith.science/api/pith-number/IFBCINLPM3U6AKME53FS4JJIQB/graph.json","events_json":"https://pith.science/api/pith-number/IFBCINLPM3U6AKME53FS4JJIQB/events.json","paper":"https://pith.science/paper/IFBCINLP"},"agent_actions":{"view_html":"https://pith.science/pith/IFBCINLPM3U6AKME53FS4JJIQB","download_json":"https://pith.science/pith/IFBCINLPM3U6AKME53FS4JJIQB.json","view_paper":"https://pith.science/paper/IFBCINLP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.02391&json=true","fetch_graph":"https://pith.science/api/pith-number/IFBCINLPM3U6AKME53FS4JJIQB/graph.json","fetch_events":"https://pith.science/api/pith-number/IFBCINLPM3U6AKME53FS4JJIQB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IFBCINLPM3U6AKME53FS4JJIQB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IFBCINLPM3U6AKME53FS4JJIQB/action/storage_attestation","attest_author":"https://pith.science/pith/IFBCINLPM3U6AKME53FS4JJIQB/action/author_attestation","sign_citation":"https://pith.science/pith/IFBCINLPM3U6AKME53FS4JJIQB/action/citation_signature","submit_replication":"https://pith.science/pith/IFBCINLPM3U6AKME53FS4JJIQB/action/replication_record"}},"created_at":"2026-07-05T03:03:32.572409+00:00","updated_at":"2026-07-05T03:03:32.572409+00:00"}