CSE 20214 is an introduction to artificial intelligence and machine learning for students across the College of Engineering at the University of Notre Dame. It covers how the common learning algorithms work, when each one is the right tool, and how to apply them to real engineering data. Three lectures a week build the ideas, and a weekly Thursday lab puts them into practice with Python libraries such as pandas, scikit-learn, and PyTorch.

Upon successful completion of this course, students will be able to:
Prepare and explore engineering data for learning, using tools such as pandas.
Select an appropriate model for a given engineering problem.
Implement and train ML models with scikit-learn and PyTorch.
Evaluate a model's performance, limitations, and biases before relying on it.
Click on the next to a topic for additional resources. indicates the required resource for the topic.
| Unit | Date | Topics | Assignments |
|---|---|---|---|
| Unit 01: Machine Learning | Mon 01/11 | Introduction to Learning | |
| Wed 01/13 | High Dimensional Data | ||
| Thu 01/14 | Lab 01 - Jupyter/Pandas | ||
| Fri 01/15 | k-Nearest Neighbors | ||
| Mon 01/18 | MLK Day | ||
| Wed 01/20 | Entropy and Variance | ||
| Thu 01/21 | Lab 02 - sklearn | ||
| Fri 01/22 | Decision Trees | ||
| Mon 01/25 | Bayesian Methods | ||
| Wed 01/27 | Linear Regression | ||
| Thu 01/28 | Lab 03 - sklearn | ||
| Fri 01/29 | Optimization | ||
| Mon 02/01 | Regularization | ||
| Wed 02/03 | Perceptrons | ||
| Thu 02/04 | Lab 04 - sklearn | ||
| Fri 02/05 | Logistic Regression | ||
| Mon 02/08 | Gradient Descent | ||
| Wed 02/10 | Support Vector Machines | ||
| Thu 02/11 | Lab 05 - sklearn | ||
| Fri 02/12 | Ensemble Methods 01 | ||
| Mon 02/15 | Ensemble Methods 02 | ||
| Wed 02/17 | Model Evaluation 01 | ||
| Thu 02/18 | Lab 06 - sklearn | ||
| Fri 02/19 | Model Evaluation 02 | ||
| Mon 02/22 | Reinforcement Learning | ||
| Wed 02/24 | Q-Learning | ||
| Thu 02/25 | Lab 07 - OpenAI Gym | ||
| Fri 02/26 | On-Policy RL | ||
| Mon 03/01 | Unsupervised Learning | ||
| Wed 03/03 | Clustering | ||
| Thu 03/04 | Lab 08 - sklearn | ||
| Fri 03/05 | Principal Component Analysis | ||
| Spring Break | Mon 03/08 | Spring Break | |
| Wed 03/10 | Spring Break | ||
| Fri 03/12 | Spring Break | ||
| Exam 01 | Mon 03/15 | Review 01 | |
| Wed 03/17 | Review 01 | ||
| Thu 03/18 | Lab 09 - flex | ||
| Fri 03/19 | Exam 01 | ||
| Unit 02: Deep Learning | Mon 03/22 | Feed-Forward Neural Networks | |
| Wed 03/24 | Backpropagation | ||
| Thu 03/25 | Lab 10 - pytorch | ||
| Fri 03/26 | Good Friday | ||
| Mon 03/29 | Easter Monday | ||
| Wed 03/31 | Training Neural Networks | ||
| Thu 04/01 | Lab 11 - pytorch | ||
| Fri 04/02 | Convolutional Neural Networks 01 | ||
| Mon 04/05 | Text as Data | ||
| Wed 04/07 | Recurrent Neural Networks | ||
| Thu 04/08 | Lab 12 - pytorch | ||
| Fri 04/09 | Self-Attention | ||
| Mon 04/12 | Attention Variants | ||
| Wed 04/14 | Transformers | ||
| Thu 04/15 | Lab 13 - JAX and keras | ||
| Fri 04/16 | Agentic LLMs | ||
| Mon 04/19 | Diffusion Models | ||
| Wed 04/21 | Deep Reinforcement Learning | ||
| Thu 04/22 | Lab 14 - flex | ||
| Fri 04/23 | Modern AI | ||
| Exam 02 | Mon 04/26 | Review 02 | |
| Wed 04/28 | Exam 02 |
There's loads of additional resources out there! If you find one that particuarly resonates with you, I'd appreciate it if you were willing to share it with the rest of the class. You'll even have the option to tag it with your name so future students can see who to thank!
Submit any additional resources to this google form: Additional Resources
| Component | Points |
|---|---|
| Readings Readings | TBD |
| Lab Labs | 14 × TBD |
| Homework Homework Assignments | TBD |
| Exam Exam 1 (includes points for turning in the practice packet) | TBD |
| Exam Exam 2 (includes points for turning in the practice packet) | TBD |
| Total | 300 |
| Grade | Points | Grade | Points | Grade | Points |
|---|---|---|---|---|---|
| A | 279-300 | A- | 270-278 | ||
| B+ | 260-269 | B | 250-259 | B- | 240-249 |
| C+ | 230-239 | C | 220-229 | C- | 210-219 |
| D | 195-209 | F | 0-194 |
Readings are due at 11:30 AM (the start of class) on the day of the due date.
Labs are started in the Thursday lab session and due at midnight on the following Sunday.
Homeworks are due at midnight on the Monday of the due week.
I do something a little different in this class than I've seen in other ones. Instead of giving you old versions of the exams with which to practice, I will release a "practice packet". If you turn in this practice packet on the day of the exam (either online or paper is fine) then you will receive points on the exam itself for actually studying. The practice packet is graded entirely on completion. Each exam includes practice-packet points within its total. There will be an entry in canvas worth 0 points for each practice packet, the points you receive for doing it will be reflected in the exam score itself.
Students are expected to attend and contribute regularly in class. This means answering questions in class, participating in discussions, and helping other students.
Foreseeable absences should be discussed with the instructor ahead of time.
Recalling one of the tenets of the Hacker Ethic:
Hackers should be judged by their hacking, not criteria such as degrees, age, race, sex, or position.
Students are expected to be respectful of their fellow classmates and the instructional staff.
Any student who has a documented disability and is registered with Disability Services should speak with the professor as soon as possible regarding accommodations. Students who are not registered should contact the Office of Disabilities.
Any academic misconduct in this course is considered a serious offense, and the strongest possible academic penalties will be pursued for such behavior. Students may discuss high-level ideas with other students, but at the time of implementation (i.e. programming), each person must do his/her own work. Use of the Internet as a reference is allowed but directly copying code or other information is cheating. It is cheating to copy, to allow another person to copy, all or part of an exam or a assignment, or to fake program output. It is also a violation of the Undergraduate Academic Code of Honor to observe and then fail to report academic dishonesty. You are responsible for the security and integrity of your own work.
In the case of a serious illness or other excused absence, as defined by university policies, coursework submissions will be accepted late by the same number of days as the excused absence.
Otherwise, there is an automatic 25% late penalty for assignments turned in 12 hours pass the specified deadline.
This course will be recorded using Zoom and Panopto. This system allows us to automatically record and distribute lectures to you in a secure environment. You can watch these recordings on your computer, tablet, or smartphone. In the course in Canvas, look for the "Panopto" tool on the left hand side of the course.
Because we will be recording in the classroom, your questions and comments may be recorded. Recordings typically only capture the front of the classroom, but if you have any concerns about your voice or image being recorded please speak to me to discuss your concerns. Except for faculty and staff who require access, no content will be shared with individuals outside of your course without your permission.
These recordings are jointly copyrighted by the University of Notre Dame and your instructor. Posting them to other websites (including YouTube, Facebook, SnapChat, etc.) or elsewhere without express, written permission may result in disciplinary action and possible civil prosecution.
For the assignments in this class, you are allowed to consult printed and online resources and to discuss the class material with other students. You may also consult AI Tools such as CoPilot or ChatGPT for help explaining concepts, debugging problems, or as a reference. Viewing or consulting solutions, such as those from other students, previous semesters, or generated by AI Tools is never allowed.
Likewise, you may copy small and trivial snippets from books, online sources, and AI Tools as long as you cite them properly. However, you may not copy solutions or significant portions of code from other students or online sources, nor may you generate solutions via AI Tools.
Finally, when preparing for exams in this class, you may not access exams from previous semesters, nor may you look at or copy solutions from other current or former students.
| Resources | Solutions | |
|---|---|---|
| Consulting | Allowed | Not Allowed |
| Copying | Cite | Not Allowed |
See the CSE Guide to the Honor Code for definitions of the above terms and specific examples of what is allowed and not allowed when consulting resources.
If you are unclear about whether certain forms of consultation or common work are acceptable or what the standards for citation are, you responsible for consulting your instructor.
If an instructor sees behavior that is, in his judgement, academically dishonest, he is required to file either an Honor Code Violation Report or a formal report to the College of Engineering Honesty Committee.
Submit any questions or suggestions to this anonymous google form: Questions and Suggestions
Note: This form is genuinely anonymous but anonymity is a priviledge. Please don't misuse it.
If you're interested in being a TA please apply via this google form: TA Applications
Note: Applications are due by the day of the second exam and will be evaluated shortly after.
Note: TAing for CSE 20214 is quite competitive and usually there are only 1 or 2 open slots a semester (if any), so it may be worth having a backup plan.
One of the benefits of ML/AI being extremely popular is there are many online resources available for learning it. The best teachers of the topics release much of their material avaible for free online. If something in class seemed unclear, you're encouraged to seek out an explanation that makes the most sense to you! If you find one that you really like, please share it with the rest of the class. Below are links to books, blogposts, and lectures that I personally find very useful.