Papers › The In-Sample Softmax for Offline Reinforcement Learning
The In-Sample Softmax for Offline Reinforcement Learning
28 Feb 2023arXiv:2302.14372archive 2025-07-28
Chenjun Xiao, Han Wang, Yangchen Pan, Adam White, Martha White
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 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 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.
In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.
Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, on Syntology's MCP service (how to connect):
get_citation_path(paper_1="2302.14372", paper_2="…") with another paper's arXiv id or titleget_concepts_for_paper(arxiv_id="2302.14372")
Code
linhlpv/Offline-and-OfflineOnline-RL
mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to AWAC: Accelerating Online Reinforcement Learning with Offline Datasets (arXiv:2006.09359; that paper's own run record: 10 ran (of which 9 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified) and Offline Reinforcement Learning with Implicit Q-Learning (arXiv:2110.06169; that paper's own run record: 45 ran (of which 23 constructed an object rather than computing a result; 36 with no instrument failure: 0 honoured, 0 violated, 36 with no contract checked; 9 where Syntology's instrument failed) · 13 unverified); nothing checks that they implement this paper's method. report
typoverflow/OfflineRL-Lib
mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Offline Reinforcement Learning with Implicit Q-Learning (arXiv:2110.06169; that paper's own run record: 45 ran (of which 23 constructed an object rather than computing a result; 36 with no instrument failure: 0 honoured, 0 violated, 36 with no contract checked; 9 where Syntology's instrument failed) · 13 unverified) and Extreme Q-Learning: MaxEnt RL without Entropy (arXiv:2301.02328; that paper's own run record: 8 ran (of which 5 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified); nothing checks that they implement this paper's method. report
zzmtsvv/rl_task
mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Stabilizing Off-Policy Q-Learning via Bootstrapping Error Reduction (arXiv:1906.00949; that paper's own run record: 4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 4 samples that ran constructed an object rather than computing a result), AWAC: Accelerating Online Reinforcement Learning with Offline Datasets (arXiv:2006.09359; that paper's own run record: 10 ran (of which 9 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified), Decision Transformer: Reinforcement Learning via Sequence Modeling (arXiv:2106.01345; that paper's own run record: 17 ran (of which 10 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 5 where Syntology's instrument failed) · 9 unverified) and 5 more (every one in this page's JSON twin); nothing checks that they implement this paper's method. report
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Methods
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections