{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:BOVLCZRSUHJML66VE4WSYU3AJC","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":"80013ebf39b8a0d69a6f65063a4c15d9c111089a6f979a14c32baf51d88978ac","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-08-17T23:05:05Z","title_canon_sha256":"a234c61120abd3dc1af316cf47079c5791cc44a306d5020ce2c20c510106cddb"},"schema_version":"1.0","source":{"id":"2208.08567","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.08567","created_at":"2026-07-05T08:07:54Z"},{"alias_kind":"arxiv_version","alias_value":"2208.08567v2","created_at":"2026-07-05T08:07:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.08567","created_at":"2026-07-05T08:07:54Z"},{"alias_kind":"pith_short_12","alias_value":"BOVLCZRSUHJM","created_at":"2026-07-05T08:07:54Z"},{"alias_kind":"pith_short_16","alias_value":"BOVLCZRSUHJML66V","created_at":"2026-07-05T08:07:54Z"},{"alias_kind":"pith_short_8","alias_value":"BOVLCZRS","created_at":"2026-07-05T08:07:54Z"}],"graph_snapshots":[{"event_id":"sha256:1418b6e50835ad258f81235bf3ffe08f7f490693bbf3136c85ae246d308eeea8","target":"graph","created_at":"2026-07-05T08:07:54Z","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/2208.08567/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work we study high probability bounds for stochastic subgradient methods under heavy tailed noise. In this setting the noise is only assumed to have finite variance as opposed to a sub-Gaussian distribution for which it is known that standard subgradient methods enjoys high probability bounds. We analyzed a clipped version of the projected stochastic subgradient method, where subgradient estimates are truncated whenever they have large norms. We show that this clipping strategy leads both to near optimal any-time and finite horizon bounds for many classical averaging schemes. Prelimina","authors_text":"Andrea Paudice, Daniela A. Parletta, Massimiliano Pontil, Saverio Salzo","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-08-17T23:05:05Z","title":"High Probability Bounds for Stochastic Subgradient Schemes with Heavy Tailed Noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.08567","kind":"arxiv","version":2},"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:c0780f4872d574048151a2a19a5c4d88c5ff3fd77a07ff97d670c78af96eb881","target":"record","created_at":"2026-07-05T08:07:54Z","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":"80013ebf39b8a0d69a6f65063a4c15d9c111089a6f979a14c32baf51d88978ac","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-08-17T23:05:05Z","title_canon_sha256":"a234c61120abd3dc1af316cf47079c5791cc44a306d5020ce2c20c510106cddb"},"schema_version":"1.0","source":{"id":"2208.08567","kind":"arxiv","version":2}},"canonical_sha256":"0baab16632a1d2c5fbd5272d2c536048b02c8cbf422ac2c8da06a0e7bfa10435","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0baab16632a1d2c5fbd5272d2c536048b02c8cbf422ac2c8da06a0e7bfa10435","first_computed_at":"2026-07-05T08:07:54.433791Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:07:54.433791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CEu3Ipoji5vcNUhu2GiAO0goya0amR6c38FYMYGjBA1IxfXLF9s7I9ZtbiBRO/+hstT6lKtWHWc84yoy5ZM4DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:07:54.434252Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.08567","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0780f4872d574048151a2a19a5c4d88c5ff3fd77a07ff97d670c78af96eb881","sha256:1418b6e50835ad258f81235bf3ffe08f7f490693bbf3136c85ae246d308eeea8"],"state_sha256":"ba5299d71b46f365d7d98a5e2c2acd8d6384b567684615e633c5cd48bbc90742"}