{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T14:06:05Z","timestamp":1784901965546,"version":"3.55.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032314406","type":"print"},{"value":"9783032314413","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T00:00:00Z","timestamp":1784937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T00:00:00Z","timestamp":1784937600000},"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":[],"published-print":{"date-parts":[[2027]]},"DOI":"10.1007\/978-3-032-31441-3_32","type":"book-chapter","created":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T13:23:16Z","timestamp":1784899396000},"page":"477-491","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Offline Stochastic Optimization of\u00a0Black-Box Objective Functions"],"prefix":"10.1007","author":[{"given":"Juncheng","family":"Dong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zihao","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hamid","family":"Jafarkhani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ali","family":"Pezeshki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vahid","family":"Tarokh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,25]]},"reference":[{"key":"32_CR1","unstructured":"Arora, S., Cohen, N., Golowich, N., Hu, W.: A convergence analysis of gradient descent for deep linear neural networks. arXiv preprint arXiv:1810.02281 (2018)"},{"key":"32_CR2","unstructured":"Aso, K., Yorozu, S.: A generalization of Clairaut\u2019s theorem and umbilical foliations (1991)"},{"issue":"1","key":"32_CR3","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1214\/ss\/1177011077","volume":"8","author":"D Bertsimas","year":"1993","unstructured":"Bertsimas, D., Tsitsiklis, J.: Simulated annealing. Stat. Sci. 8(1), 10\u201315 (1993)","journal-title":"Stat. Sci."},{"key":"32_CR4","doi-asserted-by":"publisher","unstructured":"Bottou, L.: Large-scale machine learning with stochastic gradient descent. In: Proceedings of COMPSTAT\u20192010: 19th International Conference on Computational StatisticsParis France, 22\u201327 August 2010 Keynote, Invited and Contributed Papers, pp. 177\u2013186. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-7908-2604-3_16","DOI":"10.1007\/978-3-7908-2604-3_16"},{"issue":"2","key":"32_CR5","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1287\/opre.6.2.244","volume":"6","author":"SH Brooks","year":"1958","unstructured":"Brooks, S.H.: A discussion of random methods for seeking maxima. Oper. Res. 6(2), 244\u2013251 (1958)","journal-title":"Oper. Res."},{"issue":"4","key":"32_CR6","doi-asserted-by":"publisher","first-page":"2431","DOI":"10.1007\/s11831-022-09872-y","volume":"30","author":"MS Daoud","year":"2023","unstructured":"Daoud, M.S., Shehab, M., Al-Mimi, H.M., Abualigah, L., Zitar, R.A., Shambour, M.K.Y.: Gradient-based optimizer (GBO): a review, theory, variants, and applications. Arch. Comput. Meth. Eng. 30(4), 2431\u20132449 (2023)","journal-title":"Arch. Comput. Meth. Eng."},{"key":"32_CR7","unstructured":"Duchi, J., Hazan, E., Singer, Y.: Adaptive subgradient methods for online learning and stochastic optimization. J. Mach. Learn. Res. 12(7) (2011)"},{"issue":"3","key":"32_CR8","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1111\/j.1751-5823.2002.tb00174.x","volume":"70","author":"D Fouskakis","year":"2002","unstructured":"Fouskakis, D., Draper, D.: Stochastic optimization: a review. Int. Stat. Rev. 70(3), 315\u2013349 (2002)","journal-title":"Int. Stat. Rev."},{"key":"32_CR9","unstructured":"Glasserman, P.: Gradient Estimation via Perturbation Analysis, vol.\u00a0116. Springer, New York (1990)"},{"issue":"4","key":"32_CR10","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1287\/inte.20.4.74","volume":"20","author":"F Glover","year":"1990","unstructured":"Glover, F.: Tabu search: a tutorial. Interfaces 20(4), 74\u201394 (1990)","journal-title":"Interfaces"},{"issue":"4","key":"32_CR11","first-page":"2715","volume":"18","author":"SH Haji","year":"2021","unstructured":"Haji, S.H., Abdulazeez, A.M.: Comparison of optimization techniques based on gradient descent algorithm: a review. PalArch\u2019s J. Archaeol. Egypt\/Egyptol. 18(4), 2715\u20132743 (2021)","journal-title":"PalArch\u2019s J. Archaeol. Egypt\/Egyptol."},{"issue":"3","key":"32_CR12","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1111\/1468-0262.00124","volume":"68","author":"BE Hansen","year":"2000","unstructured":"Hansen, B.E.: Sample splitting and threshold estimation. Econometrica 68(3), 575\u2013603 (2000)","journal-title":"Econometrica"},{"key":"32_CR13","unstructured":"Hinton, G., Srivastava, N., Swersky, K.: Neural networks for machine learning lecture 6a overview of mini-batch gradient descent 14(8), 2 (2012)"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. MIT Press (1992)","DOI":"10.7551\/mitpress\/1090.001.0001"},{"key":"32_CR15","unstructured":"Hu, J., Fu, M.C.: On the convergence rate of stochastic approximation for gradient-based stochastic optimization. Oper. Res. (2024)"},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"Kim, S., Pasupathy, R., Henderson, S.G.: A guide to sample average approximation. In: Handbook of Simulation Optimization, pp. 207\u2013243 (2015)","DOI":"10.1007\/978-1-4939-1384-8_8"},{"key":"32_CR17","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)"},{"key":"32_CR18","first-page":"18261","volume":"33","author":"Y Liu","year":"2020","unstructured":"Liu, Y., Gao, Y., Yin, W.: An improved analysis of stochastic gradient descent with momentum. Adv. Neural. Inf. Process. Syst. 33, 18261\u201318271 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"Maryak, J.L., Chin, D.C.: Global random optimization by simultaneous perturbation stochastic approximation. In: Proceedings of the 2001 American Control Conference. (Cat. No. 01CH37148), vol. 2, pp. 756\u2013762. IEEE (2001)","DOI":"10.1109\/ACC.2001.945806"},{"issue":"3","key":"32_CR20","first-page":"543","volume":"269","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method of solving a convex programming problem with convergence rate o (1\/k** 2). Dokl. Akad. Nauk SSSR 269(3), 543 (1983)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"32_CR21","unstructured":"Paszke, A., et al.: PyTorch: an imperative style, high-performance deep learning library. Adv. Neural. Inf. Process. Syst. 32 (2019)"},{"issue":"5","key":"32_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"BT Polyak","year":"1964","unstructured":"Polyak, B.T.: Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Phys. 4(5), 1\u201317 (1964)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"3","key":"32_CR23","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1287\/ijoc.9.3.231","volume":"9","author":"CR Reeves","year":"1997","unstructured":"Reeves, C.R.: Genetic algorithms for the operations researcher. INFORMS J. Comput. 9(3), 231\u2013250 (1997)","journal-title":"INFORMS J. Comput."},{"key":"32_CR24","unstructured":"R\u00e9nyi, A.: Probability Theory. Courier Corporation (2007)"},{"issue":"1","key":"32_CR25","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0893-6080(97)00097-X","volume":"11","author":"F Scarselli","year":"1998","unstructured":"Scarselli, F., Tsoi, A.C.: Universal approximation using feedforward neural networks: a survey of some existing methods, and some new results. Neural Netw. 11(1), 15\u201337 (1998)","journal-title":"Neural Netw."},{"key":"32_CR26","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/BF02190104","volume":"91","author":"A Shapiro","year":"1996","unstructured":"Shapiro, A., Wardi, Y.: Convergence analysis of gradient descent stochastic algorithms. J. Optim. Theor. Appl. 91, 439\u2013454 (1996)","journal-title":"J. Optim. Theor. Appl."},{"key":"32_CR27","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s00006-010-0242-8","volume":"21","author":"G Sobczyk","year":"2011","unstructured":"Sobczyk, G., S\u00e1nchez, O.L.: Fundamental theorem of calculus. Adv. Appl. Clifford Algebras 21, 221\u2013231 (2011)","journal-title":"Adv. Appl. Clifford Algebras"},{"issue":"3","key":"32_CR28","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1109\/9.119632","volume":"37","author":"JC Spall","year":"1992","unstructured":"Spall, J.C.: Multivariate stochastic approximation using a simultaneous perturbation gradient approximation. IEEE Trans. Autom. Control 37(3), 332\u2013341 (1992)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"6","key":"32_CR29","doi-asserted-by":"publisher","first-page":"1216","DOI":"10.1109\/TAC.2009.2019793","volume":"54","author":"JC Spall","year":"2009","unstructured":"Spall, J.C.: Feedback and weighting mechanisms for improving Jacobian estimates in the adaptive simultaneous perturbation algorithm. IEEE Trans. Autom. Control 54(6), 1216\u20131229 (2009)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"11","key":"32_CR30","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1080\/07408170490500654","volume":"36","author":"E Tekin","year":"2004","unstructured":"Tekin, E., Sabuncuoglu, I.: Simulation optimization: a comprehensive review on theory and applications. IIE Trans. 36(11), 1067\u20131081 (2004)","journal-title":"IIE Trans."},{"key":"32_CR31","unstructured":"Trabucco, B., Kumar, A., Geng, X., Levine, S.: Conservative objective models for effective offline model-based optimization. In: Meila, M., Zhang, T. (eds.) Proceedings of the 38th International Conference on Machine Learning. Proceedings of Machine Learning Research, 18\u201324 July 2021, vol.\u00a0139, pp. 10358\u201310368. PMLR (2021). https:\/\/proceedings.mlr.press\/v139\/trabucco21a.html"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-31441-3_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T13:23:18Z","timestamp":1784899398000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-31441-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,25]]},"ISBN":["9783032314406","9783032314413"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-31441-3_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,25]]},"assertion":[{"value":"25 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","label":"Disclosure of Interests","group":{"name":"EthicsHeading","label":"Ethics"}},{"value":"ICPR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Pattern Recognition","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lyon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icpr2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icpr2026.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}