{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:5N4GDK7OMZJXCNMG4KXJBA2TWI","short_pith_number":"pith:5N4GDK7O","schema_version":"1.0","canonical_sha256":"eb7861abee6653713586e2ae908353b21f4a5ad374d7246cc628d224104c59e8","source":{"kind":"arxiv","id":"2205.15580","version":4},"attestation_state":"computed","paper":{"title":"A Computation and Communication Efficient Method for Distributed Nonconvex Problems in the Partial Participation Setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Alexander Tyurin, Peter Richt\\'arik","submitted_at":"2022-05-31T07:41:20Z","abstract_excerpt":"We present a new method that includes three key components of distributed optimization and federated learning: variance reduction of stochastic gradients, partial participation, and compressed communication. We prove that the new method has optimal oracle complexity and state-of-the-art communication complexity in the partial participation setting. Regardless of the communication compression feature, our method successfully combines variance reduction and partial participation: we get the optimal oracle complexity, never need the participation of all nodes, and do not require the bounded gradi"},"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":"2205.15580","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-31T07:41:20Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"cc67401703d36ddfd0be639cf050a632f5d02247a9b5b543bd27abfe82660035","abstract_canon_sha256":"99658107d3517e07fa3a07d6e4665454a160a39fa75500e37320dc999ffa2e65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:29:51.124126Z","signature_b64":"X1uSf8fn/8ucQkDu+g46kmHmnRF/UrqgKZOW5PA7BLRqq6WqsE7hv8WkxbRBuV/jVT6noJVtAS9fc2wM2vJzCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb7861abee6653713586e2ae908353b21f4a5ad374d7246cc628d224104c59e8","last_reissued_at":"2026-07-05T07:29:51.123570Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:29:51.123570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Computation and Communication Efficient Method for Distributed Nonconvex Problems in the Partial Participation Setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Alexander Tyurin, Peter Richt\\'arik","submitted_at":"2022-05-31T07:41:20Z","abstract_excerpt":"We present a new method that includes three key components of distributed optimization and federated learning: variance reduction of stochastic gradients, partial participation, and compressed communication. We prove that the new method has optimal oracle complexity and state-of-the-art communication complexity in the partial participation setting. Regardless of the communication compression feature, our method successfully combines variance reduction and partial participation: we get the optimal oracle complexity, never need the participation of all nodes, and do not require the bounded gradi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.15580","kind":"arxiv","version":4},"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/2205.15580/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":"2205.15580","created_at":"2026-07-05T07:29:51.123640+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.15580v4","created_at":"2026-07-05T07:29:51.123640+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.15580","created_at":"2026-07-05T07:29:51.123640+00:00"},{"alias_kind":"pith_short_12","alias_value":"5N4GDK7OMZJX","created_at":"2026-07-05T07:29:51.123640+00:00"},{"alias_kind":"pith_short_16","alias_value":"5N4GDK7OMZJXCNMG","created_at":"2026-07-05T07:29:51.123640+00:00"},{"alias_kind":"pith_short_8","alias_value":"5N4GDK7O","created_at":"2026-07-05T07:29:51.123640+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"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":173,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18174","citing_title":"Ringmaster LMO: Asynchronous Linear Minimization Oracle Momentum Method","ref_index":172,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13434","citing_title":"Rescaled Asynchronous SGD: Optimal Distributed Optimization under Data and System Heterogeneity","ref_index":276,"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":170,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5N4GDK7OMZJXCNMG4KXJBA2TWI","json":"https://pith.science/pith/5N4GDK7OMZJXCNMG4KXJBA2TWI.json","graph_json":"https://pith.science/api/pith-number/5N4GDK7OMZJXCNMG4KXJBA2TWI/graph.json","events_json":"https://pith.science/api/pith-number/5N4GDK7OMZJXCNMG4KXJBA2TWI/events.json","paper":"https://pith.science/paper/5N4GDK7O"},"agent_actions":{"view_html":"https://pith.science/pith/5N4GDK7OMZJXCNMG4KXJBA2TWI","download_json":"https://pith.science/pith/5N4GDK7OMZJXCNMG4KXJBA2TWI.json","view_paper":"https://pith.science/paper/5N4GDK7O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.15580&json=true","fetch_graph":"https://pith.science/api/pith-number/5N4GDK7OMZJXCNMG4KXJBA2TWI/graph.json","fetch_events":"https://pith.science/api/pith-number/5N4GDK7OMZJXCNMG4KXJBA2TWI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5N4GDK7OMZJXCNMG4KXJBA2TWI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5N4GDK7OMZJXCNMG4KXJBA2TWI/action/storage_attestation","attest_author":"https://pith.science/pith/5N4GDK7OMZJXCNMG4KXJBA2TWI/action/author_attestation","sign_citation":"https://pith.science/pith/5N4GDK7OMZJXCNMG4KXJBA2TWI/action/citation_signature","submit_replication":"https://pith.science/pith/5N4GDK7OMZJXCNMG4KXJBA2TWI/action/replication_record"}},"created_at":"2026-07-05T07:29:51.123640+00:00","updated_at":"2026-07-05T07:29:51.123640+00:00"}