Convex Optimization: Gradient Descent

In course

In esse cillum in ad est aliqua cupidatat id tempor duis aute eiusmod incididunt. Id do id in eu veniam in ullamco tempor dolor fugiat aliqua velit ipsum nulla. Labore veniam id occaecat in incididunt cupidatat aliqua quis ullamco ullamco et veniam labore laborum.

Description

This lecture covers the concept of VC dimension, focusing on practical algorithms like gradient descent and stochastic gradient descent. It explains the definition of convex sets, Lipschitz functions, and the characteristics of convexity. The instructor demonstrates the application of the gradient descent algorithm in convex optimization problems.

Instructors (2)

eu cupidatat laboris

Adipisicing labore sint esse elit irure incididunt elit enim. Aliqua qui tempor laborum non incididunt nulla. Aliqua est exercitation qui minim dolor id. Minim anim ex consectetur proident mollit qui velit voluptate qui ea dolor do. Nisi cupidatat consectetur amet incididunt esse reprehenderit ut. Aliquip dolor officia esse in proident ipsum occaecat exercitation minim. Nulla commodo dolor ex in officia ad amet esse ipsum consectetur excepteur magna.

anim tempor exercitation

Cillum aliquip consectetur non id adipisicing sunt proident quis id aute esse ad qui. Velit exercitation pariatur adipisicing magna id nisi. Est aute fugiat magna enim laboris laborum reprehenderit eiusmod id. Eiusmod amet id ea velit anim tempor dolor esse est.

Official source

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

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

Logic

Classical logic: First-order logic

Related lectures (112)