|
Gatsby Computational
Neuroscience Unit |
|
Code: COMPGI02
Year: MSc in Intelligent Systems, Gatsby Unit Core Course
Prerequisites: Some background in statistics, calculus, linear algebra, and computer science. Any student or researcher at UCL is welcome to attend the lectures. Students wishing to take it for credit should consult with the course lecturers (email: zoubin @ gatsby.ucl.ac.uk ).
Term: 1
Time: 10.00 to 13.00 Tuesdays
Location: Cruciform Building Room 2.01
Taught By:
Zoubin Ghahramani (50%)
Carl E Rasmussen (50%)
| Oct 2: Introduction and Statistical Foundations |
|
Lecture Slides [ps.gz] [pdf] Assignment [ps.gz] [pdf] |
| Oct 9: Latent Variable Models |
|
Lecture Slides [ps.gz] [pdf] Assignment [ps.gz] [pdf] Suggested Readings: Welling Class Notes [ps.gz] [pdf] Roweis and Ghahramani article [ps.gz] [pdf] Minka linear algebra notes |
| Oct 16: The EM Algorithm |
|
Lecture Slides: [ps.gz]
[pdf] Assignment [ps.gz] [pdf] Matlab Code: mog.m, plot_gaussian.m Data: train1.mat |
| Oct 23: Latent Variable Time Series Models |
|
Lecture Slides: [ps.gz]
[pdf] Assignment [ps.gz][pdf] Geyser Data Set: geyser.txt LDS Code: lds.tar.gz, rdiv.m |
| Oct 30: Introduction to Graphical Models |
|
Lecture Slides: [ps.gz]
[pdf] Assignment [ps.gz][pdf] Reading: Chapter 4 of Pearl (1988) |
| Nov 13: Hierarchical and Nonlinear Models |
|
Lecture Slides: [pdf] Reading: Welling Notes on ICA Assignment: [ps.gz] [pdf] |
| Nov 20: Sampling Methods and Variational Approximations |
|
Lecture Slides (MCMC): [pdf] Lecture Slides (Variational): [pdf] Assignment: [pdf] Data: lindata.mat Suggested Readings: Radford Neal's Technical Report; and Jordan et al's Introduction to Variational Methods |
| Nov 27: Gaussian Processes |
|
Lecture Slides: [pdf] Assignment: [ps.gz] [pdf] Matlab Code: minimize Data: motorcycle.txt |
| Dec 11: Reinforcement Learning |
|
. |
Aims: This course provides students with an in-depth introduction to unsupervised learning techniques. It presents probabilistic approaches to modelling and their relation to coding theory and Bayesian statistics. A variety of latent variable models will be covered including mixture models (used for clustering), dimensionality reduction methods, time series models such as hidden Markov models which are used in speech recognition and bioinformatics, independent components analysis, hierarchical models, and nonlinear models. The course will present the foundations of probabilistic graphical models (e.g. Bayesian networks and Markov networks) as an overarching framework for unsupervised modelling. We will cover Markov chain Monte Carlo sampling methods and variational approximations for inference. Time permitting, students will also learn about Gaussian processes and the fundamentals of Bayesian decision theory/reinforcement learning/optimal control.
Learning Outcomes: To be able to understand the theory of unsupervised learning systems; to have in-depth knowledge of the main models used in UL; to understand the methods of exact and approximate inference in probabilistic models; to be able to recognise which models are appropriate for different real-world applications of machine learning methods.
Method: Lecture presentations with associated class problems.
Assessment:
Course Location: |
Tel: Email: |