B024317 - MACHINE LEARNING

• Supervised learning.



• Generalized linear models. Neural networks.



• Support vector machines. Kernels.



• Computational learning theory.



• Unsupervised learning.



• Probabilistic graphical models.



• Relational learning.



• Neural networks and feature learning.



• Applications.

• [HTF09] T. Hastie, R. Tibshirani, and J. Friedman (2009) Freely available online.



• Barber, D. (2012). Freely available online.



• Several scientific papers (see "materials" in the lectures list)

You will learn about several fundamental and some advanced algorithms for statistical learning, you will know the basics of computational learning theory, and will be able to design state-of-the-art solutions to application problems.

A good knowledge of a programming language, and a solid background in mathematics (calculus, linear algebra, and probability theory) are necessary prerequisites to this course. Previous knowledge of optimization techniques and statistics would be useful but not strictly necessary.

Lectures and practical sessions.

B024317: 9 CFU

• There is a single oral final exam. You can choose the exam topic but you are strongly advised to discuss with me before you begin working on it.


• Typically, you will be assigned a set of papers to read and will be asked to reproduce some experimental results.


• You will be required to give a short (30 min) presentation during the exam. Please ensure that your presentation includes an introduction to the problem being addressed, a brief review of relevant literature, technical derivation of methods, and, if appropriate, a detailed description of experimental work. You are allowed to use multimedia tools to prepare your presentation. You are responsible for understanding all the relevant concepts and the underlying theory.



• You can work in groups of two to carry out experimental works (three is an exceptional number that you must motivate clearly). If you do so, please ensure that personal contributions to the overall work are clearly identifiable.

B024318: 6 CFU

• There is a single oral final exam on a subset of topics (supervised learning, learning theory, grapical models)

<table summary="timetable" border="0" cellpadding="5" cellspacing="2"><tr style="background:#7d0004"><td style="color:#fff;font-weight: bold">Date<td style="color:#fff;font-weight: bold" width="50%%">Topics<td style="color:#fff;font-weight: bold">Readings/Handouts<tr style="background:#eeebde">2015-09-21 Administrivia. Introduction to the discipline of Machine Learning. Supervised learning. HTF09 1, 2.1, 2.2.
proxy-auth.unifi.it:8888 (with your credentals) if you are connecting from outside the campus network.