Papers › Uncertainty-Aware Reward-Free Exploration with General Function Approximation

Uncertainty-Aware Reward-Free Exploration with General Function Approximation

24 Jun 2024arXiv:2406.16255archive 2025-07-28

Junkai Zhang, Weitong Zhang, Dongruo Zhou, Quanquan Gu

Mastering multiple tasks through exploration and learning in an environment poses a significant challenge in reinforcement learning (RL). Unsupervised RL has been introduced to address this challenge by training policies with intrinsic rewards rather than extrinsic rewards. However, current intrinsic reward designs and unsupervised RL algorithms often overlook the heterogeneous nature of collected samples, thereby diminishing their sample efficiency. To overcome this limitation, in this paper, we propose a reward-free RL algorithm called \alg. The key idea behind our algorithm is an uncertainty-aware intrinsic reward for exploring the environment and an uncertainty-weighted learning process to handle heterogeneous uncertainty in different samples. Theoretically, we show that in order to find an ϵ-optimal policy, GFA-RFE needs to collect Õ (H² logN_ℱ (ϵ) dim (ℱ) / ϵ² ) number of episodes, where ℱ is the value function class with covering number N_ℱ (ϵ) and generalized eluder dimension dim (ℱ). Such a result outperforms all existing reward-free RL algorithms. We further implement and evaluate GFA-RFE across various domains and tasks in the DeepMind Control Suite. Experiment results show that GFA-RFE outperforms or is comparable to the performance of state-of-the-art unsupervised RL algorithms.

PaperPDFCodeCode Syntology ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also 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):

Code

Syntology 15 code samples harvested from 1 repository linked to this paper: 12 ran (of which 5 constructed an object rather than computing a result; 10 with no instrument failure: 4 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified. Where Syntology's instrument failed: 2 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 15 samples from 1 repository, 12 ran (10 with no instrument failure; 2 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written between 2026-09-22 and 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

uclaml/gfa-rfe officialmentioned in paperpytorchMITSyntology: 15 samples, 12 ran (2 instrument-failed) · 3 unverified 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

15 samples harvested: 12 ran (of which 5 constructed an object rather than computing a result; 10 with no instrument failure: 4 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

4ran · honoured contract
2ran · our draft was wrong
6ran
3unverified

Licence: 1 of the 15 samples is pointer only, meaning Syntology does not serve that copy's text. For that sample, this paper's copy is under a permissive licence and cleared, but the stored copy of the same code that Syntology serves is not; the licence label's tooltip gives Syntology's recorded reason. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from uclaml/gfa-rfe. “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. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. For 2 samples that ran, the graph records a signature this page does not show, each row saying why in its tooltip: for 1, an argument's recorded type or element kind is a printout of an object in Syntology's harness (such as a mock object, a class or a pandas printout), not the type of an input, so it does not describe the call's shape; for 1, for a class the fixture built without calling, the harness called the object with inputs it made up itself, so the recorded signature is the harness's probe, not the fixture's arguments. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (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 are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. 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 six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. 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.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.

uclaml/gfa-rfe official repository 15 samples, 12 ran (2 instrument-failed) · 3 unverified
Actor in 68 papers agent/dsquare.py ran MIT (permissive) · 419af119bd09b0ac · report fixture: returned Actor · level recorded 2026-09-22
Critic in 60 papers agent/dsquare.py ran MIT (permissive) · 790cb19787a27e3c · report fixture: returned Critic · level recorded 2026-09-22
Encoder in 278 papers agent/dsquare.py ran MIT (permissive) · 2e578a8124e51723 · report fixture: returned Encoder · level recorded 2026-09-22
RandomShiftsAug in 6 papers agent/dsquare.py ran fingerprinted MIT (permissive) · 5aee04fb3686517a · report fixture: returned RandomShiftsAug · level recorded 2026-09-22
VectorizedCritics agent/dsquare.py ran MIT (permissive) · a8a8005cfb1d6a98 · report fixture: returned VectorizedCritics · level recorded 2026-09-22
episode_len in 14 papers replay_buffer.py ran · honoured contract MIT (permissive) · 9f840a22d31a89bc · report fixture: signature episode:dict/0/? · returned int · level recorded 2026-09-24
grad_norm in 24 papers utils.py ran · honoured contract MIT (permissive) · 2478bb95b38ef24f · report fixture: signature params:list/1/Tensor, norm_type:float/0/float · returned float · level recorded 2026-09-24
load_episode in 15 papers replay_buffer.py ran · our draft was wrong MIT (permissive) · 184876e5f4ab6562 · report fixture: signature fn:PosixPath/0/? · returned dict · level recorded 2026-09-24
make_replay_loader in 11 papers replay_buffer.py ran MIT (permissive) · e4f44028e6834d07 · report fixture: returned DataLoader · level recorded 2026-09-24
param_norm in 7 papers utils.py ran · honoured contract MIT (permissive) · 8708aaca52006e47 · report fixture: signature params:list/1/Tensor, norm_type:float/0/float · returned float · level recorded 2026-09-24
schedule in 32 papers agent/dsquare.py ran · honoured contract MIT (permissive) · ae234269debed3f4 · report fixture: signature schdl:str/0/str, step:int/0/int · returned float · level recorded 2026-09-22
to_torch in 53 papers
census: 5 implementations from 6 papers, 2 distinct outputs across 2 buckets, one shared input per bucket
utils.py ran · our draft was wrong MIT (permissive) here; the stored copy is pointer only · 6244e9922f4e0610 · report fixture: signature xs:tuple/1/list, device:str/0/str · returned tuple · level recorded 2026-09-22
D2Agent agent/dsquare.py unverified MIT (permissive) · dbe65af46016bc97 · report
DDPGAgent in 5 papers agent/dsquare.py unverified MIT (permissive) · 4c262c61dad0f383 · report
make_agent in 20 papers offline.py unverified MIT (permissive) · 2a76dfe317adeb03 · report

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it.

1 assembly on this paper: 1 harvested, 0 generated.

harvested Assembly for GFA-RFE (graph method: GFA-RFE). 15 bricks; individually on a fixture: 9 ran (of which 7 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified. The assembly has not been run end-to-end.

  1. D2Agent entry · level 0 · unverified · dbe65af46016bc97
  2. Actor helper · level 1 · ran · 419af119bd09b0ac
  3. DDPGAgent helper · level 0 · unverified · 4c262c61dad0f383
  4. Encoder helper · level 1 · ran · 2e578a8124e51723
  5. RandomShiftsAug helper · level 1 · ran · 5aee04fb3686517a
  6. VectorizedCritics model · level 1 · ran · a8a8005cfb1d6a98
  7. schedule helper · level 1 · ran · honoured contract · ae234269debed3f4
  8. soft_update_params helper · level 0 · unverified · bc0768cc0f4f49c7
  9. to_torch helper · level 1 · ran · our draft was wrong · 6244e9922f4e0610
  10. TruncatedNormal helper · level 1 · ran · d868560369962580
  11. weight_init helper · level 0 · unverified · 2d7fab6117dbc6a8
  12. Critic helper · level 1 · ran · 790cb19787a27e3c
  13. eval_mode helper · level 0 · unverified · 563be4760e7af9bc
  14. hard_update_params helper · level 0 · unverified · c0833f1665786d11
  15. VectorizedLinear model · level 1 · ran · 0f7fd096ae2490f9

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2406.16255") returns these assemblies with each brick's role and wiring (how to connect).

Tasks

Reinforcement Learning (RL)

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

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