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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MIT Press Journals
2019
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |