Artificial Intelligence (AI) systems are increasingly being deployed in
many real-world tasks. This course provides an introduction to the
fundamental principles and applications of AI. The course covers classic
material including search-based methods, probabilistic reasoning, game
playing, decision making, exact and approximate inference, causal
learning, and reinforcement learning as well as selected advanced
topics. The focus of the course is on foundational methods and current
techniques for building AI systems that exhibit intelligent
behavior and can learn
from experience.
Note that there will be little coverage of machine learning in this course; those whose primary interest is in the machine learning aspects of AI should consider taking CS57300 or CS57800.
The course assumes you are familiar with basic concepts in analysis, linear algebra, optimization (e.g., Math 26500 or 35100); elementary probability, statistics (e.g., Stat 35000 or 35500); and discrete mathematics, data structures, and algorithms (e.g., CS38100). Students are expected to have good programming and software development skills and have a working knowledge of Python and Java.
Available by appointment. (Please email me a time that works for you.)
There will be a course email list (via Brightspace) used for high-priority announcements.
This will use your @purdue.edu
email address, so please be sure to check this on a regular basis.
We will be using Gradescope to turn in and comment on assignments, and Brightspace for recording and distributing grades, and any other non-public information about the course.
The course will primarily be taught through lectures, supplemented with reading.
The primary reading will be from the textbook. The written assignments and projects are also a significant component of the learning experience.
We will be using Ed Discussion to facilitate discussions; this will enable you to post questions as well as respond to questions posted by others. If you have not already joined Ed Discussion for this course, the link to do so can be found in the syllabus on Brightspace.
Late work will be penalized 15% per day (24 hour period or fraction thereof). The penalty is based on possible points, not your actual score. (E.g., after 5 days, if your submission achieves less than 75% of the possible points, you get a 0.) Each assignment has a hard deadline of five days after the published due date, after which the solution sets go out and no further submissions are accepted. Also note that the last day of class will be a hard deadline for all work. You are allowed five extension days, to be used at your discretion throughout the semester (illness, job interviews, etc.); no penalty is assessed for late work within this limit. If your assignments add up to more than five days late over the semester, the late days will be automatically applied to the highest value assignments (e.g., projects), so the 15% late penalties are applied to the lower value assignments first. Late penalties will only be applied at the end of the semester, so if you go beyond the allotted late days, you may see your score for some assignments drop. You must keep track of late days yourself. (Note: Fractional use is not allowed, and extension days may not be used to extend submission past the hard deadline (i.e., five days after the deadline, or the last day of class, whichever comes first). In addition, we follow the policy of absence requests through the Office of the Dean of Students.
Please read the departmental academic integrity policy. You should also be familiar with the Purdue University Code of Honor and the Academic Integrity Guide for Students.
Interaction among students is encouraged, and you should feel free to discuss the course with one another. However, unless otherwise noted, the work that you turn in should reflect your own efforts and knowledge.
University Emergency Preparedness instructions. Note: In the event of weather-related class cancellation, please be sure to check your email.
Nondiscrimination Statement: Purdue University is committed to maintaining a community which recognizes and values the inherent worth and dignity of every person; fosters tolerance, sensitivity, understanding, and mutual respect among its members; and encourages each individual to strive to reach his or her own potential. In pursuit of its goal of academic excellence, the University seeks to develop and nurture diversity. The University believes that diversity among its many members strengthens the institution, stimulates creativity, promotes the exchange of ideas, and enriches campus life. Purdue’s nondiscrimination policy can be found at https://www.purdue.edu/home/ea_eou_statement/.
Purdue University strives to make learning experiences as accessible as possible. If you anticipate or experience physical or academic barriers based on disability, please contact the Disability Resource Center at: drc@purdue.edu or by phone: (765) 494-1247 and the course instructor to arrange for accommodations.
Student Mental Health and Well-being: Purdue University is committed to advancing the mental health and well-being of its students. If you or someone you know is feeling overwhelmed, depressed, and/or in need of support, services are available. For help, such individuals should contact Counseling and Psychological Services (CAPS) at (765) 494-6995 and http://www.purdue.edu/caps/ during and after hours, on weekends and holidays, or through its counselors physically located in the Purdue University Student Health Center (PUSH) and the Psychology building (PSYC) during business hours.
The textbook for this course is:
Artificial Intelligence: A Modern Approach
Stuart Russell and Peter Norvig
Pearson, 2021.
ISBN: 9780137505135
Date | Topic | Reading (Russell & Norvig) | Note(s) |
---|---|---|---|
Aug. 19 | Course logistics, goals, and organization. History and foundations of AI, and its role in society. Review of relevant prerequisites | Chapter 1, Appendix A | |
Aug. 21 | Review of prerequisites (cont'd); Search: Modeling problems as search, tree search | Chapter 3-3.3 | |
Aug. 26 | Tree search methods: Breadth/depth first, uniform cost; Informed Cost Search | Chapter 3.4-3.6 | Assignment 1 Released (Gradescope). Due: Sept. 6, 11:59PM (Eastern Time) |
Aug. 28 | Informed Cost Search (cont'd); Local search, search in continuous environments | Chapter 4-4.2 | |
Sep. 2 | LABOR DAY (NO CLASS) | ||
Sep. 4 | Intelligent agents and common agent programs; Game Modeling, Minimax | Chapter 2-2.4.5, 5-5.2 | |
Sep. 9 | Minimax (cont'd), Deterministic games: α-β pruning, equilibria | Chapter 5-5.3 | |
Sep. 11 | Games: equilibria (cont'd); Constraint satisfaction | 18.2-18.2.2, 6.1 | |
Sep. 16 | Constraint satisfaction: Modeling problems, search to solve | Chapter 6.2-6.3 | Assignment 2 Released (Gradescope). Due: Sept. 25, 11:59PM (Eastern Time) Final Project Instructions (Part 0: Team) Released (Gradescope). Due: Sept. 23, 11:59PM (Eastern Time) |
Sep. 18 | No class. | ||
Sep. 23 | Search to solve CSPs (cont'd) | Chapter 6.3-6.4 | |
Sep. 25 | Planning with uncertainty; Markov Decision Processes | Chapter 12-12.6, Chapter 17-17.1 | |
Sep. 30 | Markov Decision Processes: Policy Evaluation | Chapter 17.2 | |
Oct. 2 | Propositional Logic | Chapter 7.1-7.4 | Assignment 3 Released (Gradescope). Due: Oct. 11, 11:59PM (Eastern Time) Final Project Instructions (Part 1) Released (Gradescope). Due: Oct. 23, 11:59PM (Eastern Time) |
Oct. 7 | FALL BREAK (NO CLASS) | ||
Oct. 9 | Propositional Logic: Reasoning | Chapter 7.5-7.6 | |
Oct. 14 | First-Order Logic | Chapter 8-8.3, 9-9.2 | |
Oct. 16 | Midterm | ||
Oct. 21 | First-Order Logic: Inference | Chapter 9.3-9.5 | |
Oct. 23 | First-Order Logic: Inference (cont'd); Knowledge Representation | Chapter 10, 8.4 | |
Oct. 28 | Reinforcement Learning: Bandit Problems | Chapter 22-22.3, Chapter 17.3 | Assignment 4 Released (Gradescope). Due: Nov. 6, 11:59PM (Eastern Time) Final Project Instructions (Part 2) Released (Gradescope). Due: Nov. 13, 11:59PM (Eastern Time) |
Oct. 30 | Reinforcement Learning (cont'd) | Chapter 22.4-22.7, Chapter 17.4 | |
Nov. 4 | Reinforcement Learning (cont'd), Bayesian Networks and Bayesian Inference | Chapter 13-13.3 | |
Nov. 6 | Bayesian Inference, Bayesian Reasoning over time | Chapter 14-14.2 | |
Nov. 11 | Bayesian Inference over time | Chapter 14.3-14.5 | |
Nov. 13 | Ethical Issues in AI: Fairness and Privacy, Transparency, Rights of AI | Chapter 27-27.3.7 | |
Nov. 18 | Robotics: Perception, Motion Planning | Chapter 26-26.4.2, 26.5-26.6 | |
Nov. 20 | Methods for Modern AI | ||
Nov. 25 | Methods for Modern AI (cont'd) | ||
Nov. 27 | THANKSGIVING BREAK (NO CLASS) | ||
Dec. 2 | Final Project Presentations | ||
Dec. 4 | Final Project Presentations (cont'd) | Last day of class. | |
Date: Thursday, December 12, Time: 8:00am-10:00am | FINAL EXAM | LOCATION: Rawls Hall (RAWL) Room 1086 |
FINAL EXAM: Date: Thursday, December 12, Time: 8:00am-10:00am, Location: Rawls Hall (RAWL) Room 1086