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 Csaba Szepesvari - Morgan and Claypool Publishers
We focus on those algorithms of reinforcement learning that build on the theory of dynamic programming. We give a comprehensive catalog of learning problems, describe the core ideas, followed by the discussion of their properties and limitations.
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 Dimitri P. Bertsekas - Athena Scientific
The book considers large and challenging multistage decision problems, which can be solved by dynamic programming and optimal control, but their exact solution is computationally intractable. We discuss solution methods that rely on approximations.
by David J. C. MacKay - Cambridge University Press
A textbook on information theory, Bayesian inference and learning algorithms, useful for undergraduates and postgraduates students, and as a reference for researchers. Essential reading for students of electrical engineering and computer science.