{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:L4WPMXP5DPV7F4LF7ODZ5FEPLZ","short_pith_number":"pith:L4WPMXP5","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"},"canonical_sha256":"5f2cf65dfd1bebf2f165fb879e948f5e4930e0dc84521ff11a94fdf68d2d33c4","source":{"kind":"arxiv","id":"1412.0156","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0156","created_at":"2026-05-18T02:32:30Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0156v1","created_at":"2026-05-18T02:32:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0156","created_at":"2026-05-18T02:32:30Z"},{"alias_kind":"pith_short_12","alias_value":"L4WPMXP5DPV7","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"L4WPMXP5DPV7F4LF","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"L4WPMXP5","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:L4WPMXP5DPV7F4LF7ODZ5FEPLZ","target":"record","payload":{"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"},"canonical_sha256":"5f2cf65dfd1bebf2f165fb879e948f5e4930e0dc84521ff11a94fdf68d2d33c4","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"},"source_kind":"arxiv","source_id":"1412.0156","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:32:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M2j10UfTcQgOpFYxQQU62M9b6Uc+NgrC/HhZweg1ktO7o4LhqoJUJR7cXLmDE304VgXE+FFttcLZTHHM9fqlDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T17:58:23.548012Z"},"content_sha256":"7c3b62eca956f56e675cec5d0c2615491204455abd36ec7837f2c4ed520bb9f0","schema_version":"1.0","event_id":"sha256:7c3b62eca956f56e675cec5d0c2615491204455abd36ec7837f2c4ed520bb9f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:L4WPMXP5DPV7F4LF7ODZ5FEPLZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:32:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fQcVcPBbcRHSce4b2/RpUr7AvWrkNz3y+S6EuKfX0BYD+4S7Q1JCzqYGJNv6xyj+O0TbMWgnw2ZRVd4Hd/EhCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T17:58:23.548456Z"},"content_sha256":"7f0426c619e782d5cedd12e127f31a9d2430fe71fb9176907516fb9b55fe7aa0","schema_version":"1.0","event_id":"sha256:7f0426c619e782d5cedd12e127f31a9d2430fe71fb9176907516fb9b55fe7aa0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L4WPMXP5DPV7F4LF7ODZ5FEPLZ/bundle.json","state_url":"https://pith.science/pith/L4WPMXP5DPV7F4LF7ODZ5FEPLZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L4WPMXP5DPV7F4LF7ODZ5FEPLZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-15T17:58:23Z","links":{"resolver":"https://pith.science/pith/L4WPMXP5DPV7F4LF7ODZ5FEPLZ","bundle":"https://pith.science/pith/L4WPMXP5DPV7F4LF7ODZ5FEPLZ/bundle.json","state":"https://pith.science/pith/L4WPMXP5DPV7F4LF7ODZ5FEPLZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L4WPMXP5DPV7F4LF7ODZ5FEPLZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:L4WPMXP5DPV7F4LF7ODZ5FEPLZ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ff8e000caeea283362166a15884d4350df1f35a163d42170481dd8375bbedaf3","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-29T21:29:15Z","title_canon_sha256":"368b185f4e1f404dfbcb342a62b64811deee6779704fb1f84ce5d14561d087d2"},"schema_version":"1.0","source":{"id":"1412.0156","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0156","created_at":"2026-05-18T02:32:30Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0156v1","created_at":"2026-05-18T02:32:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0156","created_at":"2026-05-18T02:32:30Z"},{"alias_kind":"pith_short_12","alias_value":"L4WPMXP5DPV7","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"L4WPMXP5DPV7F4LF","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"L4WPMXP5","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:7f0426c619e782d5cedd12e127f31a9d2430fe71fb9176907516fb9b55fe7aa0","target":"graph","created_at":"2026-05-18T02:32:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alexandre D\\'efossez (LIENS, Francis Bach (LIENS, INRIA Paris - Rocquencourt)","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-29T21:29:15Z","title":"Constant Step Size Least-Mean-Square: Bias-Variance Trade-offs and Optimal Sampling Distributions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0156","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7c3b62eca956f56e675cec5d0c2615491204455abd36ec7837f2c4ed520bb9f0","target":"record","created_at":"2026-05-18T02:32:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ff8e000caeea283362166a15884d4350df1f35a163d42170481dd8375bbedaf3","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-29T21:29:15Z","title_canon_sha256":"368b185f4e1f404dfbcb342a62b64811deee6779704fb1f84ce5d14561d087d2"},"schema_version":"1.0","source":{"id":"1412.0156","kind":"arxiv","version":1}},"canonical_sha256":"5f2cf65dfd1bebf2f165fb879e948f5e4930e0dc84521ff11a94fdf68d2d33c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f2cf65dfd1bebf2f165fb879e948f5e4930e0dc84521ff11a94fdf68d2d33c4","first_computed_at":"2026-05-18T02:32:30.212257Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:30.212257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FZ1iyk0hbJayuTp78dK5MzUSGeVZlyaX0LLDYPvdMulh+R1b1hVhQFspOdmqhIoaukhAGCUrxDh/RBbQYANSCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:30.212817Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.0156","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c3b62eca956f56e675cec5d0c2615491204455abd36ec7837f2c4ed520bb9f0","sha256:7f0426c619e782d5cedd12e127f31a9d2430fe71fb9176907516fb9b55fe7aa0"],"state_sha256":"04176116b6fba046690d16e02ebadecbe643e6f1391e18492801061725ad7080"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wxOApWq37tTbF5wXpWgPKHQvknTNHZBq05KoQAqay9sGnLCK/q12sco5PefzxOsv38ZTKC/i7qvLdISZ1RueCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T17:58:23.553575Z","bundle_sha256":"4c430692947a0282ce46efa1f13ce35147cce241f78e2ce9342e3ce1de6a1f06"}}