Unless explicitly called out on the schedule page, these readings are optional. But they may help you understand some of the concepts or dig into them in more detail. Additional pointers for specific topics are in the lecture notes.
To access some of the the electronic readings (i.e. without paying money), get onto UIUC's network (directly or via the VPN). With the VPN, you may need to select "tunnel all" rather than "split tunnel." (External folks looking at this page: your university may also have a suitable site license.)
Useful textbooks covering part or all of our material:
| Topic | Online textbooks | Other online sources | Russell and Norvig 4th edition |
|---|---|---|---|
| Intro | Ch 1, Ch 2 | ||
| Probability and Naive Bayes | Forsyth PS | Ch 12 | |
| Search | 3.1-3.6 | ||
| Robot Motion | 26.1-26.6 | ||
| Bayes Nets | Charniak Bayes Nets | Ch 13 | |
| Natural Language | Jurafsky and Martin (many sections) | Ch 23 | |
| Hidden Markov Model |
Jurafsky and Martin, Chapter 17
Forsyth PS, chapter 14 |
14.1-14.3 | |
| Computer Vision | Ch 25 | ||
| Classification |
Forsyth AML, 1.2 and 2.2
Forsyth PS, ch 11 |
19.1-19.4 | |
| Linear Classifiers | Jurafsky and Martin ch 5 | 19.6 | |
| Neural Nets | Jurafsky and Martin
ch 7,
ch 9,
Forsyth AML, chapter 16 Goldberg ch. 4-5, 13-15 | Karpathy notes | Ch. 21 |
| Vector semantics | Jurafsky and Martin ch 6 | Ch 24 | |
| Reinforcement Learning | 17.1-17.2 | ||
| Game Search | 5.1-5.6 | ||
| Constraint Satisfaction | Ch 6, 4.1 | ||
| Classical Planning | Poole and Mackworth ch 6 | 11.1-11.3 |