Boosting: Foundations and Algorithms
by Robert E. Schapire, Yoav Freund
Publisher: The MIT Press 2014
Number of pages: 544
Boosting is an approach to machine learning based on the idea of creating a highly accurate predictor by combining many weak and inaccurate 'rules of thumb'. A remarkably rich theory has evolved around boosting, with connections to a range of topics, including statistics, game theory, convex optimization, and information geometry.
Home page url
Download or read it online for free here:
by Titus Neupert, et al. - arXiv.org
This is an introductory machine learning course specifically developed with STEM students in mind, written by the theoretical Condensed Matter Theory group at the University of Zurich. We discuss supervised, unsupervised, and reinforcement learning.
by Hal Daumé III - ciml.info
Tis is a set of introductory materials that covers most major aspects of modern machine learning (supervised and unsupervised learning, large margin methods, probabilistic modeling, etc.). It's focus is on broad applications with a rigorous backbone.
by 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.
by David Barber - Cambridge University Press
The book is designed for final-year undergraduate students with limited background in linear algebra and calculus. Comprehensive and coherent, it develops everything from basics to advanced techniques within the framework of graphical models.