{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T23:52:37Z","timestamp":1775692357677,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,12,4]],"date-time":"2022-12-04T00:00:00Z","timestamp":1670112000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,4]],"date-time":"2022-12-04T00:00:00Z","timestamp":1670112000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Fundamental Research Funds for Central Universities","award":["2020YJS012"],"award-info":[{"award-number":["2020YJS012"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s10957-022-02141-9","type":"journal-article","created":{"date-parts":[[2022,12,4]],"date-time":"2022-12-04T17:02:36Z","timestamp":1670173356000},"page":"900-935","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Parallelization Upper Bound for Asynchronous Stochastic Gradients Descent in Non-convex Optimization"],"prefix":"10.1007","volume":"196","author":[{"given":"Lifu","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,4]]},"reference":[{"key":"2141_CR1","unstructured":"Agarwal, A., Duchi, J.C.: Distributed delayed stochastic optimization. In: Taylor, J., Zemel, R., Bartlett, P., Pereira, F.C.N., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems, Granada, vol. 24, pp. 873\u2013881 (2011)"},{"key":"2141_CR2","unstructured":"Dean, J., Corrado, G., Monga, R., Chen, K., Devin, M., Mao, M., Ranzato, M., Senior, A., Tucker, P., Yang, K., Le, Q.V., Ng, A.Y.: Large scale distributed deep networks. In: Bartlett, P.L., Pereira, F.C.N., Burges, C.J.C., Bottou, L., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems, Lake Tahoe, vol. 25, pp. 1232\u20131240 (2012)"},{"issue":"6","key":"2141_CR3","first-page":"165","volume":"13","author":"O Dekel","year":"2012","unstructured":"Dekel, O., Gilad-Bachrach, R., Shamir, O., Xiao, L.: Optimal distributed online prediction using mini-Batches. J. Mach. Learn. Res. 13(6), 165\u2013202 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"2141_CR4","unstructured":"Du, S., Lee, J.: On the power of over-parametrization in neural networks with Quadratic Activation. In: Dy, J.G., Krause, A. (eds.) Proceedings of the 35th International Conference on Machine Learning, Stockholm, pp. 1329\u20131338 (2018)"},{"key":"2141_CR5","unstructured":"Fang, C., Lin, Z., Zhang, T.: Sharp analysis for nonconvex SGD escaping from saddle points. arXiv preprint arXiv:1902.00247 (2019)"},{"key":"2141_CR6","unstructured":"Ge, R., Huang, F., Jin, C., Yuan, Y.: Escaping from saddle points-online stochastic gradient for tensor decomposition. In : Gr\u00fcnwald, P., Hazan, E., Kale, S. (eds.) Proceedings of The 28th Conference on Learning Theory, Paris, pp. 797\u2013842 (2015)"},{"key":"2141_CR7","unstructured":"Ge, R., Lee, J. D., Ma, T.: Matrix completion has no spurious local minimum. In: Lee, D.D., Sugiyama, M., Luxburg, U.V., Guyon, I., Garnett, R. (eds.) Advances in Neural Information Processing Systems, Barcelona, vol. 29, pp. 2973\u20132981 (2016)"},{"issue":"4B","key":"2141_CR8","doi-asserted-by":"publisher","first-page":"B1127","DOI":"10.1103\/PhysRev.137.B1127","volume":"137","author":"S Golden","year":"1965","unstructured":"Golden, S.: Lower bounds for the Helmholtz function. Phys. Rev. 137(4B), B1127\u2013B1128 (1965)","journal-title":"Phys. Rev."},{"key":"2141_CR9","unstructured":"Jin, C., Ge, R., Netrapalli, P., Kakade, S. M., Jordan, M. I.: How to escape saddle points efficiently. In: Precup, D., Teh, Y.W. (eds.) Proceedings of the 34th International Conference on Machine Learning, Sydney, pp. 1724\u20131732 (2017)"},{"key":"2141_CR10","unstructured":"Jin, C., Netrapalli, P., Ge, R., Kakade, S.M., Jordan, M.I.: A short note on concentration inequalities for random vectors with subGaussian Norm. arXiv:1902.03736 (2019)"},{"key":"2141_CR11","unstructured":"Jin, C., Netrapalli, P., Ge, R., Kakade, S.M., Jordan, M.I.: Stochastic gradient descent escapes saddle points efficiently. arXiv:1902.04811v1 (2019)"},{"issue":"3","key":"2141_CR12","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0001-8708(73)90011-X","volume":"11","author":"EH Lieb","year":"1973","unstructured":"Lieb, E.H.: Convex trace functions and the Wigner\u2013Yanase\u2013Dyson conjecture. Adv. Math. 11(3), 267\u2013288 (1973)","journal-title":"Adv. Math."},{"key":"2141_CR13","unstructured":"Lian, X., Huang, Y., Li, Y., Ji, L.: Asynchronous parallel stochastic gradient for nonconvex optimization. In: Cortes, C., Lawrence, N.D., Lee, D.D., Sugiyama, M., Garnett, R. (eds.) Advances in Neural Information Processing Systems, Montreal, vol. 28, pp. 2737\u20132745 (2015)"},{"issue":"10","key":"2141_CR14","first-page":"285","volume":"16","author":"J Liu","year":"2015","unstructured":"Liu, J., Wright, S.J., R\u00e9, C., Bittorf, V., Sridhar, S.: An asynchronous parallel stochastic coordinate descent algorithm. J. Mach. Learn. Res. 16(10), 285\u2013322 (2015)","journal-title":"J. Mach. Learn. Res."},{"issue":"24","key":"2141_CR15","doi-asserted-by":"publisher","first-page":"2225","DOI":"10.1007\/BF02885926","volume":"44","author":"X Mao","year":"1999","unstructured":"Mao, X.: Razumikhin-type theorems on exponential stability of neutral stochastic differential equations. Chin. Sci. Bull. 44(24), 2225\u20132228 (1999)","journal-title":"Chin. Sci. Bull."},{"issue":"2","key":"2141_CR16","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0304-4149(96)00109-3","volume":"65","author":"X Mao","year":"1996","unstructured":"Mao, X.: Razumikhin-type theorems on exponential stability of stochastic functional differential equations. Stoch. Process. Appl. 65(2), 233\u2013250 (1996)","journal-title":"Stoch. Process. Appl."},{"key":"2141_CR17","unstructured":"Recht, B., Re, C., Wright, S.J., Niu, F.: Hogwild: A Lock-free approach to parallelizing stochastic gradient descent. In: Taylor, J., Zemel, R., Bartlett, P., Pereira, F.C.N., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems, Granada, vol. 24, pp. 693\u2013701 (2011)"},{"issue":"1","key":"2141_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00220-016-2778-5","volume":"352","author":"D Sutter","year":"2017","unstructured":"Sutter, D., Berta, M., Tomamichel, M.: Multivariate trace inequalities. Commun. Math. Phys. 352(1), 1\u201322 (2017)","journal-title":"Commun. Math. Phys."},{"issue":"11","key":"2141_CR19","first-page":"975","volume":"7","author":"H Yun","year":"2014","unstructured":"Yun, H., Yu, H., Hsieh, C., Vishwanathan, S.V.N., Dhillon, I.S.: NOMAD: non-locking, stochastic multi-machine algorithm for asynchronous and decentralized matrix completion. Very Large Data Bases 7(11), 975\u2013986 (2014)","journal-title":"Very Large Data Bases"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02141-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-022-02141-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-022-02141-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T03:02:07Z","timestamp":1679886127000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-022-02141-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,4]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["2141"],"URL":"https:\/\/doi.org\/10.1007\/s10957-022-02141-9","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,4]]},"assertion":[{"value":"16 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}