Course - Optimisation for Data Science HT25

Created: January 20, 2025
Updated: February 06, 2025

---

• Course Webpage
• Lecture Notes
• From the previous year:
  • Lecture Notes
  • 1, Scope and examples
  • 2, Terminology and prerequisites
  • 3, Method of steepest descent
  • 4, The proximal method
  • 5, Acceleration of gradient methods
  • 6, Stochastic gradient descent
  • 7, Reducing the noise floor in SGD
  • 8, Coordinate descent
  • 9, Practical coordinate descent
  • 10, Outlook (non-examinable)
• Other courses this term: [[Courses HT25]]^U

Notes

• [[Notes - Optimisation for Data Science HT25, Basic definitions]]^U
• [[Notes - Optimisation for Data Science HT25, Steepest descent]]^U
• [[Notes - Optimisation for Data Science HT25, Proximal methods]]^U

Problem Sheets

• From the previous year:
  • Sheet 1, partial answers
  • Sheet 2, partial answers
  • Sheet 3, partial answers
  • Sheet 4, partial answers

To-Do List

---

Related posts

• [[Courses HT25]]^U

  (outgoing)
• [[Notes - Optimisation for Data Science HT25, Basic definitions]]^U

  (outgoing)
• [[Notes - Optimisation for Data Science HT25, Steepest descent]]^U

  (outgoing)
• [[Notes - Optimisation for Data Science HT25, Proximal methods]]^U

  (outgoing)
• [[University Notes]]^U

  (incoming)
• [[Part B]]^U

  (incoming)
• [[Course - Design and Analysis of Algorithms HT23]]^U

  (sim: 0.633)
• [[Course - Set Theory HT25]]^U

  (sim: 0.629)
• [[Course - Continuous Mathematics HT23]]^U

  (sim: 0.594)