ECE544: Pattern Recognition (Fall 2020)

Course Information

The goal of Pattern Recognition is to find structure in data. In this course we will cover three main areas, (1) discriminative models, (2) generative models, and (3) reinforcement learning models. In particular we will cover the following: linear regression, logistic regression, support vector machines, deep nets, structured methods, learning theory, kMeans, Gaussian mixtures, expectation maximization, VAEs, GANs, Markov decision processes, Q-learning and Reinforce.

Pre-requisites: Probability, linear algebra, and proficiency in Python.

Recommended Text: (1) Machine Learning: A Probabilistic Perspective by Kevin Murphy, (2) Deep Learning by Ian Goodfellow and Yoshua Bengio and Aaron Courville, (3) Pattern Recognition and Machine Learning by Christopher Bishop, (4) Graphical Models by Nir Friedman and Daphne Koller, and (5) Reinforcement Learning by Richard Sutton and Andrew Barto.

Course Deliverables:
(1) One course presentation (see Courseplan Lecture Group ID column for your team members)
(2) One project (see Courseplan Project Team ID column for your team members)

Grading:

1/3 class presentation, 1/3 project, 1/3 final; + 1/3 bonus for really impressive projects

Grading policy is subject to change.

TA Hours:
Time: Friday at 5pm.

Final Exam: December 8, 11am-12:30pm.

---

Instructor & TAs

---