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.
This lecture covers the transition from Gradient Descent (GD) to Conjugate Gradients (CG) for optimization on manifolds. Starting with the initialization and iterative steps of GD, it then introduces CG as a more efficient optimization method. The lecture explains how GD iterates are linear combinations of residues and how CG iterates are computed. Despite CG not finding the exact solution due to losing H-orthogonality, it is significantly better than GD, offering linear convergence with a faster rate. The lecture concludes by highlighting the importance of CG in achieving machine precision in optimization problems.