2 citations · 4 across the 10 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2023
Counting Reward Automata: Sample Efficient Reinforcement Learning Through the Exploitation of Reward Function Structure
Tristan Bester, Benjamin Rosman, Steven James +1
We present counting reward automata-a finite state machine variant capable of modelling any reward function expressible as a formal language. Unlike previous approaches, which are…
cs.AI2023
Dynamics Generalisation in Reinforcement Learning via Adaptive Context-Aware Policies
Michael Beukman, Devon Jarvis, Richard Klein +2
While reinforcement learning has achieved remarkable successes in several domains, its real-world application is limited due to many methods failing to generalise to unfamiliar con…