Lecture

Riemannian Gradient Descent: Convergence Theorem and Line Search Method

In course

Quis irure incididunt do reprehenderit dolore. Est sit labore reprehenderit non cillum reprehenderit esse. Dolore officia fugiat ullamco est duis sit dolore duis aute velit non.

Description

This lecture covers the convergence theorem of Riemannian Gradient Descent under certain assumptions, introducing the line search method for optimization on a Riemannian manifold. The slides present the mathematical details and conditions for the algorithm's convergence.

Official source

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

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

Mathematics

Geometry: Differential geometry

Related lectures (33)

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.