{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4J5TCKFZLRIS5N6DNHWWX7K52Y","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":"1555b53899d768454316bacc5652a40f82f535d5b3132ccc102c9cd7e3b0592c","cross_cats_sorted":["cs.NA","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-01-29T00:12:52Z","title_canon_sha256":"d4f684137dd2393c7bd0de1886abb6434fcc24e97e4bb6e9f96c5d99504c03e3"},"schema_version":"1.0","source":{"id":"1801.09324","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.09324","created_at":"2026-06-04T19:11:27Z"},{"alias_kind":"arxiv_version","alias_value":"1801.09324v1","created_at":"2026-06-04T19:11:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.09324","created_at":"2026-06-04T19:11:27Z"},{"alias_kind":"pith_short_12","alias_value":"4J5TCKFZLRIS","created_at":"2026-06-04T19:11:27Z"},{"alias_kind":"pith_short_16","alias_value":"4J5TCKFZLRIS5N6D","created_at":"2026-06-04T19:11:27Z"},{"alias_kind":"pith_short_8","alias_value":"4J5TCKFZ","created_at":"2026-06-04T19:11:27Z"}],"graph_snapshots":[{"event_id":"sha256:5550181a54da8f401c4b4fd3e128f6353f1670dd853c4a9442e6871905e00e2c","target":"graph","created_at":"2026-06-04T19:11:27Z","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/1801.09324/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Stochastic gradient descent (SGD) optimization algorithms are key ingredients in a series of machine learning applications. In this article we perform a rigorous strong error analysis for SGD optimization algorithms. In particular, we prove for every arbitrarily small $\\varepsilon \\in (0,\\infty)$ and every arbitrarily large $p\\in (0,\\infty)$ that the considered SGD optimization algorithm converges in the strong $L^p$-sense with order $\\frac{1}{2}-\\varepsilon$ to the global minimum of the objective function of the considered stochastic approximation problem under standard convexity-type assumpt","authors_text":"Ariel Neufeld, Arnulf Jentzen, Benno Kuckuck, Philippe von Wurstemberger","cross_cats":["cs.NA","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-01-29T00:12:52Z","title":"Strong error analysis for stochastic gradient descent optimization algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.09324","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:203e5c1569195a320404e1cb4c461d0f38d087a86d62b43e03e5e9cd511be1b4","target":"record","created_at":"2026-06-04T19:11:27Z","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":"1555b53899d768454316bacc5652a40f82f535d5b3132ccc102c9cd7e3b0592c","cross_cats_sorted":["cs.NA","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-01-29T00:12:52Z","title_canon_sha256":"d4f684137dd2393c7bd0de1886abb6434fcc24e97e4bb6e9f96c5d99504c03e3"},"schema_version":"1.0","source":{"id":"1801.09324","kind":"arxiv","version":1}},"canonical_sha256":"e27b3128b95c512eb7c369ed6bfd5dd633d9c4801b105476188479b27bfb9f77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e27b3128b95c512eb7c369ed6bfd5dd633d9c4801b105476188479b27bfb9f77","first_computed_at":"2026-06-04T19:11:27.819661Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T19:11:27.819661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vCMDLxGmjggWhfNhGNtiI1Y4QQG2Xb5DbzHX82JT1A10JhjWN6uNeZZGklC7oPoxNRtsi04rnSrs/c6MMy3iCQ==","signature_status":"signed_v1","signed_at":"2026-06-04T19:11:27.820140Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.09324","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:203e5c1569195a320404e1cb4c461d0f38d087a86d62b43e03e5e9cd511be1b4","sha256:5550181a54da8f401c4b4fd3e128f6353f1670dd853c4a9442e6871905e00e2c"],"state_sha256":"76b4252e5d5762448a2605f254bf3a1cbd0f333d719888358c1a8384c5f20617"}