{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KCNVS6PDAP3CDIIK4WCVUOSDI4","short_pith_number":"pith:KCNVS6PD","schema_version":"1.0","canonical_sha256":"509b5979e303f621a10ae5855a3a43470a1c575a44453e4f13960d161ac7468d","source":{"kind":"arxiv","id":"1710.09430","version":2},"attestation_state":"computed","paper":{"title":"A Markov Chain Theory Approach to Characterizing the Minimax Optimality of Stochastic Gradient Descent (for Least Squares)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Aaron Sidford, Praneeth Netrapalli, Prateek Jain, Rahul Kidambi, Sham M. Kakade, Venkata Krishna Pillutla","submitted_at":"2017-10-25T19:28:13Z","abstract_excerpt":"This work provides a simplified proof of the statistical minimax optimality of (iterate averaged) stochastic gradient descent (SGD), for the special case of least squares. This result is obtained by analyzing SGD as a stochastic process and by sharply characterizing the stationary covariance matrix of this process. The finite rate optimality characterization captures the constant factors and addresses model mis-specification."},"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":"1710.09430","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-25T19:28:13Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"c58138d8dbcd3b24c8336fe166bf4f184670c49c2632c671268f79e703784fc6","abstract_canon_sha256":"7668b2d830e839f144eee68b05641c473a8df826cd5d9ffd948d02f58f51091b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:11.179033Z","signature_b64":"gtYC5Hrt5n6dlRleNn+2wAdwjVbG2ujd7iHBfr2yf3oVqkaKvu7hJ//rAqm2T8wnOFhwO0KJx9NIKlnwi3iYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"509b5979e303f621a10ae5855a3a43470a1c575a44453e4f13960d161ac7468d","last_reissued_at":"2026-05-18T00:10:11.178300Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:11.178300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Markov Chain Theory Approach to Characterizing the Minimax Optimality of Stochastic Gradient Descent (for Least Squares)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Aaron Sidford, Praneeth Netrapalli, Prateek Jain, Rahul Kidambi, Sham M. Kakade, Venkata Krishna Pillutla","submitted_at":"2017-10-25T19:28:13Z","abstract_excerpt":"This work provides a simplified proof of the statistical minimax optimality of (iterate averaged) stochastic gradient descent (SGD), for the special case of least squares. This result is obtained by analyzing SGD as a stochastic process and by sharply characterizing the stationary covariance matrix of this process. The finite rate optimality characterization captures the constant factors and addresses model mis-specification."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09430","kind":"arxiv","version":2},"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":"1710.09430","created_at":"2026-05-18T00:10:11.178422+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.09430v2","created_at":"2026-05-18T00:10:11.178422+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09430","created_at":"2026-05-18T00:10:11.178422+00:00"},{"alias_kind":"pith_short_12","alias_value":"KCNVS6PDAP3C","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KCNVS6PDAP3CDIIK","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KCNVS6PD","created_at":"2026-05-18T12:31:24.725408+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/KCNVS6PDAP3CDIIK4WCVUOSDI4","json":"https://pith.science/pith/KCNVS6PDAP3CDIIK4WCVUOSDI4.json","graph_json":"https://pith.science/api/pith-number/KCNVS6PDAP3CDIIK4WCVUOSDI4/graph.json","events_json":"https://pith.science/api/pith-number/KCNVS6PDAP3CDIIK4WCVUOSDI4/events.json","paper":"https://pith.science/paper/KCNVS6PD"},"agent_actions":{"view_html":"https://pith.science/pith/KCNVS6PDAP3CDIIK4WCVUOSDI4","download_json":"https://pith.science/pith/KCNVS6PDAP3CDIIK4WCVUOSDI4.json","view_paper":"https://pith.science/paper/KCNVS6PD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.09430&json=true","fetch_graph":"https://pith.science/api/pith-number/KCNVS6PDAP3CDIIK4WCVUOSDI4/graph.json","fetch_events":"https://pith.science/api/pith-number/KCNVS6PDAP3CDIIK4WCVUOSDI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KCNVS6PDAP3CDIIK4WCVUOSDI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KCNVS6PDAP3CDIIK4WCVUOSDI4/action/storage_attestation","attest_author":"https://pith.science/pith/KCNVS6PDAP3CDIIK4WCVUOSDI4/action/author_attestation","sign_citation":"https://pith.science/pith/KCNVS6PDAP3CDIIK4WCVUOSDI4/action/citation_signature","submit_replication":"https://pith.science/pith/KCNVS6PDAP3CDIIK4WCVUOSDI4/action/replication_record"}},"created_at":"2026-05-18T00:10:11.178422+00:00","updated_at":"2026-05-18T00:10:11.178422+00:00"}