{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:HFRZXSGVF7E77NQ4CZ6UTJ4NKS","short_pith_number":"pith:HFRZXSGV","schema_version":"1.0","canonical_sha256":"39639bc8d52fc9ffb61c167d49a78d54b8cb5604057ffd4477ee85e75265bf15","source":{"kind":"arxiv","id":"2005.00224","version":1},"attestation_state":"computed","paper":{"title":"Distributed Stochastic Non-Convex Optimization: Momentum-Based Variance Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.OC","authors_text":"Ketan Rajawat, Pramod K. Varshney, Pranay Sharma, Prashant Khanduri, Saikiran Bulusu, Swatantra Kafle","submitted_at":"2020-05-01T05:04:38Z","abstract_excerpt":"In this work, we propose a distributed algorithm for stochastic non-convex optimization. We consider a worker-server architecture where a set of $K$ worker nodes (WNs) in collaboration with a server node (SN) jointly aim to minimize a global, potentially non-convex objective function. The objective function is assumed to be the sum of local objective functions available at each WN, with each node having access to only the stochastic samples of its local objective function. In contrast to the existing approaches, we employ a momentum based \"single loop\" distributed algorithm which eliminates th"},"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":"2005.00224","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-05-01T05:04:38Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"169625b806c99a8d81cdcff34a2a161a59588a6ef6a733618f0e2f0a9641a7dc","abstract_canon_sha256":"4b06edf62c22b44e1092236bc269304d9f43ef5a7d7052dac6bab273c9033d02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:59:39.067892Z","signature_b64":"uxTREltRVfLShoM6/C8N0AKJK7HPSdcRbsdwjqvUWJi3in2zQzMr7e+zM91+gdfOnkloBd5v5+aJfstJmw4LBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39639bc8d52fc9ffb61c167d49a78d54b8cb5604057ffd4477ee85e75265bf15","last_reissued_at":"2026-07-05T00:59:39.067482Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:59:39.067482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Stochastic Non-Convex Optimization: Momentum-Based Variance Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.OC","authors_text":"Ketan Rajawat, Pramod K. Varshney, Pranay Sharma, Prashant Khanduri, Saikiran Bulusu, Swatantra Kafle","submitted_at":"2020-05-01T05:04:38Z","abstract_excerpt":"In this work, we propose a distributed algorithm for stochastic non-convex optimization. We consider a worker-server architecture where a set of $K$ worker nodes (WNs) in collaboration with a server node (SN) jointly aim to minimize a global, potentially non-convex objective function. The objective function is assumed to be the sum of local objective functions available at each WN, with each node having access to only the stochastic samples of its local objective function. In contrast to the existing approaches, we employ a momentum based \"single loop\" distributed algorithm which eliminates th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.00224","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.00224/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":"2005.00224","created_at":"2026-07-05T00:59:39.067539+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.00224v1","created_at":"2026-07-05T00:59:39.067539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.00224","created_at":"2026-07-05T00:59:39.067539+00:00"},{"alias_kind":"pith_short_12","alias_value":"HFRZXSGVF7E7","created_at":"2026-07-05T00:59:39.067539+00:00"},{"alias_kind":"pith_short_16","alias_value":"HFRZXSGVF7E77NQ4","created_at":"2026-07-05T00:59:39.067539+00:00"},{"alias_kind":"pith_short_8","alias_value":"HFRZXSGV","created_at":"2026-07-05T00:59:39.067539+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.20866","citing_title":"LOSCAR-SGD: Local SGD with Communication-Computation Overlap and Delay-Corrected Sparse Model Averaging","ref_index":129,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18174","citing_title":"Ringmaster LMO: Asynchronous Linear Minimization Oracle Momentum Method","ref_index":127,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13434","citing_title":"Rescaled Asynchronous SGD: Optimal Distributed Optimization under Data and System Heterogeneity","ref_index":238,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08871","citing_title":"Rennala MVR: Improved Time Complexity for Parallel Stochastic Optimization via Momentum-Based Variance Reduction","ref_index":125,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07795","citing_title":"Scalable Distributed Stochastic Optimization via Bidirectional Compression: Beyond Pessimistic Limits","ref_index":49,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HFRZXSGVF7E77NQ4CZ6UTJ4NKS","json":"https://pith.science/pith/HFRZXSGVF7E77NQ4CZ6UTJ4NKS.json","graph_json":"https://pith.science/api/pith-number/HFRZXSGVF7E77NQ4CZ6UTJ4NKS/graph.json","events_json":"https://pith.science/api/pith-number/HFRZXSGVF7E77NQ4CZ6UTJ4NKS/events.json","paper":"https://pith.science/paper/HFRZXSGV"},"agent_actions":{"view_html":"https://pith.science/pith/HFRZXSGVF7E77NQ4CZ6UTJ4NKS","download_json":"https://pith.science/pith/HFRZXSGVF7E77NQ4CZ6UTJ4NKS.json","view_paper":"https://pith.science/paper/HFRZXSGV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.00224&json=true","fetch_graph":"https://pith.science/api/pith-number/HFRZXSGVF7E77NQ4CZ6UTJ4NKS/graph.json","fetch_events":"https://pith.science/api/pith-number/HFRZXSGVF7E77NQ4CZ6UTJ4NKS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HFRZXSGVF7E77NQ4CZ6UTJ4NKS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HFRZXSGVF7E77NQ4CZ6UTJ4NKS/action/storage_attestation","attest_author":"https://pith.science/pith/HFRZXSGVF7E77NQ4CZ6UTJ4NKS/action/author_attestation","sign_citation":"https://pith.science/pith/HFRZXSGVF7E77NQ4CZ6UTJ4NKS/action/citation_signature","submit_replication":"https://pith.science/pith/HFRZXSGVF7E77NQ4CZ6UTJ4NKS/action/replication_record"}},"created_at":"2026-07-05T00:59:39.067539+00:00","updated_at":"2026-07-05T00:59:39.067539+00:00"}