Methods › General › Distributed Methods › IMPALA

IMPALA

16 papers tagged archive 2025-07-28

Introduced by Lasse Espeholt et al. in IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architectures

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

IMPALA, or the Importance Weighted Actor Learner Architecture, is an off-policy actor-critic framework that decouples acting from learning and learns from experience trajectories using V-trace. Unlike the popular A3C-based agents, in which workers communicate gradients with respect to the parameters of the policy to a central parameter server, IMPALA actors communicate trajectories of experience (sequences of states, actions, and rewards) to a centralized learner. Since the learner in IMPALA has access to full trajectories of experience we use a GPU to perform updates on mini-batches of trajectories while aggressively parallelising all time independent operations.

This type of decoupled architecture can achieve very high throughput. However, because the policy used to generate a trajectory can lag behind the policy on the learner by several updates at the time of gradient calculation, learning becomes off-policy. The V-trace off-policy actor-critic algorithm is used to correct for this harmful discrepancy.

PaperSource

In Syntology repository known, no verified implementation (declared_code; repositories: 5 listed of 26 in the graph, strongest link: official). This answer is about arXiv:1802.01561, the paper the archive credits with this method.

Origin paper of this answer, arXiv:1802.01561 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 16 ran (of which 6 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 1 violated, 8 with no contract checked; 6 where Syntology's instrument failed) · 18 unverified (of 34 harvested samples) · 3 pointer-only (licence). The instrument figure counts failures of Syntology's instrument, not of the code. Ran means executed on a synthesized input, not that the code is correct.

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: 16 · with a code link: 10 · where Syntology ran a sample: 4 (4 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 (4 of 16 tagged: 4 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 16 of 16, 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

15 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 Learning10
Reinforcement Learning (RL)8
reinforcement-learning8
Atari Games2
Continuous Control2
Deep Reinforcement Learning2
Lifelong learning2
OpenAI Gym2
continuous-control2
Diagnostic1
Edge-computing1
Image Captioning1
MuJoCo1
Position1
Transfer Learning1

Usage over time archive 2025-07-28

Papers per year tagged with IMPALA: 2018 to 2025, peak 4 4 0 2018: 1 paper 2018 2019: 3 papers 2019 2020: 2 papers 2020 2021: 2 papers 2021 2022: 3 papers 2022 2023: 4 papers 2023 2024: 0 papers 2024 2025: 1 paper 2025
Papers per year the archive tags with this method, by the paper's archive date (16 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

Distributed MethodsDistributed Reinforcement LearningPolicy Gradient Methods

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