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
| Component | Marks |
|---|---|
| Mid-term examination | 20 |
| Assignments (2 × 15, programming) | 30 |
| End-term examination | 50 |
| Bonus assignment | TBD |
Tutorial and discussion sessions will be scheduled on an ongoing basis. Lecture notes, assignments and other course material are shared on the course's Microsoft Teams group.
Topics
| # | Topics |
|---|---|
| 1 | Let there be AI; on machine learning, data and models; distance-based classifiers; basic probability |
| 2 | Machine learning workflow; different types of learning; classification using Bayes rule; applications of machine learning |
| 3 | Introduction to supervised learning; some foundational aspects of ML |
| 4 | Linear regression; probabilistic view of linear regression; logistic regression; hyperplane-based classifiers and the perceptron |
| 5 | Probabilistic view of linear regression; logistic regression; hyperplane-based classifiers and the perceptron |
| 6 | Logistic regression; hyperplane-based classifiers and the perceptron |
| 7 | Support vector machines; kernel methods |
| 8 | Feed-forward neural networks; backpropagation; autoencoders; CNNs; RNNs |
| 9 | Unsupervised learning; dimensionality reduction; k-means clustering |
| 10 | Spectral clustering |
| 11 | EM algorithm |
| 12 | Introduction to probabilistic modeling; Markov random fields |
| 13 | Monte Carlo methods; typical sets; MCMC; Gibbs sampling; MRFs with latent variables |
Tutorials
| # | Topics | When | TA |
|---|---|---|---|
| 1 | Naive Bayes and Bayes decision theory | January | A R Shaarad |
| 2 | Linear regression and gradient descent | February | Parag Dutta |
| 3 | Support vector machines | — | A R Shaarad |
| 4 | Perceptrons; neural networks (MLPs, CNNs); backpropagation; vanishing gradients; Kaiming initialization; batch normalization; dropout | March | Parag Dutta |
| 5 | Generative modeling: GANs, VAEs and conditional VAEs | April | Mohd Ayyoob |
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.