{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:L4WPMXP5DPV7F4LF7ODZ5FEPLZ","short_pith_number":"pith:L4WPMXP5","schema_version":"1.0","canonical_sha256":"5f2cf65dfd1bebf2f165fb879e948f5e4930e0dc84521ff11a94fdf68d2d33c4","source":{"kind":"arxiv","id":"1412.0156","version":1},"attestation_state":"computed","paper":{"title":"Constant Step Size Least-Mean-Square: Bias-Variance Trade-offs and Optimal Sampling Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexandre D\\'efossez (LIENS, Francis Bach (LIENS, INRIA Paris - Rocquencourt)","submitted_at":"2014-11-29T21:29:15Z","abstract_excerpt":"We consider the least-squares regression problem and provide a detailed asymptotic analysis of the performance of averaged constant-step-size stochastic gradient descent (a.k.a. least-mean-squares). In the strongly-convex case, we provide an asymptotic expansion up to explicit exponentially decaying terms. Our analysis leads to new insights into stochastic approximation algorithms: (a) it gives a tighter bound on the allowed step-size; (b) the generalization error may be divided into a variance term which is decaying as O(1/n), independently of the step-size $\\gamma$, and a bias term that deca"},"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":"1412.0156","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-29T21:29:15Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"368b185f4e1f404dfbcb342a62b64811deee6779704fb1f84ce5d14561d087d2","abstract_canon_sha256":"ff8e000caeea283362166a15884d4350df1f35a163d42170481dd8375bbedaf3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:30.212817Z","signature_b64":"FZ1iyk0hbJayuTp78dK5MzUSGeVZlyaX0LLDYPvdMulh+R1b1hVhQFspOdmqhIoaukhAGCUrxDh/RBbQYANSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f2cf65dfd1bebf2f165fb879e948f5e4930e0dc84521ff11a94fdf68d2d33c4","last_reissued_at":"2026-05-18T02:32:30.212257Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:30.212257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constant Step Size Least-Mean-Square: Bias-Variance Trade-offs and Optimal Sampling Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexandre D\\'efossez (LIENS, Francis Bach (LIENS, INRIA Paris - Rocquencourt)","submitted_at":"2014-11-29T21:29:15Z","abstract_excerpt":"We consider the least-squares regression problem and provide a detailed asymptotic analysis of the performance of averaged constant-step-size stochastic gradient descent (a.k.a. least-mean-squares). In the strongly-convex case, we provide an asymptotic expansion up to explicit exponentially decaying terms. Our analysis leads to new insights into stochastic approximation algorithms: (a) it gives a tighter bound on the allowed step-size; (b) the generalization error may be divided into a variance term which is decaying as O(1/n), independently of the step-size $\\gamma$, and a bias term that deca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0156","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":"1412.0156","created_at":"2026-05-18T02:32:30.212334+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.0156v1","created_at":"2026-05-18T02:32:30.212334+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0156","created_at":"2026-05-18T02:32:30.212334+00:00"},{"alias_kind":"pith_short_12","alias_value":"L4WPMXP5DPV7","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"L4WPMXP5DPV7F4LF","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"L4WPMXP5","created_at":"2026-05-18T12:28:35.611951+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.12441","citing_title":"Numerical Pruning for Efficient Autoregressive Models","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L4WPMXP5DPV7F4LF7ODZ5FEPLZ","json":"https://pith.science/pith/L4WPMXP5DPV7F4LF7ODZ5FEPLZ.json","graph_json":"https://pith.science/api/pith-number/L4WPMXP5DPV7F4LF7ODZ5FEPLZ/graph.json","events_json":"https://pith.science/api/pith-number/L4WPMXP5DPV7F4LF7ODZ5FEPLZ/events.json","paper":"https://pith.science/paper/L4WPMXP5"},"agent_actions":{"view_html":"https://pith.science/pith/L4WPMXP5DPV7F4LF7ODZ5FEPLZ","download_json":"https://pith.science/pith/L4WPMXP5DPV7F4LF7ODZ5FEPLZ.json","view_paper":"https://pith.science/paper/L4WPMXP5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.0156&json=true","fetch_graph":"https://pith.science/api/pith-number/L4WPMXP5DPV7F4LF7ODZ5FEPLZ/graph.json","fetch_events":"https://pith.science/api/pith-number/L4WPMXP5DPV7F4LF7ODZ5FEPLZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L4WPMXP5DPV7F4LF7ODZ5FEPLZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L4WPMXP5DPV7F4LF7ODZ5FEPLZ/action/storage_attestation","attest_author":"https://pith.science/pith/L4WPMXP5DPV7F4LF7ODZ5FEPLZ/action/author_attestation","sign_citation":"https://pith.science/pith/L4WPMXP5DPV7F4LF7ODZ5FEPLZ/action/citation_signature","submit_replication":"https://pith.science/pith/L4WPMXP5DPV7F4LF7ODZ5FEPLZ/action/replication_record"}},"created_at":"2026-05-18T02:32:30.212334+00:00","updated_at":"2026-05-18T02:32:30.212334+00:00"}