{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VXTXKXVXMECB6ADOG5JQSY2A27","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":"9312876946cdebbb6549ea0bec147357e1ba8a4cbd362fed32fafb0349f02a81","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-27T04:22:14Z","title_canon_sha256":"0f995cd1f680afb431a23c69030619ff5ddc368795958b38d22a195cf8793088"},"schema_version":"1.0","source":{"id":"1805.10579","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10579","created_at":"2026-07-05T00:17:24Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10579v4","created_at":"2026-07-05T00:17:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10579","created_at":"2026-07-05T00:17:24Z"},{"alias_kind":"pith_short_12","alias_value":"VXTXKXVXMECB","created_at":"2026-07-05T00:17:24Z"},{"alias_kind":"pith_short_16","alias_value":"VXTXKXVXMECB6ADO","created_at":"2026-07-05T00:17:24Z"},{"alias_kind":"pith_short_8","alias_value":"VXTXKXVX","created_at":"2026-07-05T00:17:24Z"}],"graph_snapshots":[{"event_id":"sha256:0001f43cecbb557439f0dd2e4098c2c7f8096e97db99a615c94ae5ce492e149e","target":"graph","created_at":"2026-07-05T00:17:24Z","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/1805.10579/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the trade-offs between convergence rate and robustness to gradient errors in designing a first-order algorithm. We focus on gradient descent (GD) and accelerated gradient (AG) methods for minimizing strongly convex functions when the gradient has random errors in the form of additive white noise. With gradient errors, the function values of the iterates need not converge to the optimal value; hence, we define the robustness of an algorithm to noise as the asymptotic expected suboptimality of the iterate sequence to input noise power. For this robustness measure, we provide exact expre","authors_text":"Alireza Fallah, Asuman Ozdaglar, Mert Gurbuzbalaban, Necdet Serhat Aybat","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-27T04:22:14Z","title":"Robust Accelerated Gradient Methods for Smooth Strongly Convex Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10579","kind":"arxiv","version":4},"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:f525658a1ceda96d9f262344653302c02b7bc8574c48f6c12e0853a58932757b","target":"record","created_at":"2026-07-05T00:17:24Z","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":"9312876946cdebbb6549ea0bec147357e1ba8a4cbd362fed32fafb0349f02a81","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-27T04:22:14Z","title_canon_sha256":"0f995cd1f680afb431a23c69030619ff5ddc368795958b38d22a195cf8793088"},"schema_version":"1.0","source":{"id":"1805.10579","kind":"arxiv","version":4}},"canonical_sha256":"ade7755eb761041f006e3753096340d7f254c0b9e6d0f75c93d64283a1fc33cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ade7755eb761041f006e3753096340d7f254c0b9e6d0f75c93d64283a1fc33cf","first_computed_at":"2026-07-05T00:17:24.624763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:17:24.624763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w5W5xiy7ANC4eBSm7kUksRqaS9+YuNnfp4KsjJx+gIuWy3Rxw2ehxPREwcWF2E13/bEeoEn8RPd+y4LLH1o2AA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:17:24.625226Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.10579","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f525658a1ceda96d9f262344653302c02b7bc8574c48f6c12e0853a58932757b","sha256:0001f43cecbb557439f0dd2e4098c2c7f8096e97db99a615c94ae5ce492e149e"],"state_sha256":"7b1f4b0e201d3c1dc850839c36d5b77f57a0afae059868524f5dc9c96e883ca6"}