# Machine Learning

- Institution: Stanford University
- Department: Computer Science
- Teacher: Andrew Ng
- Level: Undergraduate
- Language: English
- Subjects: Computer science
- Source: [Stanford Engineering Everywhere](https://see.stanford.edu/Course/CS229)
- Licence: [CC BY-NC-SA 4.0](http://creativecommons.org/licenses/by-nc-sa/4.0/legalcode) (Non-commercial use only.)
- Syllabus: [at the source](https://see.stanford.edu/materials/aimlcs229/info.pdf)
- Who can watch: Tweens profiles and older (sources give no ratings; placed by Invisible Network from the source's own words)

This course provides a broad introduction to machine learning and statistical pattern recognition.

Topics include: supervised learning (generative/discriminative learning, parametric/non-parametric learning, neural networks, support vector machines); unsupervised learning (clustering, dimensionality reduction, kernel methods); learning theory (bias/variance tradeoffs; VC theory; large margins); reinforcement learning and adaptive control. The course will also discuss recent applications of machine learning, such as to robotic control, data mining, autonomous navigation, bioinformatics, speech recognition, and text and web data processing.

Students are expected to have the following background:

Prerequisites: - Knowledge of basic computer science principles and skills, at a level sufficient to write a reasonably non-trivial computer program.

- Familiarity with the basic probability theory. (Stat 116 is sufficient but not necessary.)

- Familiarity with the basic linear algebra (any one of Math 51, Math 103, Math 113, or CS 205 would be much more than necessary.)

## Lectures

1. [The Motivation & Applications of Machine Learning, The Logistics of the Class, The Definition of Machine Learning, The Overview of Supervised Learning, The Overview of Learning Theory, The Overview of Unsupervised Learning, The Overview…](https://invisiblenetwork.ai/learn/stanford/cs229/bd57b95cc0b6), 1 h 9 min (Video)
2. [An Application of Supervised Learning - Autonomous Deriving, ALVINN, Linear Regression, Gradient Descent, Batch Gradient Descent, Stochastic Gradient Descent (Incremental Descent), Matrix Derivative Notation for Deriving Normal Equations,…](https://invisiblenetwork.ai/learn/stanford/cs229/97623c5bed18), 1 h 16 min (Video)
3. [The Concept of Underfitting and Overfitting, The Concept of Parametric Algorithms and Non-parametric Algorithms, Locally Weighted Regression, The Probabilistic Interpretation of Linear Regression, The motivation of Logistic Regression,…](https://invisiblenetwork.ai/learn/stanford/cs229/48207263ad6a), 1 h 13 min (Video)
4. [Newton's Method, Exponential Family, Bernoulli Example, Gaussian Example, General Linear Models (GLMs), Multinomial Example, Softmax Regression](https://invisiblenetwork.ai/learn/stanford/cs229/7f383979aca8), 1 h 13 min (Video)
5. [Discriminative Algorithms, Generative Algorithms, Gaussian Discriminant Analysis (GDA), GDA and Logistic Regression, Naive Bayes, Laplace Smoothing](https://invisiblenetwork.ai/learn/stanford/cs229/35030b1f03f0), 1 h 16 min (Video)
6. [Multinomial Event Model, Non-linear Classifiers, Neural Network, Applications of Neural Network, Intuitions about Support Vector Machine (SVM), Notation for SVM, Functional and Geometric Margins](https://invisiblenetwork.ai/learn/stanford/cs229/9219bb26d288), 1 h 14 min (Video)
7. [Optimal Margin Classifier, Lagrange Duality, Karush-Kuhn-Tucker (KKT) Conditions, SVM Dual, The Concept of Kernels](https://invisiblenetwork.ai/learn/stanford/cs229/f218a1e3e0c9), 1 h 16 min (Video)
8. [Kernels, Mercer's Theorem, Non-linear Decision Boundaries and Soft Margin SVM, Coordinate Ascent Algorithm, The Sequential Minimization Optimization (SMO) Algorithm, Applications of SVM](https://invisiblenetwork.ai/learn/stanford/cs229/4ffbd8288481), 1 h 17 min (Video)
9. [Bias/variance Tradeoff, Empirical Risk Minimization (ERM), The Union Bound, Hoeffding Inequality, Uniform Convergence - The Case of Finite H, Sample Complexity Bound, Error Bound, Uniform Convergence Theorem & Corollary](https://invisiblenetwork.ai/learn/stanford/cs229/a86f126c0a02), 1 h 14 min (Video)
10. [Uniform Convergence - The Case of Infinite H, The Concept of 'Shatter' and VC Dimension, SVM Example, Model Selection, Cross Validation, Feature Selection](https://invisiblenetwork.ai/learn/stanford/cs229/74c62bc9a752), 1 h 13 min (Video)
11. [Bayesian Statistics and Regularization, Online Learning, Advice for Applying Machine Learning Algorithms, Debugging/fixing Learning Algorithms, Diagnostics for Bias & Variance, Optimization Algorithm Diagnostics, Diagnostic Example -…](https://invisiblenetwork.ai/learn/stanford/cs229/01682b5e163b), 1 h 22 min (Video)
12. [The Concept of Unsupervised Learning, K-means Clustering Algorithm, K-means Algorithm, Mixtures of Gaussians and the EM Algorithm, Jensen's Inequality, The EM Algorithm, Summary](https://invisiblenetwork.ai/learn/stanford/cs229/008e70b770ea), 1 h 14 min (Video)
13. [Mixture of Gaussian, Mixture of Naive Bayes - Text clustering (EM Application), Factor Analysis, Restrictions on a Covariance Matrix, The Factor Analysis Model, EM for Factor Analysis](https://invisiblenetwork.ai/learn/stanford/cs229/84ddd6663ca6), 1 h 15 min (Video)
14. [The Factor Analysis Model,0 EM for Factor Analysis, Principal Component Analysis (PCA), PCA as a Dimensionality Reduction Algorithm, Applications of PCA, Face Recognition by Using PCA](https://invisiblenetwork.ai/learn/stanford/cs229/5c0d65199e2c), 1 h 21 min (Video)
15. [Latent Semantic Indexing (LSI), Singular Value Decomposition (SVD) Implementation, Independent Component Analysis (ICA), The Application of ICA, Cumulative Distribution Function (CDF), ICA Algorithm, The Applications of ICA](https://invisiblenetwork.ai/learn/stanford/cs229/9f0adab98a24), 1 h 17 min (Video)
16. [Applications of Reinforcement Learning, Markov Decision Process (MDP), Defining Value & Policy Functions, Value Function, Optimal Value Function, Value Iteration, Policy Iteration](https://invisiblenetwork.ai/learn/stanford/cs229/e76373c61dbc), 1 h 13 min (Video)
17. [Generalization to Continuous States, Discretization & Curse of Dimensionality, Models/Simulators, Fitted Value Iteration, Finding Optimal Policy](https://invisiblenetwork.ai/learn/stanford/cs229/46fe5f0dd8b0), 1 h 17 min (Video)
18. [State-action Rewards, Finite Horizon MDPs, The Concept of Dynamical Systems, Examples of Dynamical Models, Linear Quadratic Regulation (LQR), Linearizing a Non-Linear Model, Computing Rewards, Riccati Equation](https://invisiblenetwork.ai/learn/stanford/cs229/81c80ace4501), 1 h 17 min (Video)
19. [Advice for Applying Machine Learning, Debugging Reinforcement Learning (RL) Algorithm, Linear Quadratic Regularization (LQR), Differential Dynamic Programming (DDP), Kalman Filter & Linear Quadratic Gaussian (LQG), Predict/update Steps of…](https://invisiblenetwork.ai/learn/stanford/cs229/57d7dd6733bc), 1 h 16 min (Video)
20. [Partially Observable MDPs (POMDPs), Policy Search, Reinforce Algorithm, Pegasus Algorithm, Pegasus Policy Search, Applications of Reinforcement Learning](https://invisiblenetwork.ai/learn/stanford/cs229/8f4422197b77), 1 h 17 min (Video)