Course unit details:
Machine Learning and Optimisation Techniques
| Unit code | EEEN60151 |
|---|---|
| Credit rating | 15 |
| Unit level | FHEQ level 7 – master's degree or fourth year of an integrated master's degree |
| Teaching period(s) | Semester 1 |
| Offered by | Department of Electrical & Electronic Engineering |
| Available as a free choice unit? | No |
Overview
- Introduction of convex sets and convex functions.
- Illustrate convex optimization problems, including linear programming, quadratic programming, geometric programming, semi-definite programming.
- Introduce duality theory, including Lagrangian dual function, Lagrange dual problem, weak and strong duality, Interpretation of dual variables, KKT optimality conditions.
- Illustrate various convex optimization methods and algorithms, such as descent methods, Newton methods, sub-gradient method, interior point method.
- Provide some applications of convex optimization to signal processing and communications.
- Introduction to machine learning and optimisation.
- High-dimensional data representation. Basic multivariate statistical and regression models. Decision tree algorithms and Bayesian learning.
- Clustering and classification algorithms including SVMs.
- Introduction to neurons, human visual system and neural networks. Artificial neural networks (feedforward, recurrent) and their learning mechanisms: supervised and unsupervised.
- Introduction to deep learning neural networks and their implementations.
Aims
To provide a general overview of convex optimization theory and its applications.
To introduce various classical convex optimization problems and illustrate how to solve these numerically and analytically.
To introduce and practise basic machine learning techniques for multivariate data analysis and engineering applications.
To introduce and practise fundamental neural networks and their recent advances, esp. deep learning neural networks and implementations in practical applications.
Learning outcomes
ILO1 Design and apply machine learning and neural network algorithms or tools for regression, clustering and classification tasks in a wide range of applications.
ILO2 Design and apply algorithms for obtaining optimal solutions for convex optimization problems.
ILO3 Perform literature searching; scientific report writing; use of graphing and presentation packages; project design; team work; use of the discussion forum.
ILO4 Demonstrate a clear and detailed knowledge of the founding principles of convex sets and convex functions.
ILO5 Recognise and reason about situations arising in the use of optimization and machine learning.
ILO6 Demonstrate profound and detailed knowledge of machine learning and AI approaches to problem solving.
ILO7 Demonstrate clear knowledge of deep learning networks and their applications
Assessment methods
| Method | Weight |
|---|---|
| Written exam | 70% |
| Written assignment (inc essay) | 30% |
Feedback methods
.
Recommended reading
Stephen Boyd and Lieven Vandenberghe, Convex Optimization Cambridge University Press.
Chong-Yung Chi and Wei-Chiang Li , Convex Optimization for Signal Processing and Communications: From Fundamentals to Applications, CRC Press.
Richard O. Duda, Peter E. Hart, and David G. Stork, Pattern Classification, 2nd ed. Willey Interscience Publication.
Christopher M. Bishop, Pattern Recognition and Machine Learning, Springer.
Ian Goodfellow, Toshua Bengio, and Aaron Courville, Deep Learning, MIT Press.
Study hours
| Scheduled activity hours | |
|---|---|
| Lectures | 27 |
| Practical classes & workshops | 18 |
| Tutorials | 6 |
| Independent study hours | |
|---|---|
| Independent study | 99 |
Teaching staff
| Staff member | Role |
|---|---|
| Kaitao Meng | Unit coordinator |
