Machine Learning Fundamentals
Machine learning is a set of methods that let computers learn patterns from data and make predictions without being explicitly programmed for each case. It powers recommendations, spam filters, image recognition, and forecasting systems.
itArtificial intelligence and machine learning | OpenSkills.info
Course pathWalk it in order
Look it upDip in anytime
Go furtherLeaves this page
Don't Panic
Don't Panic — Machine Learning Fundamentals
Here is the whole trick, stated plainly: instead of writing rules for a computer to follow, you show it examples and let it work the rules out for itself. That is machine learning, and everything else in this course is detail on top of that one sentence.
Before this existed, people wrote rules by hand — filters that flagged an email as spam if it contained certain words, catalogues that recommended a product because it shared a category with one you bought. Rules like that worked until the problem got messier than a human could enumerate: pixel patterns in a photo, slang that outpaces a dictionary, a million customers with a million tastes. Machine learning handles the mess by finding the pattern in historical examples instead of asking someone to write it down.
Three ideas carry the rest. First, every system does the same loop: collect data, choose a model, train it, evaluate it on examples it has never seen, and only then trust it. Skip the "never seen" part and you get a number that flatters you and a model that fails the moment it meets the real world — the single most common way this goes wrong. Second, there's a genuine tension between a model too simple to notice the pattern (underfitting) and one so flexible it memorizes the noise along with the signal (overfitting); the whole discipline of evaluation exists to catch you drifting toward either edge. Third, and this is the part that surprises people who arrive expecting the algorithm to be the hard bit: it usually isn't. Swapping one algorithm for a fancier one buys a few points of accuracy. Fixing the features — how the raw data gets represented — buys most of the rest.
The surprise, if there is one: a model that scores beautifully on the data it was trained on has told you almost nothing. It might have genuinely learned the pattern, or it might have simply memorized the answer key. Held-out data is the only way to tell the two apart, and every metric in this course's evaluation section exists to make that distinction visible rather than assumed.
Where to go next depends on what you actually want. The Cheatsheet is the fastest route to "which algorithm for which problem" once you already know the vocabulary. Slides gives you the map before the detail. Field Notes is where the judgment calls live — what experienced teams get burned by that no textbook warns about. And the Quiz is the honest way to check whether any of this actually stuck, which, appropriately enough, is exactly what a held-out test set is for.
Where this skill leads
Relevant careers
See how this topic contributes to broader role-level skill maps.
Sources
- https://scikit-learn.org/stable/user_guide.html
Supports
- Algorithm implementations and API documentation
- Classification and regression metrics
- Cross-validation and model selection
- Feature preprocessing and engineering
- Regularization methods (L1, L2)
- Ensemble methods (random forest, gradient boosting)
- https://www.statlearning.com/
Supports
- Bias-variance tradeoff theory
- Linear and logistic regression foundations
- Decision trees and ensemble methods
- Regularization (lasso, ridge, elastic net)
- Cross-validation methodology
- Feature selection principles
- https://developers.google.com/machine-learning/crash-course
Supports
- Supervised learning workflow
- Training/test split rationale
- Overfitting causes and prevention
- Feature engineering practices
- Neural network introduction
- Data drift and model degradation
- https://ocw.mit.edu/courses/6-036-introduction-to-machine-learning-spring-2020/
Supports
- Mathematical foundations of ML algorithms
- Linear classifiers and margin-based methods
- Neural network architectures
- Reinforcement learning fundamentals
- https://www.khanacademy.org/math/statistics-probability
Supports
- Statistical foundations for ML evaluation
- Probability distributions underlying models
- Regression as a statistical method
- https://developers.google.com/machine-learning/guides/rules-of-ml
Supports
- Field Notes: first-model simplicity and data quality over algorithm choice
- Field Notes: feature representation scaling with training data volume
- Field Notes: proxy-metric optimization misaligning with the real outcome
- Field Notes: training-serving skew and stale-feature decay signals
- https://scikit-learn.org/stable/datasets/toy_dataset.html#breast-cancer-wisconsin-diagnostic-dataset
Supports
- Exercise dataset (569 samples, 30 features, malignant/benign labels)
- https://doi.org/10.1037/h0042519
Supports
- Timeline: Rosenblatt publishes the Perceptron (1958)
- https://doi.org/10.1109/TIT.1967.1053964
Supports
- Timeline: Cover and Hart formalize nearest-neighbor classification (1967)
- https://www.routledge.com/Classification-and-Regression-Trees/Breiman-Friedman-Stone-Olshen/p/book/9780412048418
Supports
- Timeline: Breiman, Friedman, Olshen, and Stone publish CART (1984)
- https://doi.org/10.1007/BF00116251
Supports
- Timeline: Quinlan publishes ID3 (1986)
- https://doi.org/10.1007/BF00994018
Supports
- Timeline: Cortes and Vapnik publish Support-Vector Networks (1995)
- https://doi.org/10.1006/jcss.1997.1504
Supports
- Timeline: Freund and Schapire publish AdaBoost (1997)
- https://doi.org/10.1023/A:1010933404324
Supports
- Timeline: Breiman publishes Random Forests (2001)
- https://jmlr.org/papers/v12/pedregosa11a.html
Supports
- Timeline: scikit-learn's reference paper is published (2011)
- https://arxiv.org/abs/1603.02754
Supports
- Timeline: Chen and Guestrin publish the XGBoost paper (2016)
