Pith. sign in

REVIEW 2 cited by

Learning Sparse Representations Incrementally in Deep 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 1912.04002 v1 pith:PEHPQBYF submitted 2019-12-09 cs.LG stat.ML

classification cs.LGstat.ML
keywords learnedrepresentationssparselearningrepresentationagentsdeepperformance
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Sparse representations have been shown to be useful in deep reinforcement learning for mitigating catastrophic interference and improving the performance of agents in terms of cumulative reward. Previous results were based on a two step process were the representation was learned offline and the action-value function was learned online afterwards. In this paper, we investigate if it is possible to learn a sparse representation and the action-value function simultaneously and incrementally. We investigate this question by employing several regularization techniques and observing how they affect sparsity of the representation learned by a DQN agent in two different benchmark domains. Our results show that with appropriate regularization it is possible to increase the sparsity of the representations learned by DQN agents. Moreover, we found that learning sparse representations also resulted in improved performance in terms of cumulative reward. Finally, we found that the performance of the agents that learned a sparse representation was more robust to the size of the experience replay buffer. This last finding supports the long standing hypothesis that the overlap in representations learned by deep neural networks is the leading cause of catastrophic interference.

Discussion (0). Continue with ORCID 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. Simplicial Embeddings Improve Sample Efficiency in Actor-Critic Agents

    cs.LG 2025-10 conditional novelty 5.0 of 10

    Simplicial embeddings — group-wise softmax feature layers — improve sample efficiency and final performance of FastTD3, FastSAC, and PPO across continuous- and discrete-control benchmarks at no meaningful runtime cost.

  2. On the Interplay Between Sparsity and Training in Deep Reinforcement Learning

    cs.LG 2025-01 conditional novelty 5.0 of 10

    The best sparse neural architecture for deep RL agents depends on whether hidden-layer weights are fixed or learned, and spatial sparsity is not always best even in spatially-structured games.

Pith tools