{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4N22LN2OBYFJVNHCWNZHGJ6POV","short_pith_number":"pith:4N22LN2O","schema_version":"1.0","canonical_sha256":"e375a5b74e0e0a9ab4e2b3727327cf75562f75715241f3d410dd123240489fc2","source":{"kind":"arxiv","id":"1306.2119","version":1},"attestation_state":"computed","paper":{"title":"Non-strongly-convex smooth stochastic approximation with convergence rate O(1/n)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Eric Moulines (LTCI), Francis Bach (INRIA Paris - Rocquencourt, LIENS)","submitted_at":"2013-06-10T07:31:10Z","abstract_excerpt":"We consider the stochastic approximation problem where a convex function has to be minimized, given only the knowledge of unbiased estimates of its gradients at certain points, a framework which includes machine learning methods based on the minimization of the empirical risk. We focus on problems without strong convexity, for which all previously known algorithms achieve a convergence rate for function values of O(1/n^{1/2}). We consider and analyze two algorithms that achieve a rate of O(1/n) for classical supervised learning problems. For least-squares regression, we show that averaged stoc"},"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":"1306.2119","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-06-10T07:31:10Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"441933cee83be1d47f913edff09783aa3f255cc6d64b406abc10356cbfbb516b","abstract_canon_sha256":"eab2b7ba3950e1d6828dffb23d8a5a7a34bb800435ad2ab8af2e65327dbbf80b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:22.313487Z","signature_b64":"1p1YJY6Nlu0NeEwdM2E6BUgj6oSi9DyL3hZzdDQuMuhJyqVBNnC6ZM9OScllSGxqrnytn15qQxv3fW/wqVIPBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e375a5b74e0e0a9ab4e2b3727327cf75562f75715241f3d410dd123240489fc2","last_reissued_at":"2026-05-18T03:21:22.312958Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:22.312958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-strongly-convex smooth stochastic approximation with convergence rate O(1/n)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Eric Moulines (LTCI), Francis Bach (INRIA Paris - Rocquencourt, LIENS)","submitted_at":"2013-06-10T07:31:10Z","abstract_excerpt":"We consider the stochastic approximation problem where a convex function has to be minimized, given only the knowledge of unbiased estimates of its gradients at certain points, a framework which includes machine learning methods based on the minimization of the empirical risk. We focus on problems without strong convexity, for which all previously known algorithms achieve a convergence rate for function values of O(1/n^{1/2}). We consider and analyze two algorithms that achieve a rate of O(1/n) for classical supervised learning problems. For least-squares regression, we show that averaged stoc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2119","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":"1306.2119","created_at":"2026-05-18T03:21:22.313038+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.2119v1","created_at":"2026-05-18T03:21:22.313038+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2119","created_at":"2026-05-18T03:21:22.313038+00:00"},{"alias_kind":"pith_short_12","alias_value":"4N22LN2OBYFJ","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4N22LN2OBYFJVNHC","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4N22LN2O","created_at":"2026-05-18T12:27:34.582898+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/4N22LN2OBYFJVNHCWNZHGJ6POV","json":"https://pith.science/pith/4N22LN2OBYFJVNHCWNZHGJ6POV.json","graph_json":"https://pith.science/api/pith-number/4N22LN2OBYFJVNHCWNZHGJ6POV/graph.json","events_json":"https://pith.science/api/pith-number/4N22LN2OBYFJVNHCWNZHGJ6POV/events.json","paper":"https://pith.science/paper/4N22LN2O"},"agent_actions":{"view_html":"https://pith.science/pith/4N22LN2OBYFJVNHCWNZHGJ6POV","download_json":"https://pith.science/pith/4N22LN2OBYFJVNHCWNZHGJ6POV.json","view_paper":"https://pith.science/paper/4N22LN2O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.2119&json=true","fetch_graph":"https://pith.science/api/pith-number/4N22LN2OBYFJVNHCWNZHGJ6POV/graph.json","fetch_events":"https://pith.science/api/pith-number/4N22LN2OBYFJVNHCWNZHGJ6POV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4N22LN2OBYFJVNHCWNZHGJ6POV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4N22LN2OBYFJVNHCWNZHGJ6POV/action/storage_attestation","attest_author":"https://pith.science/pith/4N22LN2OBYFJVNHCWNZHGJ6POV/action/author_attestation","sign_citation":"https://pith.science/pith/4N22LN2OBYFJVNHCWNZHGJ6POV/action/citation_signature","submit_replication":"https://pith.science/pith/4N22LN2OBYFJVNHCWNZHGJ6POV/action/replication_record"}},"created_at":"2026-05-18T03:21:22.313038+00:00","updated_at":"2026-05-18T03:21:22.313038+00:00"}