Course Overview
Large datasets pose difficulties across the machine learning pipeline. They are difficult to visualize and introduce computational, storage, and communication bottlenecks during data preprocessing and model training. Moreover, high capacity models often used in conjunction with large datasets introduce additional computational and storage hurdles during model training and inference. This course is intended to provide a student with the mathematical, algorithmic, and practical knowledge of issues involving learning with large datasets. Among the topics considered are: data cleaning, visualization, and pre-processing at scale; principles of parallel and distributed computing for machine learning; techniques for scalable deep learning; analysis of programs in terms of memory, computation, and communication complexity; and methods for low-latency inference.
Prerequisites
Students are required to have taken a CMU introductory machine learning course (10-301, 10-315, 10-601, 10-701, or 10-715). A strong background in programming will also be necessary; suggested prerequisites include 15-210, 15-214, or equivalent. Students are expected to be familiar with Python or learn it during the course.
Textbooks
There will be no required textbooks, though we may suggest additional reading in the schedule below.Course Components
The requirements of this course consist of participating in lectures, homework assignments, a mini-project, and two exams. The grading breakdown is:- 20% Exam 1
- 20% Exam 2
- 40% Homework (5 Assignments, 8% Each)
- 15% Mini-Project
- 5% Quizzes
Exams
You are required to attend all exams in person. The exams will be given during class. Please plan your travel accordingly as we will not be able accommodate individual travel needs (e.g. by offering the exam early). If you have an unavoidable conflict with an exam (e.g. an exam in another course), you must notify us at least 3 weeks before the exam.Homework
The homeworks will be divided into two components: programming and written. The programming assignments will ask you to implement ML algorithms from scratch; they emphasize understanding of real-world applications of ML, building end-to-end systems, and experimental design. The written assignments will focus on core concepts, “on-paper” implementations of classic learning algorithms, derivations, and understanding of theory.Mini-Project
Students will create groups and participate in a mini-project. Mini-Project details will be released later in the semester.Quizzes
Participation will be measured via in-class quizzes. Quizzes can be completed up to 24 hours after the end of class. We will not provide make-up quizzes for days that you miss class.Piazza
We will use Piazza for class discussions. Please go to this Piazza website to join the course forum (note: you must use a cmu.edu email account to join). We strongly encourage students to post on this forum rather than emailing the course staff directly (this will be more efficient for both students and staff). Students should use Piazza to:
- Ask clarifying questions about the course material.
- Share useful resources with classmates (so long as they do not contain homework solutions).
- Look for students to form study groups.
- Answer questions posted by other students to solidify your own understanding of the material.
Piazza Extra Credit
Students who actively participate on Piazza by answering questions may receive extra credit. The course staff will monitor contributions and award extra credit at the end of each month based on the quality and helpfulness of the posts.
Gradescope
We use Gradescope to collect PDF submissions of open-ended questions on the homework (e.g. mathematical derivations, plots, short answers). The course staff will manually grade your submission, and you’ll receive personalized feedback explaining your final marks.You will also submit your code for programming questions on the homework to Gradescope. After uploading your code, our grading scripts will autograde your assignment by running your program on a VM. This provides you with immediate feedback on the performance of your submission.
Regrade Requests
If you believe an error was made during manual grading, you’ll be able to submit a regrade request on Gradescope. For each homework, regrade requests will be open for only **1 week** after the grades have been published. This is to encourage you to check the feedback you’ve received early!Course Staff
Instructional Staff
William W. Cohen
Jacob Rast
Teaching Assistants
Christopher Berman
Kathryn Chen
Gunjan Dhanuka
Juan Hernandez Gomez
Pierce Miller
Glenn Xu
Sean Xu
Baihong Yuan
Schedule
Schedule for Spring 2025 (subject to change)General Policies
Late Homework Policy
You have 4 total grace days that can be used to submit late homework assignments without penalty. We will automatically keep a tally of these grace days for you; they will be applied greedily. You may not use more than 2 grace days on any single homework assignment. Additionally, please note:- All homework submissions are electronic. As such, lateness will be determined by the latest timestamp of any part of your submission. For example, suppose the homework requires submissions to both Gradescope Written and Programming. If you submit your Written on time but your Programming 1 minute late, your entire homework will be penalized for the full 24-hour period.
- Once you have exhuasted your late days any submission up to 24 hours late will recieve a 50% penalty. Any work submitted after 24 hours will be graded but will not be eligible for any credit.
Extensions
In general, we do not grant extensions on assignments. There are several exceptions:- Medical Emergencies: If you are sick and unable to complete an assignment or attend class, please go to University Health Services. For minor illnesses, we expect grace days to provide sufficient accommodation. For medical emergencies (e.g. prolonged hospitalization), students may request an extension afterwards by contacting their Student Liaison or Academic Advisor and having them reach out to the education associate Jacob Rast on their behalf.
- Family/Personal Emergencies: If you have a family emergency (e.g. death in the family) or a personal emergency (e.g. mental health crisis), please contact your academic adviser or Counseling and Psychological Services (CaPS). In addition to offering support, they will reach out to the instructors for all your courses on your behalf to request an extension.
- University-Approved Absences: If you are attending an out-of-town university approved event (e.g. multi-day athletic/academic trip organized by the university), you may request an extension for the duration of the trip. You must provide confirmation of your attendance, usually from a faculty or staff organizer of the event.
Audit Policy
Official auditing of the course (i.e. taking the course for an “Audit” grade) is not permitted this semester.Unofficial auditing of the course (i.e. watching the lectures online or attending them in person) is welcome and permitted without prior approval. Unofficial auditors will not be given access to course materials such as homework assignments and exams.
Pass/Fail Policy
Pass/Fail is allowed in this class, no permission is required from the course staff. The grade for the Pass cutoff will depend on your program. Be sure to check with your program / department as to whether you can count a Pass/Fail course towards your degree requirements.Accommodations for Students with Disabilities
If you have a disability and have an accommodations letter from the Disability Resources office, I encourage you to discuss your accommodations and needs with Jacob Rast as early in the semester as possible. I 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, I encourage you to contact them at access@andrew.cmu.edu.Academic Integrity Policies
Read this CarefullyCollaboration among Students
- The purpose of student collaboration is to facilitate learning, not to circumvent it. Studying the material in groups is strongly encouraged. It is also allowed to seek help from other students in understanding the material needed to solve a particular homework problem, provided no written notes (including code) are shared, or are taken at that time, and provided learning is facilitated, not circumvented. The actual solution must be done by each student alone.
- The presence or absence of any form of help or collaboration, whether given or received, must be explicitly stated and disclosed in full by all involved. Specifically, each assignment solution must include the corresponding collaboration section.
- If you gave help after turning in your own assignment and/or after answering the collaboration section, you must update your answers before the assignment’s deadline, if necessary by emailing the course staff or a Piazza post.
- Collaboration without full disclosure will be handled severely, in compliance with CMU’s Policy on Academic Integrity.
Previously Used Assignments
Some of the homework assignments used in this class may have been used in prior versions of this class, or in classes at other institutions, or elsewhere. Solutions to them may be, or may have been, available online, or from other people or sources. It is explicitly forbidden to use any such sources, or to consult people who have solved these problems before. It is explicitly forbidden to search for these problems or their solutions on the internet. You must solve the homework assignments completely on your own. We will be actively monitoring your compliance. Collaboration with other students who are currently taking the class is allowed, but only under the conditions stated above.Generative AI
Students are encouraged to use generative AI tools (such as ChatGPT) the same way they would interact with any other collaborator. In particular, any substantive collaboration should be disclosed, and all solutions should be entirely the student’s own work. To ensure the latter, any notes or results from a collaboration should remain closed while writing up the solution, so that no material is accidentally transferred.Policy Regarding “Found Code”
You are encouraged to read books and other instructional materials, both online and offline, to help you understand the concepts and algorithms taught in class. These materials may contain example code or pseudo code, which may help you better understand an algorithm or an implementation detail. However, when you implement your own solution to an assignment, you must put all materials aside, and write your code completely on your own, starting “from scratch”. Specifically, you may not use any code you found or came across. If you find or come across code that implements any part of your assignment, you must disclose this fact in your collaboration statement.Duty to Protect One’s Work
Students are responsible for proactively protecting their work from copying and misuse by other students. If a student’s work is copied by another student, the original author is also considered to be at fault and in gross violation of the course policies. It does not matter whether the author allowed the work to be copied or was merely negligent in preventing it from being copied. When overlapping work is submitted by different students, both students will be punished.To protect future students, do not post your solutions publicly, neither during the course nor afterwards.
Penalties for Violations of Course Policies
All violations (even first one) of course policies will always be reported to the university authorities (your Department Head, Associate Dean, Dean of Student Affairs, etc.) as an official Academic Integrity Violation and will carry severe penalties. The penalty which will be recommended by the Professor for violation of the academic integrity policy is failure in the course. For repeat offenders, violoation of academic integrity policies can even lead to dismissal from the university.Course Calendar
Acknowledgments
This course is based in part on material developed by Virginia Smith, Ameet Talwalkar, Geoffrey Gordon, Heather Miller, Barnabas Poczos, and Anthony Joseph.
Previous courses: 10-605/10-805, Fall 2024; 10-405/10-605, Spring 2024; 10-605/10-805, Fall 2023; 10-405/10-605, Spring 2023; 10-605/10-805, Fall 2022; 10-405/10-605, Spring 2022; 10-605/10-805, Fall 2021; 10-405/10-605, Spring 2021; 10-605/10-805, Fall 2020; 10-405/10-605, Spring 2020; even older versions of 10-405/10-605/10-805.