{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:HS5ZJCL3GYYV4X5YELMQAW2A37","short_pith_number":"pith:HS5ZJCL3","schema_version":"1.0","canonical_sha256":"3cbb94897b36315e5fb822d9005b40dfd74926cdbd58463d48451b2a4cbbab75","source":{"kind":"arxiv","id":"2105.07320","version":1},"attestation_state":"computed","paper":{"title":"LocalNewton: Reducing Communication Bottleneck for Distributed Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.DC","authors_text":"Avishek Ghosh, Kannan Ramchandran, Michael Mahoney, Michal Derezinski, Rajiv Khanna, Vipul Gupta","submitted_at":"2021-05-16T00:15:08Z","abstract_excerpt":"To address the communication bottleneck problem in distributed optimization within a master-worker framework, we propose LocalNewton, a distributed second-order algorithm with local averaging. In LocalNewton, the worker machines update their model in every iteration by finding a suitable second-order descent direction using only the data and model stored in their own local memory. We let the workers run multiple such iterations locally and communicate the models to the master node only once every few (say L) iterations. LocalNewton is highly practical since it requires only one hyperparameter,"},"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":"2105.07320","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2021-05-16T00:15:08Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"084109057545614bf9127c6229bf5a137e6efa318f159f81de3fb341a6638b25","abstract_canon_sha256":"7b34b38b56428cce4b6a67ad584d2f975bddb7323ef07289efc8f5543bf23534"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:40:39.740709Z","signature_b64":"eWT3jh3m24kJYEFZNP+OrUoogawEGfXTW+ZdGfHm0Es36F1+wXptJq+2m/vfD+86+Xm/IyTvBHfodCPL2gLwAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cbb94897b36315e5fb822d9005b40dfd74926cdbd58463d48451b2a4cbbab75","last_reissued_at":"2026-07-05T02:40:39.740209Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:40:39.740209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LocalNewton: Reducing Communication Bottleneck for Distributed Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.DC","authors_text":"Avishek Ghosh, Kannan Ramchandran, Michael Mahoney, Michal Derezinski, Rajiv Khanna, Vipul Gupta","submitted_at":"2021-05-16T00:15:08Z","abstract_excerpt":"To address the communication bottleneck problem in distributed optimization within a master-worker framework, we propose LocalNewton, a distributed second-order algorithm with local averaging. In LocalNewton, the worker machines update their model in every iteration by finding a suitable second-order descent direction using only the data and model stored in their own local memory. We let the workers run multiple such iterations locally and communicate the models to the master node only once every few (say L) iterations. LocalNewton is highly practical since it requires only one hyperparameter,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.07320","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/2105.07320/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":"2105.07320","created_at":"2026-07-05T02:40:39.740271+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.07320v1","created_at":"2026-07-05T02:40:39.740271+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.07320","created_at":"2026-07-05T02:40:39.740271+00:00"},{"alias_kind":"pith_short_12","alias_value":"HS5ZJCL3GYYV","created_at":"2026-07-05T02:40:39.740271+00:00"},{"alias_kind":"pith_short_16","alias_value":"HS5ZJCL3GYYV4X5Y","created_at":"2026-07-05T02:40:39.740271+00:00"},{"alias_kind":"pith_short_8","alias_value":"HS5ZJCL3","created_at":"2026-07-05T02:40:39.740271+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.12260","citing_title":"Decentralized Learning via Random Walk with Jumps","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HS5ZJCL3GYYV4X5YELMQAW2A37","json":"https://pith.science/pith/HS5ZJCL3GYYV4X5YELMQAW2A37.json","graph_json":"https://pith.science/api/pith-number/HS5ZJCL3GYYV4X5YELMQAW2A37/graph.json","events_json":"https://pith.science/api/pith-number/HS5ZJCL3GYYV4X5YELMQAW2A37/events.json","paper":"https://pith.science/paper/HS5ZJCL3"},"agent_actions":{"view_html":"https://pith.science/pith/HS5ZJCL3GYYV4X5YELMQAW2A37","download_json":"https://pith.science/pith/HS5ZJCL3GYYV4X5YELMQAW2A37.json","view_paper":"https://pith.science/paper/HS5ZJCL3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.07320&json=true","fetch_graph":"https://pith.science/api/pith-number/HS5ZJCL3GYYV4X5YELMQAW2A37/graph.json","fetch_events":"https://pith.science/api/pith-number/HS5ZJCL3GYYV4X5YELMQAW2A37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HS5ZJCL3GYYV4X5YELMQAW2A37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HS5ZJCL3GYYV4X5YELMQAW2A37/action/storage_attestation","attest_author":"https://pith.science/pith/HS5ZJCL3GYYV4X5YELMQAW2A37/action/author_attestation","sign_citation":"https://pith.science/pith/HS5ZJCL3GYYV4X5YELMQAW2A37/action/citation_signature","submit_replication":"https://pith.science/pith/HS5ZJCL3GYYV4X5YELMQAW2A37/action/replication_record"}},"created_at":"2026-07-05T02:40:39.740271+00:00","updated_at":"2026-07-05T02:40:39.740271+00:00"}