Name
Abstract | ||
|---|---|---|
We introduce NAMSG, an adaptive first-order algorithm for training neural networks. The method is efficient in computation and memory, and straightforward to implement. It computes the gradients at configurable remote observation points, in order to expedite the convergence by adjusting the step size for directions with different curvatures, in the stochastic setting. It also scales the updating vector elementwise by a nonincreasing preconditioner, to take the advantages of AMSGRAD. We analyze the convergence properties for both convex and nonconvex problems, by modeling the training process as a dynamic system, and provide a guideline to select the observation distance without grid search. We also propose a datadependent regret bound, which guarantees the convergence in the convex setting. Experiments demonstrate that NAMSG works well in practice and compares favorably to popular adaptive methods, such as ADAM, NADAM, and AMSGRAD. |
Year | Venue | DocType |
|---|---|---|
2019 | arXiv: Learning | Journal |
Volume | Citations | PageRank |
abs/1905.01422 | 0 | 0.34 |
References | Authors | |
0 | 8 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| chen yushu | 1 | 1 | 2.37 |
| Hao Jing | 2 | 0 | 0.68 |
| Wenlai Zhao | 3 | 17 | 6.42 |
| Zhiqiang Liu | 4 | 12 | 4.68 |
| Liang Qiao | 5 | 0 | 1.69 |
| Wei Xue | 6 | 400 | 52.95 |
| Haohuan Fu | 7 | 491 | 63.94 |
| Guangwen Yang | 8 | 599 | 92.40 |