## Machine Learning, Spring, 2020Course Number: COMPSCI 589
Time: MW / 2:30-3:45 PM
Room: Thompson Hall room 102
Course Final: TBD
Instructor: Justin Domke
Staff Email: Please usa Piazza
Course Website: Detailed materials for the course will be hosted on Moodle. Syllabus (this page) is at http://people.cs.umass.edu/domke/courses/cs589/
Instructor Office Hours: TBD
TA Hours: TBD
- I constantly get questions about override requests for this course, so I apologize that I cannot answer your question individually.
- If you'd like to take this course but cannot register, please submit an override request through the online system.
- Above all, please describe your background in
**linear algebra**,**probability theory**, and**basic multivariate calculus**. - Please list any courses you've taken either
*in*those topics, or*using*those topics or any other relevant training or experience you might have. - If you have taken a course elsewhere that you wish to substitute for a prerequisite, include a link to the syllabus of this course.
- Out of fairness, emailing me directly will not result in any preferential access. Note that it is likely there will be a substantial waitlist for the course, so I can't guarantee anyone entry to the course from the waitlist regardless of preparation.
- The Elements of Statistical Learning by Hastie, Tibshirani and Friedman
- An Introduction to Statistical Learning by James, Witten, Hastie and Tibshirani
- Introduction and Overview
**(Unit 1: Regression)** - Linear Regression, Ridge, and Lasso
- KNN Regression, Regression Trees, and Feature Selection
- Support Vector and Neural Network Regression
- KOLS and Gaussian Process Regression
**(Unit 2: Classification)** - K-Nearest Neighbors and Decision Trees
- Naive Bayes, LDA, and Logistic Regression
- Overfitting, Regularization, and Cross-Validation
- Support Vector Machines Basis Expansion, and Kernels
- Neural Networks and Deep Learning
- Ensembles and Classification
**(Unit 3: Kernels)** - Kernel Ridge Regression
- Support Vector Machines
- Bayesian Methods 1
- Bayesian Methods 2
- Markov Chain Monte Carlo
- Generative and Discriminative Methods
**(Unit 4: Unsupervised Learning)** - Hierarchical Clustering
- K-Means
- Mixture Models
- Linear Dimensionality Reduction and SVD
- Principal Components Analysis
- Final Review
Pass Fail / Audit. This class has extreme demand for seats. Thus, I will not approve any students to take the class pass/fail or as audit. Depending on what degree program you are in, you still may be able to register for the class in this way, and I will of course respect the university policy in that regard. However, I will not sign any forms approving a student to take the course pass/fail. Many students also ask to switch to pass/fail several weeks into the semester. I will not approve any such requests. If you want to be able to switch to pass/fail, you should not register for this class.Homework Submission: Homework assignments will generally
consist of developing machine learning systems in Python, evaluating the
systems, and producing written reports. Both the code and report must
be submitted through Moodle by the due date for a submission to be
considered on time.Late Homework: To allow some flexibility to complete
assignments given other constraints, you have a total of five free late
days. You will be charged one late day for handing in an assignment
within 24 hours after it is due, two late days for handing in an
assignment within 48 hours after it is due, etc. Your assignment is
considered late if either the written or code portions are submitted
late. The late homework clock stops when both the written and code
portions are submitted. After you have used up your late days, late
homework will not count for credit except in special circumstances (ie:
illness documented by a doctors note). If you do not hand in an
assignment at all, this will count as using all five late days.Homework Collaboration: You are encouraged to discuss
assignments and course material with other students in person or on the
course forums. However, you must show that you fully understand the
solution to any homework problem arising from such collaboration by
writing your own code, running your own experiments, and producing your
own write-up for the problem.Academic Honesty Policy: You are required to list the names
of anyone you discuss problems with on the first page of your solutions.
Copying any solution materials from external sources (books, web pages,
etc.) or other students is considered cheating. To emphasize: no detectable
copying is acceptable, even, e.g., copying a single sentence from an
outside source. Sharing your code or solutions with other students is
also considered cheating. Any detected cheating will result in a grade
of -100% on the assignment for all students involved (negative credit), and potentially a grade of F in the course.Re-grading Policy: Errors in grading of assignments and exams
can occur despite the best efforts of the course staff. If you believe
you've found a grading error, complete the online re- grade request
form. Re-grade requests must be submitted no later than one week after
the assignment is returned. Note that re-grading may result in your
original grade increasing or decreasing as appropriate. |