Steve James
Steve James
Home
Publications
Talks
Research Lab
Contact
Light
Dark
Automatic
Language
Counting Reward Automata: Sample Efficient Reinforcement Learning Through the Exploitation of Reward Function Structure
We present counting reward automata—a finite state machine variant capable of modelling any reward function expressible as a …
Tristan Bester
,
Benjamin Rosman
,
Steven James
,
Geraud Nangue Tasse
PDF
Cite
Cite
×