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.
Lecture
Complexity Analysis of FGD Algorithm
Description
This lecture covers the complexity analysis of the FGD algorithm when applied to a sum of n functions, focusing on deriving a closed form expression for the average at each iteration and discussing the computational complexity and memory requirements in big O notation.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.