Graph kernels and Gaussian processes for relational reinforcement learning
From MaRDI portal
Recommendations
Cites work
- A short introduction to learning with kernels
- Combinatorial optimization. Theory and algorithms.
- Evaluation of techniques for classifying biological sequences
- Graph kernels and Gaussian processes for relational reinforcement learning.
- Graph theory.
- scientific article; zbMATH DE number 1179314 (Why is no real title available?)
- scientific article; zbMATH DE number 1550912 (Why is no real title available?)
- scientific article; zbMATH DE number 3799842 (Why is no real title available?)
- scientific article; zbMATH DE number 823069 (Why is no real title available?)
- Integrating guidance into relational reinforcement learning
- Introduction to Gaussian processes
- 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.
- Speeding up relational reinforcement learning through the use of an incremental first order decision tree learner
- Tetris is Hard, Even to Approximate
Cited in
(8)- Semi-Lipschitz functions and machine learning for discrete dynamical systems on graphs
- Reinforcement learning via approximation of the Q-function
- Graph kernels: a survey
- Graph kernels and Gaussian processes for relational reinforcement learning.
- Multi-relational graph convolutional networks: generalization guarantees and experiments
- Integrating guidance into relational reinforcement learning
- Practical solution techniques for first-order MDPs
- 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)