{"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/taming-the-noise-in-reinforcement-learning","title":"Taming the Noise in Reinforcement Learning via Soft Updates","arxiv_id":"1512.08562","date":"2015-12-28","proceeding":null,"authors":["Roy Fox","Ari Pakman","Naftali Tishby"],"abstract":"Model-free reinforcement learning algorithms, such as Q-learning, perform\npoorly in the early stages of learning in noisy environments, because much\neffort is spent unlearning biased estimates of the state-action value function.\nThe bias results from selecting, among several noisy estimates, the apparent\noptimum, which may actually be suboptimal. We propose G-learning, a new\noff-policy learning algorithm that regularizes the value estimates by\npenalizing deterministic policies in the beginning of the learning process. We\nshow that this method reduces the bias of the value-function estimation,\nleading to faster convergence to the optimal value and the optimal policy.\nMoreover, G-learning enables the natural incorporation of prior domain\nknowledge, when available. The stochastic nature of G-learning also makes it\navoid some exploration costs, a property usually attributed only to on-policy\nalgorithms. We illustrate these ideas in several examples, where G-learning\nresults in significant improvements of the convergence rate and the cost of the\nlearning process.","url_abs":"http://arxiv.org/abs/1512.08562v4","url_pdf":"http://arxiv.org/pdf/1512.08562v4.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":"taming-the-noise-in-reinforcement-learning","repo_url":"https://github.com/jollyraven100/Quant_algorithmic-trading_and_More","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"taming-the-noise-in-reinforcement-learning","repo_url":"https://github.com/jollyraven100/Trade-Ideas-and-Research-Reference","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"taming-the-noise-in-reinforcement-learning","repo_url":"https://github.com/michaelsyao/Trade-Ideas-and-Research-Reference","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"q-learning","task_name":"Q-Learning"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"reinforcement-learning-2","task_name":"reinforcement-learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1512.08562","atlas_url":"https://app.syntology.ai/?focus=1512.08562","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1512.08562"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1512.08562\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1512.08562"},"call":"get_concepts_for_paper(arxiv_id=\"1512.08562\")"}],"by_repo":[{"repo":"jollyraven100/Quant_algorithmic-trading_and_More","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"jollyraven100/Trade-Ideas-and-Research-Reference","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"michaelsyao/Trade-Ideas-and-Research-Reference","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":"5a7f685c67b1888bbf4d2422ebf3fdb898884d17853f0ce28aeffe90b273fcba","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}