## Abstract

While there has been a significant amount of work studying gradient descent techniques for non-convex optimization problems over the last few years, all existing results establish either local convergence with good rates or global convergence with highly suboptimal rates, for many problems of interest. In this paper, we take the first step in getting the best of both worlds – establishing global convergence and obtaining a good rate of convergence for the problem of computing squareroot of a positive definite (PD) matrix, which is a widely studied problem in numerical linear algebra with applications in machine learning and statistics among others. Given a PD matrix M and a PD starting point U_{0}, we show that gradient descent with appropriately chosen stepsize finds an ε-accurate squareroot of M in (Formula presented) iterations, where (Formula presented). Our result is the first to establish global convergence for this problem and that it is robust to errors in each iteration. A key contribution of our work is the general proof technique which we believe should further excite research in understanding deterministic and stochastic variants of simple non-convex gradient descent algorithms with good global convergence rates for other problems in machine learning and numerical linear algebra.

Original language | English (US) |
---|---|

State | Published - 2017 |

Externally published | Yes |

Event | 20th International Conference on Artificial Intelligence and Statistics, AISTATS 2017 - Fort Lauderdale, United States Duration: Apr 20 2017 → Apr 22 2017 |

### Conference

Conference | 20th International Conference on Artificial Intelligence and Statistics, AISTATS 2017 |
---|---|

Country/Territory | United States |

City | Fort Lauderdale |

Period | 4/20/17 → 4/22/17 |

## All Science Journal Classification (ASJC) codes

- Artificial Intelligence
- Statistics and Probability