Lecture room: Batiment Eifffel, CentraleSupélec
Instructor: Fragkiskos Malliaros
Email: fragkiskos.me [at] gmail.com
Office hours: Right after class (or send me an email and we will find a good time to meet)
TA: Sylvain Lannuzel
Email: sylvain.s.lannuzel [at] gmail.com
Machine learning is the scientific field that provides computers the ability to learn without being explicitly programmed (definition by Wikipedia). Machine learning lies at the heart of many real-world applications, including recommender systems, web search, computer vision, autonomous cars and automatic language translation.
The course will provide an overview of fundamental topics as well as important trends in machine learning, including algorithms for supervised and unsupervised learning, dimensionality reduction methods and their applications. A substantial lab section will involve group projects on a data science competition and will provide the students the ability to apply the course theory to real-world problems.
Schedule and Lectures
The topics of the lectures are subject to change (the following schedule outlines the topics that will be covered in the course). The slides for each lecture will be posted in piazza
just before the start of the class. The due dates of the assignments/project are subject to change.
|1||October 9||Introduction; Model selection and evaluation||Lecture 1||
|2||October 16||Dimensionality reduction||Lecture 2||Assignment 1 out
|3||October 23||Linear and logistic regression||Lecture 3||Project proposal due on October 27
|4||October 30||Probabilistic classifiers and linear discriminant analysis||Lecture 4||Assignment 1 due on November 3 Assignment 2 out
|5||November 6||Non-parametric learning and nearest neighbor methods||Lecture 5||
|6||November 14||Tree-based methods and ensemble learning||Lecture 6||
|7||November 21||Support Vector Machines||Lecture 7||Assignment 2 due on November 24
|8||November 28||Unsupervised learning: clustering||Lecture 8||
|9||December 5||Project presentations||Project final report due
[October 9] Lecture 1: Introduction; Model selection and evaluation
Introduction to machine learning, administrivia, course structure and overview of the topics that will be covered in the course. Overfitting and generalization. Bias-variance tradeoff. Training, validation and test sets. Cross-validation. Evalution of supervised learning algorithms.
- M. Kuhn and K. Johnson. An Introduction to Feature Selection. Applied Predictive Modeling, pages 487-519, 2013. [For the part of the lecture on feature selection].
- Concentration of the empirical risk (also here), lecture notes by Dimitris Papailiopoulos (UW-Madison).
- Model evaluation, model selection, and algorithm selection in machine learning: Part I (Basics), Part II (Bootstrapping and uncertainties), and Part III (Cross-validation and hyperparameter tuning). Interesting blog post by Sebastian Raschka, 2016.
- Convex Optimization: Algorithms and Complexity (Sections 1.1, 1.2, 1.3)
- Convex optimization and gradient descent, lecture notes by Nisheeth Vishnoi, EPFL (Sections 1.1, 1.2, 1.3)
[October 16] Lecture 2: Dimensionality reduction
Dimemensionality reduction techniques. Singular Value Decomposition (SVD). Principal Component Analysis (PCA). Multidimensional Scaling (MDS) and nonlinear dimensionality reduction.
- SVD and Low Rank Matrix Approximations, lecture notes by Tim Roughgarden and Gregory Valiant (Stanford University)
- Understanding Machine Learning: From Theory to Algorithms (Section 23.1)
- J. B. Tenenbaum, V. De Silva, and J. C. Langford. A Global Geometric Framework for Nonlinear Dimensionality Reduction. Science, 290:5500, pp. 2319-2323, 2000
- S. T. Roweis and L. K. Saul. Nonlinear Dimensionality Reduction by Locally Linear Embedding. Science, 290:5500, pp. 2323-2326, 2000
- M. Belkin and P. Niyogi. Laplacian eigenmaps and spectral techniques for embedding and clustering. In NIPS, 2001
[October 23] Lecture 3: Linear and logistic regression
Supervised learning models. Linear regression. Linear classification models. Logistic regression. Maximum likelihood estimation.
[October 30] Lecture 4: Probabilistic classifiers and linear discriminant analysis
Bayes rule. Naive Bayes classifier. Maximum a posterioti estimation. Linear discriminant analysis (LDA).
[November 6] Lecture 5: Non-parametric learning and nearest neighbor methods
Introduction to non-parametric learning methods. Distance and similarity metrics. Nearest neighbor algorithms.
[November 14] Lecture 6: Tree-based methods and ensemble learning
Decision trees. Ensemble learning. Bagging and Boosting. The AdaBoost algorithm.
[November 21] Lecture 7: Support Vector Machines
Maximum margin classifier. Linear SVMs. Primal and dual optimization problems. Non-linearly separable data and the kernel trick. Regularization and the non-separable case.
[November 28] Lecture 8: Unsupervised learning: clustering
Introduction to unsupervised learning methods. Data clustering. Hierarchical clustering. k-means clustering. Spectral clustering.
Lecture XX: Project presentations
Presentation of the projects of each team.
Course Structure and Objectives
Each section of the course is divided into 1h30' lecture and 1h30' lab. The labs will include hands-on assignments (using Python) and will provide the students the opportunity to deal with ML tasks in practice.
The course aims to introduce students to the field of machine learning by:
- Covering a wide range of topics, methodologies and related applications.
- Giving the students the opportunity to obtain hands-on experience on dealing with real-world problems.
We expect that by the end of the course, the students will be able to:
- Identify problems that can be solved using machine learning methodologies.
- Given a problem, identify and apply the most appropriate algorithm(s).
- Implement some of those algorithms from scratch.
- Evaluate and compare machine learning algorithms for a
- Deal with real-world data challenges.
There is no official prerequisite for this course. However, the students are expected to:
- Have basic knowledge of probability theory and linear algebra.
- Be familiar with at least one programming language (e.g., Python or any language of their preference).
There is no single required textbook for the course. We will recommend specific chapters from the following books:
- Shai Shalev-Shwartz and Shai Ben-David. Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press, 2014.
- Christopher M. Bishop. Pattern Recognition and Machine Learning. Springer, 2011.
- Trevor Hastie, Robert Tibshirani, and Jerome Friedman. The Elements of Statistical Learning: Data Mining, Inference, and Prediction. Second Edition, Springer, 2017.
- Jure Leskovec, Anand Rajaraman, and Jeff Ullman. Mining of Massive Datasets. Cambridge University Press, 2014.
The evaluation of the course will be based on the following:
- Two assignments: the assignments will include theoretical questions as well hands-on practical questions and will familiarize the students with basic machine learning tasks.
- Project: The students are expected to form groups of 3-4 people, propose a topic for their project, and submit a final project report (it would also be interesting to organize a poster session at the end of the quarter). Please, read the project section for more details.
The grading will be as follows:
| Assignment 1 (individual): || 15%
| Assignment 2 (groups of 3-4 students): || 35%
|| Project (groups of 3-4 students): || 50%
All of your work must be your own. Don't copy another student's assignment, in part or in total, and submit it as your own work. Acknowledge and cite source material in your papers or assignments.
Details about the project of the course will be posted soon on piazza.
Please find below a list of conferences related to the contents of the course (mostly in the field of machine learning and data mining. We provide the DBLP website of each venue where you can access the proceedings (papers, tutorials, etc).
Check out the website of each conference (e.g., KDD 2016
) for more information.