{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:X5GRMVJ7A7GQY6VED5O7K7LA5D","short_pith_number":"pith:X5GRMVJ7","schema_version":"1.0","canonical_sha256":"bf4d16553f07cd0c7aa41f5df57d60e8ed8fa4bcc5d622aa5567723b0225a457","source":{"kind":"arxiv","id":"2301.05872","version":3},"attestation_state":"computed","paper":{"title":"CEDAS: A Compressed Decentralized Stochastic Gradient Method with Improved Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","cs.MA"],"primary_cat":"math.OC","authors_text":"Kun Huang, Shi Pu","submitted_at":"2023-01-14T09:49:15Z","abstract_excerpt":"In this paper, we consider solving the distributed optimization problem over a multi-agent network under the communication restricted setting. We study a compressed decentralized stochastic gradient method, termed ``compressed exact diffusion with adaptive stepsizes (CEDAS)\", and show the method asymptotically achieves comparable convergence rate as centralized { stochastic gradient descent (SGD)} for both smooth strongly convex objective functions and smooth nonconvex objective functions under unbiased compression operators. In particular, to our knowledge, CEDAS enjoys so far the shortest tr"},"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":"2301.05872","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-01-14T09:49:15Z","cross_cats_sorted":["cs.DC","cs.LG","cs.MA"],"title_canon_sha256":"a50d4e3d15db74337ee8642aad67cd33bfeb25abefa8c0b0a5054d1c5c74de98","abstract_canon_sha256":"0a699a6c5a881f266ff42833ca3f3ff8c7eef381f5579202550a37956301941d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:12:52.551232Z","signature_b64":"9i82Co6wRNfMe2HVEDAcKlFrjiE1dSMcm7IhiBt2cQu8i9J4RE4REI+U1A65KAz++DSm0OwUypBwDGaU5vNcDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf4d16553f07cd0c7aa41f5df57d60e8ed8fa4bcc5d622aa5567723b0225a457","last_reissued_at":"2026-07-05T09:12:52.550807Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:12:52.550807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CEDAS: A Compressed Decentralized Stochastic Gradient Method with Improved Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","cs.MA"],"primary_cat":"math.OC","authors_text":"Kun Huang, Shi Pu","submitted_at":"2023-01-14T09:49:15Z","abstract_excerpt":"In this paper, we consider solving the distributed optimization problem over a multi-agent network under the communication restricted setting. We study a compressed decentralized stochastic gradient method, termed ``compressed exact diffusion with adaptive stepsizes (CEDAS)\", and show the method asymptotically achieves comparable convergence rate as centralized { stochastic gradient descent (SGD)} for both smooth strongly convex objective functions and smooth nonconvex objective functions under unbiased compression operators. In particular, to our knowledge, CEDAS enjoys so far the shortest tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.05872","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/2301.05872/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":"2301.05872","created_at":"2026-07-05T09:12:52.550863+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.05872v3","created_at":"2026-07-05T09:12:52.550863+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.05872","created_at":"2026-07-05T09:12:52.550863+00:00"},{"alias_kind":"pith_short_12","alias_value":"X5GRMVJ7A7GQ","created_at":"2026-07-05T09:12:52.550863+00:00"},{"alias_kind":"pith_short_16","alias_value":"X5GRMVJ7A7GQY6VE","created_at":"2026-07-05T09:12:52.550863+00:00"},{"alias_kind":"pith_short_8","alias_value":"X5GRMVJ7","created_at":"2026-07-05T09:12:52.550863+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2412.13054","citing_title":"Distributed Normal Map-based Stochastic Proximal Gradient Methods over Networks","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X5GRMVJ7A7GQY6VED5O7K7LA5D","json":"https://pith.science/pith/X5GRMVJ7A7GQY6VED5O7K7LA5D.json","graph_json":"https://pith.science/api/pith-number/X5GRMVJ7A7GQY6VED5O7K7LA5D/graph.json","events_json":"https://pith.science/api/pith-number/X5GRMVJ7A7GQY6VED5O7K7LA5D/events.json","paper":"https://pith.science/paper/X5GRMVJ7"},"agent_actions":{"view_html":"https://pith.science/pith/X5GRMVJ7A7GQY6VED5O7K7LA5D","download_json":"https://pith.science/pith/X5GRMVJ7A7GQY6VED5O7K7LA5D.json","view_paper":"https://pith.science/paper/X5GRMVJ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.05872&json=true","fetch_graph":"https://pith.science/api/pith-number/X5GRMVJ7A7GQY6VED5O7K7LA5D/graph.json","fetch_events":"https://pith.science/api/pith-number/X5GRMVJ7A7GQY6VED5O7K7LA5D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X5GRMVJ7A7GQY6VED5O7K7LA5D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X5GRMVJ7A7GQY6VED5O7K7LA5D/action/storage_attestation","attest_author":"https://pith.science/pith/X5GRMVJ7A7GQY6VED5O7K7LA5D/action/author_attestation","sign_citation":"https://pith.science/pith/X5GRMVJ7A7GQY6VED5O7K7LA5D/action/citation_signature","submit_replication":"https://pith.science/pith/X5GRMVJ7A7GQY6VED5O7K7LA5D/action/replication_record"}},"created_at":"2026-07-05T09:12:52.550863+00:00","updated_at":"2026-07-05T09:12:52.550863+00:00"}