Methods › Reinforcement Learning › Behaviour Policies › Epsilon Greedy Exploration

Epsilon Greedy Exploration

5 papers tagged archive 2025-07-28

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.

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.

TaskPapers
Reinforcement Learning (RL)5
Q-Learning3
Reinforcement Learning3
reinforcement-learning3
Atari Games2
Deep Reinforcement Learning2
Multi-agent Reinforcement Learning2
Decision Making1
Fairness1
Malware Analysis1
Multi-Goal Reinforcement Learning1
SMAC1
SMAC+1
Starcraft1

Usage over time archive 2025-07-28

Papers per year tagged with Epsilon Greedy Exploration: 2013 to 2024, peak 2 2 0 2013: 1 paper 2013 2014: 0 papers 2014 2015: 0 papers 2015 2016: 0 papers 2016 2017: 0 papers 2017 2018: 0 papers 2018 2019: 1 paper 2019 2020: 0 papers 2020 2021: 0 papers 2021 2022: 2 papers 2022 2023: 0 papers 2023 2024: 1 paper 2024
Papers per year the archive tags with this method, by the paper's archive date (5 dated). Bars are counts, not a trend claim.

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

Behaviour Policies

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