Overview

This course is about the theory and practice of Artificial Intelligence. We will study modern techniques for computers to represent task-relevant information and make intelligent (i.e., satisficing or optimal) decisions towards the achievement of goals. The search and problem-solving methods are applicable throughout a large range of industrial, civil, medical, financial, robotic, and information systems. We will investigate questions about AI systems such as: how to represent knowledge, how to effectively generate appropriate sequences of actions and how to search among alternatives to find optimal or near-optimal solutions. We will also explore how to deal with uncertainty in the world and how to learn from experience. We will cover the aggregation of conflicting preferences and computational game theory. Throughout the course, we will discuss topics such as AI and Ethics and introduce applications related to AI for Social Good. We expect that by the end of the course students will have a thorough understanding of the algorithmic foundations of AI, how probability and AI are closely interrelated, and how automated agents make decisions. We also expect students to acquire a strong appreciation of the big-picture aspects of developing fully autonomous intelligent agents.

Levels

This 15-281 course is for undergraduates. There is no masters level version offered this semester (15-681).

15-281 used to be 15-381 in previous semesters. This is not a significant change to the course, but rather a recognition that many students are able to complete the necessary prerequisites and are prepared to take this course in their second year.

Prerequisites + Corequisites

The prequisites for this course are:

• 15-122 Principles of Imperative Computation
• 21-241 Matrices and Linear Transformations
• 21-127 Concepts of Mathematics or 15-151 Mathematical Foundations of Computer Science.

The corequisite for this course is:

• 21-122 Integration and Approximation

For this corequisite, you should either have completed it prior to starting 15-281 or have it on your schedule for Spring 2020.

Please see the instructors if you are unsure whether your background is suitable for the course.

Office Hours

This course uses the CMU OHQueue tool as a queueing system for office hours.

Schedule (subject to change)

Dates	Topic	Reading / Demo	Slides
1/13 Mon	Introduction	AIMA Ch. 1	pptx (inked) pdf (inked)
1/15 Wed	Agents and Search	AIMA Ch. 3.1-4	pptx (inked) pdf (inked)
1/20 Mon	No class: MLK Day
1/22 Wed	Informed Search	AIMA Ch. 3.5-6	pptx (inked) pdf (inked)
1/27 Mon	Adversarial Search	AIMA Ch. 5.2-5	pptx (inked) pdf (inked)
1/29 Wed	Contraint Satisfaction Problems	AIMA Ch. 6.1-3, 6.5 CSP Demo	pptx (inked) pdf (inked)
2/3 Mon	Local Search	AIMA Ch. 4.1, 6.4 CSP Demo	pptx (inked) pdf (inked)
2/5 Wed	Optimization & Linear Programming	Boyd and Vandenberghe Ch. 2.2.1, 2.2.4, 4.3-4.3.1	Local Search pptx (inked) pdf (inked) LP pptx (inked) pdf (inked)
2/10 Mon	Integer Programming		pptx (inked) pdf (inked)
2/12 Wed	Propositional Logic	AIMA Ch. 7.1-5	pptx (inked) pdf (inked)
2/17 Mon	MIDTERM 1 EXAM	In class
2/19 Wed	SAT and Logical Agents	AIMA Ch. 7.6-7	pptx (inked) pdf (inked)
2/24 Mon	Classical Planning	AIMA Ch. 10	pptx (inked) pdf (inked)
2/26 Wed	First Order Logic	AIMA Ch. 8.1-3, 9.1-3.2	pptx (inked) pdf (inked)
3/2 Mon	Knowledge Representation	AIMA Ch. 12; Never-Ending Learning	pptx (inked) pdf (inked)
3/4 Wed	Markov Decision Process I	AIMA Ch. 17.1-3	pptx (inked) pdf (inked)
3/9 Mon	No class: Spring Break
3/11 Wed	No class: Spring Break
3/16 Mon	No class
3/18 Wed	Markov Decision Process II		pptx (inked) pdf (inked)
3/23 Mon	Reinforcement Learning I	AIMA Ch. 21.1-3	pptx (inked) pdf (inked)
3/25 Wed	Reinforcement Learning II	AIMA Ch. 21.4-5	pptx (inked) pdf (inked)
3/30 Mon	Bayes Nets: Representation	AIMA Ch. 13.1-5, 14.1-2 Bayes Net Demo (highres)	pptx (inked) pdf (inked)
4/1 Wed	Bayes Nets: Independence	AIMA Ch. 13.4-5, 14.2, Jordan 2.1	pptx (inked) pdf (inked) Bayes Ball handout
4/6 Mon	Bayes Nets: Inference	AIMA Ch. 14.4	pptx (inked) pdf (inked)
4/8 Wed	MIDTERM 2 EXAM	In class
4/13 Mon	Bayes Nets: Sampling	AIMA Ch. 14.5 Likelihood Demo, Gibbs Demo	pptx (inked) pdf (inked)
4/15 Wed	Hidden Markov Models	AIMA Ch. 15.2, 15.5	pptx (inked) pdf (inked)
4/20 Mon	Particle Filter & HMM Applications	AIMA Ch. 15.2, 15.6	pptx (inked) pdf (inked)
4/22 Wed	Game Theory: Equilibrium	AIMA Ch. 17.5	pptx (inked) pdf (inked)
4/27 Mon	Game Theory: Social Choice	AIMA Ch. 17.6	pptx (inked) pdf (inked)
4/29 Wed	AI and Ethics		pptx pdf (no ink)
5/4 Mon	FINAL EXAM

Recitations

Recitations start the first week of class, Friday, Jan. 17. Recitation attendence is recommended to help solidfy weekly course topics. That being said, the recitation materials published below are required content and are in-scope for midterm and final exams.

Recitation section assignments will be locked-down after the third week. Until then, you may try attending different recitation sections to find the best fit for you. In the case of any over-crowded recitation sections, priority goes to students that are officially registered for that section in S3. The process to select your final recitation assignment will be announced on Piazza as we get closer to Recitation 4, Feb. 7.

Time	Location	Section	TAs	Resources
Fri, 12:30 - 1:20 pm	SH 220	A	Claire and Harlene	Section A Resources
Fri, 1:30 - 2:20 pm	PH A22	B	Aarthi and Maia	Aarthi's course notes
Fri, 1:30 - 2:20 pm	SH 208	C	Simran and Ahana	Section C Resources
Fri, 2:30 - 3:20 pm	PH 226C	D + E (merged)	Amy, Claire, Maia, and Tina	Section D Resources Section E Resources

Dates	Recitation	Handout	Code
1/17 Fri	Recitation 1	pdf (solutions)	candygrab.zip
1/24 Fri	Recitation 2	pdf (solutions)
1/31 Fri	Recitation 3	pdf (solutions)	tictactoe.zip (tictactoe-solution.py)
2/7 Fri	Recitation 4	pdf (solutions)	OR-Tools code
2/14 Fri	Recitation 5	New content pdf (solutions) Midterm review pdf (solutions)
2/21 Fri	Recitation 6	pdf (solutions)
2/28 Fri	Recitation 7	pdf (solutions)	crane.py (agentApproxSol.py)
3/6 Fri	No recitation
3/13 Fri	No recitation
3/20 Fri	Recitation 8	pdf (solutions)
3/27 Fri	Recitation 9	pdf (solutions)	candygrab.zip (agentApproxSol.py)
4/3 Fri	Recitation 10	New content pdf (solutions) Midterm review pdf (solutions)
4/10 Fri	Recitation 11	pdf (solutions)
4/17 Fri	Recitation 12	pdf (solutions)
4/24 Fri	Recitation 13	pdf (solutions)
5/1 Fri	Recitation 14	pdf (solutions)

Exams

The course includes two midterm exams and a final exam. The midterms will be in class on Feb. 17 and Apr. 8. The final exam date is to-be-determined. Plan any travel around exams, as exams cannot be rescheduled.

Assignments

There will be five programming assignments and twelve written/online assignments (subject to change). Written/online assignments will involve working through algorithms presented in the class, deriving and proving mathematical results, and critically analyzing material presented in class. Programming assignments will involve writing code in Python to implement various algorithms.

For any assignments that aren't released yet, the dates below are tentative and subject to change.

Policies

Grading

Grades will be collected and reported in Canvas. Please let us know if you believe there to be an error the grade reported in Canvas.

Final scores will be composed of:

• 15% Midterm exams (each)
• 30% Final exam
• 20% Programming homework
• 10% Written homework
• 5% Online homework
• 5% Participation

Participation Grades

Participation will be based on the percentage of in-class polling questions answered:

• 5% for 80% or greater poll participation
• 3% for 70%
• 1% for 60%

Correctness of in-class polling responses will not be taken into account for participation grades.

It is against the course academic integrity policy to answer in-class polls when you are not present in lecture. Violations of this policy will be reported as an academic integrity violation. Information about academic integrity at CMU may be found at https://www.cmu.edu/academic-integrity.

Final Grade

This class is not curved. However, we convert final course scores to letter grades based on grade boundaries that are determined at the end of the semester. What follows is a rough guide to how course grades will be established, not a precise formula — we will fine-tune cutoffs and other details as we see fit after the end of the course. This is meant to help you set expectations and take action if your trajectory in the class does not take you to the grade you are hoping for. So, here's a rough, very rough heuristics about the correlation between final grades and total scores:

• A: above 90%
• B: 80-90%
• C: 70-80%
• D: 60-70%

This heuristic assumes that the makeup of a student’s grade is not wildly anomalous: exceptionally low overall scores on exams, programming assignments, or written assignments will be treated on a case-by-case basis.

Precise grade cutoffs will not be discussed at any point during or after the semester. For students very close to grade boundaries, instructors may, at their discretion, consider participation in lecture and recitation, exam performance, and overall grade trends when assigning the final grade.

Late Policy

Programming assignments, written homework, and online homework:

• 6 slip days across all assignment types
• Use up to two per assignment
• You may use these at your discretion, but they are intended for minor illness and other disruptive events outside of your control, and not for poor time management
• You are responsible to keep track of your own slip days. Gradescope will not enforce the total number of slip days

Aside from this, there will be no extensions on assignments in general. If you think you really really need an extension on a particular assignment, contact the instructor as soon as possible and before the deadline. Please be aware that extensions are entirely discretionary and will be granted only in exceptional circumstances outside of your control (e.g., due to severe illness or major personal/family emergencies, but not for competitions, club-related events or interviews). The instructors will require confirmation from University Health Services or your academic advisor, as appropriate.
Nearly all situations that make you run late on an assignment homework can be avoided with proper planning — often just starting early. Here are some examples:

• I have so many deadlines this week: you know your deadlines ahead of time — plan accordingly.
• It's a minute before the deadline and the network is down: you always have multiple submissions -- it's not a good idea to wait for the deadline for your first submission.
• My computer crashed and I lost everything: Use Dropbox or similar to do real-time backup -- recover your files onto AFS and finish your homework from a cluster machine.
• My fraternity/sorority/club has that big event that is taking all my time: Schedule your extra-curricular activities around your classes, not vice versa.

Again, you should be keeping track of how many slip days you have used, and ensure that you are both using no more than 2 slip days per assignment and using no more than 6 slip days in the semester. If you submit an assignment late but do not have enough slip days to use for either reason, one of two things will happen:

• if you submitted a version of the assignment on time or within your available slip days, we will grade the last valid assignment submission.
• if you did not submit a version on time, you will receive a 0.

You are encouraged to submit a version of your assignment early. It is not a good idea to wait for the deadline for your first submission.

Collaboration Policy

We encourage you to discuss course content and assignments with your classmates. However, these discussion must be kept at a conceptual level only.

• You may NOT view, share, or communicate about any artifact that will be submitted as part of an assignment. Example artifacts include, but are not limited to: code, pseudocode, diagrams, and text.
• You may look at another student's Python error messages and discuss what the error means at a conceptual level. However, you may NOT give specific instructions to fix the error.
• All work that you present must be your own.
• Using any external sources of code or algorithms in any way must have approval from the instructor before submitting the work. For example, you must get instructor approval before using an algorithm you found online for implementing a heuristic function in a programming assignment.

Programming Assignment Partners

The only exception to the above collaboration policy is when you share programming code directly with your programming assignment partner.

• You are allowed to work in groups of at most two on each programming assignment, i.e. you and one partner
• You must specify your parnter when you submit each assignment
• Once you start working with a partner on an assignment, you may not switch to another partner for that assignment
• You may change partners between assignments. In fact, you are strongly encouraged to change partners occasionally
• Important: You are responsible for making sure that both you AND your partner understand the work that you submit. If we discover that one partner cannot answer basic questions about the submitted work, both students in the group will be reported for an academic integrity violation.

Violations of these policies will be reported as an academic integrity violation. Information about academic integrity at CMU may be found at https://www.cmu.edu/academic-integrity. Please contact the instructor if you ever have any questions regarding academic integrity or these collaboration policies.

Accommodations for Students with Disabilities

If you have a disability and have an accommodations letter from the Disability Resources office, we encourage you to discuss your accommodations and needs with us as early in the semester as possible. We will work with you to ensure that accommodations are provided as appropriate. If you suspect that you may have a disability and would benefit from accommodations but are not yet registered with the Office of Disability Resources, we encourage you to visit their website.

Statement of Support for Students’ Health & Well-being

Take care of yourself. Do your best to maintain a healthy lifestyle this semester by eating well, exercising, getting enough sleep, and taking some time to relax. This will help you achieve your goals and cope with stress.
All of us benefit from support during times of struggle. There are many helpful resources available on campus and an important part of the college experience is learning how to ask for help. Asking for support sooner rather than later is almost always helpful.
If you or anyone you know experiences any academic stress, difficult life events, or feelings like anxiety or depression, we strongly encourage you to seek support. Counseling and Psychological Services (CaPS) is here to help: call 412-268-2922 and visit their website at http://www.cmu.edu/counseling/. Consider reaching out to a friend, faculty or family member you trust for help getting connected to the support that can help.
If you have questions about this or your coursework, please let us know. Thank you, and have a great semester.