Fundamentals · Read 7 min

What machine learning is for people who do not code

The machine is not thinking. It is tuning thousands of knobs until it gets things right. I will show you how, with an example you can follow in your head.

Think about how you learned to estimate the price of a house without ever noticing. Nobody handed you a formula. You saw a few: this big one with a garden cost more, that small one far out cost less. After looking at enough of them, if someone shows you a new house, you blurt out a rough number. You did not reason it out with rules; you tuned it through examples. That, almost to the letter, is what a machine does when it "learns".

The term machine learning sounds like science fiction, but the underlying idea is humble and stubborn: instead of writing out the rules for the computer one by one, you give it examples and let it discover on its own what pattern connects them. You do not program the answer. You program the way to learn it.

01 · the switchWhat machine learning is: teaching with examples, not rules

To understand what machine learning is, it helps to first see how software used to work. For decades, programming meant writing explicit rules: if the email contains the word "prize" and comes from a stranger, then flag it as spam. The programmer thought through every case and typed it out. It worked, until the world served up a case nobody had foreseen.

Machine learning turns the problem around. Instead of telling the machine what spam is, you show it ten thousand emails already sorted by humans ("this is spam, this is not") and let it find on its own what the bad pile has in common. Nobody wrote the rule. The rule emerged from the examples.

You do not teach it the answer. You teach it to find the answer from examples.

This is the distinction Arthur Samuel intuited back in 1959, when he defined the field as the study that gives computers "the ability to learn without being explicitly programmed for it" [1]. His program played checkers and got better game after game, not because someone kept adding rules, but because it adjusted its own judgment based on which moves ended up winning.

Figure 1 · two ways to solve the same problem
Classic programming Rules + Data Answers Machine learning Data + Answers Rules The order flips: instead of writing the rules, the machine deduces them from the examples that already have a known answer.
Ordinary programming takes your rules and produces answers. Machine learning takes known answers and produces the rules by itself. It is the same problem seen in reverse.

02 · the knobsHow it learns: tuning thousands of knobs until it gets it right

Here comes the part almost nobody explains well, and it is the easiest to picture. Inside the model there are a great many numbers you can move, like the knobs on a giant sound console. Each knob decides how much a detail weighs: how much the size of the house matters, how much the neighborhood, how much its age. At the start they all sit in random positions, set by chance. In that state, the model knows nothing.

Then the cycle begins. You feed it an example whose answer you do know. The model makes its prediction with the knobs wherever they happen to be, and it almost always misses. You measure how much it missed: that distance between what it said and what was correct is called the error. And here is the trick: the error tells you which direction to move each knob so it misses a little less next time.

You nudge each knob a little in that direction. You feed it another example. It misses a little less. And another, and another, thousands upon thousands of times. Each pass corrects the error by a hair. Added together, those tiny corrections carry the knobs from an initial mess to a combination that hits surprisingly well. That process of going round and round tuning is called training, and each knob a parameter.

Why it needs so very many examples

With two or three houses, the model memorizes those three and that is it: it has learned nothing useful. Only when it sees many varied examples do the knobs settle onto what repeats (big costs more, far costs less) and discard what was mere coincidence. Learning, for a machine, is separating the pattern from the noise. And that demands volume.

03 · the testWhen it truly learned (and when it only memorized)

There is a trap worth knowing about, because it explains why these systems sometimes fail badly. A model can tune its knobs so tightly to the examples you showed it that it ends up memorizing them instead of understanding the pattern. It does wonderfully with what it has already seen and collapses on any new case. It is like the student who memorizes last year's exam answers and goes blank when the questions change. This is called overfitting.

Learning is not getting the familiar right. It is getting right what it never saw.

That is why the people who build these models always keep part of the examples secret, unused during training. When the model finishes tuning its knobs, they confront it with that pile it never saw. If it gets those right, it truly learned. If it only gets right what it already knew, it memorized. That difference is everything.

Figure 2 · truly learning vs. memorizing
error training → starts to memorize known examples new examples
The error on the known examples keeps dropping. But if the model overtunes, the error on the new examples starts rising again: a sign that it stopped learning the pattern and began memorizing. An illustrative curve of the overfitting phenomenon.

With these three ideas you already have the full skeleton, without a single line of code: it learns from examples instead of rules, it learns by tuning a great many knobs to lower the error, and it is checked against new cases so we do not confuse learning with memorizing. Everything else (neural networks, deep learning, the models that today write and draw) are bigger, more elaborate versions of this same heartbeat.

Next time you read that a system "learned" to recognize faces or to translate languages, you know what lies underneath. There was no awakening, no spark of consciousness. There were thousands of examples, a pile of knobs, and a great many passes correcting the error until it hit the mark. Humble and stubborn, as we said at the start. And surprisingly powerful.

Sources

  1. Samuel, A. L. (1959). Some Studies in Machine Learning Using the Game of Checkers. IBM Journal of Research and Development, 3(3), pp. 210-229. DOI: 10.1147/rd.33.0210.
  2. Mitchell, T. M. (1997). Machine Learning. McGraw-Hill. (Defines learning as improving at a task T, measured by P, with experience E.)
  3. Goodfellow, I., Bengio, Y. & Courville, A. (2016). Deep Learning, ch. 5: Machine Learning Basics. MIT Press. deeplearningbook.org.

Learn more about AI

See all Learn AI