A Line-Search Descent Algorithm for Strict Saddle Functions with Complexity Guarantees

ICML 2020

A Line-Search Descent Algorithm for Strict Saddle Functions with Complexity Guarantees

Jul 14, 2020
|
51 views
|
Details
This is a video presentation of the paper "A Line-Search Descent Algorithm for Strict Saddle Functions with Complexity Guarantees" accepted at the ICML 2020 workshop Beyond First Order Methods in ML Systems. A list of accepted papers can be found here: https://sites.google.com/view/optml-icml2020/accepted-papers?authuser=0. The paper can be found on arXiv here: https://arxiv.org/abs/2006.07925.

Comments
loading...