Module 9 ended with the case 9 prototype documented, presented and scored against its self-assessment rubric; that closed the practical part of the course. This final module adds no new theory or code: it gives you the means to keep learning on your own with good judgement. We start with the most durable source of all, books and articles. In a field that changes every six months, good books are what goes out of date least (the fundamentals of modules 3, 4, 5 and 6 have been the same for decades) and the original papers are the way to understand where every idea you have used came from, from the perceptron of 05-01 to the transformer of 05-05 or the model card of 08-01. This lesson first explains how to read technical material (reading an ML book like a novel gets you nowhere), then presents the reference works grouped by block, with their level, the module of the course they extend and who they are for, and ends with a list of key papers, a method for reading a paper and a three-stage reading plan. To bring it down to earth, what Marta and Diego at NovaMarket would read first.
A word of caution, as a matter of rigour: we cite only real, well-established works, with their authors; we include neither deep links nor prices because they go stale. Several are free online by their authors' decision at the time of writing; that may change, so always check the author's or publisher's website.
Contents
- How to read technical material: active reading, reproduced code and a reading notebook
- General AI references
- Practical machine learning
- Deep learning
- Probability, statistics and reasoning
- Logic, expert systems and Prolog
- Ethics and society
- Projects, systems and MLOps
- Key papers and how to read a paper
- A three-stage reading plan and how it lands at NovaMarket
- Common Mistakes and Tips
- Exercises
- Conclusion
- How to read technical material: active reading, reproduced code and a reading notebook
You do not read a technical book; you work through it. Three habits make the difference between "I've read it" and "I can use it":
- Active reading. Before each chapter, write in one line what you expect to learn; when you finish, write in three lines what you have learned without looking at the book. If you cannot, you have not understood it. Ask questions in the margin ("why L2 regularisation here and not L1?") and look for the answer before moving on.
- Reproduce the code. Type the examples in (do not copy and paste), run them, break them on purpose (change a hyperparameter, drop a column, insert a null value) and watch what happens. Then apply them to your data: throughout the course you always had
orders_nm.csvorreviews_nm.py; keep using them as a test bench for everything you read. - A reading notebook. One file per book (Markdown in your
novamarket_ai/notes/repository folder is fine) with: the main idea of each chapter, a key formula or code fragment, a connection with something you already know ("this is the cross-validation from 04-05, but nested") and an open doubt. Rereading your notes is ten times faster than rereading the book.
Two more pieces of advice: do not read reference works from cover to cover (Russell & Norvig runs to over a thousand pages; you consult it by chapter), and alternate a "dense" book with a "light" one so you do not give up. As an optional aid, this small Python log lets you track what you have read and its connections with the course:
import json
from datetime import date
NOTEBOOK = "notes/reading_notebook.json"
def note(book, chapter, idea, course_module, doubt=""):
"""Add an entry to the reading notebook (a simple JSON file, versionable in Git)."""
try:
with open(NOTEBOOK, encoding="utf-8") as f:
entries = json.load(f)
except FileNotFoundError:
entries = []
entries.append({"date": str(date.today()), "book": book, "chapter": chapter,
"idea": idea, "course_module": course_module, "doubt": doubt})
with open(NOTEBOOK, "w", encoding="utf-8") as f:
json.dump(entries, f, ensure_ascii=False, indent=2)
note("Géron", "ch. 4", "Batch vs stochastic gradient descent: the latter escapes local minima",
"05-03", "how do I choose the learning rate without blind trial and error?")Each entry stores the date, book, chapter, idea, the course module it extends and a doubt; the JSON is readable, versionable and easy to turn into a pandas table whenever you want to review what you have covered.
- General AI references
These are the books that cover the complete map this course drew (agents, search, logic, probability, learning). You do not read them whole; you consult them.
| Work | Level | Extends | Who it is for / how to use it |
|---|---|---|---|
| Russell & Norvig, Artificial Intelligence: A Modern Approach (AIMA) | Intermediate-advanced | The whole course; especially 02, 03, 06 | The academic reference for the "acting rationally" definition (01-02) and the PEAS framework (02-01). Use it as a dictionary: when something about search, minimax, logic or Bayesian networks feels thin, go to the corresponding chapter. It has pseudocode for every algorithm in module 3. |
| Poole & Mackworth, Artificial Intelligence: Foundations of Computational Agents | Intermediate | 02, 03, 06 | An alternative to AIMA, free online on the authors' website (check availability), with companion Python code (AIPython). Very good for the agent-based approach and for reasoning under uncertainty. |
If you have to pick just one and you are starting out, Poole & Mackworth for accessibility and for the code; AIMA when you want the definitive reference.
- Practical machine learning
These extend module 4 (and parts of 5 and 9): data preparation, algorithms, evaluation, overfitting, and the step up to real projects.
| Work | Level | Extends | Who it is for / how to use it |
|---|---|---|---|
| Aurélien Géron, Hands-On Machine Learning with Scikit-Learn, Keras and TensorFlow | Introductory-intermediate | All of 04, 05, 09-02 | The most recommended practical book for the profile of this course. Part one: scikit-learn in the same spirit as 04-03 to 04-06 (pipelines, validation, tuning); part two: networks with Keras. Every chapter has a notebook to reproduce. Start here if you want to go deeper into what you did with the returns predictor. |
| Andriy Burkov, The Hundred-Page Machine Learning Book | Introductory | 04, 05 (overview) | A concise, correct summary of all of ML; you can read it in a week. Ideal for consolidating the map before a big book, or for revising before an interview. The author distributes it on a "read first, pay later" basis; check the conditions. |
| Müller & Guido, Introduction to Machine Learning with Python | Introductory | 04, 07-03 | Written by a core scikit-learn developer; it explains the library the way it was designed. Very useful for understanding the fit/transform/predict design and the evaluation tools from 04-05. |
| James, Witten, Hastie, Tibshirani (and Taylor in the Python edition), An Introduction to Statistical Learning (ISL) | Intermediate | 04-04, 04-05, 04-06 | The bridge between ML and statistics: regression, classification, resampling, regularisation, trees and boosting with just the right amount of mathematical intuition. There is an edition with labs in R and another in Python; both free on the authors' website (check availability). For anyone who wants to understand why what scikit-learn does works. |
Suggested order for a junior: Burkov (map) → Géron (practice) → ISL (statistical foundation); Müller & Guido as the library reference.
- Deep learning
These extend module 5 and 09-03: from the neuron to CNNs, RNNs and transformers.
| Work | Level | Extends | Who it is for / how to use it |
|---|---|---|---|
| François Chollet, Deep Learning with Python | Introductory-intermediate | 05-01 to 05-05, 09-03 | By the creator of Keras. Explains clearly what a tensor is, how a network learns and how to build CNNs, RNNs and transformers with Keras. The best recommendation for starting deep learning seriously; its chapters on "what deep learning is and is not" are excellent for judgement. |
| Simon J. D. Prince, Understanding Deep Learning | Intermediate | All of 05 | Modern, with very carefully drawn figures and exercise notebooks; free online on the author's website (check availability). Covers transformers, diffusion models and ethics. Ideal as a second book, after Chollet, when you want the mathematics at a calmer pace. |
| Goodfellow, Bengio, Courville, Deep Learning | Advanced | 05-02, 05-03 | The classic academic reference, free online (check availability). Its first part (linear algebra, probability, optimisation) is a valuable mathematical refresher; the rest is dense and somewhat pre-transformer. For consultation, not cover-to-cover reading. |
- Probability, statistics and reasoning
These extend 06-03 (Bayes and Bayesian networks) and the probabilistic foundation of all ML.
| Work | Level | Extends | Who it is for / how to use it |
|---|---|---|---|
| Christopher Bishop, Pattern Recognition and Machine Learning (PRML) | Advanced | 04, 05, 06-03 | Treats ML as probabilistic inference: every model has its distribution. Requires mathematical fluency; save it for when ISL feels thin. The graphical-models chapters extend 06-03 directly. |
| Koller & Friedman, Probabilistic Graphical Models | Advanced (reference) | 06-03 | The treatise on Bayesian and Markov networks: representation, inference and learning. Not for reading straight through; consult it when you need to go beyond the enumeration of 06-03 (approximate inference, structure learning). |
| Judea Pearl & Dana Mackenzie, The Book of Why | Popular science | 06-03, 02-04, 08-02 | Explains without formulas the difference between correlation and causation, and why it matters (remember the COMPAS bias or the recruitment case in 08-02). A pleasant read that changes how you look at any predictive model. |
- Logic, expert systems and Prolog
These extend module 6 (06-01, 06-02, 06-04) and the rules engine of case 8.
| Work | Level | Extends | Who it is for / how to use it |
|---|---|---|---|
| Giarratano & Riley, Expert Systems: Principles and Programming | Intermediate | 06-02, 06-04 | The classic expert-systems text: knowledge representation, forward and backward chaining, uncertainty, and programming with CLIPS. Useful for anyone who is going to build serious rules engines (beyond our engine from 06-04). |
| Ivan Bratko, Prolog Programming for Artificial Intelligence | Intermediate | 06-01, 07-01, 03-02 | Teaches Prolog through AI problems: search, planning, expert systems, language processing. Perfect for anyone left wanting more after the Prolog of 07-01. |
- Ethics and society
These extend 02-04 (ethics and the AI Act), 08-02 (bias cases) and 08-03 (regulation).
| Work | Level | Extends | Who it is for / how to use it |
|---|---|---|---|
| Cathy O'Neil, Weapons of Math Destruction | Popular science | 02-04, 08-02 | Real cases of opaque models that harm people (credit, employment, justice). Required reading before deploying any model that affects customers, such as NovaMarket's returns predictor. |
| Kate Crawford, Atlas of AI | Popular science | 02-03, 02-04, 08-03 | Looks at AI as a material system: data, human labelling labour, energy, power. Broadens the perspective beyond the code. |
| Melanie Mitchell, Artificial Intelligence: A Guide for Thinking Humans | Popular science | 01, 02-02, 08-03 | Explains honestly what today's AI does and does not do and why AGI is far away. The best antidote to hype for someone in Diego's position. |
- Projects, systems and MLOps
These extend 08-01 (method, model card, drift), 07-04 (environments) and what in 10-04 we will call the MLOps path.
| Work | Level | Extends | Who it is for / how to use it |
|---|---|---|---|
| Chip Huyen, Designing Machine Learning Systems | Intermediate | 08-01, 07-04, 09-04 | How to take a model to production: data, features, deployment, monitoring, drift, team. It is the natural continuation of the batch deployment of the returns predictor and the drift check of 09-04. |
| Andrew Ng, Machine Learning Yearning | Introductory | 08-01, 04-05, 04-06 | Short, free (it was distributed on the DeepLearning.AI website; check availability), focused on project decisions: how to split the data, which metric to choose, error analysis, when to collect more data. Each chapter fits in two pages; very practical. |
- Key papers and how to read a paper
The original papers are the primary source of everything you have seen. You do not need to read them all, or in full, but knowing ten of them places you in the history of the field (01-01) and teaches you to read the ones still to come.
How to read a technical paper
A scientific paper has a fixed structure: abstract, introduction (problem and contribution), related work, method, experiments, conclusions and references. Read it in three passes:
- Pass 1 (10 min): abstract, figures and tables, conclusion. Decide whether it is worth continuing. Note in one sentence what it claims.
- Pass 2 (30-60 min): introduction and experiments at a calm pace; skip the proofs. Check what they compare against (is the baseline fair, as we demanded in 09-04?) and on which data.
- Pass 3 (only if you are going to use it): the full method, and try to reproduce a part of it, even at small scale.
Where to find them: arXiv (arxiv.org) publishes open preprints of almost everything current in AI; Papers with Code (paperswithcode.com) links each paper to implementations and results tables; Google Scholar is useful for following citations. The older papers (Turing, Rosenblatt) are usually accessible in university repositories.
Ten papers (and one more) that explain the course
| Paper | Year | What it contributes | Extends |
|---|---|---|---|
| Turing, "Computing Machinery and Intelligence" | 1950 | The imitation game and the objections to machine intelligence; readable without mathematics | 01-01 |
| McCulloch & Pitts, "A Logical Calculus of the Ideas Immanent in Nervous Activity" | 1943 | The neuron as a logical unit: the origin of networks | 05-01 |
| Rosenblatt, "The Perceptron" | 1958 | The first model that learns its own weights | 05-01 |
| Rumelhart, Hinton & Williams, "Learning Representations by Back-Propagating Errors" | 1986 | Backpropagation just as you programmed it in 05-03 | 05-03 |
| LeCun et al., "Gradient-Based Learning Applied to Document Recognition" (LeNet) | 1998 | CNNs for handwritten digits; the model from 09-03 descends from here | 05-04 |
| Krizhevsky, Sutskever & Hinton, "ImageNet Classification with Deep CNNs" (AlexNet) | 2012 | The start of the deep learning era (01-01) | 05-04 |
| Mikolov et al., "Efficient Estimation of Word Representations in Vector Space" (word2vec) | 2013 | Word embeddings; what you used in case 4 | 05-04, 05-05 |
| Silver et al., "Mastering the Game of Go with Deep Neural Networks and Tree Search" (AlphaGo) | 2016 | Tree search + networks + reinforcement learning | 03-03, 08-02 |
| Vaswani et al., "Attention Is All You Need" | 2017 | The transformer | 05-05 |
| Devlin et al., "BERT: Pre-training of Deep Bidirectional Transformers" | 2018 | Pre-training and fine-tuning in NLP | 05-05 |
| Brown et al., "Language Models are Few-Shot Learners" (GPT-3) | 2020 | Scale and in-context learning: the basis of the LLMs in case 7 | 05-05 |
| Mitchell et al., "Model Cards for Model Reporting" | 2019 | The template for the model card of 08-01 and 09-04 | 08-01, 02-04 |
Suggested reading order: Turing (historical and accessible), Model Cards (short and directly useful), Vaswani (the most cited today; read it with 05-05 alongside), and then the rest according to your path.
- A three-stage reading plan and how it lands at NovaMarket
| Stage | Indicative duration | What to read | How to work through it |
|---|---|---|---|
| 1. Consolidate | 1-2 months | Burkov (whole); Ng, ML Yearning (whole); Turing 1950 and Model Cards | Reading notebook per chapter; redo an exercise from 09-02 applying one idea from each book |
| 2. Deepen | 3-4 months | Géron (parts I and II) or Chollet, depending on whether you prefer classical ML or networks; Mitchell, A Guide for Thinking Humans as light reading; Vaswani 2017 with 05-05 | Reproduce the notebooks and apply them to orders_nm.csv/the reviews; write a two-page summary per book |
| 3. Specialise | Ongoing | According to your path (10-04): ISL or PRML; Prince or Goodfellow; Koller & Friedman or Bratko; Huyen; O'Neil and Crawford | One book every two or three months; one paper a month with the three passes; share your notes (10-03) |
Marta (head of data, with the returns predictor in production and the RAG assistant still to build) would first read ML Yearning (project decisions in two weeks), then Huyen for monitoring the predictor and, in parallel, Géron so that her team shares a vocabulary; Vaswani and BERT when the assistant gets under way. Diego (operations, non-technical) would start with Mitchell (what AI can and cannot do), continue with O'Neil (the risks of the predictor he uses every day) and read the abstract and figures of the Model Cards paper to understand the document Marta hands him with every model.
Common Mistakes and Tips
- Buying (or downloading) five books and finishing none. Pick one per stage; the rest go on the waiting list.
- Reading without a keyboard. If the book comes with code and you do not run it, you retain a fraction. Save passive reading for the popular-science titles.
- Starting with Goodfellow or Bishop. They are advanced references; starting there is discouraging. Order matters: Burkov/Géron/Chollet first.
- Confusing free with permanent. What is open today may stop being so; keep your notes, do not depend on the PDF.
- Reading papers as if they were revealed truth. A paper is a claim with evidence; check the baseline, the data and whether anyone has reproduced it (Papers with Code helps).
- Tip: follow a "one dense book + one light book" rule and "one paper a month"; always note the connection with a module of the course; that is what turns reading into knowledge.
Exercises
- Choose and justify. Pick one book from the tables for your current situation (level, time available, goal) and write a paragraph justifying the choice on three criteria: which module of the course it extends, why that level, and what you will do with it (code to reproduce, data to apply it to).
- Personal reading plan. Adapt the three-stage table to three real months of your calendar: set weeks, chapters and one deliverable per stage (for example, a reproduced notebook, a summary or an entry in the JSON notebook from section 1).
- First pass of a paper. Choose one from the papers table (recommended: Model Cards or Vaswani 2017) and do pass 1: write in five lines what problem it solves, what the contribution is, what the main figure or table shows and how it connects with the course.
Solutions
- Example: "I choose Géron because it extends the whole of module 4 and part of 5, which is what I will use most as a junior; its introductory-intermediate level matches what I already know of scikit-learn; I will reproduce the notebooks of the classification and model-tuning chapters and apply them to NovaMarket's returns predictor to try to beat the AUC of 0.844 with a better-documented pipeline."
- Example: Weeks 1-3: all of Burkov, one notebook entry per chapter. Weeks 4-6: ML Yearning, deliverable: a one-page document with the data split and metric of case 4 revised. Weeks 7-12: Géron chs. 2-4 and 6-7 with reproduced notebooks; deliverable: my own notebook with nested validation on
orders_nm.csv. - Example (Model Cards, 2019): Problem: models are published without explaining what they are for or how they fail. Contribution: a standard template (model details, intended use, factors, metrics, evaluation data, ethical considerations). Main figure: examples of model cards with metrics broken down by subgroup. Connection: it is the template we followed in 08-01 and 09-04; the breakdown by subgroup is what was missing from the returns predictor's model card.
Conclusion
You have learned to read technical material actively (expect, reproduce, note), you have a map of books by block with their level and the module they extend (general references with AIMA and Poole & Mackworth; practical ML with Burkov, Géron, Müller & Guido and ISL; deep learning with Chollet, Prince and Goodfellow; probability with Bishop, Koller & Friedman and Pearl; expert systems with Giarratano & Riley and Bratko; ethics with O'Neil, Crawford and Mitchell; projects with Huyen and Ng), a list of twelve papers that explain where every idea in the course comes from and a three-pass method for reading any paper, plus a three-stage plan and the first readings of Marta and Diego. Books give depth and permanence; but learning from books alone is slow when what you need is guided practice and correction. In the next lesson (10-02) we will see how to choose online courses and tutorials, which are the reference ones for each module of the course, and how to put together a three-month plan that combines video, official documentation and deliberate practice.
Fundamentals of Artificial Intelligence (AI)
Module 1: Introduction to Artificial Intelligence
Module 2: Basic Principles of AI
- Fundamental Concepts: Agents, Environments and Rationality
- Types of Artificial Intelligence
- Data as the Raw Material of AI
- Ethics and Considerations in AI
Module 3: Algorithms in AI
- Introduction to Algorithms
- Search Algorithms
- Adversarial Search: Games and Minimax
- Optimization Algorithms
Module 4: Machine Learning
- Basic Concepts of Machine Learning
- Types of Machine Learning
- Data Preparation and Feature Engineering
- Machine Learning Algorithms
- Model Evaluation and Validation
- Overfitting, Regularization and Hyperparameter Tuning
Module 5: Neural Networks and Deep Learning
- Introduction to Neural Networks
- Neural Network Architecture
- How a Network Learns: Gradient Descent and Backpropagation
- Deep Learning and Its Applications
- Transformers, Large Language Models and Generative AI
Module 6: Logic and Expert Systems
- Logic in AI
- Expert Systems
- Reasoning under Uncertainty: Probability and Bayesian Networks
- Applications of Expert Systems
Module 7: Tools and Programming Languages in AI
- Programming Languages for AI
- Scientific Python: NumPy, pandas and Matplotlib
- Popular Tools and Libraries
- Development Environments
Module 8: Projects and Case Studies
Module 9: Exercises and Practice
- Algorithm Exercises
- Machine Learning Practice
- Neural Network Projects
- Capstone Project: from Idea to Prototype
