Expectation Maximization

Linear Algebra

Gaussian Discriminant Analysis

Support Vector Machine (SVM)

Regularization (mathematics)

Unsupervised learning

Prompting

Exponential family

Weighted Least Squares

Generalized Linear Models

Kernel (operating system)

Neural network

Feature / Model Selection

Factor Analysis

Self-supervised Learning

Instruct Tuning

Supervised learning

Newton's Method

Probability

NumPy

Bias - Variance

Gaussian Mixture Models (GMM)

Independent Component Analysis (ICA)

In-context Learning

Multi-class Classification

Python

Backpropagation

K-means clustering

Principal Component Analysis (PCA)

Large Language Model (LLM)

Reinforcement Learning from Human Feedback (RLHF)

Logistic Regression

CS 229: Machine Learning Stanford University Winter 2023 This comprehensive course covers various machine learning principles from supervised, unsupervised to reinforcement learning. Topics also touch on neural networks, support vector machines, bias-variance tradeoffs, and many real-world applications. It requires a background in computer science, probability, multivariable calculus, and linear algebra.  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, practical advice); 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:

- Knowledge of basic computer science principles and skills, at a level sufficient to write a reasonably non-trivial computer program in Python/NumPy. (CS106A or CS106B, CS106X.)
- Familiarity with probability theory. (CS 109, MATH151, or STATS 116) 
- Familiarity with multivariable calculus and linear algebra (relevant classes include, but not limited to MATH 51, MATH 104, MATH 113, CS 205, CME 100.) Stanford Math 51 course text can be found [here](https://web.stanford.edu/class/math51/stanford/math51book.pdf). 

CS 229: Machine Learning

Machine Learning

Expectation%E2%80%93maximization algorithm

Expectation Maximization

1 courses cover this concept

CS 229: Machine Learning