{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/momentum-based-accelerated-q-learning","title":"Momentum-based Accelerated Q-learning","arxiv_id":"1910.11673","date":"2019-10-23","proceeding":null,"authors":[],"abstract":"This paper studies accelerated algorithms for Q-learning. We propose an\nacceleration scheme by incorporating the historical iterates of the Q-function.\nThe idea is conceptually inspired by the momentum-based acceleration methods in\nthe optimization theory. Under finite state-action space settings, the proposed\naccelerated Q-learning algorithm provably converges to the global optimum with\na rate of $\\mathcal{O}(1/\\sqrt{T})$. While sharing a comparable theoretic\nconvergence rate with the existing Speedy Q-learning (SpeedyQ) algorithm, we\nnumerically show that the proposed algorithm outperforms SpeedyQ via playing\nthe FrozenLake grid world game. Furthermore, we generalize the acceleration\nscheme to the continuous state-action space case where function approximation\nof the Q-function is necessary. In this case, the algorithms are validated\nusing commonly adopted testing problems in reinforcement learning, including\ntwo discrete-time linear quadratic regulation (LQR) problems from the Deepmind\nControl Suite, and the Atari 2600 games. Simulation results show that the\nproposed accelerated algorithms can improve the convergence performance\ncompared with the vanilla Q-learning algorithm.","url_abs":"http://arxiv.org/abs/1910.11673v1","url_pdf":"http://arxiv.org/pdf/1910.11673v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"momentum-based-accelerated-q-learning","repo_url":"https://github.com/fapont/hackaton-hiparis-2021","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"atari-games","task_name":"Atari Games"},{"task_slug":"q-learning","task_name":"Q-Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"fapont/hackaton-hiparis-2021","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"6776fc78054183502469fc8c8ee7b642b501c8b58d5cb8398f57880106ac1b5e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}