
Premium content
Access to this content requires a subscription. You must be a premium user to view this content.

Would you like to see your presentation here, made available to a global audience of researchers?
Add your own presentation or have us affordably record your next conference.
Logical specifications help reinforcement learning algorithms achieve complex tasks. However, when a task is under-specified, agents may fail to learn useful policies. In this work, we explore improving coarse-grained logical specifications through an exploration-guided strategy. We propose AutoSpec, a framework that searches for a logical refinement whose satisfaction implies that of the original specification but provides additional guidance, making it easier for reinforcement learning algorithms to learn useful policies. AutoSpec applies to tasks specified via the SpectRL logic. We exploit the compositional nature of SpectRL specifications and design an algorithm that refines the abstract specification graph by refining existing edges or introducing new ones. We show how AutoSpec integrates with existing algorithms for learning from logical specifications. Our experiments demonstrate that AutoSpec improves the complexity of control tasks solved using refined logical specifications.
