{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TFBKX346JNS7NUUE5GPOL4QJ22","short_pith_number":"pith:TFBKX346","schema_version":"1.0","canonical_sha256":"9942abef9e4b65f6d284e99ee5f209d69d8eab99c8712be199b2b51b03984f71","source":{"kind":"arxiv","id":"2605.31309","version":1},"attestation_state":"computed","paper":{"title":"Non-Asymptotic Convergence of Stochastic Iterative Algorithms: A Lyapunov Framework","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Siva Theja Maguluri, Zaiwei Chen","submitted_at":"2026-05-29T13:41:01Z","abstract_excerpt":"We survey Lyapunov-based techniques for the finite-time analysis of stochastic iterative algorithms, also known as stochastic approximation (SA) algorithms, for solving fixed-point equations $\\bar{F}(x)=x$, where the operator $\\bar{F}(\\cdot)$ can only be accessed through a noisy oracle. We first focus on the standard setting in which $\\bar{F}(\\cdot)$ is contractive with respect to some norm and the noise is i.i.d., and explain how generalized Moreau envelopes serve as universal Lyapunov functions, regardless of the underlying norm. We then show how this framework yields mean-square convergence"},"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":"2605.31309","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-29T13:41:01Z","cross_cats_sorted":["math.PR","stat.ML"],"title_canon_sha256":"4342a3223dc67d7b1056dc86e83da78a1c536d7afa272c3a2440d1f084a027ab","abstract_canon_sha256":"8ff4e1ab5101fa2e22c7a80cc018e144e0f58c4e2fe0e57ca6348bfd6cf087d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T01:04:10.187806Z","signature_b64":"sfNHom08Rb3al+d+FfUyHvkW7h4oVF2Oa++wDjqTWj8hLKcmShFZxbjdS0tvTUP6AyWOZUiXy41JZWT6MtQzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9942abef9e4b65f6d284e99ee5f209d69d8eab99c8712be199b2b51b03984f71","last_reissued_at":"2026-06-01T01:04:10.187273Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T01:04:10.187273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Asymptotic Convergence of Stochastic Iterative Algorithms: A Lyapunov Framework","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Siva Theja Maguluri, Zaiwei Chen","submitted_at":"2026-05-29T13:41:01Z","abstract_excerpt":"We survey Lyapunov-based techniques for the finite-time analysis of stochastic iterative algorithms, also known as stochastic approximation (SA) algorithms, for solving fixed-point equations $\\bar{F}(x)=x$, where the operator $\\bar{F}(\\cdot)$ can only be accessed through a noisy oracle. We first focus on the standard setting in which $\\bar{F}(\\cdot)$ is contractive with respect to some norm and the noise is i.i.d., and explain how generalized Moreau envelopes serve as universal Lyapunov functions, regardless of the underlying norm. We then show how this framework yields mean-square convergence"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.31309","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.31309/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.31309","created_at":"2026-06-01T01:04:10.187363+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.31309v1","created_at":"2026-06-01T01:04:10.187363+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.31309","created_at":"2026-06-01T01:04:10.187363+00:00"},{"alias_kind":"pith_short_12","alias_value":"TFBKX346JNS7","created_at":"2026-06-01T01:04:10.187363+00:00"},{"alias_kind":"pith_short_16","alias_value":"TFBKX346JNS7NUUE","created_at":"2026-06-01T01:04:10.187363+00:00"},{"alias_kind":"pith_short_8","alias_value":"TFBKX346","created_at":"2026-06-01T01:04:10.187363+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/TFBKX346JNS7NUUE5GPOL4QJ22","json":"https://pith.science/pith/TFBKX346JNS7NUUE5GPOL4QJ22.json","graph_json":"https://pith.science/api/pith-number/TFBKX346JNS7NUUE5GPOL4QJ22/graph.json","events_json":"https://pith.science/api/pith-number/TFBKX346JNS7NUUE5GPOL4QJ22/events.json","paper":"https://pith.science/paper/TFBKX346"},"agent_actions":{"view_html":"https://pith.science/pith/TFBKX346JNS7NUUE5GPOL4QJ22","download_json":"https://pith.science/pith/TFBKX346JNS7NUUE5GPOL4QJ22.json","view_paper":"https://pith.science/paper/TFBKX346","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.31309&json=true","fetch_graph":"https://pith.science/api/pith-number/TFBKX346JNS7NUUE5GPOL4QJ22/graph.json","fetch_events":"https://pith.science/api/pith-number/TFBKX346JNS7NUUE5GPOL4QJ22/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TFBKX346JNS7NUUE5GPOL4QJ22/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TFBKX346JNS7NUUE5GPOL4QJ22/action/storage_attestation","attest_author":"https://pith.science/pith/TFBKX346JNS7NUUE5GPOL4QJ22/action/author_attestation","sign_citation":"https://pith.science/pith/TFBKX346JNS7NUUE5GPOL4QJ22/action/citation_signature","submit_replication":"https://pith.science/pith/TFBKX346JNS7NUUE5GPOL4QJ22/action/replication_record"}},"created_at":"2026-06-01T01:04:10.187363+00:00","updated_at":"2026-06-01T01:04:10.187363+00:00"}