Papers › Uncertainty-Based Offline Reinforcement Learning with Diversified Q-Ensemble

Uncertainty-Based Offline Reinforcement Learning with Diversified Q-Ensemble

4 Oct 2021NeurIPS 2021 12arXiv:2110.01548archive 2025-07-28

Gaon An, Seungyong Moon, Jang-Hyun Kim, Hyun Oh Song

Offline reinforcement learning (offline RL), which aims to find an optimal policy from a previously collected static dataset, bears algorithmic difficulties due to function approximation errors from out-of-distribution (OOD) data points. To this end, offline RL algorithms adopt either a constraint or a penalty term that explicitly guides the policy to stay close to the given dataset. However, prior methods typically require accurate estimation of the behavior policy or sampling from OOD data points, which themselves can be a non-trivial problem. Moreover, these methods under-utilize the generalization ability of deep neural networks and often fall into suboptimal solutions too close to the given dataset. In this work, we propose an uncertainty-based offline RL method that takes into account the confidence of the Q-value prediction and does not require any estimation or sampling of the data distribution. We show that the clipped Q-learning, a technique widely used in online RL, can be leveraged to successfully penalize OOD data points with high prediction uncertainties. Surprisingly, we find that it is possible to substantially outperform existing offline RL methods on various tasks by simply increasing the number of Q-networks along with the clipped Q-learning. Based on this observation, we propose an ensemble-diversified actor-critic algorithm that reduces the number of required ensemble networks down to a tenth compared to the naive ensemble while achieving state-of-the-art performance on most of the D4RL benchmarks considered.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2110.01548")

Code

Syntology Ran 13 of 21 code samples harvested from 5 repositories linked to this paper; 8 have no recorded run. Of those that ran: 1 ran · our draft was wrong; 12 ran with no contract checked.

By repository: community (archive-listed): 21 samples from 5 repositories, 13 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

corl-team/CORL mentioned on GitHubjax report
howuhh/sac-n-jax mentioned on GitHubjaxMIT report
snu-mllab/edac mentioned on GitHubpytorchMIT report
yihaosun1124/OfflineRL-Kit mentioned on GitHubpytorch report
zzmtsvv/rl_task mentioned on GitHubpytorch 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.

Code Syntology ran Syntology

21 samples harvested; 13 ran; 0 honoured the contract we drafted; 8 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · our draft was wrong
12ran
8unverified

Licence: 6 of the 21 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 5 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

Actor corl-team/CORL/algorithms/offline/edac.py community (archive-listed) ran · metamorphic tier: deterministic fingerprinted Apache-2.0 (permissive) · 7f11d5ce17556f04 · report
DeterministicActor zzmtsvv/rl_task/doge/doge.py community (archive-listed) ran fingerprinted no licence file found · pointer only · 241911ed91897454 · report
Distance zzmtsvv/rl_task/doge/doge.py community (archive-listed) ran no licence file found · pointer only · ab927c7eea834816 · report
EDACPolicy yihaosun1124/OfflineRL-Kit/offlinerlkit/policy/model_free/edac.py community (archive-listed) ran · metamorphic tier: deterministic MIT (permissive) · f5dc603591d69cbd · report
EnsembleCritic howuhh/sac-n-jax/sac_n_jax_flax.py community (archive-listed) ran MIT (permissive) · b4a9de39db5c3e24 · report
EnsembledCritic zzmtsvv/rl_task/doge/doge.py community (archive-listed) ran no licence file found · pointer only · 31807722c6d0ebca · report
EnsembledLinear zzmtsvv/rl_task/doge/doge.py community (archive-listed) ran no licence file found · pointer only · 5e8059b5878ab4e3 · report
ParallelizedEnsemble snu-mllab/edac/lifelong_rl/models/networks.py community (archive-listed) ran fingerprinted MIT (permissive) · 97f6ff89661513fb · report
ParallelizedLayer snu-mllab/edac/lifelong_rl/models/networks.py community (archive-listed) ran MIT (permissive) · 765f2c4c8cb57eab · report
VectorizedCritic corl-team/CORL/algorithms/offline/edac.py community (archive-listed) ran · metamorphic tier: deterministic Apache-2.0 (permissive) · 832ae1f434765b20 · report
VectorizedLinear corl-team/CORL/algorithms/offline/edac.py community (archive-listed) ran · metamorphic tier: deterministic Apache-2.0 (permissive) · 0f7fd096ae2490f9 · report
doge_config zzmtsvv/rl_task/doge/doge.py community (archive-listed) ran no licence file found · pointer only · 527759337db08777 · report
uniform_init howuhh/sac-n-jax/sac_n_jax_flax.py community (archive-listed) ran · our draft was wrong MIT (permissive) · b5491b8fa060cb74 · report
Critic howuhh/sac-n-jax/sac_n_jax_flax.py community (archive-listed) unverified MIT (permissive) · 5794e64ed17e773b · report
DOGE zzmtsvv/rl_task/doge/doge.py community (archive-listed) unverified no licence file found · pointer only · deb27526958aa790 · report
EDAC corl-team/CORL/algorithms/offline/edac.py community (archive-listed) unverified Apache-2.0 (permissive) · 0f2060e11b06334a · report
from_numpy snu-mllab/edac/lifelong_rl/models/networks.py community (archive-listed) unverified MIT (permissive) · 1d1f97e963885eb0 · report
ones snu-mllab/edac/lifelong_rl/models/networks.py community (archive-listed) unverified MIT (permissive) · 78a13fda3d5531a2 · report
randn snu-mllab/edac/lifelong_rl/models/networks.py community (archive-listed) unverified MIT (permissive) · 826e9009d90a358b · report
soft_update corl-team/CORL/algorithms/offline/edac.py community (archive-listed) unverified Apache-2.0 (permissive) · 12fd41e242a13169 · report
zeros snu-mllab/edac/lifelong_rl/models/networks.py community (archive-listed) unverified MIT (permissive) · 662ecb7bbf9644d8 · report

Tasks

Adroid door-clonedAdroid door-humanAdroid hammer-clonedAdroid hammer-humanAdroid pen-clonedAdroid pen-humanAdroid relocate-clonedAdroid relocate-humanD4RLGym halfcheetah-expertGym halfcheetah-full-replayGym halfcheetah-mediumGym halfcheetah-medium-expertGym halfcheetah-medium-replayGym halfcheetah-randomOffline RLQ-LearningReinforcement LearningReinforcement Learning (RL)Value predictionreinforcement-learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Q-Learning

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