{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T16:52:26Z","timestamp":1785603146420,"version":"3.56.0"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T00:00:00Z","timestamp":1729555200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T00:00:00Z","timestamp":1729555200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10957-024-02547-7","type":"journal-article","created":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T06:02:15Z","timestamp":1729576935000},"page":"2412-2450","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Convergence Rates for Stochastic Approximation: Biased Noise with Unbounded Variance, and Applications"],"prefix":"10.1007","volume":"203","author":[{"given":"Rajeeva Laxman","family":"Karandikar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1057-1942","authenticated-orcid":false,"given":"Mathukumalli","family":"Vidyasagar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,10,22]]},"reference":[{"issue":"1\u20132","key":"2547_CR1","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s10107-022-01822-7","volume":"199","author":"Y Arjevani","year":"2023","unstructured":"Arjevani, Y., Carmon, Y., Duchi, J.C., Foster, D.J., Srebro, N., Woodworth, B.: Lower bounds for non-convex stochastic optimization. Math. Program. 199(1\u20132), 165\u2013214 (2023)","journal-title":"Math. Program."},{"key":"2547_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-75894-2","volume-title":"Adaptive Algorithms and Stochastic Approximation","author":"A Benveniste","year":"1990","unstructured":"Benveniste, A., M\u00e9tivier, M., Priouret, P.: Adaptive Algorithms and Stochastic Approximation. Springer-Verlag, Berlin (1990)"},{"issue":"3","key":"2547_CR3","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1137\/S1052623497331063","volume":"10","author":"DP Bertsekas","year":"2000","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Global convergence in gradient methods with errors. SIAM J. Optim. 10(3), 627\u2013642 (2000)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"2547_CR4","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1214\/aoms\/1177728659","volume":"25","author":"JR Blum","year":"1954","unstructured":"Blum, J.R.: Multivariable stochastic approximation methods. Ann. Math. Stat. 25(4), 737\u2013744 (1954)","journal-title":"Ann. Math. Stat."},{"issue":"6","key":"2547_CR5","doi-asserted-by":"crossref","first-page":"3319","DOI":"10.1090\/S0002-9947-09-05048-X","volume":"362","author":"J Bolte","year":"2010","unstructured":"Bolte, J., Nguyen, T.P., Peypouquet, J., Suter, B.W.: Characterizations of Lojasiewicz inequalities: subgradient flows, Talweg, convexity. Trans. Am. Math. Soc. 362(6), 3319\u20133363 (2010)","journal-title":"Trans. Am. Math. Soc."},{"issue":"3","key":"2547_CR6","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1137\/S0363012995282784","volume":"36","author":"VS Borkar","year":"1998","unstructured":"Borkar, V.S.: Asynchronous stochastic approximations. SIAM J. Control. Optim. 36(3), 840\u2013851 (1998)","journal-title":"SIAM J. Control. Optim."},{"key":"2547_CR7","volume-title":"Stochastic Approximation: A Dynamical Systems Viewpoint","author":"VS Borkar","year":"2022","unstructured":"Borkar, V.S.: Stochastic Approximation: A Dynamical Systems Viewpoint, 2nd edn. Cambridge University Press, Cambridge (2022)","edition":"2"},{"key":"2547_CR8","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1137\/S0363012997331639","volume":"38","author":"VS Borkar","year":"2000","unstructured":"Borkar, V.S., Meyn, S.P.: The O.D.E. method for convergence of stochastic approximation and reinforcement learning. SIAM J. Control. Optim. 38, 447\u2013469 (2000)","journal-title":"SIAM J. Control. Optim."},{"key":"2547_CR9","unstructured":"Borkar, V.S., Shah, D.A.: Remarks on differential inclusion limits of stochastic approximation (2023). arxiv:2303.04558"},{"issue":"2","key":"2547_CR10","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou, L., Curtis, F.E., Nocedal, J.: Optimization methods for large-scale machine learning. SIAM Rev. 60(2), 223\u2013311 (2018)","journal-title":"SIAM Rev."},{"issue":"3","key":"2547_CR11","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1109\/9.751340","volume":"44","author":"HF Chen","year":"1999","unstructured":"Chen, H.F., Duncan, T.E., Pasik-Duncan, B.: A Kiefer\u2013Wolfowitz algorithm with randomized differences. IEEE Trans. Autom. Control 44(3), 442\u2013453 (1999)","journal-title":"IEEE Trans. Autom. Control"},{"key":"2547_CR12","first-page":"59","volume":"35","author":"DP Derevitskii","year":"1974","unstructured":"Derevitskii, D.P., Fradkov, A.L.: Two models for analyzing the dynamics of adaptation algorithms. Autom. Remote Control 35, 59\u201367 (1974)","journal-title":"Autom. Remote Control"},{"key":"2547_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/9781108591034","volume-title":"Probability: Theory and Examples","author":"R Durrett","year":"2019","unstructured":"Durrett, R.: Probability: Theory and Examples, 5th edn. Cambridge University Press, Cambridge (2019)","edition":"5"},{"key":"2547_CR14","first-page":"15836","volume":"35","author":"I Fatkhullin","year":"2022","unstructured":"Fatkhullin, I., Etesami, J., He, N., Kiyavash, N.: Sharp analysis of stochastic optimization under global Kurdyka\u2013Lojasiewicz inequality. Adv. Neural Inf. Process. Syst. 35, 15836\u201315848 (2022)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"2547_CR15","unstructured":"Fontaine, X., Bortoli, V.D., Durmus, A.: Convergence rates and approximation results for SGD and its continuous-time counterpart. In: Proceedings of Thirty Fourth Conference on Learning Theory, vol. 134, pp. 1965\u20132058. PMLR (2021)"},{"key":"2547_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.arcontrol.2022.01.003","volume":"53","author":"B Franci","year":"2022","unstructured":"Franci, B., Grammatico, S.: Convergence of sequences: a survey. Annu. Rev. Control. 53, 1\u201326 (2022)","journal-title":"Annu. Rev. Control."},{"issue":"2","key":"2547_CR17","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1137\/1110031","volume":"X","author":"EG Gladyshev","year":"1965","unstructured":"Gladyshev, E.G.: On stochastic approximation. Theory Probab. Appl. X(2), 275\u2013278 (1965)","journal-title":"Theory Probab. Appl."},{"issue":"2","key":"2547_CR18","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1023\/A:1014291407082","volume":"63","author":"ON Granichin","year":"2002","unstructured":"Granichin, O.N.: Randomized algorithms for stochastic approximation under arbitrary disturbances. Autom. Remote Control 63(2), 209\u2013219 (2002)","journal-title":"Autom. Remote Control"},{"issue":"11","key":"2547_CR19","doi-asserted-by":"crossref","first-page":"3098","DOI":"10.1109\/TAC.2014.2321667","volume":"59","author":"L Gr\u00fcne","year":"2014","unstructured":"Gr\u00fcne, L., Kellett, C.M.: ISS-Lyapunov functions for discontinuous discrete-time systems. IEEE Trans. Autom. Control 59(11), 3098\u20133103 (2014)","journal-title":"IEEE Trans. Autom. Control"},{"key":"2547_CR20","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/0022-247X(81)90123-2","volume":"80","author":"MA Hanson","year":"1981","unstructured":"Hanson, M.A.: On sufficiency of Kuhn\u2013Tucker conditions. J. Math. Anal. Appl. 80, 545\u2013550 (1981)","journal-title":"J. Math. Anal. Appl."},{"key":"2547_CR21","unstructured":"Karandikar, R.L., Vidyasagar, M.: Recent advances in stochastic approximation with applications to nonconvex optimization and fixed point problems (2024). https:\/\/arxiv.org\/pdf\/2109.03445v6.pdf"},{"key":"2547_CR22","unstructured":"Karandikar, R.L., Vidyasagar, M.: Recent advances in stochastic approximation with applications to nonconvex optimization and fixed point problems. Commun. Optim. Theory (to appear) (2024)"},{"key":"2547_CR23","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1007\/978-3-319-46128-1_50","volume":"9851","author":"H Karimi","year":"2016","unstructured":"Karimi, H., Nutini, J., Schmidt, M.: Linear convergence of gradient and proximal-gradient methods under the Polyak\u2013Lojasiewicz condition. Lect. Notes Comput. Sci. 9851, 795\u2013811 (2016)","journal-title":"Lect. Notes Comput. Sci."},{"key":"2547_CR24","unstructured":"Khaled, A., Richt\u00e1rik, P.: Better Theory for SGD in the Nonconvex World (2020). arXiv:2002.03329"},{"issue":"3","key":"2547_CR25","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1214\/aoms\/1177729392","volume":"23","author":"J Kiefer","year":"1952","unstructured":"Kiefer, J., Wolfowitz, J.: Stochastic estimation of the maximum of a regression function. Ann. Math. Stat. 23(3), 462\u2013466 (1952)","journal-title":"Ann. Math. Stat."},{"key":"2547_CR26","doi-asserted-by":"crossref","first-page":"769","DOI":"10.5802\/aif.1638","volume":"48","author":"K Kurdyka","year":"1998","unstructured":"Kurdyka, K.: On gradients of functions definable in o-minimal structures. Ann. L\u2019Inst. Fourier 48, 769\u2013783 (1998)","journal-title":"Ann. L\u2019Inst. Fourier"},{"issue":"2","key":"2547_CR27","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/0022-247X(77)90133-0","volume":"61","author":"HJ Kushner","year":"1977","unstructured":"Kushner, H.J.: General convergence results for stochastic approximations via weak convergence theory. J. Math. Anal. Appl. 61(2), 490\u2013503 (1977)","journal-title":"J. Math. Anal. Appl."},{"key":"2547_CR28","volume-title":"Stochastic Approximation Methods for Constrained and Unconstrained Systems","author":"HJ Kushner","year":"2012","unstructured":"Kushner, H.J., Clark, D.S.: Stochastic Approximation Methods for Constrained and Unconstrained Systems. Springer-Verlag, Berlin (2012)"},{"key":"2547_CR29","volume-title":"Stochastic Approximation Algorithms and Applications","author":"HJ Kushner","year":"2003","unstructured":"Kushner, H.J., Yin, G.G.: Stochastic Approximation Algorithms and Applications, 2nd edn. Springer-Verlag, Berlin (2003)","edition":"2"},{"key":"2547_CR30","unstructured":"Li, S., Xia, Y., Xu, Z.: Simultaneous perturbation stochastic approximation: towards one-measurement per iteration (2022). arxiv:2203.03075"},{"key":"2547_CR31","unstructured":"Liu, J., Yuan, Y.: On almost sure convergence rates of stochastic gradient methods. In: Loh, P.L., Raginsky, M. (eds.) Proceedings of Thirty Fifth Conference on Learning Theory, Proceedings of Machine Learning Research, vol. 178, pp. 2963\u20132983. PMLR (2022)"},{"issue":"6","key":"2547_CR32","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1109\/TAC.1977.1101561","volume":"22","author":"L Ljung","year":"1977","unstructured":"Ljung, L.: Analysis of recursive stochastic algorithms. IEEE Trans. Autom. Control 22(6), 551\u2013575 (1977)","journal-title":"IEEE Trans. Autom. Control"},{"key":"2547_CR33","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1214\/aos\/1176344212","volume":"6","author":"L Ljung","year":"1978","unstructured":"Ljung, L.: Strong convergence of a stochastic approximation algorithm. Ann. Stat. 6, 680\u2013696 (1978)","journal-title":"Ann. Stat."},{"key":"2547_CR34","unstructured":"Lojasiewicz, S.: Une propri\u00e9t\u00e9 topologique des sous-ensembles analytiques r\u00e9els. Editions du centre National de la Recherche Scientifique, pp. 87\u201389 (1963)"},{"issue":"2","key":"2547_CR35","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1109\/TIT.1984.1056894","volume":"IT\u201330","author":"M M\u00e9tivier","year":"1984","unstructured":"M\u00e9tivier, M., Priouret, P.: Applications of Kushner and Clark lemma to general classes of stochastic algorithms. IEEE Trans. Inf. Theory IT\u201330(2), 140\u2013151 (1984)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"2547_CR36","doi-asserted-by":"crossref","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2009","unstructured":"Nemirovski, A., Juditsky, A., Lan, G., Shapiro, A.: Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19(4), 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"key":"2547_CR37","first-page":"543","volume":"269","author":"Y Nesterov","year":"1983","unstructured":"Nesterov, Y.: A method for unconstrained convex minimization problem with the rate of convergence $$o(1\/k^2)$$. Soviet Math. Doklady 269, 543\u2013547 (1983). (in Russian)","journal-title":"Soviet Math. Doklady"},{"key":"2547_CR38","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course, vol. 87. Springer Scientific+Business Media, Berlin (2004)"},{"issue":"2","key":"2547_CR39","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/s10208-015-9296-2","volume":"17","author":"Y Nesterov","year":"2017","unstructured":"Nesterov, Y., Spokoiny, V.: Random gradient-free minimization of convex functions. Found. Comput. Math. 17(2), 527\u2013566 (2017)","journal-title":"Found. Comput. Math."},{"key":"2547_CR40","doi-asserted-by":"crossref","unstructured":"Pachal, S., Bhatnagar, S., Prashanth, L.A.: Generalized simultaneous perturbation-based gradient search with reduced estimator bias (2022). arxiv:2212.10477v1","DOI":"10.1109\/CISS56502.2023.10089720"},{"issue":"5","key":"2547_CR41","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"B Polyak","year":"1964","unstructured":"Polyak, B.: 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":"4","key":"2547_CR42","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1016\/0041-5553(63)90382-3","volume":"3","author":"BT Polyak","year":"1963","unstructured":"Polyak, B.T.: Gradient methods for the minimisation of functionals. USSR Comput. Math. Math. Phys. 3(4), 864\u2013878 (1963)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"4","key":"2547_CR43","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1137\/0330046","volume":"30","author":"BT Polyak","year":"1992","unstructured":"Polyak, B.T., Juditsky, A.B.: Acceleration of stochastic approximation by averaging. SIAM J. Control Optim. 30(4), 838\u2013855 (1992)","journal-title":"SIAM J. Control Optim."},{"key":"2547_CR44","unstructured":"Reddy, T.U.K., Vidyasagar, M.: Convergence of momentum-based heavy ball method with batch updating and\/or approximate gradients (2023). https:\/\/arxiv.org\/pdf\/2303.16241.pdf"},{"issue":"3","key":"2547_CR45","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1214\/aoms\/1177729586","volume":"22","author":"H Robbins","year":"1951","unstructured":"Robbins, H., Monro, S.: A stochastic approximation method. Ann. Math. Stat. 22(3), 400\u2013407 (1951)","journal-title":"Ann. Math. Stat."},{"key":"2547_CR46","first-page":"233","volume-title":"A Convergence Theorem for Non Negative Almost Supermartingales and Some Applications","author":"H Robbins","year":"1971","unstructured":"Robbins, H., Siegmund, D.: A Convergence Theorem for Non Negative Almost Supermartingales and Some Applications, pp. 233\u2013257. Elsevier, Amsterdam (1971)"},{"issue":"10","key":"2547_CR47","doi-asserted-by":"crossref","first-page":"1480","DOI":"10.1109\/9.720513","volume":"43","author":"P Sadegh","year":"1998","unstructured":"Sadegh, P., Spall, J.C.: Optimal random perturbations for stochastic approximation using a simultaneous perturbation gradient approximation. IEEE Trans. Autom. Control 43(10), 1480\u20131484 (1998)","journal-title":"IEEE Trans. Autom. Control"},{"key":"2547_CR48","first-page":"1","volume":"134","author":"O Sebbouh","year":"2021","unstructured":"Sebbouh, O., Gower, R.M., Defazio, A.: Almost sure convergence rates for stochastic gradient descent and stochastic heavy ball. Proc. Mach. Learn. Res. 134, 1\u201337 (2021)","journal-title":"Proc. Mach. Learn. Res."},{"issue":"3","key":"2547_CR49","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1109\/9.119632","volume":"37","author":"J Spall","year":"1992","unstructured":"Spall, J.: Multivariate stochastic approximation using a simultaneous perturbation gradient approximation. IEEE Trans. Autom. Control 37(3), 332\u2013341 (1992)","journal-title":"IEEE Trans. Autom. Control"},{"key":"2547_CR50","unstructured":"Sutskever, I., Martens, J., Dahl, G., Hinton, G.: On the importance of initialization and momentum in deep learning. In: Proceedings of the 30th international conference on machine learning (ICML-13), pp. 1139\u20131147 (2013)"},{"issue":"6","key":"2547_CR51","doi-asserted-by":"crossref","first-page":"3255","DOI":"10.1214\/16-AAP1272","volume":"27","author":"V Tadi\u0107","year":"2017","unstructured":"Tadi\u0107, V., Doucet, A.: Asymptotic bias of stochastic gradient search. Ann. Appl. Probab. 27(6), 3255\u20133304 (2017)","journal-title":"Ann. Appl. Probab."},{"key":"2547_CR52","first-page":"185","volume":"16","author":"JN Tsitsiklis","year":"1994","unstructured":"Tsitsiklis, J.N.: Asynchronous stochastic approximation and q-learning. Mach. Learn. 16, 185\u2013202 (1994)","journal-title":"Mach. Learn."},{"key":"2547_CR53","unstructured":"Vaswani, S., Bach, F., Schmidt, M.: Fast and faster convergence of SGD for over-parameterized models (and an accelerated perceptron). In: Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics (AISTATS), pp. 1\u201310 (2019)"},{"key":"2547_CR54","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719185","volume-title":"Nonlinear Systems Analysis (SIAM Classics Series)","author":"M Vidyasagar","year":"2002","unstructured":"Vidyasagar, M.: Nonlinear Systems Analysis (SIAM Classics Series). Society for Industrial and Applied Mathematics (SIAM), Philadelphia (2002)"},{"key":"2547_CR55","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s00498-023-00342-9","volume":"35","author":"M Vidyasagar","year":"2023","unstructured":"Vidyasagar, M.: Convergence of stochastic approximation via martingale and converse Lyapunov methods. Math. Controls Sign. Syst. 35, 351\u2013374 (2023)","journal-title":"Math. Controls Sign. Syst."},{"key":"2547_CR56","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813658","volume-title":"Probability with Martingagles","author":"D Williams","year":"1991","unstructured":"Williams, D.: Probability with Martingagles. Cambridge University Press, Cambridge (1991)"},{"issue":"1","key":"2547_CR57","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-015-0892-3","volume":"151","author":"SJ Wright","year":"2015","unstructured":"Wright, S.J.: Coordinate descent algorithms. Math. Program. 151(1), 3\u201334 (2015)","journal-title":"Math. Program."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02547-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-024-02547-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02547-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T20:06:52Z","timestamp":1733774812000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-024-02547-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,22]]},"references-count":57,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["2547"],"URL":"https:\/\/doi.org\/10.1007\/s10957-024-02547-7","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,22]]},"assertion":[{"value":"1 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}