A Line-Search Descent Algorithm for Strict Saddle Functions with Complexity Guarantees - CrossMinds.ai
A Line-Search Descent Algorithm for Strict Saddle Functions with Complexity Guarantees
Jul 14, 202010 views
Michael O'Neill
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.
ICML 2020
Recommended