Methods › Reinforcement Learning › Behaviour Policies › Epsilon Greedy Exploration
Epsilon Greedy Exploration
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
ϵ-Greedy Exploration is an exploration strategy in reinforcement learning that takes an exploratory action with probability ϵ and a greedy action with probability 1-ϵ. It tackles the exploration-exploitation tradeoff with reinforcement learning algorithms: the desire to explore the state space with the desire to seek an optimal policy. Despite its simplicity, it is still commonly used as an behaviour policy π in several state-of-the-art reinforcement learning models.
Image Credit: Robin van Embden
In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.
Near matches the lookup lists, each a different name: ε-greedy exploration strategy to BAIL; Smoothed ϵ n -Greedy exploration scheme; EPSILON; RIE-Greedy; DiBA-Greedy; med--greedy; MeZO-Greedy; Epsilon-VAE.
Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.
Papers archive 2025-07-28
archive papers tagged: 5 · with a code link: 2 · where Syntology ran a sample: 1 (1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (1 of 5 tagged: 1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 5 of 5, newest first by the archive's date (ties by slug), in archive order.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
Reinforcement Learning for an Efficient and Effective Malware Investigation during Cyber Incident Response 4 Aug 2024 · 0 repositories · arXiv:2408.01999
-
Sampling Efficient Deep Reinforcement Learning through Preference-Guided Stochastic Exploration 20 Jun 2022 · 1 repository · arXiv:2206.09627
-
Exploiting Semantic Epsilon Greedy Exploration Strategy in Multi-Agent Reinforcement Learning 26 Jan 2022 · 0 repositories · arXiv:2201.10803
-
Individual specialization in multi-task environments with multiagent reinforcement learners 29 Dec 2019 · 0 repositories · arXiv:1912.12671
-
Playing Atari with Deep Reinforcement Learning 19 Dec 2013 · 112 repositories · arXiv:1312.5602Syntology 64 ran (of which 24 constructed an object rather than computing a result; 46 with no instrument failure: 5 honoured, 0 violated, 41 with no contract checked; 18 where Syntology's instrument failed) · 53 unverified (of 117 harvested samples) · 56 pointer-only (licence)
Tasks archive 2025-07-28
14 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
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