Every Local Minimum Value Is the Global Minimum Value of Induced Model in Nonconvex Machine Learning

Every Local Minimum Value Is the Global Minimum Value of Induced Model in Nonconvex Machine Learning

For nonconvex optimization in machine learning, this article proves that every local minimum achieves the globally optimal value of the perturbable gradient basis model at any differentiable point. As a result, nonconvex machine learning is theoretically as supported as convex machine learning with...

Полное описание

Библиографические подробности
Главные авторы: Kawaguchi, Kenji, Huang, Jiaoyang, Kaelbling, Leslie P
Другие авторы: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Формат: Статья
Язык:English
Опубликовано: MIT Press - Journals 2021
Online-ссылка:https://hdl.handle.net/1721.1/129666

Internet

https://hdl.handle.net/1721.1/129666

Схожие документы