ML 101
M01 · L02
Introduction

Types of Machine Learning

Not all learning is the same. Just as humans learn from teachers, exploration, and trial-and-error, ML has three distinct paradigms — each suited to different problems.

01 / 13
ML 101
M01 · L02
Paradigm 1

Supervised Learning

The most widely used paradigm. You provide labeled training data — input-output pairs — and the model learns to predict outputs for new inputs.

Key Idea
Learn from a teacher: labeled examples → discover the mapping function
02 / 13
ML 101
M01 · L02
Two Flavors

Classification vs Regression

Supervised learning splits into two tasks depending on the type of output.

Classification
Discrete labels: spam/not spam, cat/dog
Regression
Continuous values: price, temperature
03 / 13
ML 101
M01 · L02
Algorithms

Supervised Toolbox

Each algorithm has its sweet spot — from simple to powerful.

  • Linear Regression — simple, interpretable baselines
  • Decision Trees — handle non-linear data naturally
  • SVMs — optimal decision boundaries
  • Neural Networks — learn complex mappings at scale
04 / 13
ML 101
M01 · L02
Paradigm 2

Unsupervised Learning

No labels, no teacher. The algorithm discovers hidden structure in data entirely on its own.

Three Tasks
Clustering • Dimensionality Reduction • Anomaly Detection
05 / 13
ML 101
M01 · L02
The Math

K-Means Clustering

Group similar data points by minimizing the distance to cluster centers.

K-Means Objective
J = \sum_{k=1}^{K}\sum_{x_i \in C_k} \|x_i - \mu_k\|^2
06 / 13
ML 101
M01 · L02
Beyond Clustering

Reduction & Anomalies

Compress data and catch outliers — two more unsupervised superpowers.

  • PCA — find directions of max variance
  • Autoencoders — neural compression
  • Anomaly Detection — flag fraud, defects, intrusions
07 / 13
ML 101
M01 · L02
Paradigm 3

Reinforcement Learning

An agent interacts with an environment, takes actions, and learns a policy that maximizes cumulative reward.

The RL Loop
State → Action → Reward → New State → repeat
08 / 13
ML 101
M01 · L02
The Math

The Return

The agent maximizes the discounted cumulative reward over time.

Expected Return
G_t = \sum_{k=0}^{\infty} \gamma^k R_{t+k+1}
09 / 13
ML 101
M01 · L02
Hybrid Approaches

Beyond the Three

Modern AI blurs the boundaries with hybrid learning strategies.

Semi-supervised
Few labels + lots of unlabeled data
Self-supervised
Create labels from the data itself
10 / 13
ML 101
M01 · L02
Decision Guide

Choosing the Right Type

Match your data and problem to the right paradigm.

  • Have labels? → Supervised learning
  • Find structure? → Unsupervised learning
  • Sequential decisions? → Reinforcement learning
  • Few labels? → Semi/self-supervised
11 / 13
ML 101
Knowledge Check

Check what stuck

Three questions from this lesson. Answer to see why — the explanation appears whether you were right or wrong. Nothing is scored or saved.

Question 1 of 0
Score 0/0

12 / 13
ML 101
Summary
Recap

What you learned

Three paradigms — supervised, unsupervised, and reinforcement — plus hybrid approaches. Choosing the right one depends on your data and your problem.

13 / 13