{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:C4V6J7N6INNFPEYUAWPY566JVV","short_pith_number":"pith:C4V6J7N6","schema_version":"1.0","canonical_sha256":"172be4fdbe435a579314059f8efbc9ad4255559ae3867238ff263d6827e844f8","source":{"kind":"arxiv","id":"1308.6370","version":1},"attestation_state":"computed","paper":{"title":"Fast Convergence of Stochastic Gradient Descent under a Strong Growth Condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"LIENS), Mark Schmidt (INRIA Paris - Rocquencourt, Nicolas Le Roux (INRIA Paris - Rocquencourt","submitted_at":"2013-08-29T06:06:42Z","abstract_excerpt":"We consider optimizing a function smooth convex function $f$ that is the average of a set of differentiable functions $f_i$, under the assumption considered by Solodov [1998] and Tseng [1998] that the norm of each gradient $f_i'$ is bounded by a linear function of the norm of the average gradient $f'$. We show that under these assumptions the basic stochastic gradient method with a sufficiently-small constant step-size has an $O(1/k)$ convergence rate, and has a linear convergence rate if $g$ is strongly-convex."},"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":"1308.6370","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-08-29T06:06:42Z","cross_cats_sorted":[],"title_canon_sha256":"5512bd264018135f7077f1b6bb04ef4ddb8e413dfbb34485e59b2cacdc280983","abstract_canon_sha256":"d9ce8dd64e6963ffd5516088b2dc1923156919180ed3225fa680b7f837ff6cf8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:40.122630Z","signature_b64":"CxElZfepkF3lfOgPGQL38ru5vsdYpk3Wh2XaFuEJkpG5ZgxxQwbiSV38H1QemHH9rgcUhexM30kGF+J01xWJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"172be4fdbe435a579314059f8efbc9ad4255559ae3867238ff263d6827e844f8","last_reissued_at":"2026-05-18T03:14:40.121912Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:40.121912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Convergence of Stochastic Gradient Descent under a Strong Growth Condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"LIENS), Mark Schmidt (INRIA Paris - Rocquencourt, Nicolas Le Roux (INRIA Paris - Rocquencourt","submitted_at":"2013-08-29T06:06:42Z","abstract_excerpt":"We consider optimizing a function smooth convex function $f$ that is the average of a set of differentiable functions $f_i$, under the assumption considered by Solodov [1998] and Tseng [1998] that the norm of each gradient $f_i'$ is bounded by a linear function of the norm of the average gradient $f'$. We show that under these assumptions the basic stochastic gradient method with a sufficiently-small constant step-size has an $O(1/k)$ convergence rate, and has a linear convergence rate if $g$ is strongly-convex."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.6370","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":"1308.6370","created_at":"2026-05-18T03:14:40.122006+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.6370v1","created_at":"2026-05-18T03:14:40.122006+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6370","created_at":"2026-05-18T03:14:40.122006+00:00"},{"alias_kind":"pith_short_12","alias_value":"C4V6J7N6INNF","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"C4V6J7N6INNFPEYU","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"C4V6J7N6","created_at":"2026-05-18T12:27:40.988391+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":11,"internal_anchor_count":5,"sample":[{"citing_arxiv_id":"1907.09547","citing_title":"Stochastic algorithms with geometric step decay converge linearly on sharp functions","ref_index":59,"is_internal_anchor":true},{"citing_arxiv_id":"2602.18718","citing_title":"Stochastic Gradient Variational Inference with Price's Gradient Estimator from Bures-Wasserstein to Parameter Space","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2605.20866","citing_title":"LOSCAR-SGD: Local SGD with Communication-Computation Overlap and Delay-Corrected Sparse Model Averaging","ref_index":192,"is_internal_anchor":true},{"citing_arxiv_id":"2605.18174","citing_title":"Ringmaster LMO: Asynchronous Linear Minimization Oracle Momentum Method","ref_index":191,"is_internal_anchor":true},{"citing_arxiv_id":"2509.02912","citing_title":"Stochastic versus Deterministic in Stochastic Gradient Descent","ref_index":33,"is_internal_anchor":true},{"citing_arxiv_id":"2605.08871","citing_title":"Rennala MVR: Improved Time Complexity for Parallel Stochastic Optimization via Momentum-Based Variance Reduction","ref_index":189,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06129","citing_title":"Convergence guarantees for stochastic algorithms solving non-unique problems in metric spaces","ref_index":87,"is_internal_anchor":false},{"citing_arxiv_id":"2604.14017","citing_title":"Stochastic Trust-Region Methods for Over-parameterized Models","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2604.10373","citing_title":"Shuffling the Data, Stretching the Step-size: Sharper Bias in constant step-size SGD","ref_index":121,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07795","citing_title":"Scalable Distributed Stochastic Optimization via Bidirectional Compression: Beyond Pessimistic Limits","ref_index":106,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07841","citing_title":"\\mathsf{VISTA}: Decentralized Machine Learning in Adversary Dominated Environments","ref_index":58,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C4V6J7N6INNFPEYUAWPY566JVV","json":"https://pith.science/pith/C4V6J7N6INNFPEYUAWPY566JVV.json","graph_json":"https://pith.science/api/pith-number/C4V6J7N6INNFPEYUAWPY566JVV/graph.json","events_json":"https://pith.science/api/pith-number/C4V6J7N6INNFPEYUAWPY566JVV/events.json","paper":"https://pith.science/paper/C4V6J7N6"},"agent_actions":{"view_html":"https://pith.science/pith/C4V6J7N6INNFPEYUAWPY566JVV","download_json":"https://pith.science/pith/C4V6J7N6INNFPEYUAWPY566JVV.json","view_paper":"https://pith.science/paper/C4V6J7N6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.6370&json=true","fetch_graph":"https://pith.science/api/pith-number/C4V6J7N6INNFPEYUAWPY566JVV/graph.json","fetch_events":"https://pith.science/api/pith-number/C4V6J7N6INNFPEYUAWPY566JVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C4V6J7N6INNFPEYUAWPY566JVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C4V6J7N6INNFPEYUAWPY566JVV/action/storage_attestation","attest_author":"https://pith.science/pith/C4V6J7N6INNFPEYUAWPY566JVV/action/author_attestation","sign_citation":"https://pith.science/pith/C4V6J7N6INNFPEYUAWPY566JVV/action/citation_signature","submit_replication":"https://pith.science/pith/C4V6J7N6INNFPEYUAWPY566JVV/action/replication_record"}},"created_at":"2026-05-18T03:14:40.122006+00:00","updated_at":"2026-05-18T03:14:40.122006+00:00"}