{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T22:33:00Z","timestamp":1759530780528,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":8,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T00:00:00Z","timestamp":1496361600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ZJNSF","award":["LY16H080008"],"award-info":[{"award-number":["LY16H080008"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,2]]},"DOI":"10.1145\/3094243.3094249","type":"proceedings-article","created":{"date-parts":[[2017,6,26]],"date-time":"2017-06-26T12:13:28Z","timestamp":1498479208000},"page":"19-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["An improved Adam Algorithm using look-ahead"],"prefix":"10.1145","author":[{"given":"An","family":"Zhu","sequence":"first","affiliation":[{"name":"Dept. of Computer Science, Wenzhou-Kean University, Wenzhou, China"}]},{"given":"Yu","family":"Meng","sequence":"additional","affiliation":[{"name":"Dept. of Biological Science, Wenzhou-Kean University, Wenzhou, China"}]},{"given":"Changjiang","family":"Zhang","sequence":"additional","affiliation":[{"name":"Dept. of Computer Science, Wenzhou-Kean University, Wenzhou, China"}]}],"member":"320","published-online":{"date-parts":[[2017,6,2]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Adam: A Method for Stochastic Optimization. arXiv preprint arXiv:1412.6980","author":"Kingma D.","year":"2014","unstructured":"Kingma , D. and Ba , J . 2014 . Adam: A Method for Stochastic Optimization. arXiv preprint arXiv:1412.6980 Kingma, D. and Ba, J. 2014. Adam: A Method for Stochastic Optimization. arXiv preprint arXiv:1412.6980"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2604-3_16"},{"volume-title":"Proceedings of the 28th International Conference on Machine Learning (ICML-11)","author":"Ngiam J.","key":"e_1_3_2_1_3_1","unstructured":"Ngiam , J. , Coates , A. , Lahiri , A. , Prochnow , B. , Le , Q. V. , and Ng , A. Y . 2011. On optimization methods for deep learning . In Proceedings of the 28th International Conference on Machine Learning (ICML-11) . 265--272. Ngiam, J., Coates, A., Lahiri, A., Prochnow, B., Le, Q. V., and Ng, A. Y. 2011. On optimization methods for deep learning. In Proceedings of the 28th International Conference on Machine Learning (ICML-11). 265--272."},{"key":"e_1_3_2_1_4_1","unstructured":"Nesterov Y. 1983. A method for unconstrained convex minimization problem with the rate of convergence O (1\/k2). In Doklady an SSSR 543--547.  Nesterov Y. 1983. A method for unconstrained convex minimization problem with the rate of convergence O (1\/k2). In Doklady an SSSR 543--547."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2021068"},{"key":"e_1_3_2_1_6_1","unstructured":"Tieleman T. Hinton G. 2012. Lecture 6.5-rmsprop: Divide the gradient by a running average of its recent magnitude. COURSERA: Neural Networks for Machine Learning 4(2).  Tieleman T. Hinton G. 2012. Lecture 6.5-rmsprop: Divide the gradient by a running average of its recent magnitude. COURSERA: Neural Networks for Machine Learning 4(2)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627435.2670313"},{"volume-title":"Proceedings of the 31st International Conference on Machine Learning (ICML-14)","author":"Sohl-Dickstein J.","key":"e_1_3_2_1_8_1","unstructured":"Sohl-Dickstein , J. , Poole , B. , and Ganguli , S . 2014 Fast large-scale optimization by unifying stochastic gradient and quasi-newton methods . In Proceedings of the 31st International Conference on Machine Learning (ICML-14) , 604--612. Sohl-Dickstein, J., Poole, B., and Ganguli, S. 2014 Fast large-scale optimization by unifying stochastic gradient and quasi-newton methods. In Proceedings of the 31st International Conference on Machine Learning (ICML-14), 604--612."}],"event":{"name":"ICDLT '17: 2017 International Conference on Deep Learning Technologies","sponsor":["Southwest Jiaotong University"],"location":"Chengdu China","acronym":"ICDLT '17"},"container-title":["Proceedings of the 2017 International Conference on Deep Learning Technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3094243.3094249","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3094243.3094249","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:16Z","timestamp":1750217416000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3094243.3094249"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,2]]},"references-count":8,"alternative-id":["10.1145\/3094243.3094249","10.1145\/3094243"],"URL":"https:\/\/doi.org\/10.1145\/3094243.3094249","relation":{},"subject":[],"published":{"date-parts":[[2017,6,2]]},"assertion":[{"value":"2017-06-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}