{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UQIJ2CZL5CLIBXJ3B5RLRMUB4O","short_pith_number":"pith:UQIJ2CZL","schema_version":"1.0","canonical_sha256":"a4109d0b2be89680dd3b0f62b8b281e3b43ab72bf679dc20df0feb3c7ccf29d8","source":{"kind":"arxiv","id":"1907.01849","version":1},"attestation_state":"computed","paper":{"title":"Distributed Learning in Non-Convex Environments -- Part II: Polynomial Escape from Saddle-Points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.SP","math.OC"],"primary_cat":"cs.MA","authors_text":"Ali H. Sayed, Stefan Vlaski","submitted_at":"2019-07-03T11:06:43Z","abstract_excerpt":"The diffusion strategy for distributed learning from streaming data employs local stochastic gradient updates along with exchange of iterates over neighborhoods. In Part I [2] of this work we established that agents cluster around a network centroid and proceeded to study the dynamics of this point. We established expected descent in non-convex environments in the large-gradient regime and introduced a short-term model to examine the dynamics over finite-time horizons. Using this model, we establish in this work that the diffusion strategy is able to escape from strict saddle-points in O(1/$\\m"},"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":"1907.01849","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-07-03T11:06:43Z","cross_cats_sorted":["cs.LG","eess.SP","math.OC"],"title_canon_sha256":"cb3e03c0dbc7cff257929f4e9f218e625618e35e8736c5caaf771c2eb90bd542","abstract_canon_sha256":"736425e96beff47fbd69e689e677b6572264a4cad3cf1d2b1849d4287ea94e7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:34.813073Z","signature_b64":"hqYxr6v/B9+Bu0yMy9WyHkfjpb0mQMymzPdrxOlKQdyeeyTxdeCQk3GR15UP+a05SV6T7OKJcAXrS3rDUo3aCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4109d0b2be89680dd3b0f62b8b281e3b43ab72bf679dc20df0feb3c7ccf29d8","last_reissued_at":"2026-05-17T23:41:34.812435Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:34.812435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Learning in Non-Convex Environments -- Part II: Polynomial Escape from Saddle-Points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.SP","math.OC"],"primary_cat":"cs.MA","authors_text":"Ali H. Sayed, Stefan Vlaski","submitted_at":"2019-07-03T11:06:43Z","abstract_excerpt":"The diffusion strategy for distributed learning from streaming data employs local stochastic gradient updates along with exchange of iterates over neighborhoods. In Part I [2] of this work we established that agents cluster around a network centroid and proceeded to study the dynamics of this point. We established expected descent in non-convex environments in the large-gradient regime and introduced a short-term model to examine the dynamics over finite-time horizons. Using this model, we establish in this work that the diffusion strategy is able to escape from strict saddle-points in O(1/$\\m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.01849","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":""},"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":"1907.01849","created_at":"2026-05-17T23:41:34.812542+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.01849v1","created_at":"2026-05-17T23:41:34.812542+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.01849","created_at":"2026-05-17T23:41:34.812542+00:00"},{"alias_kind":"pith_short_12","alias_value":"UQIJ2CZL5CLI","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"UQIJ2CZL5CLIBXJ3","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"UQIJ2CZL","created_at":"2026-05-18T12:33:30.264802+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/UQIJ2CZL5CLIBXJ3B5RLRMUB4O","json":"https://pith.science/pith/UQIJ2CZL5CLIBXJ3B5RLRMUB4O.json","graph_json":"https://pith.science/api/pith-number/UQIJ2CZL5CLIBXJ3B5RLRMUB4O/graph.json","events_json":"https://pith.science/api/pith-number/UQIJ2CZL5CLIBXJ3B5RLRMUB4O/events.json","paper":"https://pith.science/paper/UQIJ2CZL"},"agent_actions":{"view_html":"https://pith.science/pith/UQIJ2CZL5CLIBXJ3B5RLRMUB4O","download_json":"https://pith.science/pith/UQIJ2CZL5CLIBXJ3B5RLRMUB4O.json","view_paper":"https://pith.science/paper/UQIJ2CZL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.01849&json=true","fetch_graph":"https://pith.science/api/pith-number/UQIJ2CZL5CLIBXJ3B5RLRMUB4O/graph.json","fetch_events":"https://pith.science/api/pith-number/UQIJ2CZL5CLIBXJ3B5RLRMUB4O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UQIJ2CZL5CLIBXJ3B5RLRMUB4O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UQIJ2CZL5CLIBXJ3B5RLRMUB4O/action/storage_attestation","attest_author":"https://pith.science/pith/UQIJ2CZL5CLIBXJ3B5RLRMUB4O/action/author_attestation","sign_citation":"https://pith.science/pith/UQIJ2CZL5CLIBXJ3B5RLRMUB4O/action/citation_signature","submit_replication":"https://pith.science/pith/UQIJ2CZL5CLIBXJ3B5RLRMUB4O/action/replication_record"}},"created_at":"2026-05-17T23:41:34.812542+00:00","updated_at":"2026-05-17T23:41:34.812542+00:00"}