Rainbow DQN
E200562
Rainbow DQN is a deep reinforcement learning algorithm that combines several key extensions to the original DQN—such as double Q-learning, prioritized replay, dueling networks, multi-step learning, distributional RL, and noisy nets—into a single, more performant agent.
All labels observed (5)
How this entity was disambiguated
This entity first appeared as the object of triple T1793199 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Rainbow DQN Context triple: [Atari deep Q-network, inspiredAlgorithm, Rainbow DQN]
-
A.
Dueling DQN
Dueling DQN is a deep reinforcement learning algorithm that separates state-value and advantage estimations within its neural network architecture to improve learning efficiency and stability over standard DQN.
-
B.
Atari deep Q-network
The Atari deep Q-network is a pioneering deep reinforcement learning system that learned to play a wide range of Atari 2600 video games directly from raw pixels at human-level or better performance.
-
C.
Double DQN
Double DQN is a reinforcement learning algorithm that improves upon standard Deep Q-Networks by reducing overestimation bias through decoupling action selection from action evaluation.
-
D.
Prioritized Experience Replay DQN
Prioritized Experience Replay DQN is a variant of the Deep Q-Network algorithm that improves learning efficiency by sampling more informative experiences with higher priority from the replay buffer.
-
E.
DDPG
DDPG (Deep Deterministic Policy Gradient) is a model-free, off-policy deep reinforcement learning algorithm designed for continuous action spaces, combining ideas from DQN and actor-critic methods.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Rainbow DQN Target entity description: Rainbow DQN is a deep reinforcement learning algorithm that combines several key extensions to the original DQN—such as double Q-learning, prioritized replay, dueling networks, multi-step learning, distributional RL, and noisy nets—into a single, more performant agent.
-
A.
Dueling DQN
Dueling DQN is a deep reinforcement learning algorithm that separates state-value and advantage estimations within its neural network architecture to improve learning efficiency and stability over standard DQN.
-
B.
Atari deep Q-network
The Atari deep Q-network is a pioneering deep reinforcement learning system that learned to play a wide range of Atari 2600 video games directly from raw pixels at human-level or better performance.
-
C.
Double DQN
Double DQN is a reinforcement learning algorithm that improves upon standard Deep Q-Networks by reducing overestimation bias through decoupling action selection from action evaluation.
-
D.
Prioritized Experience Replay DQN
Prioritized Experience Replay DQN is a variant of the Deep Q-Network algorithm that improves learning efficiency by sampling more informative experiences with higher priority from the replay buffer.
-
E.
DDPG
DDPG (Deep Deterministic Policy Gradient) is a model-free, off-policy deep reinforcement learning algorithm designed for continuous action spaces, combining ideas from DQN and actor-critic methods.
- F. None of above. chosen
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
DQN extension
ⓘ
deep reinforcement learning algorithm ⓘ value-based reinforcement learning method ⓘ |
| actionSpace | discrete action spaces ⓘ |
| basedOn |
Deep Q-Network
ⓘ
linked to:
Deep Q-Learning
|
| citationYear | 2018 ⓘ |
| codeAvailability | open-source implementations in multiple frameworks (e.g., PyTorch, TensorFlow) ⓘ |
| combines |
Double Q-learning
ⓘ
distributional reinforcement learning ⓘ dueling network architecture ⓘ multi-step learning ⓘ noisy networks for exploration ⓘ prioritized experience replay ⓘ |
| developedAt | DeepMind ⓘ |
| evaluatedOn | Atari 2600 games from the Arcade Learning Environment ⓘ |
| goal | maximize expected cumulative reward ⓘ |
| improvesOver |
C51 distributional DQN
ⓘ
linked to:
Rainbow DQN
DQN ⓘ
linked to:
Deep Q-Learning
Double DQN ⓘ Dueling DQN ⓘ Prioritized DQN ⓘ
linked to:
Prioritized Experience Replay DQN
|
| influenced | subsequent Atari benchmark baselines ⓘ |
| introducedInPaper |
Rainbow: Combining Improvements in Deep Reinforcement Learning
ⓘ
linked to:
Rainbow DQN
|
| learningSignal | temporal-difference error ⓘ |
| optimizationAlgorithm | stochastic gradient descent variant ⓘ |
| outperforms | baseline DQN on Atari benchmarks ⓘ |
| proposedBy |
Bilal Piot
ⓘ
Dan Horgan ⓘ David Silver ⓘ Georg Ostrovski ⓘ Hado van Hasselt ⓘ Joseph Modayil ⓘ Matteo Hessel ⓘ Mohammad Azar ⓘ Tom Schaul ⓘ Will Dabney ⓘ |
| publishedAt |
AAAI 2018
ⓘ
linked to:
AAAI Conference on Artificial Intelligence
|
| taskType | model-free reinforcement learning ⓘ |
| uses |
Q-learning update rule
ⓘ
epsilon-greedy policy with noisy nets modification ⓘ experience replay buffer ⓘ target network ⓘ |
| usesDistributionalMethod | categorical value distribution (C51) ⓘ |
| usesExplorationMethod | noisy linear layers ⓘ |
| usesFunctionApproximator | deep convolutional neural network ⓘ |
| usesMultiStepReturn | n-step returns ⓘ |
| usesNetworkArchitecture | dueling network with value and advantage streams ⓘ |
| usesPrioritization | proportional prioritized replay ⓘ |
| valueRepresentation | distribution over returns ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Rainbow DQN Description of subject: Rainbow DQN is a deep reinforcement learning algorithm that combines several key extensions to the original DQN—such as double Q-learning, prioritized replay, dueling networks, multi-step learning, distributional RL, and noisy nets—into a single, more performant agent.
Referenced by (22)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Rainbow DQN
linked to: Rainbow DQN
linked to: Rainbow DQN
Joseph Modayil
→
algorithmContribution
→
Rainbow DQN combines several DQN improvements into one unified agent
ⓘ
linked to: Rainbow DQN
linked to: Rainbow DQN
linked to: Rainbow DQN
Rainbow: Combining Improvements in Deep Reinforcement Learning
→
introducedAlgorithm
→
Rainbow DQN
ⓘ
subject linked to:
Dan Horgan
linked to: Rainbow DQN
linked to: Rainbow DQN
linked to: Rainbow DQN
linked to: Rainbow DQN
linked to: Rainbow DQN
linked to: Rainbow DQN
linked to: Rainbow DQN