A proposed transfer algorithm, GGPI, applies successor features to alternating zero-sum Markov games, but its central theorem is not proven as written.
Advantages and Limitations of using Successor Features for Transfer in Reinforcement Learning
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
One question central to Reinforcement Learning is how to learn a feature representation that supports algorithm scaling and re-use of learned information from different tasks. Successor Features approach this problem by learning a feature representation that satisfies a temporal constraint. We present an implementation of an approach that decouples the feature representation from the reward function, making it suitable for transferring knowledge between domains. We then assess the advantages and limitations of using Successor Features for transfer.
citation-role summary
citation-polarity summary
fields
cs.MA 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Successor Features for Transfer in Alternating Markov Games
A proposed transfer algorithm, GGPI, applies successor features to alternating zero-sum Markov games, but its central theorem is not proven as written.