Announcements
- January 16: the course webpage is up.
- Course discussions are on Piazza (register with your IISc email address).
- TA hours: please email a TA for an appointment.
Course description
With the increasing amounts of data being generated in diverse fields such as astronomical sciences, health and life sciences, financial and economic modeling, climate modeling, market analysis, and even defense, there is an increasing need for computational methods that can automatically analyze and learn predictive models from such data.
Machine learning, the study of computer systems and algorithms that automatically improve performance by learning from data, provides such methods; indeed, machine learning techniques are already being used with success in a variety of domains, for example in computer vision to develop face recognition systems, in information retrieval to improve search results, in computational biology to discover new genes, and in drug discovery to prioritize chemical structures for screening.
This course aims to provide a sound introduction to both the theory and practice of machine learning, with the goal of giving students a strong foundation in the subject, enabling them to apply machine learning techniques to real problems, and preparing them for advanced coursework and research in machine learning and related fields.
Prerequisites
E0 232: Probability and Statistics (or an equivalent course elsewhere), with a grade of B or higher. Some background in linear algebra and optimization will also be helpful.
Evaluation (tentative)
| Component | Marks |
|---|---|
| Project | 20 |
| Mid-term examinations (2 × 15) | 30 |
| Final examination | 50 |
Syllabus
| # | Topic | Recommended reading |
|---|---|---|
| 1 | Introduction to machine learning; classification using Bayes rule | Duda and Hart: Chapter 2 |
| 2 | Introduction to Bayes decision theory | Duda and Hart: Chapter 2 |
| 3 | Bayes decision theory (contd.) | Duda and Hart: Chapter 2 |
| 4 | Learning as optimization; linear regression | Bishop: Chapter 3 |
| 5 | Probabilistic view of linear regression: ML and MAP estimates | |
| 6 | Logistic regression: optimization and probabilistic approaches | |
| 7 | Parameter estimation for logistic regression: gradient descent, stochastic gradient methods | |
| 8 | Hyperplane-based classifiers, the perceptron and the perceptron convergence theorem | |
| 9 | Introduction to support vector machines | |
| 10 | Support vector machines | |
| 11 | Kernel methods and kernel SVM | |
| 12 | Feed-forward neural networks and backpropagation | |
| 13 | Undirected graphical models, Markov random fields | An Introduction to Restricted Boltzmann Machines |
| 14 | Introduction to MCMC and Gibbs sampling | Bishop: Sections 11.1.5, 11.2.1; Markov Chain Monte Carlo (MCMC) |
| 15 | Restricted Boltzmann machines | An Introduction to Restricted Boltzmann Machines; A Practical Guide to Training Restricted Boltzmann Machines |
| 16 | Boltzmann machines and variational methods | Ackley, Hinton and Sejnowski (1985), A Learning Algorithm for Boltzmann Machines; Boltzmann Machines |
| 17 | Variational methods (contd.) | Variational methods (see Section 6.3.1) |
| 18 | EM algorithm, mixture models and k-means | Bishop: Chapter 9 |
| 19 | Bayesian networks; introduction to HMMs | A Tutorial on HMMs |
| 20 | HMMs (contd.): the forward–backward algorithm | A Tutorial on HMMs |
| 21 | Introduction to undirected graphical models and Markov random fields | |
| 22 | Variational Bayes and variational autoencoders | |
| 23 | Convolutional and recurrent neural networks |
Projects
As part of this course, you are required to work on a project. This will give you hands-on experience of working with data from various domains (text, images, videos, etc.) used in contemporary ML research, and also expose you to specialized topics of ML that are more advanced or recent than what will be covered in the lectures. A list of project ideas will be shared with the class; you can also come up with your own project ideas.
Project policy
- Some project ideas are based on reading and surveying several papers; others are based on implementing one or two papers and comparing the proposed methods on datasets. We will point you to relevant papers.
- The best grades will be reserved for groups that come up with new approaches, either theoretical or experimental, that have not been used in the literature.
- Each project will have a project mentor, who will help you locate papers and datasets and clear doubts.
- In implementation-based projects, code may already be available online. It is perfectly fine to use it, as long as it is cited in the reports.
- You are required to submit a mid-term report around the third week of March, and the final report shortly before the final examination.
- Plagiarism is strictly prohibited while writing the reports. Any plagiarism detected will result in an F grade for the course.
References
Recommended textbooks
- C. M. Bishop, Pattern Recognition and Machine Learning, Springer, 2006.
- T. Hastie, R. Tibshirani and J. Friedman, The Elements of Statistical Learning: Data Mining, Inference and Prediction, Springer, 2nd edition, 2009.
- S. Haykin, Neural Networks and Learning Machines, Prentice-Hall, 3rd edition, 2009.
- I. Goodfellow, Y. Bengio and A. Courville, Deep Learning, MIT Press, 2017.
Additional textbooks
- T. Hastie, R. Tibshirani and J. Friedman, The Elements of Statistical Learning: Data Mining, Inference and Prediction, Springer, 2nd edition, 2009. Free download
- T. Mitchell, Machine Learning, McGraw Hill, 1997.
Optimization textbooks
- R. Fletcher, Practical Methods of Optimization, John Wiley, 2000.
- D. G. Luenberger and Y. Ye, Linear and Nonlinear Programming, Springer.
- Y. Nesterov, Introductory Lectures on Convex Optimization, Springer.
- S. Boyd and L. Vandenberghe, Convex Optimization, Cambridge University Press.
Academic honesty
As students of IISc, we expect you to adhere to the highest standards of academic honesty and integrity.
Elements of the course are designed to support your learning of the subject. Copying will not help you (in the exams or in the real world), so don't do it. If you have difficulties learning some of the topics or lack some background, try to form study groups where you can bounce off ideas with one another and try to teach each other what you understand. You're also welcome to talk to any of us and we'll be glad to help you.
If any exam/project is found to be copied, it will automatically result in a zero grade for that project and a warning note to your advisor. Any repeat instance will automatically lead to a failing grade in the course.