Papers › Diversity is All You Need: Learning Skills without a Reward Function

Diversity is All You Need: Learning Skills without a Reward Function

16 Feb 2018ICLR 2019 5arXiv:1802.06070archive 2025-07-28

Benjamin Eysenbach, Abhishek Gupta, Julian Ibarz, Sergey Levine

Intelligent creatures can explore their environments and learn useful skills without supervision. In this paper, we propose DIAYN ('Diversity is All You Need'), a method for learning useful skills without a reward function. Our proposed method learns skills by maximizing an information theoretic objective using a maximum entropy policy. On a variety of simulated robotic tasks, we show that this simple objective results in the unsupervised emergence of diverse skills, such as walking and jumping. In a number of reinforcement learning benchmark environments, our method is able to learn a skill that solves the benchmark task despite never receiving the true task reward. We show how pretrained skills can provide a good parameter initialization for downstream tasks, and can be composed hierarchically to solve complex, sparse reward tasks. Our results suggest that unsupervised discovery of skills can serve as an effective pretraining mechanism for overcoming challenges of exploration and data efficiency in reinforcement learning.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology View this paper on Syntology: its repositories, every harvested function with whether it ran, its licence and the call to fetch it.

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="1802.06070")

Code

Syntology Ran 5 of 11 code samples harvested from 2 repositories linked to this paper; 6 have no recorded run. Of those that ran: 5 ran with no contract checked.

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

alirezakazemipour/DIAYN-PyTorch mentioned on GitHubpytorch report
egiob/diversityisallyouneed-sb3 mentioned on GitHubpytorchMIT 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

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

5ran
6unverified

Licence: 0 of the 11 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 2 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.

Discriminator alirezakazemipour/DIAYN-PyTorch/Brain/agent.py community (archive-listed) ran · metamorphic tier: deterministic fingerprinted MIT (permissive) · 6cb01147c4e509a3 · report
Memory alirezakazemipour/DIAYN-PyTorch/Brain/agent.py community (archive-listed) ran MIT (permissive) · b9f1643b2317c893 · report
PolicyNetwork alirezakazemipour/DIAYN-PyTorch/Brain/agent.py community (archive-listed) ran · metamorphic tier: deterministic MIT (permissive) · f94f400f8198fffa · report
QvalueNetwork alirezakazemipour/DIAYN-PyTorch/Brain/agent.py community (archive-listed) ran · metamorphic tier: deterministic MIT (permissive) · 80c6f43e5b975034 · report
ValueNetwork alirezakazemipour/DIAYN-PyTorch/Brain/agent.py community (archive-listed) ran · metamorphic tier: deterministic fingerprinted MIT (permissive) · 7149f4b47fc8f92f · report
SACAgent alirezakazemipour/DIAYN-PyTorch/Brain/agent.py community (archive-listed) unverified MIT (permissive) · b5094696507eef80 · report
init_weight alirezakazemipour/DIAYN-PyTorch/Brain/agent.py community (archive-listed) unverified MIT (permissive) · 5abea37f033582d3 · report
normalize_env navneet-nmk/Hierarchical-Meta-Reinforcement-Learning/maml_rl/envs/normalized_env.py community (archive-listed) unverified MIT (permissive) · 430c8be20a33317f · report
total_rewards navneet-nmk/Hierarchical-Meta-Reinforcement-Learning/t_maml_rl.py community (archive-listed) unverified MIT (permissive) · e70b539f75e44f24 · report
value_iteration navneet-nmk/Hierarchical-Meta-Reinforcement-Learning/maml_rl/utils/reinforcement_learning.py community (archive-listed) unverified MIT (permissive) · 9bb3898b9bf31939 · report
value_iteration_finite_horizon navneet-nmk/Hierarchical-Meta-Reinforcement-Learning/maml_rl/utils/reinforcement_learning.py community (archive-listed) unverified MIT (permissive) · 788406b2cba7e7a9 · report

Tasks

AllDiversityMeta Reinforcement LearningReinforcement LearningReinforcement Learning (RL)Unsupervised Reinforcement Learningreinforcement-learning

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