Skip to content
Switch branches/tags


Failed to load latest commit information.
Latest commit message
Commit time
Sep 13, 2020
May 4, 2021

EPFL Course - Optimization for Machine Learning - CS-439

Official coursebook information

Lectures: Posted every monday on youtube

Q&A: Fri 13:15-14:00 on zoom

Exercises: Fri 14:15-16:00 on zoom

This course teaches an overview of modern mathematical optimization methods, for applications in machine learning and data science. In particular, scalability of algorithms to large datasets will be discussed in theory and in implementation.



Convexity, Gradient Methods, Proximal algorithms, Subgradient Methods, Stochastic and Online Variants of mentioned methods, Coordinate Descent, Frank-Wolfe, Accelerated Methods, Primal-Dual context and certificates, Lagrange and Fenchel Duality, Second-Order Methods including Quasi-Newton Methods, Derivative-Free Optimization.

Advanced Contents:

Parallel and Distributed Optimization Algorithms

Computational Trade-Offs (Time vs Data vs Accuracy), Lower Bounds

Non-Convex Optimization: Convergence to Critical Points, Alternating minimization, Neural network training


Nr Date Topic Materials Exercises
#1 26.2. Introduction, Convexity notes, slides lab01
#2 5.3. Gradient Descent notes, slides lab02
#3 12.3. Projected Gradient Descent notes, slides lab03
#4 19.3. Proximal and Subgradient Descent notes, slides lab04
#5 26.3. Stochastic Gradient Descent, Non-Convex Optimization notes, slides lab05
. 2.4. easter vacation -
. 9.4. easter vacation -
#6 16.4. Non-Convex Optimization, Accelerated Gradient Descent notes, slides lab06
#7 23.4. Newton's Method & Quasi-Newton notes, slides lab07
#8 30.4. Frank-Wolfe notes, slides lab08
#9 7.5. Coordinate Descent notes, slides lab09
#10 14.5. Duality, Gradient-free, adaptive methods notes, slides lab10
#11 28.5. Opt for ML in Practice notes, slides Q&A
#12 4.6. Opt for ML in Practice notes, slides Q&A Projects
#13 11.4. Mini-Project week


The weekly exercises consist of a mix of theoretical and practical Python exercises for the corresponding topic each week (starting week 2). Solutions to theory exercises are available here, and for practicals in the lab folder.


A mini-project will focus on the practical implementation: Here we encourage students to investigate the real-world performance of one of the studied optimization algorithms or variants, helping to provide solid empirical evidence for some behaviour aspects on a real machine-learning task. The project is mandatory and done in groups of 3 students. It will count 20% to the final grade. Project reports (3 page PDF) are due June 18th. Here is a detailed project description.


Final written exam in exam session on Thursday 08.07.2021 from 08h15 to 11h15 (CE1, PO01). Format: Closed book. Theoretical questions similar to exercises. You are allowed to bring one cheat sheet (A4 size paper, both sides can be used), either handwritten or 11 point minimum font size. For practice: exam 2019, solutions 2019, exam 2018, solutions 2018.

Links to related courses and materials

Recommended Books


EPFL Course - Optimization for Machine Learning - CS-439



No releases published


No packages published