261-5110-00L  Optimization for Data Science

SemesterSpring Semester 2023
LecturersB. Gärtner, N. He
Periodicityyearly recurring course
Language of instructionEnglish



Courses

NumberTitleHoursLecturers
261-5110-00 VOptimization for Data Science3 hrs
Mon13:15-14:00NO C 60 »
Tue10:15-12:00ETF C 1 »
B. Gärtner, N. He
261-5110-00 UOptimization for Data Science2 hrs
Tue14:15-16:00CAB G 51 »
Fri14:15-16:00ML H 44 »
B. Gärtner, N. He
261-5110-00 AOptimization for Data Science4 hrsB. Gärtner, N. He

Catalogue data

AbstractThis course provides an in-depth theoretical treatment of optimization methods that are relevant in data science.
Learning objectiveUnderstanding the guarantees and limits of relevant optimization methods used in data science. Learning theoretical paradigms and techniques to deal with optimization problems arising in data science.
ContentThis course provides an in-depth theoretical treatment of classical and modern optimization methods that are relevant in data science.

After a general discussion about the role that optimization has in the process of learning from data, we give an introduction to the theory of (convex) optimization. Based on this, we present and analyze algorithms in the following four categories: first-order methods (gradient and coordinate descent, Frank-Wolfe, subgradient and mirror descent, stochastic and incremental gradient methods); second-order methods (Newton and quasi Newton methods); non-convexity (local convergence, provable global convergence, cone programming, convex relaxations); min-max optimization (extragradient methods).

The emphasis is on the motivations and design principles behind the algorithms, on provable performance bounds, and on the mathematical tools and techniques to prove them. The goal is to equip students with a fundamental understanding about why optimization algorithms work, and what their limits are. This understanding will be of help in selecting suitable algorithms in a given application, but providing concrete practical guidance is not our focus.
Prerequisites / NoticeA solid background in analysis and linear algebra; some background in theoretical computer science (computational complexity, analysis of algorithms); the ability to understand and write mathematical proofs.

Performance assessment

Performance assessment information (valid until the course unit is held again)
Performance assessment as a semester course
ECTS credits10 credits
ExaminersB. Gärtner, N. He
Typesession examination
Language of examinationEnglish
RepetitionThe performance assessment is only offered in the session after the course unit. Repetition only possible after re-enrolling.
Mode of examinationwritten 180 minutes
Additional information on mode of examinationAt four times during the course of the semester, we will hand out graded assignments (compulsory continuous performance assessments). The solutions are expected to be typeset in LaTeX or similar. Solutions will be graded and contribute 40% to the final grade. Concretely, let P1, P2, P3, P4 be the performances in the four graded assignments, measured as the percentage of points being attained (between 0% and 100%). A graded assignment that is not handed in is counted with a performance of 0%.
Let PE be the performance in the final exam. Then the overall course performance is computed as P = 0.1*P1 + 0.1*P2 + 0.1*P3 + 0.1*P4 + 0.6*PE. A course performance of P >= 50% is guaranteed to lead to a passing grade, but depending on the overall performance of the cohort, we may lower the threshold for a passing grade. Assignments can be discussed with colleagues, but we expect an independent writeup.
Written aids4 pages (A4) of written material (no restrictions regarding form or content)
This information can be updated until the beginning of the semester; information on the examination timetable is binding.

Learning materials

 
Main linkInformation
Only public learning materials are listed.

Groups

No information on groups available.

Restrictions

There are no additional restrictions for the registration.

Offered in

ProgrammeSectionType
CAS in Computer ScienceFocus Courses and ElectivesWInformation
Cyber Security MasterCore CoursesWInformation
Cyber Security MasterCore CoursesWInformation
DAS in Data ScienceMachine Learning and Artificial IntelligenceWInformation
Data Science MasterData ManagementWInformation
Computer Science MasterCore CoursesWInformation
Computer Science MasterCore CoursesWInformation
Computer Science MasterMinor in Theoretical Computer ScienceWInformation
Integrated Building Systems MasterSpecialised CoursesInformation
Mathematics MasterSelection: Further Realms and Some UZH CoursesWInformation
Mathematics MasterMachine LearningWInformation
Computational Science and Engineering MasterCore CoursesWInformation
Statistics MasterSubject Specific ElectivesWInformation