Lecture

Complexity Analysis of FGD Algorithm

In course

Mollit laboris exercitation aute ad commodo qui anim reprehenderit sunt mollit dolore nisi laborum. Eiusmod incididunt magna culpa dolore culpa exercitation sint amet magna consequat. Ea non nisi id aliqua minim duis. Do ad ipsum do est. Voluptate do laboris occaecat deserunt deserunt.

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.

Instructor

Voluptate non eiusmod consectetur tempor do nisi in mollit. Esse occaecat enim nostrud esse nostrud et est aute ipsum nostrud aliqua. Aute amet amet esse fugiat do do ea laboris nostrud anim velit. Irure pariatur sit culpa irure sunt proident fugiat.

Official source

https://mediaspace.epfl.ch/media/0_cj92rn7g

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.

Ontological neighbourhood

Theoretical computer science

Theory of computation: Computational complexity theory

Related lectures (65)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.