Statistical Machine Learning
CS59000 • Spring 2011 • Time: TR 3:00 pm - 4:15 pm •
Location: Forney Hall of Chemical Engr B124
This course has been approved by
the department as a Qual 1 course for CS graduate students.
Professor Alan Qi
Lawson 2142L • alanqi [at] cs.purdue.edu
Office hours: 4:15-5:15pm Tues
Syed Abbas Zilqurnain Naqvi
Lawson 2149-1 • naqvi [at] purdue.edu
Office hours: 2-3pm Tues and 3:30-4:30pm Fri
This introductory course will cover many concepts,
models, and algorithms in machine learning. Topics include classical
supervised learning (e.g., regression and classification), unsupervised
learning (e.g., principle component analysis and K-means), and recent
development in the machine learning field such as variational Bayes,
expectation propagation, and Gaussian processes. While this
course will give students the basic ideas and intuition behind modern
machine learning methods, the underlying theme in the course is
Review on probability distributions and basic concepts in information
Linear regression and classification
Probabilistic graphical models: Bayesian networks, Markov random fields
and conditional random fields
K-means Clustering, mixture models and Expectation Maximization
Hidden Markov models, state space models, and forward-backward
Sampling methods, importance sampling, and Markov Chain Monte Carlo
Deterministic approximate inference: Laplace's method, Variational
Bayes, and expectation propagation
Nonparametric Bayesian: Dirichlet
process mixture models
Combining models (or weak
Recent papers from NIPS, ICML,
UAI, JMLR, etc.
Calculus, basic linear algebra and probability, or permission of
Pattern Recognition and Machine Learning, Christopher M. Bishop, 2007
Information Theory, Inference, and Learning Algorithms, David MacKay,
2003. Available on-line here.
- Homework (links will be activated as homework is assigned).
Copying will not be tolerated.
- Midterm in mid October
of recent research
will choose a subtopic of machine learning research,
select three recent conference papers on the topic, and write a 2 page
report outlining the main ideas of papers and relate them to the
context of the course.
project: You are required to complete a class project. The choice
of the topic is up to you so long as it clearly pertains to the course
material. To ensure that you are on the right track, you will have to
submit a one paragraph description of your project a month before the
project is due. You are encouraged to collaborate on the project, but .
We expect a four page write-up about the project, which should clearly
and succintly describe the project goal, methods, and your results.
Each group should submit only one copy of the write-up and include all
the names of the group members (a two person group will have 6 pages, a
three person group will have 8 pages, and so on). The projects will be
graded on the basis of your understanding of the overall course
material (not based on, e.g., how brilliantly your method works).
- Homework: 25%
- Midterm: 25%
- Paper Review: 5%
- Final project: 10%
- Final exam: 35%
Assignments will be accepted up to 5 days late with a penalty of 20%
per day. No assignment will be accepted more than 5 days late.
In the event of a major campus emergency, course requirements,
deadlines and grading percentages are subject to changes that may be
necessitated by a revised semester calendar or other circumstances
beyond the instructor’s control. Here are ways to get information about
changes in this course. Course web page:
Instructor’s and TA's emails: alanqi [at]cs.purdue.edu or .naqvi [at]
To avoid the spread of pandemic influenza, a student is not
recommended to come to class with a fever or for seven calendar days
after recovering from influenza. Mitigation practices can be found
The development of the course material is partially supported by the
National Science Foundation under Grant No. 0916443. Any
opinions, findings and conclusions or recomendations expressed in this
material are those of the author(s) and do not necessarily reflect the
views of the National Science Foundation (NSF).