Pith. sign in

REVIEW 2 cited by

Deep Transformer Q-Networks for Partially Observable Reinforcement Learning

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 2206.01078 v2 pith:2BKDJRJO submitted 2022-06-02 cs.LG cs.AI

classification cs.LGcs.AI
keywords agentlearningrecurrentreinforcementtaskstransformeraccessdeep
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Real-world reinforcement learning tasks often involve some form of partial observability where the observations only give a partial or noisy view of the true state of the world. Such tasks typically require some form of memory, where the agent has access to multiple past observations, in order to perform well. One popular way to incorporate memory is by using a recurrent neural network to access the agent's history. However, recurrent neural networks in reinforcement learning are often fragile and difficult to train, susceptible to catastrophic forgetting and sometimes fail completely as a result. In this work, we propose Deep Transformer Q-Networks (DTQN), a novel architecture utilizing transformers and self-attention to encode an agent's history. DTQN is designed modularly, and we compare results against several modifications to our base model. Our experiments demonstrate the transformer can solve partially observable tasks faster and more stably than previous recurrent approaches.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Reinforcement Learning in hyperbolic space for multi-step reasoning

    cs.LG 2025-07 reject novelty 4.0 of 10

    Hyperbolic transformer policies are claimed to beat vanilla transformer policies by 32-45% on a handful of reasoning and control problems, but the evidence is too weak to support the claim.

  2. Optimal Return-to-Go Guided Decision Transformer for Auto-Bidding in Advertisement

    cs.LG 2025-06 conditional novelty 4.0 of 10

    An iterative R* Decision Transformer that predicts an upper-quantile return-to-go and augments its training set with simulator-filtered high-reward trajectories beats DT, BC, and IQL on the AIGB auto-bidding benchmark.

Pith tools