Efficient PAC reinforcement learning in regular decision processes
Recently regular decision processes have been proposed as a well-behaved form of non-Markov decision process. Regular decision processes are characterised by a transition function and a reward function that depend on the whole history, though regularly (as in regular languages). In practice both the...
| Hlavní autoři: | , |
|---|---|
| Médium: | Conference item |
| Jazyk: | English |
| Vydáno: |
International Joint Conferences on Artificial Intelligence
2021
|