{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T05:22:06Z","timestamp":1739942526200,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T00:00:00Z","timestamp":1739836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T00:00:00Z","timestamp":1739836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-025-03750-7","type":"journal-article","created":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T18:58:46Z","timestamp":1739905126000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Spawning Gradient Descent (SpGD): A Novel Optimization Framework for Machine Learning and Deep Learning"],"prefix":"10.1007","volume":"6","author":[{"given":"Moeinoddin","family":"Sheikhottayefe","sequence":"first","affiliation":[]},{"given":"Zahra","family":"Esmaily","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6262-1898","authenticated-orcid":false,"given":"Fereshte","family":"Dehghani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,18]]},"reference":[{"issue":"4\u20135","key":"3750_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0925-2312(93)90006-O","volume":"5","author":"S-i Amari","year":"1993","unstructured":"Amari S-i. Backpropagation and stochastic gradient descent method. Neurocomputing. 1993;5(4\u20135):185\u201396.","journal-title":"Neurocomputing"},{"key":"3750_CR2","doi-asserted-by":"crossref","unstructured":"Zou F, Shen L, Jie Z, Zhang W, Liu W. A sufficient condition for convergences of adam and rmsprop. In: Proceedings of the IEEE CVF Conference on Computer Vision and Pattern Recognition, 2019:11127\u201311135.","DOI":"10.1109\/CVPR.2019.01138"},{"key":"3750_CR3","unstructured":"D\u00e9fossez A, Bottou L, Bach F, Usunier N. A simple convergence proof of adam and adagrad. arXiv preprint arXiv:2003.02395 2020."},{"key":"3750_CR4","unstructured":"Ruder S. An overview of gradient descent optimization algorithms. arXiv preprint arXiv:1609.04747 2016."},{"issue":"1\u20132","key":"3750_CR5","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10107-021-01712-4","volume":"196","author":"H Hazimeh","year":"2022","unstructured":"Hazimeh H, Mazumder R, Saab A. Sparse regression at scale: Branch-and-bound rooted in first-order optimization. Math Program. 2022;196(1\u20132):347\u201388.","journal-title":"Math Program."},{"key":"3750_CR6","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.cjche.2022.10.021","volume":"58","author":"D Chen","year":"2023","unstructured":"Chen D, Luo Y, Yuan X. Cascade refrigeration system synthesis based on hybrid simulated annealing and particle swarm optimization algorithm. Chin J Chem Eng. 2023;58:244\u201355.","journal-title":"Chin J Chem Eng."},{"issue":"1","key":"3750_CR7","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s43926-023-00036-3","volume":"3","author":"F Sajjad","year":"2023","unstructured":"Sajjad F, Rashid M, Zafar A, Zafar K, Fida B, Arshad A, Riaz S, Dutta AK, Rodrigues JJ. An efficient hybrid approach for optimization using simulated annealing and grasshopper algorithm for iot applications. Discover Internet Things. 2023;3(1):7.","journal-title":"Discover Internet Things"},{"issue":"1","key":"3750_CR8","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s11831-022-09801-z","volume":"30","author":"SK Sahoo","year":"2023","unstructured":"Sahoo SK, Saha AK, Ezugwu AE, Agushaka JO, Abuhaija B, Alsoud AR, Abualigah L. Moth flame optimization: theory, modifications, hybridizations, and applications. Arch Comput Methods Eng. 2023;30(1):391\u2013426.","journal-title":"Arch Comput Methods Eng."},{"key":"3750_CR9","doi-asserted-by":"crossref","unstructured":"Abualigah L, AlNajdawi S, Ikotun AM, Forestiero A, Gul F, Ezugwu AE, Jia H, Zare M, Mahajan S, Alshinwan M. Quantum approximate optimization algorithm: a review study and problems. Metaheuristic Optimization Algorithms, 2024;147\u2013165","DOI":"10.1016\/B978-0-443-13925-3.00007-8"},{"key":"3750_CR10","doi-asserted-by":"crossref","unstructured":"Abualigah L, Ikotun AM, Zitar RA, Alsoud AR, Khodadadi N, Ezugwu AE, Hanandeh ES, Jia H, et al. Whale optimization algorithm: analysis and full survey. In: Metaheuristic Optimization Algorithms, pp. 105\u2013115. Elsevier, 2024.","DOI":"10.1016\/B978-0-443-13925-3.00015-7"},{"issue":"1","key":"3750_CR11","doi-asserted-by":"publisher","first-page":"13088","DOI":"10.1111\/exsy.13088","volume":"40","author":"K Balasubramanian","year":"2023","unstructured":"Balasubramanian K, Nalligoundenpalayam Periyasamy A, Kishore R. Modified spider monkey optimization algorithm based feature selection and probabilistic neural network classifier in face recognition. Expert Syst. 2023;40(1):13088.","journal-title":"Expert Syst."},{"key":"3750_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.est.2022.105311","volume":"55","author":"W Jiang","year":"2022","unstructured":"Jiang W, Wang X, Huang H, Zhang D, Ghadimi N. Optimal economic scheduling of microgrids considering renewable energy sources based on energy hub model using demand response and improved water wave optimization algorithm. J Energy Storage. 2022;55: 105311.","journal-title":"J Energy Storage"},{"key":"3750_CR13","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.ins.2021.10.070","volume":"583","author":"IA Zamfirache","year":"2022","unstructured":"Zamfirache IA, Precup R-E, Roman R-C, Petriu EM. Reinforcement learning-based control using q-learning and gravitational search algorithm with experimental validation on a nonlinear servo system. Inform Sci. 2022;583:99\u2013120.","journal-title":"Inform Sci."},{"key":"3750_CR14","doi-asserted-by":"crossref","unstructured":"Luo Q, Wu G, Trivedi A, Hong F, Wang L, Srinivasan D. Multi-objective optimization algorithm with adaptive resource allocation for truck-drone collaborative delivery and pick-up services. IEEE Transactions on Intelligent Transportation Systems 2023.","DOI":"10.1109\/TITS.2023.3267103"},{"key":"3750_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.est.2022.104756","volume":"52","author":"MA Taghikhani","year":"2022","unstructured":"Taghikhani MA, Khamseh J. Multi-objective optimal energy management of storage system and distributed generations via water cycle algorithm concerning renewable resources uncertainties and pollution reduction. J Energy Storage. 2022;52: 104756.","journal-title":"J Energy Storage"},{"issue":"18","key":"3750_CR16","doi-asserted-by":"publisher","first-page":"13529","DOI":"10.1007\/s00521-023-08451-x","volume":"35","author":"D Maden","year":"2023","unstructured":"Maden D, \u00c7elik E, Houssein EH, Sharma G. Squirrel search algorithm applied to effective estimation of solar pv model parameters: a real-world practice. Neural Comput Appl. 2023;35(18):13529\u201346.","journal-title":"Neural Comput Appl"},{"issue":"8","key":"3750_CR17","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1515\/mt-2023-0015","volume":"65","author":"SM Sait","year":"2023","unstructured":"Sait SM, Mehta P, G\u00fcrses D, Yildiz AR. Cheetah optimization algorithm for optimum design of heat exchangers. Mater Test. 2023;65(8):1230\u20136.","journal-title":"Mater Test."},{"key":"3750_CR18","unstructured":"Sutton RS. Two problems with backpropagation and other steepest-descent learning procedures for networks. In: Proc. of Eightth Annual Conference of the Cognitive Science Society, 1986;823\u2013831."},{"issue":"1","key":"3750_CR19","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0893-6080(98)00116-6","volume":"12","author":"N Qian","year":"1999","unstructured":"Qian N. On the momentum term in gradient descent learning algorithms. Neural Netw. 1999;12(1):145\u201351.","journal-title":"Neural Netw"},{"key":"3750_CR20","unstructured":"Nesterov YE. A method of solving a convex programming problem with convergence rate $$o(1\/k^2)$$. In: Doklady Akademii Nauk, 1983;269:543\u2013547. Russian Academy of Sciences"},{"key":"3750_CR21","unstructured":"Keskar NS, Mudigere D, Nocedal J, Smelyanskiy M, Tang PTP. On large-batch training for deep learning: Generalization gap and sharp minima. arXiv preprint arXiv:1609.04836 2016."},{"key":"3750_CR22","unstructured":"Duchi J, Hazan E, Singer Y. Adaptive subgradient methods for online learning and stochastic optimization. J Mach Learn Res 2011;12(7)."},{"key":"3750_CR23","unstructured":"Hinton GE, Srivastava N, Krizhevsky A, Sutskever I, Salakhutdinov RR. Improving neural networks by preventing co-adaptation of feature detectors. arXiv preprint arXiv:1207.0580 2012."},{"key":"3750_CR24","unstructured":"Liu L, Jiang H, He P, Chen W, Liu X, Gao J, Han J. On the variance of the adaptive learning rate and beyond. arXiv preprint arXiv:1908.03265 2019."},{"key":"3750_CR25","unstructured":"Dozat T. Incorporating nesterov momentum into adam 2016."},{"key":"3750_CR26","unstructured":"Xie X, Zhou P, Li H, Lin Z, Yan S. Adan: Adaptive nesterov momentum algorithm for faster optimizing deep models. arXiv preprint arXiv:2208.06677 2022."},{"key":"3750_CR27","unstructured":"Zhuang J, Tang T, Ding Y, Tatikonda S, Dvornek N, Papademetris X, Duncan JS. Adabelief optimizer: Adapting stepsizes by the belief in observed gradients. Advances in Neural Information Processing Systems 2020;33."},{"issue":"2","key":"3750_CR28","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1137\/21M1453311","volume":"15","author":"B Wang","year":"2022","unstructured":"Wang B, Nguyen T, Sun T, Bertozzi AL, Baraniuk RG, Osher SJ. Scheduled restart momentum for accelerated stochastic gradient descent. SIAM J Imaging Sci. 2022;15(2):738\u201361.","journal-title":"SIAM J Imaging Sci"},{"key":"3750_CR29","unstructured":"Bishop CM. Pattern Recognition and Machine Learning. Inform Sci Stat vol. 4. Springer, New York 2006."},{"issue":"2","key":"3750_CR30","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou L, Curtis FE, Nocedal J. Optimization methods for large-scale machine learning. SIAM Review. 2018;60(2):223\u2013311.","journal-title":"SIAM Review"},{"key":"3750_CR31","volume-title":"Deep Learning","author":"I Goodfellow","year":"2016","unstructured":"Goodfellow I, Bengio Y, Courville A. Deep Learning. Cambridge, MA: MIT Press; 2016."},{"key":"3750_CR32","unstructured":"Bottou L, Bousquet O. The tradeoffs of large scale learning. Advances in neural information processing systems 2007;20."},{"key":"3750_CR33","unstructured":"Kingma DP, Ba J. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 2014."},{"key":"3750_CR34","unstructured":"Schaul T, Zhang S, LeCun Y. No more pesky learning rates. In: International Conference on Machine Learning, 2013;343\u2013351."},{"key":"3750_CR35","unstructured":"Schmidt M, Roux NL. Fast convergence of stochastic gradient descent under a strong growth condition. arXiv preprint arXiv:1308.6370 2013."},{"key":"3750_CR36","unstructured":"Ding K, Tan Y. A cuda-based real parameter optimization benchmark. arXiv preprint arXiv:1407.7737 2014."},{"issue":"6","key":"3750_CR37","doi-asserted-by":"publisher","first-page":"3422","DOI":"10.11591\/eei.v10i6.3244","volume":"10","author":"IA Abed","year":"2021","unstructured":"Abed IA, Ali MM, Kadhim AAA. Using particle swarm optimization to solve test functions problems. Bull Electr Eng Inform. 2021;10(6):3422\u201331.","journal-title":"Bull Electr Eng Inform"},{"key":"3750_CR38","volume-title":"A Connectionist Machine for Genetic Hillclimbing","author":"DH Ackley","year":"2012","unstructured":"Ackley DH. A Connectionist Machine for Genetic Hillclimbing, vol. 28. New York: Springer; 2012."},{"issue":"1","key":"3750_CR39","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1162\/evco.2006.14.1.119","volume":"14","author":"Y-W Shang","year":"2006","unstructured":"Shang Y-W, Qiu Y-H. A note on the extended rosenbrock function. Evolution Comput. 2006;14(1):119\u201326.","journal-title":"Evolution Comput"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-025-03750-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-025-03750-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-025-03750-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T18:58:56Z","timestamp":1739905136000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-025-03750-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,18]]},"references-count":39,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,3]]}},"alternative-id":["3750"],"URL":"https:\/\/doi.org\/10.1007\/s42979-025-03750-7","relation":{},"ISSN":["2661-8907"],"issn-type":[{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,18]]},"assertion":[{"value":"24 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 February 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This research does not involve any human or animal subjects.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human Participants and Animals"}}],"article-number":"195"}}