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...
Main Authors: | Ronca, A, De Giacomo, G |
---|---|
Format: | Conference item |
Language: | English |
Published: |
International Joint Conferences on Artificial Intelligence
2021
|
Similar Items
-
Markov abstractions for PAC reinforcement learning in non-Markov decision processes
by: Ronca, A, et al.
Published: (2022) -
Provably efficient offline reinforcement learning in regular decision processes
by: Cipollone, R, et al.
Published: (2024) -
Regular decision processes
by: Brafman, RI, et al.
Published: (2024) -
Sample-Efficient Proper PAC Learning with Approximate Differential Privacy
by: Ghazi, Badih, et al.
Published: (2022) -
PAC-UF Process Improving Surface Water Treatment: PAC Effects and Membrane Fouling Mechanism
by: Tian Li, et al.
Published: (2022-04-01)