Graph kernels and Gaussian processes for relational reinforcement learning

DOI10.1007/s10994-006-8258-yzbMath1103.68681OpenAlexW2109722166WikidataQ58503819 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

zbMATH Keywords

Gaussian processesReinforcement learningRelational learningGraph kernels

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Practical solution techniques for first-order MDPs, Semi-Lipschitz functions and machine learning for discrete dynamical systems on graphs, Reinforcement learning algorithms with function approximation: recent advances and applications, Graph Kernels: A Survey

Cites Work

• 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.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item