A Line-Search Descent Algorithm for Strict Saddle Functions with Complexity Guarantees
Abstract
We describe a line-search algorithm which achieves the best-known worst-case complexity results for problems with a certain “strict saddle” property that has been observed to hold in low-rank matrix optimization problems. Our algorithm is adaptive, in the sense that it makes use of backtracking line searches and does not require prior knowledge of the parameters that define the strict saddle property.
Cite
Text
O'Neill and Wright. "A Line-Search Descent Algorithm for Strict Saddle Functions with Complexity Guarantees." Journal of Machine Learning Research, 2023.Markdown
[O'Neill and Wright. "A Line-Search Descent Algorithm for Strict Saddle Functions with Complexity Guarantees." Journal of Machine Learning Research, 2023.](https://mlanthology.org/jmlr/2023/oneill2023jmlr-linesearch/)BibTeX
@article{oneill2023jmlr-linesearch,
title = {{A Line-Search Descent Algorithm for Strict Saddle Functions with Complexity Guarantees}},
author = {O'Neill, Michael J. and Wright, Stephen J.},
journal = {Journal of Machine Learning Research},
year = {2023},
pages = {1-34},
volume = {24},
url = {https://mlanthology.org/jmlr/2023/oneill2023jmlr-linesearch/}
}