{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IATNMHNLOEQ2RTSZLXHB5ZFBIL","short_pith_number":"pith:IATNMHNL","schema_version":"1.0","canonical_sha256":"4026d61dab7121a8ce595dce1ee4a142e6cb36ff23fb72ad92484b919098c2a9","source":{"kind":"arxiv","id":"1903.07228","version":1},"attestation_state":"computed","paper":{"title":"Optimal Rate of Convergence for Quasi-Stochastic Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrey Bernstein, Emiliano Dall'Anese, Marcello Colombino, Prashant Mehta, Sean Meyn, Yue Chen","submitted_at":"2019-03-18T02:05:41Z","abstract_excerpt":"The Robbins-Monro stochastic approximation algorithm is a foundation of many algorithmic frameworks for reinforcement learning (RL), and often an efficient approach to solving (or approximating the solution to) complex optimal control problems. However, in many cases practitioners are unable to apply these techniques because of an inherent high variance. This paper aims to provide a general foundation for \"quasi-stochastic approximation,\" in which all of the processes under consideration are deterministic, much like quasi-Monte-Carlo for variance reduction in simulation. The variance reduction"},"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":"1903.07228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-18T02:05:41Z","cross_cats_sorted":[],"title_canon_sha256":"e0049e8100bf500cf71f923bffb58496d5583c95eb36bd5ed352485c7395c8ed","abstract_canon_sha256":"534198acddae2bdd8da782d2c7e2fe4201d0257eec11a0d0d4def4894ff08b3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:03.866339Z","signature_b64":"3a/PHJb8XJQf4YV0kdV0ZegmlK3Mz57IW5XH4THqa14jz9zeeiA9bavWHMQp2KJFqNGKrduOKfm8P0AFbrSDCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4026d61dab7121a8ce595dce1ee4a142e6cb36ff23fb72ad92484b919098c2a9","last_reissued_at":"2026-05-17T23:51:03.865703Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:03.865703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Rate of Convergence for Quasi-Stochastic Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andrey Bernstein, Emiliano Dall'Anese, Marcello Colombino, Prashant Mehta, Sean Meyn, Yue Chen","submitted_at":"2019-03-18T02:05:41Z","abstract_excerpt":"The Robbins-Monro stochastic approximation algorithm is a foundation of many algorithmic frameworks for reinforcement learning (RL), and often an efficient approach to solving (or approximating the solution to) complex optimal control problems. However, in many cases practitioners are unable to apply these techniques because of an inherent high variance. This paper aims to provide a general foundation for \"quasi-stochastic approximation,\" in which all of the processes under consideration are deterministic, much like quasi-Monte-Carlo for variance reduction in simulation. The variance reduction"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07228","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":"1903.07228","created_at":"2026-05-17T23:51:03.865816+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.07228v1","created_at":"2026-05-17T23:51:03.865816+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07228","created_at":"2026-05-17T23:51:03.865816+00:00"},{"alias_kind":"pith_short_12","alias_value":"IATNMHNLOEQ2","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"IATNMHNLOEQ2RTSZ","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"IATNMHNL","created_at":"2026-05-18T12:33:18.533446+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/IATNMHNLOEQ2RTSZLXHB5ZFBIL","json":"https://pith.science/pith/IATNMHNLOEQ2RTSZLXHB5ZFBIL.json","graph_json":"https://pith.science/api/pith-number/IATNMHNLOEQ2RTSZLXHB5ZFBIL/graph.json","events_json":"https://pith.science/api/pith-number/IATNMHNLOEQ2RTSZLXHB5ZFBIL/events.json","paper":"https://pith.science/paper/IATNMHNL"},"agent_actions":{"view_html":"https://pith.science/pith/IATNMHNLOEQ2RTSZLXHB5ZFBIL","download_json":"https://pith.science/pith/IATNMHNLOEQ2RTSZLXHB5ZFBIL.json","view_paper":"https://pith.science/paper/IATNMHNL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.07228&json=true","fetch_graph":"https://pith.science/api/pith-number/IATNMHNLOEQ2RTSZLXHB5ZFBIL/graph.json","fetch_events":"https://pith.science/api/pith-number/IATNMHNLOEQ2RTSZLXHB5ZFBIL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IATNMHNLOEQ2RTSZLXHB5ZFBIL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IATNMHNLOEQ2RTSZLXHB5ZFBIL/action/storage_attestation","attest_author":"https://pith.science/pith/IATNMHNLOEQ2RTSZLXHB5ZFBIL/action/author_attestation","sign_citation":"https://pith.science/pith/IATNMHNLOEQ2RTSZLXHB5ZFBIL/action/citation_signature","submit_replication":"https://pith.science/pith/IATNMHNLOEQ2RTSZLXHB5ZFBIL/action/replication_record"}},"created_at":"2026-05-17T23:51:03.865816+00:00","updated_at":"2026-05-17T23:51:03.865816+00:00"}