Pith. sign in

REVIEW 1 cited by

Deep Attention Recurrent Q-Network

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1512.01693 v1 pith:WSE3A5GW submitted 2015-12-05 cs.LG

classification cs.LG
keywords attentiondeepq-networkapproachgameslearningmechanismsrecurrent
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

A deep learning approach to reinforcement learning led to a general learner able to train on visual input to play a variety of arcade games at the human and superhuman levels. Its creators at the Google DeepMind's team called the approach: Deep Q-Network (DQN). We present an extension of DQN by "soft" and "hard" attention mechanisms. Tests of the proposed Deep Attention Recurrent Q-Network (DARQN) algorithm on multiple Atari 2600 games show level of performance superior to that of DQN. Moreover, built-in attention mechanisms allow a direct online monitoring of the training process by highlighting the regions of the game screen the agent is focusing on when making decisions.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Bi-directional Recurrence Improves Transformer in Partially Observable Markov Decision Processes

    cs.LG 2025-05 conditional novelty 4.0 of 10

    DBGFQN swaps transformer feed-forward networks for a single BiGRU layer and reports improved average success rate on 23 POMDP environments, but the headline gains and parameter reductions are not reproducible from the...

Pith tools