Temporally Abstract Partial Models
Khimya Khetarpal, Zafarali Ahmed, Gheorghe Comanici, Doina Precup

TL;DR
This paper introduces temporally abstract partial option models that incorporate situational affordances, enhancing planning efficiency by focusing on relevant actions at different time scales in reinforcement learning.
Contribution
It defines affordances for options and develops partial models that consider situational feasibility, addressing a gap in temporally abstract decision-making.
Findings
Partial models improve planning efficiency.
Trade-offs between estimation and approximation errors analyzed.
Empirical results show potential benefits in real scenarios.
Abstract
Humans and animals have the ability to reason and make predictions about different courses of action at many time scales. In reinforcement learning, option models (Sutton, Precup \& Singh, 1999; Precup, 2000) provide the framework for this kind of temporally abstract prediction and reasoning. Natural intelligent agents are also able to focus their attention on courses of action that are relevant or feasible in a given situation, sometimes termed affordable actions. In this paper, we define a notion of affordances for options, and develop temporally abstract partial option models, that take into account the fact that an option might be affordable only in certain situations. We analyze the trade-offs between estimation and approximation error in planning and learning when using such models, and identify some interesting special cases. Additionally, we demonstrate empirically the potential…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsReinforcement Learning in Robotics · Evolutionary Algorithms and Applications · Computability, Logic, AI Algorithms
