Announcements
- As last year, we use Canvas for course management. Join the course at canvas.instructure.com/enroll/XAELBR using your @iisc.ac.in 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 |
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.
Project presentations
| Title | Team |
|---|---|
| Sensitivity Analysis on DQN Variants | Renga Bashyam K G, Arun Govind M |
| ELMo: Deep Contextualized Word Representations | A R Shaarad, Prateek Sachan |
| Explainable Deep Learning | Anirudh Singh, Ankur Debnath, Deep Patel, Lalit Manam |
| Fake News | |
| Performance Analysis of Different Approaches to Network Embedding | Kishalay Das, Paarth Gupta, Kapil Pathak, Aalo Majumdar |
| Image Synthesis with Conditional Generative Adversarial Networks | Shreya Roy, Soumyajit Gangopadhyay |
| BERT | Arun Kanthali, Divyanshu Bhandari, Yash Patel |
| Graph Neural Networks | Mohammed Abdul Qaathir, Koppolu Anudeep, Palakshigari Sasidhar Manjunath |
| Adversarially Regularized Graph Autoencoder for Graph Embeddings | Abhishek Kumar, Anup Patel, Pragati Kumar Singh, Shivam Chauhan |
| Object Recognition in Neuromorphic Images using Spiking SVM | |
| Learning to Learn by Gradient Descent by Gradient Descent | Shrey Gupta, Aarsh Chotalia, Pratyush Menon |
| Mimicking Data by Learning Patterns on Data Constraints | Kapil Khurana, Vishal Goel |
| Single Shot Object Detection in Aerial Images | Mohd Haroon Ansari, Pooja Gupta, Maj. Govind |
| Zero-Shot Recognition Using GCN | Ameenudeen PE, Danish Shaikh, Deepa TM, Najath Pathiyil |
| Attention-Based Models for Text Summarization | Koushik Sen, Rahul Dev, Shah Manan Jayant, Upasana Doley |
| Open-World Knowledge Graph Completion | Bidhov Bizar, Anik Saha, Sarat Chandra, Uday Gulghane |
| Adversarial Training of Neural Networks for Cryptography Applications | Chandrasekhar S, Nagabhushan S N, Sandesh Rao M |
| Neural Dialog Generation | Siddharth Jha, Vinayak, Divij Mishra |
| Automatic Goal Generation for Reinforcement Learning Agents | Nikita Parate, Ankit Wahane, Ponsuganth Ilangovan |
| Graph Representation Learning | Nikita Yadav, Rashi Verma, Rishabh Gupta, Swyam Prakash Singh |
| Reinforcement Learning: Policy Gradient and TRPO | Dhiraj Shanbhag, Ashish Raghuvanshi, Waquar Azam |
| Deep Generative Models with a Focus on StackGAN | Gururaj K, Sakya Basak, Rahul Bansal, Rajat Nagpal |
| Spectral Clustering | Tapesh Yadav |
| Transformer Network for Abstractive Text Summarization | Aniruddha Bala, Chittersu Raghu, Ravi Raj Saxena |
| Unsupervised Abstractive Text Summarization | Aadesh Magare, Nilesh Kande, Rishabh Meshram, Shubham Sharma |
References
Recommended textbooks
- C. M. Bishop, Pattern Recognition and Machine Learning, Springer, 2006.
- R. O. Duda, P. E. Hart and D. G. Stork, Pattern Classification, Wiley-Interscience, 2nd edition, 2000.
- S. Haykin, Neural Networks: A Comprehensive Foundation, Pearson, 2004.
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.