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

 

Size2540.539 Kb
File typepdf
Downloads295
Created2019-05-01
Cover of Understanding Machine Learning: From Theory to Algorithms

Download

  • New Applications of Artificial Intelligence

    This book has a complete set of applications of artificial neural networks that allow the reader to gain experience about the new systems for implementing and developing artificial intelligence (AI) methods, which can run in several digital systems. On the other hand, the book shows the newest alg...

  • SLO Adoption and Usage in Site Reliability Engineering

    Download free course SLO Adoption and Usage in Site Reliability Engineering, pdf file on 104 pages by Julie McCoy, Nicole Forsgren....

  • Cloud Computing - Architecture and Applications

    In the era of Internet of Things and with the explosive worldwide growth of electronic data volume, and associated need of processing, analysis, and storage of such humongous volume of data, it has now become mandatory to exploit the power of massively parallel architecture for fast computation. ...

  • DevOps for Digital Leaders

    Download free course DevOps for Digital Leaders, pdf file on 176 pages by Aruna Ravichandran, Kieran Taylor, Peter Waterhouse....

  • Text Mining with R

    Download free course Text Mining with R, pdf file on 194 pages by Julia Silge, David Robinson....

  • Azure Serverless Succinctly

    Download free course Azure Serverless Succinctly, pdf file on 92 pages by by Sander Rossel....

  • High-Performance Caching with Nginx and Nginx Plus

    Download free course High-Performance Caching with Nginx and Nginx Plus, pdf file on 47 pages by Floyd Smith....

  • Software Architecture Patterns

    The success of any application or system depends on the architecture pattern you use. By describing the overall characteristics of the architecture, these patterns not only guide designers and developers on how to design components, but also determine the ways in which those components should inte...

  • Arduino projects for Genuis

    Download free Arduino tutorial in PDF , this book will show the Genius how to attach an Arduino board to their computer and program it....

  • Migrating to Cloud-Native Application Architectures

    Download free course Migrating to Cloud-Native Application Architectures, pdf file on 58 pages by Matt Stine....