Understanding Machine Learning: From Theory to Algorithms

Download Understanding Machine Learning tutorial, a complete eBook created by Shai Shalev-Shwartz and Shai Ben-David.

Machine learning is one of the fastest growing areas of computer science, with far-reaching applications. The aim of this textbook is to introduce machine learning, and the algorithmic paradigms it offers, in a principled way. The book provides an extensive theoretical account of the fundamental ideas underlying machine learning and the mathematical derivations that transform these principles into practical algorithms.

Following a presentation of the basics of the field, the book covers a wide array of central topics that have not been addressed by previous textbooks.

Table of contents

  • Introduction
  • What Is Learning?
  • When Do We Need Machine Learning?
  • Types of Learning
  • Relations to Other Fields
  • How to Read This Book
  • Possible Course Plans Based on This Book
  • Notation
  • Part I Foundations
  • A Formal Learning Model
  • PAC Learning
  • A More General Learning Model
  • Releasing the Realizability Assumption – Agnostic PAC
  • Learning
  • The Scope of Learning Problems Modeled
  • Summary
  • Bibliographic Remarks
  • Exercises
  • Learning via Uniform Convergence
  • Uniform Convergence Is Sufficient for Learnability
  • Examples
  • Threshold Functions
  • Intervals
  • Axis Aligned Rectangles
  • Finite Classes
  • VC-Dimension and the Number of Parameters
  • The Fundamental Theorem of PAC learning
  • Proof of Theorem
  • Characterizing Nonuniform Learnability
  • Structural Risk Minimization
  • Minimum Description Length and Occam’s Razor
  • Occam’s Razor
  • Other Notions of Learnability – Consistency
  • Discussing the Different Notions of Learnability
  • The No-Free-Lunch Theorem Revisited
  • Summary
  • Bibliographic Remarks
  • Exercises
  • The Runtime of Learning
  • Learning -Term DNF
  • Efficiently Learnable, but Not by a Proper ERM
  • Hardness of Learning*
  • Bibliographic Remarks
  • Exercises
  • Part II From Theory to Algorithms
  • Linear Regression
  • Least Squares
  • Linear Regression for Polynomial Regression Tasks
  • Logistic Regression
  • Bibliographic Remarks
  • Exercises
  • The VC-Dimension of L(B, T)
  • AdaBoost for Face Recognition
  • Bibliographic Re
  • xii Contents
  • k-Fold Cross Validation
  • Train-Validation-Test Split
  • What to Do If Learning Fails
  • Bibliographic Remarks
  • Exercises
  • Controlling the Fitting-Stability Tradeoff
  • Bibliographic Remarks
  • Exercises
  • Stochastic Gradient Descent
  • Gradient Descent
  • Analysis of GD for Convex-Lipschitz Functions
  • Stochastic Gradient Descent (SGD)
  • Analysis of SGD for Convex-Lipschitz-Bounded Functions
  • Learning with SGD
  • SGD for Risk Minimization
  • Analyzing SGD for Convex-Smooth Learning Problems
  • SGD for Regularized Loss Minimization
  • Bibliographic Remarks
  • Exercises
  • Support Vector Machines
  • Margin and Hard-SVM
  • Bibliographic Remarks
  • Exercises
  • Kernel Methods
  • Embeddings into Feature Spaces
  • The Kernel Trick
  • Kernels as a Way to Express Prior Knowledge
  • Characterizing Kernel Functions*
  • Implementing Soft-SVM with Kernels
  • Summary
  • Bibliographic Remarks
  • Exercises
  • Multiclass, Ranking, and Complex Prediction Problems
  • One-versus-All and All-Pairs
  • Linear Predictors for Ranking
  • Bipartite Ranking and Multivariate Performance Measures
  • Linear Predictors for Bipartite Ranking
  • Bibliographic Remarks
  • Exercises
  • Nearest Neighbor
  • Analysis
  • A Generalization Bound for the -NN Rule
  • Feedforward Neural Networks
  • Learning Neural Networks
  • The Expressive Power of Neural Networks
  • Geometric Intuition
  • The Sample Complexity of Neural Networks
  • The Runtime of Learning Neural Networks
  • SGD and Backpropagation
  • Contents xv
  • Online Learnability
  • Online Classification in the Unrealizable Case
  • Weighted-Majority
  • Online Convex Optimization
  • The Online Perceptron Algorithm
  • Summary
  • Bibliographic Remarks
  • The k-Means Algorithm
  • Spectral Clustering
  • Graph Cut
  • Graph Laplacian and Relaxed Graph Cuts
  • Unnormalized Spectral Clustering
  • Information Bottleneck*
  • Maximum Likelihood Estimation for Continuous Random Variables
  • Maximum Likelihood and Empirical Risk Minimization
  • Linear Discriminant Analysis
  • Latent Variables and the EM Algorithm


Size : 2540.539 Kb
File type : pdf
Downloads: 273
Created: 2019-05-01
Understanding Machine Learning: From Theory to Algorithms

Others Machine Learning Tutorials

A Brief Introduction to Machine Learning for Engineers

Machine Learning Yearning

Understanding Machine Learning

Python Machine Learning Projects

The Hundred-Page Machine Learning Book

Others related eBooks about Understanding Machine Learning: From Theory to Algorithms

Enhanced Living Environments

Download free course Enhanced Living Environments, pdf file on 339 pages by Ivan Ganchev, Nuno Garcia, Ciprian Dobre, Constandinos Mavromoustakis, Rossitza Goleva....

The Future of Software Quality Assurance

Download free course The Future of Software Quality Assurance, pdf file on 272 pages by Stephan Goericke....

Arduino Programming Notebook

A beginner's reference to the programming syntax of the Arduino microcontroller. Includes information on program structure, variables, datatypes, arithmetic, constants, flow control, and most of the common functions of the core library. Also includes an appendix with schematics and simple programs...

An Introduction to Matlab and Mathcad

Download free course An Introduction to Matlab and Mathcad, pdf file on 136 pages by by Troy Siemers....

Pro Git, 2nd Edition

Pro Git (2nd Edition) is your fully-updated guide to Git and its usage in the modern world..., download free Git tutorial in PDF (456 pages) created by Scott Chacon ....

20 Awesome Uses for a Raspberry Pi

This is a free Raspberry PI PDF tutorial in 22 chapters and 21 pages. This document aims to give students 20 awesome projects that you can use Raspberry PI....

Reinforcement Learning: An Introduction, Second Edition

Reinforcement Learning (RL), one of the most active research areas in artificial intelligence, is a computational approach to learning whereby an agent tries to maximize the total amount of reward it receives while interacting with a complex, uncertain environment. In Reinforcement Learning, Richard...

A First Course on Time Series Analysis with SAS

This book has been developed for a one-semester course usually attended by students in statistics, economics, business, engineering, and quantitative social sciences. A unique feature of this edition is its integration with the statistical software package SAS (Statistical Analysis System) computi...

XSLT Tutorial in PDF

Download XSLT Tutorial in PDF, free training document in 47 pages by Dan Olteanu....

The Complete FreeBSD: Documentation from the Source

The Complete FreeBSD is an eminently practical guidebook that explains not only how to get a computer up and running with the FreeBSD operating system, but also how to turn it into a highly functional and secure server that can host large numbers of users and disks, support remote access, and prov...