Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the convexity of Lovász extension and submodular function maximization, explaining the concept of extending functions to convex sets and proving the convexity property. The instructor, Michael Kapralov, demonstrates how to find the minimum value of a function over a set and maps it to the real numbers, emphasizing the importance of convexity in optimization problems.