A neurally plausible model learns successor representations in partially observable environments
Not on the map. Why?
Abstract (arXiv)
Animals need to devise strategies to maximize returns while interacting with their environment based on incoming noisy sensory observations. Task-relevant states, such as the agent's location within an environment or the presence of a predator, are often not directly observable but must be inferred using available sensory information. Successor representations (SR) have been proposed as a middle-ground between model-based and model-free reinforcement learning strategies, allowing for fast value computation and rapid adaptation to changes in the reward function or goal locations. Indeed, recent studies suggest that features of neural responses are consistent with the SR framework. However, it is not clear how such representations might be learned and computed in partially observed, noisy environments. Here, we introduce a neurally plausible model using distributional successor features, which builds on the distributed distributional code for the representation and computation of uncertainty, and which allows for efficient value function computation in partially observed environments via the successor representation. We show that distributional successor features can support reinforcement learning in noisy environments in which direct learning of successful policies is infeasible.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). First posted on arXiv 22 Jun 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 3; 2023: 3; 2024: 2.
12 papers.
- 2024A Distributional Analogue to the Successor Representationcited by 15
- 2021A First-Occupancy Representation for Reinforcement Learningcited by 14
- 2022A Rubric for Human-like Agents and NeuroAIcited by 8
- 2021Successor Feature Sets: Generalizing Successor Representations Across Policiescited by 6
- 2021Successor Feature Representationscited by 6
- 2022Unsupervised representation learning with recognition-parametrised probabilistic modelscited by 5
- 2023Distributional Bellman Operators over Mean Embeddingscited by 4
- 2021Multi-Agent Reinforcement Learning via Adaptive Kalman Temporal Difference and Successor Representationcited by 1
- 2022AKF-SR: Adaptive Kalman Filtering-based Successor Representationcited by 1
- 2023Uncertainty-aware transfer across tasks using hybrid model-based successor feature reinforcement learningcited by 1
- 2024How does the brain compute with probabilities?cited by 1
- 2023An introduction to reinforcement learning for neurosciencecited by 0
- 2024How does the brain compute with probabilities?1 Sep 2024
- 2024A Distributional Analogue to the Successor Representation13 Feb 2024
- 2023Distributional Bellman Operators over Mean Embeddings9 Dec 2023
- 2023An introduction to reinforcement learning for neuroscience13 Nov 2023
- 2023Uncertainty-aware transfer across tasks using hybrid model-based successor feature reinforcement learning16 Oct 2023
- 2022A Rubric for Human-like Agents and NeuroAI8 Dec 2022
- 2022Unsupervised representation learning with recognition-parametrised probabilistic models13 Sep 2022
- 2022AKF-SR: Adaptive Kalman Filtering-based Successor Representation31 Mar 2022
- 2021Multi-Agent Reinforcement Learning via Adaptive Kalman Temporal Difference and Successor Representation30 Dec 2021
- 2021Successor Feature Representations29 Oct 2021
- 2021A First-Occupancy Representation for Reinforcement Learning28 Sep 2021
- 2021Successor Feature Sets: Generalizing Successor Representations Across Policies3 Mar 2021