Grid cells as a spectral basis for successor features: when the goal moves, one linear regression re-adapts the agent
In continual reinforcement learning, successor features separate environment dynamics from task reward, but a poor feature basis forces relearning whenever the task changes. Spectral-SF takes the basis from eigenvectors of the transition matrix of a fixed reference policy, so each successor feature equals its base feature times a known constant and the long-term return shares the same features as the immediate reward, with no successor-feature network or replay buffer. In a two-goal gridworld with the uniform random walk as reference policy, Spectral-SF maintains near-maximal return across every goal change, whereas SimpleSF and DQN lose most of their return at each change.