Undergraduate Course: Machine Learning Theory (INFR11202)
|School||School of Informatics
||College||College of Science and Engineering
|Credit level (Normal year taken)||SCQF Level 11 (Year 4 Undergraduate)
||Availability||Available to all students
|Summary||This course is an introduction to the theory of learning algorithms and their properties that are relevant to the widespread use of machine learning. The course starts with the standard mathematical concepts in theoretical ML. It then covers classical analytic results about accuracy, confidence, sample complexity and model complexity. Standard learning/optimisation algorithms are described in this context. In modern research areas such as trustworthy machine learning, several properties including privacy, fairness and interpretablity are considered vital for widespread reliable use of machine learning. These topics are discussed in a mathematical perspective.
The course aims to provide a firm foundation in reading and understanding mathematical ideas so that students are equipped to follow the latest developments and research, and to interpret relevant properties and tradeoffs. Throughout, the course will take the approach of precise mathematical definition and analysis, coupled with easy examples and intuition to aid understanding.
The following is an indicative list of topics in the course:
1. Notations, terminology and formal models.
2. Learning theory: Empirical risk minimisation and sampling complexity. Probably approximately correct (PAC) guarantees.
3. Complexity of learning models (e.g. VC dimension) and bias-complexity tradeoff.
4. Optimization algorithms. Regression, SVM, Stochastic gradient descent and its variants.
5. Regularization, convexity, stability, Lipschitzness and other properties
6. Statistical Privacy
7. Mechanisms for privacy preserving machine learning. Differentially private stochastic gradient descent.
8. Interpretable machine learning. (E.g. Feature importance)
The topics will be discussed with reference to standard machine learning techniques, and examples of realistic problems. Our approach will include precise definitions and analysis as well as examples and intuitive explanations. The relevance and domain of applicability of the various concepts will be discussed.
Tutorials and problem sets will be available to help understanding and exploration of the subject.
Information for Visiting Students
|High Demand Course?
Course Delivery Information
|Academic year 2022/23, Available to all students (SV1)
|Learning and Teaching activities (Further Info)
Lecture Hours 18,
Seminar/Tutorial Hours 3,
Feedback/Feedforward Hours 1,
Summative Assessment Hours 2,
Revision Session Hours 1,
Programme Level Learning and Teaching Hours 2,
Directed Learning and Independent Learning Hours
|Assessment (Further Info)
|Additional Information (Assessment)
||Written Exam 70%
||Students will receive feedback in the forms of assessment of coursework, tutorials, and problem sets.
||Hours & Minutes
|Main Exam Diet S2 (April/May)||Machine Learning Theory (INFR11202)||2:00|
On completion of this course, the student will be able to:
- Interpret and explain rigorous statements about properties of machine learning methods.
- Evaluate properties of learning models through proofs and examples.
- Relate, compare, and contrast the implications of various qualities of machine learning models covered in the course.
- Formulate precise mathematical requirements corresponding to desired properties in real learning problems, and explain their decisions.
|'Understanding Machine Learning: From Theory to Algorithms', by Shai Ben-David and Shai Shalev-Schwartz|
|Graduate Attributes and Skills
Critical / analytical thinking
|Keywords||Machine Learning,Data Science,Algorithms,Theory
|Course organiser||Dr Rik Sarkar
Tel: (0131 6)50 4444
|Course secretary||Mrs Helen Tweedale
Tel: (0131 6)50 2692