{"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/the-in-sample-softmax-for-offline","title":"The In-Sample Softmax for Offline Reinforcement Learning","arxiv_id":"2302.14372","date":"2023-02-28","proceeding":null,"authors":["Chenjun Xiao","Han Wang","Yangchen Pan","Adam White","Martha White"],"abstract":"Reinforcement learning (RL) agents can leverage batches of previously collected data to extract a reasonable control policy. An emerging issue in this offline RL setting, however, is that the bootstrapping update underlying many of our methods suffers from insufficient action-coverage: standard max operator may select a maximal action that has not been seen in the dataset. Bootstrapping from these inaccurate values can lead to overestimation and even divergence. There are a growing number of methods that attempt to approximate an \\emph{in-sample} max, that only uses actions well-covered by the dataset. We highlight a simple fact: it is more straightforward to approximate an in-sample \\emph{softmax} using only actions in the dataset. We show that policy iteration based on the in-sample softmax converges, and that for decreasing temperatures it approaches the in-sample max. We derive an In-Sample Actor-Critic (AC), using this in-sample softmax, and show that it is consistently better or comparable to existing offline RL methods, and is also well-suited to fine-tuning.","url_abs":"https://arxiv.org/abs/2302.14372v2","url_pdf":"https://arxiv.org/pdf/2302.14372v2.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":"the-in-sample-softmax-for-offline","repo_url":"https://github.com/hwang-ua/inac_pytorch","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"the-in-sample-softmax-for-offline","repo_url":"https://github.com/linhlpv/Offline-and-OfflineOnline-RL","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"the-in-sample-softmax-for-offline","repo_url":"https://github.com/typoverflow/OfflineRL-Lib","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"the-in-sample-softmax-for-offline","repo_url":"https://github.com/zzmtsvv/rl_task","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"offline-rl","task_name":"Offline RL"},{"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":[{"method_slug":"softmax","method_name":"Softmax"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2302.14372","atlas_url":"https://app.syntology.ai/?focus=2302.14372","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":"2302.14372"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2302.14372\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2302.14372"},"call":"get_concepts_for_paper(arxiv_id=\"2302.14372\")"}],"by_repo":[{"repo":"hwang-ua/inac_pytorch","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"linhlpv/Offline-and-OfflineOnline-RL","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["2006.09359","2110.06169"],"harvested_for_calls":[{"arxiv_id":"2006.09359","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.09359"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.09359\")"},{"arxiv_id":"2110.06169","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2110.06169"},"call":"get_harvested_code_for_paper(arxiv_id=\"2110.06169\")"}]},{"repo":"typoverflow/OfflineRL-Lib","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["2110.06169","2301.02328"],"harvested_for_calls":[{"arxiv_id":"2110.06169","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2110.06169"},"call":"get_harvested_code_for_paper(arxiv_id=\"2110.06169\")"},{"arxiv_id":"2301.02328","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2301.02328"},"call":"get_harvested_code_for_paper(arxiv_id=\"2301.02328\")"}]},{"repo":"zzmtsvv/rl_task","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":8,"harvested_for":["1906.00949","2006.09359","2106.01345","2110.01548","2110.06169","2208.06193","2301.02328","2306.06569"],"harvested_for_calls":[{"arxiv_id":"1906.00949","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1906.00949"},"call":"get_harvested_code_for_paper(arxiv_id=\"1906.00949\")"},{"arxiv_id":"2006.09359","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.09359"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.09359\")"},{"arxiv_id":"2106.01345","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.01345"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.01345\")"},{"arxiv_id":"2110.01548","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2110.01548"},"call":"get_harvested_code_for_paper(arxiv_id=\"2110.01548\")"},{"arxiv_id":"2110.06169","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2110.06169"},"call":"get_harvested_code_for_paper(arxiv_id=\"2110.06169\")"},{"arxiv_id":"2208.06193","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2208.06193"},"call":"get_harvested_code_for_paper(arxiv_id=\"2208.06193\")"},{"arxiv_id":"2301.02328","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2301.02328"},"call":"get_harvested_code_for_paper(arxiv_id=\"2301.02328\")"},{"arxiv_id":"2306.06569","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2306.06569"},"call":"get_harvested_code_for_paper(arxiv_id=\"2306.06569\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"9e56e21070b637f86324267a666f6ffdce94656365faa2847ce29d18f54523da","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}