{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3PS24SKDTFXHB3ECVSQW4L6CQV","short_pith_number":"pith:3PS24SKD","schema_version":"1.0","canonical_sha256":"dbe5ae4943996e70ec82aca16e2fc28576dcd0aadaed0556eedb3d8fa95921bf","source":{"kind":"arxiv","id":"1707.01155","version":1},"attestation_state":"computed","paper":{"title":"Stochastic, Distributed and Federated Optimization for Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jakub Kone\\v{c}n\\'y","submitted_at":"2017-07-04T21:15:14Z","abstract_excerpt":"We study optimization algorithms for the finite sum problems frequently arising in machine learning applications. First, we propose novel variants of stochastic gradient descent with a variance reduction property that enables linear convergence for strongly convex objectives. Second, we study distributed setting, in which the data describing the optimization problem does not fit into a single computing node. In this case, traditional methods are inefficient, as the communication costs inherent in distributed optimization become the bottleneck. We propose a communication-efficient framework whi"},"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":"1707.01155","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-04T21:15:14Z","cross_cats_sorted":[],"title_canon_sha256":"2186c5a5609b06b1e5b7a33bfa0c4b9c988a9bcafb0baa159fb01ce0db94d1f7","abstract_canon_sha256":"bcd9ab7b1713785eabe8ae919cc5035dc0b02825230026d1e52cd96379360342"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:53.536344Z","signature_b64":"jV5G3FlUmyAShtuBK3vZpwUMqEUKCTCBgDbeMF3qxTBJG/r4wfW+shKp2WuEO+yUGRlGCTemAT92Omsh0jbyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbe5ae4943996e70ec82aca16e2fc28576dcd0aadaed0556eedb3d8fa95921bf","last_reissued_at":"2026-05-18T00:40:53.535843Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:53.535843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic, Distributed and Federated Optimization for Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jakub Kone\\v{c}n\\'y","submitted_at":"2017-07-04T21:15:14Z","abstract_excerpt":"We study optimization algorithms for the finite sum problems frequently arising in machine learning applications. First, we propose novel variants of stochastic gradient descent with a variance reduction property that enables linear convergence for strongly convex objectives. Second, we study distributed setting, in which the data describing the optimization problem does not fit into a single computing node. In this case, traditional methods are inefficient, as the communication costs inherent in distributed optimization become the bottleneck. We propose a communication-efficient framework whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01155","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":""},"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":"1707.01155","created_at":"2026-05-18T00:40:53.535920+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.01155v1","created_at":"2026-05-18T00:40:53.535920+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01155","created_at":"2026-05-18T00:40:53.535920+00:00"},{"alias_kind":"pith_short_12","alias_value":"3PS24SKDTFXH","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3PS24SKDTFXHB3EC","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3PS24SKD","created_at":"2026-05-18T12:30:58.224056+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/3PS24SKDTFXHB3ECVSQW4L6CQV","json":"https://pith.science/pith/3PS24SKDTFXHB3ECVSQW4L6CQV.json","graph_json":"https://pith.science/api/pith-number/3PS24SKDTFXHB3ECVSQW4L6CQV/graph.json","events_json":"https://pith.science/api/pith-number/3PS24SKDTFXHB3ECVSQW4L6CQV/events.json","paper":"https://pith.science/paper/3PS24SKD"},"agent_actions":{"view_html":"https://pith.science/pith/3PS24SKDTFXHB3ECVSQW4L6CQV","download_json":"https://pith.science/pith/3PS24SKDTFXHB3ECVSQW4L6CQV.json","view_paper":"https://pith.science/paper/3PS24SKD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.01155&json=true","fetch_graph":"https://pith.science/api/pith-number/3PS24SKDTFXHB3ECVSQW4L6CQV/graph.json","fetch_events":"https://pith.science/api/pith-number/3PS24SKDTFXHB3ECVSQW4L6CQV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3PS24SKDTFXHB3ECVSQW4L6CQV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3PS24SKDTFXHB3ECVSQW4L6CQV/action/storage_attestation","attest_author":"https://pith.science/pith/3PS24SKDTFXHB3ECVSQW4L6CQV/action/author_attestation","sign_citation":"https://pith.science/pith/3PS24SKDTFXHB3ECVSQW4L6CQV/action/citation_signature","submit_replication":"https://pith.science/pith/3PS24SKDTFXHB3ECVSQW4L6CQV/action/replication_record"}},"created_at":"2026-05-18T00:40:53.535920+00:00","updated_at":"2026-05-18T00:40:53.535920+00:00"}