The materials on this course website are archival materials from the Fall 2013 CS188 on-campus offering at UC Berkeley. These materials are made available for anyone for self-study, but this is not a MOOC (Massively Open Online Course) and there will be no active support from the teaching staff for these materials. We do hope in the future to offer this course again as a MOOC.
Times and Locations
- Lecture: Tuesdays and Thursdays 12:30-2pm in 245 Li Ka Shing
- Sections: Beginning the week of 9/2
- 101: Th 3-4pm, 71 Evans (Sergey / Evan)
- 102: Th 4-5pm, 6 Evans (Sergey / Evan)
- 103: Th 5-6pm, 4 Evans (Sergey / Evan)
- 104: F 9-10am, 71 Evans (Michael / James)
- 105: F 10-11am, 71 Evans (Michael / James)
- 106: F 11-12pm, 6 Evans (Michael / James)
- 107: F 12-1pm, 4 Evans (John / Alvin)
- 108: F 1-2pm, 5 Evans (John / Alvin)
- 109: F 2-3pm, 85 Evans (Teodor / Ning)
- 110: F 3-4pm, 85 Evans (Teodor / Ning)
CommunicationThere will be several routes of communication for this course:
- Announcements will be posted to this website.
The main mode of electronic communication between students and staff, as well as amongst students, will be through Piazza. It is intended for general questions about the course, clarifications about assignments, student questions to each other, discussions about material, and so on. We strongly encourage students to participate in discussion, ask, and answer questions through this site. The course staff will monitor discussions closely.
If you need to contact the course staff privately, you should email cs188-staff AT lists.berkeley.edu. You may of course contact the professor or GSIs directly, but the staff list will produce the fastest response.
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.
CS 61A or 61B: Prior computer programming experience is expected (see below); most students will have taken both these courses.
CS 70 or Math 55: Facility with basic concepts of propositional logic and probability are expected (see below); CS 70 is the better choice for this course.
This course has substantial elements of both programming and mathematics, because these elements are central to modern AI. You should be prepared to review basic probability on your own if it is not fresh in your head. You should also be very comfortable programming on the level of CS 61B even though it is not strictly required.
CS61A AND CS61B AND CS70 is the recommended background.
Course programming assignments will be in Python. We do not assume that students have previous experience with the language, but we do expect you to learn the basics very rapidly. Project 0 is designed to teach you the basics of Python, but if you want to get a head start here is a good tutorial: ACM Python Tutorial
This class includes five programming projects and regular electronic assignments.
Collaboration: Project 0 is to be completed alone. Projects 1 through 5 can be completed alone or in teams of two. When completing in a team of two it is important that both team members submit their team's project files into edX to ensure a grade is registered for both team members. Homework is to be submitted individually but may be discussed in groups.
Project grading: Projects will by default be graded automatically for correctness, though we will review projects individually as necessary to ensure that they receive the credit they deserve.
Slip days: Programming projects must be turned in electronically by 5:00pm on the listed due date. You will have 5 slip days for these projects, up to two of which can be used for each project. Note that slip days are counted at the granularity of days, rounded up to the nearest day. The other homework assignments do not have late days!
Ethics: Submissions should acknowledge all collaborators and sources consulted. All code and written responses should be original. We trust you all to submit your own work, but to protect the integrity of the course from anyone who doesn’t want to play by the rules, we will actively be checking for code plagiarism (both from current classmates and previous semesters). I’m not lenient about cheating; I sympathize with Kris Pister’s policy.
GradingOverall grades will be determined from:
- Programming Assignments (30%)
- Electronic Assignments (10%)
- Midterm exam 1 (10%)
- Midterm Exam 2 (15%)
- Final Exam (35%)
|A||[90 – 100]%|
|A-||[85 – 90)%|
|B+||[80 – 85)%|
|B||[75 – 80)%|
|B-||[70 – 75)%|
|C+||[65 – 70)%|
|C||[60 – 65)%|
|C-||[55 – 60)%|
|D+||[50 – 55)%|
|D||[45 – 50)%|
|D-||[40 – 45)%|
|F||[0 – 40)%|
These cutoffs represent grade minimums. We may adjust grades upward based on class participation, extra credit, etc. The grade of A+ will be awarded at the professor’s discretion based on exceptional performance.
Regrade Policy: If you believe an error has been made in the grading of one of your exams or assignments, you may resubmit it for a regrade. For any regrade requests, send an email to the staff list with a detailed explanation of which problems you think we marked incorrectly and why. Regrades for cases where we mis-applied a rubric in an individual case are much more likely to be successful than regrades that argue about relative point values within the rubric, as the rubric is applied to the entire class. Because we will examine your entire submission in detail, your grade can go up or down as a result of a regrade request.
No textbook is required for this course. For students who want to read more, we recommend Artificial Intelligence: A Modern Approach by Stuart Russell (UC Berkeley) and Peter Norvig (Google). Be aware, however, that this is not a course textbook, so our presentation does not necessarily follow the presentation in the book.