Gaussian Processes for Machine Learning
by Carl E. Rasmussen, Christopher K. I. Williams
Publisher: The MIT Press 2005
ISBN/ASIN: 026218253X
ISBN-13: 9780262182539
Number of pages: 266
Description:
Gaussian processes (GPs) provide a principled, practical, probabilistic approach to learning in kernel machines. The book deals with the supervised-learning problem for both regression and classification, and includes detailed algorithms. A wide variety of covariance (kernel) functions are presented and their properties discussed. Model selection is discussed both from a Bayesian and a classical perspective. Many connections to other well-known techniques from machine learning and statistics are discussed, including support-vector machines, neural networks, splines, regularization networks, relevance vector machines and others.
Download or read it online for free here:
Download link
(multiple PDF files)
Similar books
Modeling Agents with Probabilistic Programsby Owain Evans, et al. - AgentModels.org
This book describes and implements models of rational agents for (PO)MDPs and Reinforcement Learning. One motivation is to create richer models of human planning, which capture human biases. The book assumes basic programming experience.
(7360 views)
The Hundred-Page Machine Learning Bookby Andriy Burkov
This is the first successful attempt to write an easy to read book on machine learning that isn't afraid of using math. It's also the first attempt to squeeze a wide range of machine learning topics in a systematic way and without loss in quality.
(11989 views)
The Elements of Statistical Learning: Data Mining, Inference, and Predictionby T. Hastie, R. Tibshirani, J. Friedman - Springer
This book brings together many of the important new ideas in learning, and explains them in a statistical framework. The authors emphasize the methods and their conceptual underpinnings rather than their theoretical properties.
(43527 views)
Optimal and Learning Control for Autonomous Robotsby Jonas Buchli, et al. - arXiv.org
The starting point is the formulation of of an optimal control problem and deriving the different types of solutions and algorithms from there. These lecture notes aim at supporting this unified view with a unified notation wherever possible.
(7321 views)