Machine Learning · Insper

Introduction & History

Advanced approach

How machine learning (ML) got here, and which questions the rest of the course will answer

The path of this part

  1. 200 years of milestonesstatistics and computer science
  2. The perceptron and the wintersa table of boxes vs. a model; hype and revivals
  3. Reading the arcthree lessons for this course
  4. The course aheadclassical ML end to end, up to the frontier
Each stage answers one question: which milestones led here? → why did learning stall twice, and what brought it back? → what does the history teach this course? → what does the course cover, and in which order?
Stage 1 · which milestones led here?

A 200-year conversation: statistics and computer science

whenmilestone
1805least squares: the historical basis of regression
1886regression to the mean: the word "regression" enters statistics
1920s–1936statistical foundations: modern inference takes shape
1950Turing's question: can machines think?
1956–1959the birth of artificial intelligence (AI) and the perceptron
1969–1980first AI winter: hype meets its limits

… up to the current edge

whenmilestone
1984–1986backpropagation and decision trees: learning revives on two fronts
1995–1997statistical learning era: rigorous theory, powerful algorithms
2001ensembles and the "two cultures": the workhorses of tabular ML
2012–2016the deep learning breakthrough: neural networks return, at scale
2017–2018transformers: attention is all you need
2020–todayfoundation models: one model, many tasks

The full timeline, with sources, is on the lesson page.

Stage 2 · why did learning stall twice, and what brought it back?

Matchboxes and the perceptron: a table vs. a model

Both learn from feedback on their mistakes: a loss removes a bead; an error nudges the perceptron's weights toward the right answer (Rosenblatt, 1958).

matchbox machine

one box per position: a lookup table

what it learns in one box says nothing about any other; a position it never met has no box at all

perceptron

a few weights shared by every input

each update changes its answer on examples it has never seen

The perceptron generalizes. Hexapawn fits in 19 boxes; almost no real problem does, so every model in this course is a function with parameters, not a table of answers.

Two winters, two revivals

whenwhat happened
1969–1973Minsky and Papert: one perceptron cannot learn XOR (exclusive or); the Lighthill Report: AI failed to deliver
1974–1980first winter: funding collapses in the US and the UK
1984–1986backpropagation trains multi-layer networks, which solve XOR; CART and ID3 make trees practical
1987–1993second winter: the expert-systems boom, programs of hand-written rules, collapses
1995–2001statistical learning: support vector machines, boosting, random forests; theory and honest validation
2012–deep learning: large labeled datasets, graphics processing units (GPUs) and open software
Both winters have the same shape: promises outran results.
Stage 3 · what does the history teach this course?

Reading the arc: three lessons for this course

the classics never left

least squares (1805) is still the first regression model to try; logistic regression (1958) is a production workhorse

hype cycles are real

two AI winters (about 1974–1980 and 1987–1993); honest evaluation is the antidote

modern = classical, composed

BERTopic (2022) is embeddings + dimensionality reduction + clustering + TF-IDF (term frequency × inverse document frequency)

Knowing the parts lets you understand, and debug, the whole.
Stage 4 · what does the course cover, and in which order?

Where this course fits

  • Classical machine learning end to end: data, unsupervised learning, regression, classification, trees and ensembles.
  • It finishes at the frontier: neural networks, explainability, AutoML (automated machine learning), MLOps (machine learning operations) and foundation models.
  • Deep learning gets one bridging lecture here; its full treatment is in the companion course Artificial Neural Networks and Deep Learning.

The questions the course will answer

questionwhere
kinds of learning; will it work on cases it never saw?the ML landscape
what does the data look like, is it ready?exploratory analysis, preprocessing, pipelines
structure with no labels at all?dimensionality reduction, clustering
predict a number?linear regression, gradient descent and regularization
predict a class?logistic regression, k-nearest neighbors, SVM, trees, ensembles
how good is the model, really?classification metrics, ROC and PR curves, cross-validation
which model, with which settings?model selection
why did it decide that? how does it run in production?explainability, MLOps

SVM = support vector machine; ROC = receiver operating characteristic; PR = precision–recall.

Advanced lab · about 25 min, in pairs

What the machine learned, and the map of the course, steps 4 to 6

  • Step 4, in the matchbox simulator: train against the greedy opponent. Does a stronger teacher make a stronger machine?
  • Step 5: the timeline as a map of the course. Step 6: take random forest, gradient boosting and BERTopic apart into classical pieces.
  • At every step, answer the Predict before acting.
  • Simulation: change the teacher (step 4).

Pace: step 4 and the simulation in 10 min; step 5 in 8 min; step 6 in 7 min.