Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the concepts of feature expansion and kernel methods in machine learning. It starts with a recap of linear models, margin, maximum margin classifier, and support vector machines. It then delves into topics like overlapping classes, slack variables, different linear models for classification, and the impact of loss functions. The lecture progresses to discuss polynomial curve fitting, nearest neighbor methods, k-nearest neighbors, curse of dimensionality, and nonlinear classification. It concludes with an in-depth exploration of polynomial feature expansion, kernel functions, kernel regression, kernel SVM, and the kernel trick.