2016/06/08 by Tejas D. Kulkarni, Kulkarni, Tejas D., Ardavan Saeedi +5 · 1 voice · 97 citations
Computer Science · Decision Sciences · Mathematics · Neuroscience · Psychology · #Advanced Bandit Algorithms Research #Artificial intelligence #Bellman equation #Bottleneck #Computer science #Mathematical optimization #Mathematics #Neural dynamics and brain function #Psychology #Reinforcement #Reinforcement Learning in Robotics #Reinforcement learning #Social psychology #Successor cardinal #cs.AI #cs.LG #cs.NE #stat.ML
paper · pdf · doi:10.48550/arxiv.1606.02396
published in arXiv (Cornell University) (Cornell University) · 10 pages, 6 figures
arxiv created 2016/06/08 · openalex publication_date 2016/06/08 · arxiv updated 2016/06/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/04
Learning robust value functions given raw observations and rewards is now possible with model-free and model-based deep reinforcement learning algorithms. There is a third alternative, called Successor Representations (SR), which decomposes the value function into two components -- a reward predictor and a successor map. The successor map represents the expected future state occupancy from any given state and the reward predictor maps states to scalar rewards. The value function of a state can be computed as the inner product between the successor map and the reward weights. In this paper, we present DSR, which generalizes SR within an end-to-end deep reinforcement learning framework. DSR has several appealing properties including: increased sensitivity to distal reward changes due to factorization of reward and world dynamics, and the ability to extract bottleneck states (subgoals) given successor maps trained under a random policy. We show the efficacy of our approach on two diverse environments given raw pixel observations -- simple grid-world domains (MazeBase) and the Doom game engine.