{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IHLHCKENCNBMEUBGOICGZERJTN","short_pith_number":"pith:IHLHCKEN","schema_version":"1.0","canonical_sha256":"41d671288d1342c2502672046c92299b7ac70cbdbb961720e66fda54e90a4722","source":{"kind":"arxiv","id":"1410.4744","version":1},"attestation_state":"computed","paper":{"title":"mS2GD: Mini-Batch Semi-Stochastic Gradient Descent in the Proximal Setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jakub Kone\\v{c}n\\'y, Jie Liu, Martin Tak\\'a\\v{c}, Peter Richt\\'arik","submitted_at":"2014-10-17T14:43:43Z","abstract_excerpt":"We propose a mini-batching scheme for improving the theoretical complexity and practical performance of semi-stochastic gradient descent applied to the problem of minimizing a strongly convex composite function represented as the sum of an average of a large number of smooth convex functions, and simple nonsmooth convex function. Our method first performs a deterministic step (computation of the gradient of the objective function at the starting point), followed by a large number of stochastic steps. The process is repeated a few times with the last iterate becoming the new starting point. The"},"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":"1410.4744","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-17T14:43:43Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3a5ce7194a6d0a3d8d48d1ec5d6e9b37094b38275d5a50e9dd5b03071bec2c31","abstract_canon_sha256":"602e638e69388326942d07c61821cbb4bc3e5bcb64c1c4bee66f2ff86c25a84b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:54.807972Z","signature_b64":"HoRdr9FgofGz6l5EyNwxr4bEb0PowtsOuHgnUQ/fb6/UOn/2Tvoel4282wmkEpSg6GEjJwGWLrj4f+ZM+WH6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41d671288d1342c2502672046c92299b7ac70cbdbb961720e66fda54e90a4722","last_reissued_at":"2026-05-18T02:39:54.807556Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:54.807556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"mS2GD: Mini-Batch Semi-Stochastic Gradient Descent in the Proximal Setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jakub Kone\\v{c}n\\'y, Jie Liu, Martin Tak\\'a\\v{c}, Peter Richt\\'arik","submitted_at":"2014-10-17T14:43:43Z","abstract_excerpt":"We propose a mini-batching scheme for improving the theoretical complexity and practical performance of semi-stochastic gradient descent applied to the problem of minimizing a strongly convex composite function represented as the sum of an average of a large number of smooth convex functions, and simple nonsmooth convex function. Our method first performs a deterministic step (computation of the gradient of the objective function at the starting point), followed by a large number of stochastic steps. The process is repeated a few times with the last iterate becoming the new starting point. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4744","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":"1410.4744","created_at":"2026-05-18T02:39:54.807615+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.4744v1","created_at":"2026-05-18T02:39:54.807615+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4744","created_at":"2026-05-18T02:39:54.807615+00:00"},{"alias_kind":"pith_short_12","alias_value":"IHLHCKENCNBM","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IHLHCKENCNBMEUBG","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IHLHCKEN","created_at":"2026-05-18T12:28:33.132498+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/IHLHCKENCNBMEUBGOICGZERJTN","json":"https://pith.science/pith/IHLHCKENCNBMEUBGOICGZERJTN.json","graph_json":"https://pith.science/api/pith-number/IHLHCKENCNBMEUBGOICGZERJTN/graph.json","events_json":"https://pith.science/api/pith-number/IHLHCKENCNBMEUBGOICGZERJTN/events.json","paper":"https://pith.science/paper/IHLHCKEN"},"agent_actions":{"view_html":"https://pith.science/pith/IHLHCKENCNBMEUBGOICGZERJTN","download_json":"https://pith.science/pith/IHLHCKENCNBMEUBGOICGZERJTN.json","view_paper":"https://pith.science/paper/IHLHCKEN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.4744&json=true","fetch_graph":"https://pith.science/api/pith-number/IHLHCKENCNBMEUBGOICGZERJTN/graph.json","fetch_events":"https://pith.science/api/pith-number/IHLHCKENCNBMEUBGOICGZERJTN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IHLHCKENCNBMEUBGOICGZERJTN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IHLHCKENCNBMEUBGOICGZERJTN/action/storage_attestation","attest_author":"https://pith.science/pith/IHLHCKENCNBMEUBGOICGZERJTN/action/author_attestation","sign_citation":"https://pith.science/pith/IHLHCKENCNBMEUBGOICGZERJTN/action/citation_signature","submit_replication":"https://pith.science/pith/IHLHCKENCNBMEUBGOICGZERJTN/action/replication_record"}},"created_at":"2026-05-18T02:39:54.807615+00:00","updated_at":"2026-05-18T02:39:54.807615+00:00"}