Course Description

In this course, we study Artificial Intelligence (AI) algorithms and learn intuitive explanations behind them. AI algorithms are the algorithms used for automated decision making and execution. AI algorithms are behind the technologies in scheduling flights, search engines, self-driving vehicles, recommendations systems, navigation systems, robotics, solvers, voice recognition, translation, and so many other complex and advanced problems.

The course assumes students are comfortable with basic concepts in analysis, elementary algebra, elementary probability, statistics, and programming. It is recommended that students have the basic knowledge of linear algebra, the basics of machine learning, and the basics of deep learning, but it is not necessary. We will cover the required material in this course.

Target: This course is targeted to undergraduate students in Computer Science interested in learning the cores concepts in Artificial Intelligence or working in the areas related to Artificial Intelligence. The course should be of interest to undergraduate students from other STEM disciplines satisfying the prerequisites and interested in learning about Artificial Intelligence.

Course Details

• Lectures on M/W at 4:30pm-5:45pm at Rawls Hall, rm 1086
• Instructor's office hour, one hour right after the Monday lectures at the lecture room continued to LWSN.

  *Make sure you are enrolled in the course piazza (contact Enoch Adu if no access).

  *For information regarding auditing and enrolling contact Lori O’Brien.

  *We do not use a particular textbook.

  *The main body of the course material is borrowed from Stanford University CS221 Artificial Intelligence by Percy and Dorsa.

Grading

• Homework Assignments

  [HW1: 8%, HW2: 8%, HW3: 8%, HW4: 8%, HW5: 8%, HW6: 8%]

• Midterm: 20%
• Coding Project: 12%
• Final: 20%

*No late submission would be accepted.

Collaboration Policy

I encourage the students to discuss and exchange ideas about the course materials. The students shall accomplish each of their problem sets, project, midterm, and final individually. No collaboration or discussion prior to the due times.

Topics

• Intro to AI
• Prerequisites of Machine Learning
• Seach
• Constraint Satisfaction
• Markov Decision Processes (MDPs)
• Games
• Markov Networks
• Bayesian Networks
• Causal model
• Logic

Extra Resources

• Book: Artificial Intelligence: A Modern Approach by Stuart Russell and Peter Norvig
• Book: Probabilistic Graphical Models by Daphne Koller and Nir Friedman
• Book: A First Course in Probability by Sheldon M. Ross
• Book: Foundations of Constraint Satisfaction by Edward Tsang
• Book: Reinforcement Learning: An Introduction by Richard S. Sutton and Andrew G. Barto
• Book: Algorithms for Reinforcement Learning by Csaba Szepesvári
• Book: Towards common-sense reasoning via conditional simulation: legacies of Turing in Artificial Intelligence by Cameron E. Freer, Daniel M. Roy, Joshua B. Tenenbaum
• [Course on AI] by Percy Liang and Dorsa Sadigh

Note-Covid-19

In case you observe symptoms or become quarantined or isolated at any point in time during the semester, immediately reach out to the Protect Purdue Health Center, Academic Case Manager, and the Office of the Dean of Students.