CS 188 | Introduction to Artificial Intelligence

Spring 2021

Lectures: Mon/Wed/Fri 3:00–3:59 pm, Online

CS188 Robot Waving

Description

This course will introduce the basic ideas and techniques underlying the design of intelligent computer systems. A specific emphasis will be on the statistical and decision-theoretic modeling paradigm.

By the end of this course, you will have built autonomous agents that efficiently make decisions in fully informed, partially observable and adversarial settings. Your agents will draw inferences in uncertain environments and optimize actions for arbitrary reward structures. Your machine learning algorithms will classify handwritten digits and photographs. The techniques you learn in this course apply to a wide variety of artificial intelligence problems and will serve as the foundation for further study in any application area you choose to pursue.

See the syllabus for slides, deadlines, and the lecture schedule. Readings refer to fourth edition of AIMA unless otherwise specified.

Recordings

We make lecture and Q&A recordings available as links to Google Drive, which you can find posted together with other materials on the Syllabus page of this website shortly after the lecture. These links will work only if you are signed into your UC Berkeley Google account. The recordings are also available on Kaltura, which is a service that UC Berkeley partners with that facilitates the cloud recordings of Zoom meetings. All recordings on Kaltura have automatically-generated captions available by default alongside some other useful controls, such as playback speed adjustment.

To access the channel with recordings for this course, please go to this website and create an account if you don’t have one already: https://kaltura.berkeley.edu

Once you have the account, you should be able to access and subscribe to videos in the channel by following this link.


Syllabus

W Date Lecture Topic Readings Section Homework Project
0 W 1/20 Intro to AI [pdf] [pptx] [lecture] Ch. 1
N/A HW0 - Math, diagnostic
Electronic
due 1/25 10:59 pm
Project 0
due 1/22 11:59pm
F 1/22 Agents + Environments, part 1 [pdf] [pptx] [lecture] [q&a] Ch. 2
1 M 1/25 Agents + Environments, part 2 [pdf] [pptx] [lecture] Ch. 2
Section 1, solutions,
recording
Exam prep 1, solutions,
recording
HW1 - Uninformed search
Electronic
due 2/1 10:59 pm

Written HW1 - Probability, uninformed search, and heuristics
PDF
due 2/10 10:59 pm on gradescope.

Piazza post on WHW1 self-grading, due 2/22 10:59 pm. Gradescope link.
Project 1
due 2/5 11:59 pm
W 1/27 Uninformed Search [pdf] [pptx] [lecture] [supplementary lecture] [q&a] Ch. 3.1-4
F 1/29 Informed Search [pdf] [pptx] [lecture] [supplementary lecture] [q&a] Ch. 3.5-6
Note 1
2 M 2/1 Local Search [pdf] [pptx] [lecture] [supplementary lecture] [q&a] Ch. 4.1-2
Section 2, solutions,
recording
Exam prep 2, solutions,
recording
HW2 - Informed search and game trees
Electronic
due 2/8 10:59 pm
W 2/3 Games: minimax, alpha-beta [pdf] [pptx] [lecture] [q&a] Ch. 5.1-3
F 2/5 Games: MCTS, chance [pdf] [pptx] [lecture] [q&a] Ch. 5.4-5
Note 2
3 M 2/8 Propositional Logic [pdf] [pptx] [lecture] [q&a] Ch. 7.1-4
Section 3, solutions,
recording
Exam prep 3, solutions,
recording
HW3 - Propositional logic and local search
Electronic
due 2/16 10:59 pm
PDF

Written HW2 - Games and logic
PDF
due 2/24 10:59 pm on gradescope.
Project 2
due 2/19 11:59 pm
W 2/10 Logical Inference: theorem proving, model checking [pdf] [pptx] [lecture] [q&a] Ch. 7.5-6
F 2/12 Propositional Planning [pdf] [pptx] [lecture] [q&a] Ch. 7.7
4 M 2/15 Presidents' Day Section 4, solutions,
recording
Exam prep 4, solutions,
recording
HW4 - First order logic and probability
Electronic
due 2/22 10:59 pm
PDF
W 2/17 FOL: Syntax, Semantics, Inference [pdf] [pptx] [lecture] [q&a] Ch. 8.1-2, skim 9.1-4
Note 3
F 2/19 Probability, Independence, Naive Bayes [pdf] [pptx] [lecture] [q&a] Ch. 12.1-6
5 M 2/22 Bayes nets: syntax, semantics, examples [pdf] [pptx] [lecture] [q&a] Ch. 13.1-2 Section 5, solutions,
recording
Exam prep 5, solutions,
recording
HW5 - Probability and Bayes Nets
Electronic
due 3/1 10:59 pm
PDF
W 2/24 Bayes nets: exact inference [pdf] [pptx] [lecture] [q&a] Ch. 13.3
F 2/26 Bayes nets: stochastic inference (rejection, importance) [pdf] [pptx] [lecture] [q&a] Ch. 13.4
6 M 3/1 Bayes nets: stochastic inference (Gibbs) [pdf] [pptx] [lecture] [q&a] Ch. 13.4 Section 6
Exam prep 6
W 3/3 Temporal models, filtering, Viterbi [pdf] [pptx] [lecture] [q&a] Ch. 14.1-2
F 3/5 HMMs [pdf] [pptx] [lecture] [q&a] Ch. 14.3
7 M 3/8 DBNs, particle filtering [pdf] [pptx] [lecture] [q&a] Ch. 14.5 Section 7
Exam prep 7
W 3/10 Midterm  
F 3/12 Rationality, utility theory [pdf] [pptx] [lecture] [q&a] Ch. 16.1-3
8 M 3/15 Decision nets, VPI, unknown preferences [pdf] [pptx] [lecture] [q&a] Ch. 16.5-7
Section 8
Exam prep 8
W 3/17 MDPs: V/Q/pi [pdf] [pptx] [lecture] [q&a] Ch. 17.1
F 3/19 MDPs: Value/Policy Iter [pdf] [pptx] [lecture] [q&a] Ch. 17.2
9 M 3/22 Spring Break
W 3/24 Spring Break
F 3/26 Spring Break  
10 M 3/29 MDPs: Bandits [pdf] [pptx] [lecture] [q&a] Ch. 17.3 Section 9
Exam prep 9
W 3/31 ML: Decision Trees [pdf] [pptx] [lecture] [q&a] Ch. 19.1-3
F 4/2 ML: Linear Regression, Logistic Regression [pdf] [pptx] [lecture] [q&a] Ch. 19.6
11 M 4/5 ML: Ensembles [pdf] [pptx] [lecture] [q&a] Ch. 19.8 Section 10
Exam prep 10
W 4/7 ML: Statistical Learning, Naive Bayes [pdf] [pptx] [lecture] [q&a] Ch. 20.1-2
F 4/9 ML: Neural Net structures [pdf] [pptx] [lecture] [q&a] Ch. 21.1-3
12 M 4/12 ML: Learning in Neural Nets [pdf] [pptx] [lecture] [q&a] Ch. 21.3-5 Section 11
Exam prep 11
W 4/14 RL: Temporal Difference [pdf] [pptx] [lecture] [q&a] Ch. 22.1-2
F 4/16 RL: Q Learning [pdf] [pptx] [lecture] [q&a] Ch. 22.3
13 M 4/19 RL: Function Approx [pdf] [pptx] [lecture] [q&a] Ch. 22.4 Section 12
Exam prep 12
W 4/21 RL: Policy search, applications [pdf] [pptx] [lecture] [q&a] Ch. 22.5, 22.7
F 4/23 Fairness and ethics in AI [pdf] [pptx] [lecture] [q&a] Ch. 27.3
14 M 4/26 Advanced topics I [pdf] [pptx] [lecture] [q&a]  
W 4/28 Advanced topics II [pdf] [pptx] [lecture] [q&a]  
F 4/30 Future + wrapup [pdf] [pptx] [lecture] [q&a]  
15 M 5/3 RRR  
W 5/5 RRR
F 5/7 RRR  
16 M 5/10    
W 5/12 Final
F 5/14