University of Cambridge > Talks.cam > CCIMI Short course: First-order methods for large scale optimisation problems > First-order methods for large scale optimisation problems - Modern first-order methods for structured convex problems

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

First-order methods for large scale optimisation problems - Modern first-order methods for structured convex problems

Download to your calendar using vCal

If you have a question about this talk, please contact Rachel Furner .

Part of the CCIMI short course ‘First-order methods for large scale optimisation problems’

Instructor: Stephen Becker, University of Colorado

Lecture 3: Modern first-order methods for structured convex problems Starting with gradient descent, the proximal point method, and subgradient descent, we then explore accelerated and proximal variants (such as FISTA ), and finally discuss stochastic gradient descent (SGD) and variance-reduced versions such as SVRG and SAGA . There will be an interlude with convergence analysis for some of these methods and discussion of step-sizes.

This talk is part of the CCIMI Short course: First-order methods for large scale optimisation problems series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Computer Lab, FW26 and Online Online - Teams. Please email div-c@eng.cam.ac.uk for the link zoom webinar - email jrt51@cam.ac.uk or jn271@cam.ac.uk for link

Other talks

Afternoon Break Spectral rigidity of random covers of compact hyperbolic surfaces Geometry and Generalization: The case of Grokking Title TBC Group Work A Data-Centric Approach to AI Adaptation and Alignment
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity