Machine learning 2
|5%||In class exercises|
I assume you have taken ML1 (ds4400) or equivalent. Working knowledge of Python required (or you must be willing to pick up rapidly as we go).
Homeworks will consist of both written and programming components. The latter will be completed in Python, using a mix of standard libraries (numpy, pytorch, etc.)
Late Policy. Homeworks that are one day late will be subject to a 20% penalty; two days incurs 50%. Homeworks more than two days late will not be accepted.
The mid-term will be given in class, and will be testing for understanding of the core material presented in the course regarding the fundamentals covered in the first half of the course.
A big component of this course will be your project, which will involve picking a particular dataset on which to implement, train and evaluate machine learning models. Collaboration is allowed (team sizes <= 2, however). This project will be broken down into several graded deliverables, and culminate in a report and final presentation in class to your peers.
Here is an outline of the project expectations, (tentative) dates, etc.
A commitment to the principles of academic integrity is essential to the mission of Northeastern University. The promotion of independent and original scholarship ensures that students derive the most from their educational experience and their pursuit of knowledge. Academic dishonesty violates the most fundamental values of an intellectual community and undermines the achievements of the entire University. For more information, please refer to the Academic Integrity Web page.
More specific to this class: It is fine to consult online resources for programming assignments (of course), but lifting a solution/implementation in its entirety is completely inappropriate. Moreover, you must list all sources (websites/URLs) consulted for every homework; failing to do so will constitute a violation of academic integrity. In general, you must also be able to explain whatever code you use.
|Meeting||Topic(s)||readings||things due||lecture notes/etc|
|1/7 (t)||Logistics, overview||Slides; Notebook|
|1/9 (r)||Math Review||Math for ML, Part 1: 5-5.5, 6-6.5||Slides; probability review NB; autodiff in Torch NB; A follow-up note to our exercise on gradients|
|1/14 (t)||MLE, MAP, and graphical models||Math for ML, Part 2: 8.3, 8.4, 8.5||Slides; Notebook on conjugate priors|
|1/16 (r)||Neural networks / backprop||A Course in Machine Learning, Ch. 10||Slides; Notes ok NNs/backprop; Notebook on backprop|
|1/21 (t)||Clustering I||Elements of Statistical Learning, 14--14.6; (optional) CIML 11.3|
|1/23 (r)||Clustering II → Mixture models and EM||Elements of Statistical Learning, 14.6--14.9; MML, Part 2: 11||HW1 DUE|
|1/28 (r)||Topic modeling I||Applications of Topic Models (Boyd-Graber, Hu, Mimno)|
|1/30 (r)||Topic modeling II||Applications of Topic Models (Boyd-Graber, Hu, Mimno)|
|2/4 (t)||Dimensionality reduction I||Math for ML, Part 2: 10||HW2 DUE|
|2/6 (r)||Dimensionality reduction II / Auto-encoders||t-SNE paper|
|2/11 (t)||"Self-supervision"; Learning to embed|
|2/13 (r)||Structured prediction I||A Course in Machine Learning, Ch 17|
|2/18 (t)||Structured prediction II||A Course in Machine Learning, Ch 17||HW3 DUE|
|2/20 (r)||No class|
|2/27 (r)||Midterm exam|
|3/13 (r)||Fairness and bias||A Course in Machine Learning, Ch. 8||Project proposal due|
|3/17 (t)||Project pitches and feedback||In class project pitches!|
|3/24 (t)||Active learning||HW4 DUE|
|3/26 (r)||"Green" AI|
|3/31 (t)||Reinforcement learning I|
|4/2 (r)||Reinforcement learning II|
|4/7 (t)||Final project presentations I||Presentations!|
|4/9 (r)||Final project presentations II||Presentations!|
|4/14 (t)||No class (final write-ups due)||FINAL PROJECT WRITE-UPS DUE!|