{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:SVWAL6FKDK67NFRYDPL6CQBDM4","short_pith_number":"pith:SVWAL6FK","schema_version":"1.0","canonical_sha256":"956c05f8aa1abdf696381bd7e1402367357a2e5fad66173e9404b42e9711094e","source":{"kind":"arxiv","id":"2207.04475","version":2},"attestation_state":"computed","paper":{"title":"Finite-time High-probability Bounds for Polyak-Ruppert Averaged Iterates of Linear Stochastic Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.PR","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Alain Durmus, Alexey Naumov, Eric Moulines, Sergey Samsonov","submitted_at":"2022-07-10T14:36:04Z","abstract_excerpt":"This paper provides a finite-time analysis of linear stochastic approximation (LSA) algorithms with fixed step size, a core method in statistics and machine learning. LSA is used to compute approximate solutions of a $d$-dimensional linear system $\\bar{\\mathbf{A}} \\theta = \\bar{\\mathbf{b}}$ for which $(\\bar{\\mathbf{A}}, \\bar{\\mathbf{b}})$ can only be estimated by (asymptotically) unbiased observations $\\{(\\mathbf{A}(Z_n),\\mathbf{b}(Z_n))\\}_{n \\in \\mathbb{N}}$. We consider here the case where $\\{Z_n\\}_{n \\in \\mathbb{N}}$ is an i.i.d. sequence or a uniformly geometrically ergodic Markov chain. W"},"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":"2207.04475","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2022-07-10T14:36:04Z","cross_cats_sorted":["cs.LG","math.PR","math.ST","stat.TH"],"title_canon_sha256":"e7d49c31a33beacf646edeb81a19462c0db809d0f734bbcd05f323c756ea451b","abstract_canon_sha256":"2e2c12d04f442eaaf6f86fef32ed995ef63fdc3ceef7023b8cdc6452b224c594"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:55:57.983747Z","signature_b64":"VvVaQJGWsAjfuF0F391SoT4157UEnR+LH5Q/Vm33o/MnGkKiwfvsgTsvTrK+WQUD+CNpgv/XcWJTxflIn7zDCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"956c05f8aa1abdf696381bd7e1402367357a2e5fad66173e9404b42e9711094e","last_reissued_at":"2026-07-05T05:55:57.983304Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:55:57.983304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite-time High-probability Bounds for Polyak-Ruppert Averaged Iterates of Linear Stochastic Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.PR","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Alain Durmus, Alexey Naumov, Eric Moulines, Sergey Samsonov","submitted_at":"2022-07-10T14:36:04Z","abstract_excerpt":"This paper provides a finite-time analysis of linear stochastic approximation (LSA) algorithms with fixed step size, a core method in statistics and machine learning. LSA is used to compute approximate solutions of a $d$-dimensional linear system $\\bar{\\mathbf{A}} \\theta = \\bar{\\mathbf{b}}$ for which $(\\bar{\\mathbf{A}}, \\bar{\\mathbf{b}})$ can only be estimated by (asymptotically) unbiased observations $\\{(\\mathbf{A}(Z_n),\\mathbf{b}(Z_n))\\}_{n \\in \\mathbb{N}}$. We consider here the case where $\\{Z_n\\}_{n \\in \\mathbb{N}}$ is an i.i.d. sequence or a uniformly geometrically ergodic Markov chain. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.04475","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2207.04475/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":"2207.04475","created_at":"2026-07-05T05:55:57.983378+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.04475v2","created_at":"2026-07-05T05:55:57.983378+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.04475","created_at":"2026-07-05T05:55:57.983378+00:00"},{"alias_kind":"pith_short_12","alias_value":"SVWAL6FKDK67","created_at":"2026-07-05T05:55:57.983378+00:00"},{"alias_kind":"pith_short_16","alias_value":"SVWAL6FKDK67NFRY","created_at":"2026-07-05T05:55:57.983378+00:00"},{"alias_kind":"pith_short_8","alias_value":"SVWAL6FK","created_at":"2026-07-05T05:55:57.983378+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.03100","citing_title":"Berry-Esseen bounds for multivariate martingale difference sequences in the Kolmogorov distance","ref_index":45,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SVWAL6FKDK67NFRYDPL6CQBDM4","json":"https://pith.science/pith/SVWAL6FKDK67NFRYDPL6CQBDM4.json","graph_json":"https://pith.science/api/pith-number/SVWAL6FKDK67NFRYDPL6CQBDM4/graph.json","events_json":"https://pith.science/api/pith-number/SVWAL6FKDK67NFRYDPL6CQBDM4/events.json","paper":"https://pith.science/paper/SVWAL6FK"},"agent_actions":{"view_html":"https://pith.science/pith/SVWAL6FKDK67NFRYDPL6CQBDM4","download_json":"https://pith.science/pith/SVWAL6FKDK67NFRYDPL6CQBDM4.json","view_paper":"https://pith.science/paper/SVWAL6FK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.04475&json=true","fetch_graph":"https://pith.science/api/pith-number/SVWAL6FKDK67NFRYDPL6CQBDM4/graph.json","fetch_events":"https://pith.science/api/pith-number/SVWAL6FKDK67NFRYDPL6CQBDM4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SVWAL6FKDK67NFRYDPL6CQBDM4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SVWAL6FKDK67NFRYDPL6CQBDM4/action/storage_attestation","attest_author":"https://pith.science/pith/SVWAL6FKDK67NFRYDPL6CQBDM4/action/author_attestation","sign_citation":"https://pith.science/pith/SVWAL6FKDK67NFRYDPL6CQBDM4/action/citation_signature","submit_replication":"https://pith.science/pith/SVWAL6FKDK67NFRYDPL6CQBDM4/action/replication_record"}},"created_at":"2026-07-05T05:55:57.983378+00:00","updated_at":"2026-07-05T05:55:57.983378+00:00"}