We discuss a set of topics that are important for the understanding of modern data science but that are typically not taught in an introductory ML course. In particular we discuss fundamental ideas and techniques that come from probability, information the ...
This course provides an overview of key advances in continuous optimization and statistical analysis for machine learning. We review recent learning formulations and models as well as their guarantees
This course is concerned with randomized algorithms that have been developed during the last decade to solve large-scale linear algebra problems from, for example, scientific computing and statistical learning. Emphasis will be placed on both, the develop ...
In computational complexity we study the computational resources needed to solve problems and understand the relation between different types of computation.This course advances the students knowledge of computational complexity, and develop an understa ...
The course aims to introduce the basic concepts and results on metric embeddings, or more precisely on approximate embeddings. This area has been under rapid development since the 90's and it has strong impact on algorithms for discrete optimization proble ...
This course provides an overview of recent developments in online learning, game theory, and variational inequalities and their point of intersection with a focus on algorithmic development. The primary approach is to lay out the different problem classes ...
Statistical learning theory for supervised learning and generalization in PAC and online models (VC theory, MDL/SRM, covering numbers, Radamacher Averages, boosting, compression, stability and connection with strong convexity in Banch spaces); Computationa ...