{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CJFHCAU4ZY6SU6B2OT4K6ZFBLK","short_pith_number":"pith:CJFHCAU4","schema_version":"1.0","canonical_sha256":"124a71029cce3d2a783a74f8af64a15aa5aa17105725cbdd4b7b98d71c54b989","source":{"kind":"arxiv","id":"1810.13245","version":3},"attestation_state":"computed","paper":{"title":"Fast Convergence Rates of Distributed Subgradient Methods with Adaptive Quantization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Justin Romberg, Siva Theja Maguluri, Thinh T. Doan","submitted_at":"2018-10-30T16:06:03Z","abstract_excerpt":"We study distributed optimization problems over a network when the communication between the nodes is constrained, and so information that is exchanged between the nodes must be quantized. Recent advances using the distributed gradient algorithm with a quantization scheme at a fixed resolution have established convergence, but at rates significantly slower than when the communications are unquantized.\n  In this paper, we introduce a novel quantization method, which we refer to as adaptive quantization, that allows us to match the convergence rates under perfect communications. Our approach adj"},"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":"1810.13245","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-30T16:06:03Z","cross_cats_sorted":[],"title_canon_sha256":"b6bba6ab55c95dba684ca3fa1bc13bd29dcecc22dd414d64d518ff278359b457","abstract_canon_sha256":"5ed36fe1639471b637396408c40e9cbc8ae02eeef9e217c28f859743770b6a36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:29.649645Z","signature_b64":"ovnuzB19UjEmxGXwmSAVXQVNnqobR4gfzZEm0IynOJs9xyEPMdtYr5Bq6DbGMf52xRNn/10IyOIwUw6Tw1kUCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"124a71029cce3d2a783a74f8af64a15aa5aa17105725cbdd4b7b98d71c54b989","last_reissued_at":"2026-05-17T23:46:29.648939Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:29.648939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Convergence Rates of Distributed Subgradient Methods with Adaptive Quantization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Justin Romberg, Siva Theja Maguluri, Thinh T. Doan","submitted_at":"2018-10-30T16:06:03Z","abstract_excerpt":"We study distributed optimization problems over a network when the communication between the nodes is constrained, and so information that is exchanged between the nodes must be quantized. Recent advances using the distributed gradient algorithm with a quantization scheme at a fixed resolution have established convergence, but at rates significantly slower than when the communications are unquantized.\n  In this paper, we introduce a novel quantization method, which we refer to as adaptive quantization, that allows us to match the convergence rates under perfect communications. Our approach adj"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13245","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":""},"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":"1810.13245","created_at":"2026-05-17T23:46:29.649045+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.13245v3","created_at":"2026-05-17T23:46:29.649045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13245","created_at":"2026-05-17T23:46:29.649045+00:00"},{"alias_kind":"pith_short_12","alias_value":"CJFHCAU4ZY6S","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CJFHCAU4ZY6SU6B2","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CJFHCAU4","created_at":"2026-05-18T12:32:16.446611+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/CJFHCAU4ZY6SU6B2OT4K6ZFBLK","json":"https://pith.science/pith/CJFHCAU4ZY6SU6B2OT4K6ZFBLK.json","graph_json":"https://pith.science/api/pith-number/CJFHCAU4ZY6SU6B2OT4K6ZFBLK/graph.json","events_json":"https://pith.science/api/pith-number/CJFHCAU4ZY6SU6B2OT4K6ZFBLK/events.json","paper":"https://pith.science/paper/CJFHCAU4"},"agent_actions":{"view_html":"https://pith.science/pith/CJFHCAU4ZY6SU6B2OT4K6ZFBLK","download_json":"https://pith.science/pith/CJFHCAU4ZY6SU6B2OT4K6ZFBLK.json","view_paper":"https://pith.science/paper/CJFHCAU4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.13245&json=true","fetch_graph":"https://pith.science/api/pith-number/CJFHCAU4ZY6SU6B2OT4K6ZFBLK/graph.json","fetch_events":"https://pith.science/api/pith-number/CJFHCAU4ZY6SU6B2OT4K6ZFBLK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CJFHCAU4ZY6SU6B2OT4K6ZFBLK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CJFHCAU4ZY6SU6B2OT4K6ZFBLK/action/storage_attestation","attest_author":"https://pith.science/pith/CJFHCAU4ZY6SU6B2OT4K6ZFBLK/action/author_attestation","sign_citation":"https://pith.science/pith/CJFHCAU4ZY6SU6B2OT4K6ZFBLK/action/citation_signature","submit_replication":"https://pith.science/pith/CJFHCAU4ZY6SU6B2OT4K6ZFBLK/action/replication_record"}},"created_at":"2026-05-17T23:46:29.649045+00:00","updated_at":"2026-05-17T23:46:29.649045+00:00"}