{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:LMI2KAPQU7C44ISAXVQEW2TYMY","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":"ce33191d121079a5b48bc408702bc6869cffbfd932b76c09d53abc58155410bf","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-20T21:09:09Z","title_canon_sha256":"57927329d4e293b787a851cd7b91b029f19a457b5633f3a0bdce87e3b1969b88"},"schema_version":"1.0","source":{"id":"2411.13711","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.13711","created_at":"2026-07-05T09:38:36Z"},{"alias_kind":"arxiv_version","alias_value":"2411.13711v1","created_at":"2026-07-05T09:38:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13711","created_at":"2026-07-05T09:38:36Z"},{"alias_kind":"pith_short_12","alias_value":"LMI2KAPQU7C4","created_at":"2026-07-05T09:38:36Z"},{"alias_kind":"pith_short_16","alias_value":"LMI2KAPQU7C44ISA","created_at":"2026-07-05T09:38:36Z"},{"alias_kind":"pith_short_8","alias_value":"LMI2KAPQ","created_at":"2026-07-05T09:38:36Z"}],"graph_snapshots":[{"event_id":"sha256:576728f2dd88cda24bfff64ebfa2bc81436722fbbab0d9033192e58a93573c9b","target":"graph","created_at":"2026-07-05T09:38:36Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.13711/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper establishes the first almost sure convergence rate and the first maximal concentration bound with exponential tails for general contractive stochastic approximation algorithms with Markovian noise. As a corollary, we also obtain convergence rates in $L^p$. Key to our successes is a novel discretization of the mean ODE of stochastic approximation algorithms using intervals with diminishing (instead of constant) length. As applications, we provide the first almost sure convergence rate for $Q$-learning with Markovian samples without count-based learning rates. We also provide the firs","authors_text":"Shangtong Zhang, Xiaochi Qian, Xinyu Liu, Zixuan Xie","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-20T21:09:09Z","title":"Almost Sure Convergence Rates and Concentration of Stochastic Approximation and Reinforcement Learning with Markovian Noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.13711","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:6bbddd57e070e40dcad0f7f69d72a066000ad7683ba756ffcaea2ab6d52f3bd9","target":"record","created_at":"2026-07-05T09:38:36Z","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":"ce33191d121079a5b48bc408702bc6869cffbfd932b76c09d53abc58155410bf","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-20T21:09:09Z","title_canon_sha256":"57927329d4e293b787a851cd7b91b029f19a457b5633f3a0bdce87e3b1969b88"},"schema_version":"1.0","source":{"id":"2411.13711","kind":"arxiv","version":1}},"canonical_sha256":"5b11a501f0a7c5ce2240bd604b6a78662b67c42416925ca63808f9d89b8c4560","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b11a501f0a7c5ce2240bd604b6a78662b67c42416925ca63808f9d89b8c4560","first_computed_at":"2026-07-05T09:38:36.166382Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:38:36.166382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r2TKBr5UwD41HKs/wYhGwk2gP8SIL2dlG0fqFg+XVSvkwW6v5XyLPoIcT+691fzPp11FDI1KVfYa48HnulvyDw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:38:36.166864Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.13711","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6bbddd57e070e40dcad0f7f69d72a066000ad7683ba756ffcaea2ab6d52f3bd9","sha256:576728f2dd88cda24bfff64ebfa2bc81436722fbbab0d9033192e58a93573c9b"],"state_sha256":"96707dd3eabb7a8e26b67c50819ffdb67e9853956aadac7f73c08adfd32d2d63"}