Graph kernels and Gaussian processes for relational reinforcement learning

DOI10.1007/S10994-006-8258-YMaRDI QIDQ2433177zbMATH OpenOpenAlexWikidataFDO

Authors 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 learningGraph kernelsRelational learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 1775635
• Relational reinforcement learning
• Relation-aware Graph Contrastive Learning
• Inductive Logic Programming

Cites work

• scientific article; zbMATH DE number 1304257 (Why is no real title available?)
• scientific article; zbMATH DE number 1179314 (Why is no real title available?)
• scientific article; zbMATH DE number 1950576 (Why is no real title available?)
• scientific article; zbMATH DE number 1550912 (Why is no real title available?)
• scientific article; zbMATH DE number 2088111 (Why is no real title available?)
• scientific article; zbMATH DE number 3799842 (Why is no real title available?)
• scientific article; zbMATH DE number 1881082 (Why is no real title available?)
• scientific article; zbMATH DE number 823069 (Why is no real title available?)
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• Combinatorial optimization. Theory and algorithms.
• Graph kernels and Gaussian processes for relational reinforcement learning.
• Integrating guidance into relational reinforcement learning
• Kernel-based reinforcement learning
• On graph kernels: hardness results and efficient alternatives.
• PAC-Bayesian pattern classification with kernels. Theory, algorithms, and an application to the game Go.
• Positive definite rational kernels.
• Tetris is Hard, Even to Approximate

Cited in

(8)

• Reinforcement learning via approximation of the Q-function
• Integrating guidance into relational reinforcement learning
• Practical solution techniques for first-order MDPs
• Semi-Lipschitz functions and machine learning for discrete dynamical systems on graphs
• Graph kernels: a survey
• Multi-relational graph convolutional networks: generalization guarantees and experiments
• Graph kernels and Gaussian processes for relational reinforcement learning.
• Reinforcement learning algorithms with function approximation: recent advances and applications

This page was built for publication: Graph kernels and Gaussian processes for relational reinforcement learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2433177)