Tests the three eras of AI, the nesting of AI, ML and deep learning, the roles around a project, when classical ML beats deep learning, and the first pandas procedures the rest of the book relies on.
Based on chapter 1. Every answer comes with an explanation and a link back to the section.
/Q1
Quiz
Question 1 of 23
The three eras and what limited each Level 1
Progress
The chapter says the Rules & Expert Systems era did not end for lack of compute or algorithms. What was the bottleneck that ended it?
/02
练习From the book
7 exercises
The chapter's own exercises are open questions. Try one, then compare with the model answer.
Exercise 1.1 [W]
Name the era (Rules & Expert Systems / Statistical ML / Deep Learning & Foundation Models) each of the following belongs to, and give one reason it belongs there: (a) Random Forests; (b) BERT; (c) MYCIN.
Show the model answer
(a) Random Forests: Statistical ML; an ensemble of decision trees learned from labelled examples, no hand-coded rules. (b) BERT: Deep Learning & Foundation Models; a pretrained transformer, part of the post-2012 scale-driven era. (c) MYCIN: Rules & Expert Systems; a hand-coded if-then medical diagnosis system from the 1970s, predating any learning from data.
Exercise 1.2 [W]
Explain in one or two sentences why "AI," "machine learning," and "deep learning" are not synonyms, using the nesting relationship from this chapter.
Show the model answer
They're nested subsets, not synonyms. Artificial Intelligence is the broadest term: any system exhibiting intelligent behaviour, including hand-coded rule systems. Machine Learning is the subset of AI that learns from data rather than being explicitly programmed. Deep Learning is the subset of ML that specifically uses neural networks. Every deep learning system is machine learning and AI. But not every AI system is machine learning (expert systems aren't), and not every ML system is deep learning (Random Forests aren't).
Exercise 1.3 [A]
Using Listing 1.6 as a starting point, add three milestones of your choosing from outside this chapter's list (they can be from any era). Then, using Procedure 1.2, determine how many of the resulting milestones fall after the year 2017.
Show the model answer
The answer depends on the three milestones chosen. The mechanical step: append the new rows, then run df_milestones[df_milestones['year'] > 2017] (Procedure 1.2) and count the resulting rows. Any milestone dated 2018 or later (BERT, GPT-3, ChatGPT, GPT-4, etc.) will count; anything from Era 1 or Era 2 will not.
Exercise 1.4 [A]
Reproduce Listing 1.7's logic to find the year reinforcement learning paper volume first exceeded classical ML paper volume. Report the ratio between them in 2024.
Show the model answer
Reinforcement learning first exceeds classical ML in 2019 (2,231 papers vs. 1,967). That's four years after deep learning crossed the same line, in 2015. RL's climb follows the deep reinforcement learning results of the mid-2010s: DeepMind's DQN playing Atari games (2013, published in Nature in 2015) and AlphaGo (2016). In 2024, reinforcement learning outnumbers classical ML by roughly 1.9x (5,533 vs. 2,850). That's a much smaller gap than deep learning's 4.8x over classical ML that year.
Exercise 1.5 [E]
A customer's data science team has 3,000 labelled examples of a tabular fraud-detection problem and is proposing to fine-tune a foundation model for it. Using this chapter's Trade-offs section, write the two or three sentences you'd say to them. Include what you'd suggest they try first.
Show the model answer
Something like: "With 3,000 labelled examples on a tabular problem, a foundation model is very unlikely to beat a well-tuned XGBoost or LightGBM model on accuracy. It will also cost more to run and be harder to explain to a regulator or auditor. I'd suggest starting with gradient-boosted trees as a baseline this week. If that doesn't hit the target, we can talk about where a foundation model might help. But it's not the first thing to reach for here." The point is to redirect from "AI" as a default answer. The answer should be a specific technique matched to data volume, data type, and interpretability needs.
Exercise 1.6 [E]
The chapter notes that pct_change() on a zero-to-nonzero transition produces an infinite percentage. Propose two different ways to handle this before ranking growth years with nlargest(). State a situation where each would be the wrong choice.
Show the model answer
Two options. (1) Explicitly filter or mask the first nonzero transition (or any inf/NaN value) before calling nlargest(), e.g. growth.replace([np.inf, -np.inf], np.nan).dropna(). This is the wrong choice if a genuine, very large but finite growth spike should be preserved: a blanket inf filter can be too aggressive if applied without checking what's being excluded. (2) Add a minimum-volume floor (e.g. only consider percentage growth once the series exceeds some absolute threshold, like 1k papers/year), so early near-zero noise never enters the ranking at all. This is the wrong choice if the point of the analysis is specifically to capture early inflection points before volume is large. That's exactly what this filter would discard.
Exercise 1.7 [R]
Read the Domingos essay cited above. Pick one "useful thing" from it that this chapter did not mention. Explain how it would have changed the way Listing 1.7's finding was interpreted if applied to it.
Show the model answer
Discussion only. No single answer. Domingos' essay makes the point (among others) that "more data beats a cleverer algorithm" up to a point, and that feature engineering matters more than the choice of learning algorithm for most practical problems. Applied to Listing 1.7's finding: the 2015 crossover and the roughly 5x gap by 2024 could be read as "deep learning is a better algorithm." Domingos' framing suggests a different reading. Deep learning unlocked the ability to use far more data, with far less hand-engineered feature work than classical ML. That's consistent with this chapter's account of GPU compute and large labelled datasets as the real enablers, not a sudden algorithmic insight in isolation.