{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:XBUNRDITI3POB5GUNKMIDXZMHD","short_pith_number":"pith:XBUNRDIT","schema_version":"1.0","canonical_sha256":"b868d88d1346dee0f4d46a9881df2c38ef594dd470452febab0195ad1ad239e5","source":{"kind":"arxiv","id":"2011.03853","version":3},"attestation_state":"computed","paper":{"title":"A fast randomized incremental gradient method for decentralized non-convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY","eess.SY","stat.ML"],"primary_cat":"math.OC","authors_text":"Ran Xin, Soummya Kar, Usman A. Khan","submitted_at":"2020-11-07T21:30:42Z","abstract_excerpt":"We study decentralized non-convex finite-sum minimization problems described over a network of nodes, where each node possesses a local batch of data samples. In this context, we analyze a single-timescale randomized incremental gradient method, called GT-SAGA. GT-SAGA is computationally efficient as it evaluates one component gradient per node per iteration and achieves provably fast and robust performance by leveraging node-level variance reduction and network-level gradient tracking. For general smooth non-convex problems, we show the almost sure and mean-squared convergence of GT-SAGA to a"},"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":"2011.03853","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-11-07T21:30:42Z","cross_cats_sorted":["cs.LG","cs.SY","eess.SY","stat.ML"],"title_canon_sha256":"a8e3126ba40abf753e8598a5ae5b6eb3862f696fc30c7cae1bf34f0c384c0795","abstract_canon_sha256":"838fe2900a5d70cc865883cf50d9ed2f86ce74fe799967b995849d59fe93698b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:19:02.545370Z","signature_b64":"Skpp8owIUNCXn2Q91XBpw1urpuPHD8JTnczimgJmOJElHyVcp3mMwfQMIHbECumcjgjMMJhkmqMIRxI90YjvBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b868d88d1346dee0f4d46a9881df2c38ef594dd470452febab0195ad1ad239e5","last_reissued_at":"2026-07-05T03:19:02.544962Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:19:02.544962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A fast randomized incremental gradient method for decentralized non-convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY","eess.SY","stat.ML"],"primary_cat":"math.OC","authors_text":"Ran Xin, Soummya Kar, Usman A. Khan","submitted_at":"2020-11-07T21:30:42Z","abstract_excerpt":"We study decentralized non-convex finite-sum minimization problems described over a network of nodes, where each node possesses a local batch of data samples. In this context, we analyze a single-timescale randomized incremental gradient method, called GT-SAGA. GT-SAGA is computationally efficient as it evaluates one component gradient per node per iteration and achieves provably fast and robust performance by leveraging node-level variance reduction and network-level gradient tracking. For general smooth non-convex problems, we show the almost sure and mean-squared convergence of GT-SAGA to a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.03853","kind":"arxiv","version":3},"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/2011.03853/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":"2011.03853","created_at":"2026-07-05T03:19:02.545012+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.03853v3","created_at":"2026-07-05T03:19:02.545012+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.03853","created_at":"2026-07-05T03:19:02.545012+00:00"},{"alias_kind":"pith_short_12","alias_value":"XBUNRDITI3PO","created_at":"2026-07-05T03:19:02.545012+00:00"},{"alias_kind":"pith_short_16","alias_value":"XBUNRDITI3POB5GU","created_at":"2026-07-05T03:19:02.545012+00:00"},{"alias_kind":"pith_short_8","alias_value":"XBUNRDIT","created_at":"2026-07-05T03:19:02.545012+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/XBUNRDITI3POB5GUNKMIDXZMHD","json":"https://pith.science/pith/XBUNRDITI3POB5GUNKMIDXZMHD.json","graph_json":"https://pith.science/api/pith-number/XBUNRDITI3POB5GUNKMIDXZMHD/graph.json","events_json":"https://pith.science/api/pith-number/XBUNRDITI3POB5GUNKMIDXZMHD/events.json","paper":"https://pith.science/paper/XBUNRDIT"},"agent_actions":{"view_html":"https://pith.science/pith/XBUNRDITI3POB5GUNKMIDXZMHD","download_json":"https://pith.science/pith/XBUNRDITI3POB5GUNKMIDXZMHD.json","view_paper":"https://pith.science/paper/XBUNRDIT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.03853&json=true","fetch_graph":"https://pith.science/api/pith-number/XBUNRDITI3POB5GUNKMIDXZMHD/graph.json","fetch_events":"https://pith.science/api/pith-number/XBUNRDITI3POB5GUNKMIDXZMHD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XBUNRDITI3POB5GUNKMIDXZMHD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XBUNRDITI3POB5GUNKMIDXZMHD/action/storage_attestation","attest_author":"https://pith.science/pith/XBUNRDITI3POB5GUNKMIDXZMHD/action/author_attestation","sign_citation":"https://pith.science/pith/XBUNRDITI3POB5GUNKMIDXZMHD/action/citation_signature","submit_replication":"https://pith.science/pith/XBUNRDITI3POB5GUNKMIDXZMHD/action/replication_record"}},"created_at":"2026-07-05T03:19:02.545012+00:00","updated_at":"2026-07-05T03:19:02.545012+00:00"}