What is Machine Learning?
Theme
Palette
Download
Caption (tap to copy)
📖 Deep dive (full written explanation)
This cover anchors the 'why' post in the kind of problem that motivated ML in the first place: tasks where writing explicit rules is either impossible or hopeless. Recognizing a cat in a photo, catching fraud, choosing what to recommend next — nobody can sit down and enumerate the rules for these, yet they're solvable from examples.
The post's job is to answer the practical question: why does this approach deserve a central place in modern software? The answer is that ML owns a whole category of problems defined by complexity, fuzziness, and constant change, and that category turns out to be enormous and commercially central.
The first argument is the strongest: some rules simply cannot be written by hand. Consider recognizing a handwritten 7. Different people slant it, cross it, curve it, or add a serif. The space of valid sevens is vast and fuzzy, and any if-statement you write will miss countless legitimate variations while accepting some non-sevens.
Machine learning sidesteps the problem entirely. Instead of articulating what makes a 7, you show the system thousands of labeled examples and let it discover the pattern. This is precisely the regime where hand-coded logic collapses under its own complexity and learned models shine — perception, language, and any task humans do effortlessly but can't explain procedurally.
The second argument is adaptability. Many important problems aren't static — they drift. Spammers invent new tricks, fraudsters change tactics, customer preferences shift with seasons and trends. Hand-written rules capture a snapshot and then rot; keeping them current requires a human to constantly rewrite logic, which is slow and expensive.
An ML system handles drift structurally. Retrain it on recent data and it adapts to the new patterns automatically, no rule rewrite required. This is why domains defined by adversaries or changing tastes — spam filtering, fraud detection, recommendation — are dominated by learned models rather than fixed rulebooks. The ability to refresh from data is a feature rules can't match.
This decision tree gives a practical filter for when ML is actually the right tool, countering the reflex to throw ML at everything. The first question is whether you can state exact rules. If yes, just write the code — ML would only add cost and uncertainty. If you genuinely can't articulate the rules, the next question is whether you have many examples to learn from.
With plenty of examples and no clean rules, machine learning is the appropriate choice. Without examples, ML has nothing to learn from, so the right move is to collect data first or fall back on heuristics in the meantime. The tree encodes a mature engineering judgment: ML is a specific tool for a specific situation, not a default.
The third argument is scale. A human fraud analyst, however skilled, can review only a few thousand cases a day and will tire, drift, and apply criteria inconsistently. A trained model scores millions of transactions per second, around the clock, applying identical criteria to every one.
The point isn't merely that ML matches human judgment on hard pattern tasks — it's that it applies that judgment at a volume and consistency no team of people could approach. This combination of human-level pattern recognition with machine-level throughput is what makes ML transformative for operational decisions: the same quality of call, made automatically, billions of times.
This code slide makes the rules-versus-learned contrast tangible with spam filtering. The rule-based version checks for a hard-coded list of bad words; it's brittle, trivially defeated by spelling 'fr3e' or rephrasing, and blind to any trick its author didn't anticipate. The learned version is trained on labeled emails and infers what spam looks like from the data itself.
The lesson is generalization. The rule covers exactly the cases its author thought of and no more. The learned model captures broader statistical signals — word combinations, structure, sender patterns — and crucially can be retrained as spammers adapt. The slide compresses the whole 'why ML' argument into a single before-and-after you can picture.
This slide makes the abstraction personal by listing where ML already touches an ordinary day. Search ranking, photo tagging, voice assistants, navigation ETAs, card-fraud alerts, the social feed you scroll, the products you're shown — every one is driven by models learning from behavior rather than by hand-written rules.
The rhetorical move is to collapse the distance between 'machine learning' as a buzzword and the concrete software the reader uses constantly. ML is no longer a laboratory curiosity or a future promise; it is operating infrastructure, running silently underneath most of the applications people open every hour. Recognizing that breadth is itself a strong argument for understanding the technology rather than treating it as someone else's specialty.
This mind map drives home that ML is not futuristic — it's already the quiet infrastructure of daily life. Your phone uses it for face unlock and predictive text. Streaming services use it to rank recommendations and even pick thumbnails. Maps use it for ETA prediction and live rerouting. Banks use it for fraud alerts and credit scoring.
The branches are deliberately mundane because that's the point: ML stopped being a research curiosity and became embedded in the ordinary software you touch every hour. Seeing the breadth at a glance reframes the technology from 'something coming' to 'something already running underneath nearly everything', which is the strongest possible case for understanding it.
This slide deliberately argues against ML to keep the reader honest. If a rule is simple and stable, write the rule — ML adds data requirements, infrastructure, and unpredictable behavior in exchange for nothing. ML is also the wrong choice when you can't obtain data that represents where the system will run, when the law requires fully explainable decisions, or when errors are both rare and catastrophic.
The broader message is that maturity in ML includes knowing when not to use it. Reaching for a model reflexively, because it's fashionable, produces fragile systems that are harder to debug than the plain logic they replaced. The right posture is deliberate: choose ML when its specific strengths match the problem, and otherwise prefer the simpler tool.
This slide translates the technical case into business terms, which is often what actually drives adoption. ML converts data a company already collects into automated decisions — whom to approve for credit, what to recommend, which machine is about to fail. That yields a lower cost per decision, faster turnaround, and personalization delivered at a scale no manual process could sustain.
The closing observation is important and counterintuitive: the winners usually aren't the teams with the most sophisticated algorithm but the ones with the most useful, well-labeled data. Models are increasingly commoditized; proprietary, relevant data is the durable advantage. This reframes ML strategy away from model-chasing and toward data quality, which is where most real-world value is actually created.
These bullets gather the concrete situations where ML earns its keep: patterns too complex to hand-code, problems that drift over time, decisions needed at massive scale, personalization tailored per user, and prediction from messy real-world data. Each is a category, not a single application.
Reading them together clarifies the boundary of the technology. ML isn't a universal solvent; it's the right answer for problems with this particular signature — complex, changing, high-volume, individualized, and data-rich. When a problem matches several of these bullets, a learned model is very likely the strongest approach, which is a far more useful heuristic than 'use ML because everyone does'.
This closes the 'why' post and sets up the mechanics. Having established the classes of problems ML solves and when it's genuinely the right tool, the natural next question is how it actually pulls this off. The next post opens the engine: the training loop, loss functions, and gradient descent that turn a pile of examples into a working model.