Yaser Abu-Mostafa

@article{, title= {Caltech CS156 - Machine Learning - Yaser}, journal= {}, author= {Yaser Abu-Mostafa}, year= {2012}, url= {http://work.caltech.edu/telecourse.html}, license= {CC BY-NC-ND}, abstract= {##Outline This is an introductory course in machine learning (ML) that covers the basic theory, algorithms, and applications. ML is a key technology in Big Data, and in many financial, medical, commercial, and scientific applications. It enables computational systems to adaptively improve their performance with experience accumulated from the observed data. ML has become one of the hottest fields of study today, taken up by undergraduate and graduate students from 15 different majors at Caltech. This course balances theory and practice, and covers the mathematical as well as the heuristic aspects. The lectures below follow each other in a story-like fashion: * What is learning? * Can a machine learn? * How to do it? * How to do it well? * Take-home lessons. Lecture 01 - The Learning Problem - Introduction; supervised, unsupervised, and reinforcement learning. Components of the learning problem. Lecture 02 - Is Learning Feasible? Can we generalize from a limited sample to the entire space? Relationship between in-sample and out-of-sample. Lecture 03 - The Linear Model I - Linear classification and linear regression. Extending linear models through nonlinear transforms. Lecture 04 - Error and Noise - The principled choice of error measures. What happens when the target we want to learn is noisy. Lecture 05 - Training versus Testing - The difference between training and testing in mathematical terms. What makes a learning model able to generalize? Lecture 06 - Theory of Generalization - How an infinite model can learn from a finite sample. The most important theoretical result in machine learning. Lecture 07 - The VC Dimension - A measure of what it takes a model to learn. Relationship to the number of parameters and degrees of freedom. Lecture 08 - Bias-Variance Tradeoff - Breaking down the learning performance into competing quantities. The learning curves. Lecture 09 - The Linear Model II - More about linear models. Logistic regression, maximum likelihood, and gradient descent. Lecture 10 - Neural Networks - A biologically inspired model. The efficient backpropagation learning algorithm. Hidden layers. Lecture 11 - Overfitting - Fitting the data too well; fitting the noise. Deterministic noise versus stochastic noise. Lecture 12 - Regularization - Putting the brakes on fitting the noise. Hard and soft constraints. Augmented error and weight decay. Lecture 13 - Validation - Taking a peek out of sample. Model selection and data contamination. Cross validation. Lecture 14 - Support Vector Machines - One of the most successful learning algorithms; getting a complex model at the price of a simple one. Lecture 15 - Kernel Methods - Extending SVM to infinite-dimensional spaces using the kernel trick, and to non-separable data using soft margins. Lecture 16 - Radial Basis Functions - An important learning model that connects several machine learning models and techniques. Lecture 17 - Three Learning Principles - Major pitfalls for machine learning practitioners; Occam?s razor, sampling bias, and data snooping. Lecture 18 - Epilogue - The map of machine learning. Brief views of Bayesian learning and aggregation methods.}, keywords= {}, terms= {}, superseded= {} }

Average Time | 1 hrs, 37 mins, 26 secs |

Average Speed | 574.41kB/s |

Best Time | 4 mins, 31 secs |

Best Speed | 12.39MB/s |

Worst Time | 6 hrs, 40 mins, 57 secs |

Worst Speed | 139.59kB/s |