Graph kernels and Gaussian processes for relational reinforcement learning
From MaRDI portal
Publication:2433177
DOI10.1007/s10994-006-8258-yzbMath1103.68681WikidataQ58503819 ScholiaQ58503819MaRDI QIDQ2433177
Kurt Driessens, Jan Ramon, Thomas Gärtner
Publication date: 27 October 2006
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-006-8258-y
68T05: Learning and adaptive systems in artificial intelligence
Related Items
Graph Kernels: A Survey, Practical solution techniques for first-order MDPs, Reinforcement learning algorithms with function approximation: recent advances and applications, Semi-Lipschitz functions and machine learning for discrete dynamical systems on graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Integrating guidance into relational reinforcement learning
- Kernel-based reinforcement learning
- Tetris is Hard, Even to Approximate
- Learning Theory and Kernel Machines
- Learning Theory and Kernel Machines
- Inductive Logic Programming
- Combinatorial optimization. Theory and algorithms.