{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,25]],"date-time":"2026-08-25T16:45:13Z","timestamp":1787676313621,"version":"build-2784847793"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T00:00:00Z","timestamp":1658102400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T00:00:00Z","timestamp":1658102400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Walker Fellowship from Applied Research Laboratory"},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ECCS-1846706"],"award-info":[{"award-number":["ECCS-1846706"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-15-1-040"],"award-info":[{"award-number":["FA9550-15-1-040"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10994-022-06215-7","type":"journal-article","created":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T18:08:37Z","timestamp":1658167717000},"page":"3245-3277","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["An adaptive polyak heavy-ball method"],"prefix":"10.1007","volume":"111","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7634-274X","authenticated-orcid":false,"suffix":"Jr.","given":"Samer","family":"Saab","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shashi","family":"Phoha","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Minghui","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Asok","family":"Ray","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,7,18]]},"reference":[{"key":"6215_CR1","doi-asserted-by":"crossref","unstructured":"Bakirov, R., Fay, D., & Gabrys, B. (2021). Automated adaptation strategies for stream learning. Machine Learning, 1\u201334.","DOI":"10.1007\/s10994-021-05992-x"},{"key":"6215_CR2","doi-asserted-by":"crossref","unstructured":"Beck, A. (2017). First-order methods in optimization. SIAM.","DOI":"10.1137\/1.9781611974997"},{"key":"6215_CR3","unstructured":"Berrada, L., Zisserman, A., & Kumar, M. P. (2020). Training neural networks for and by interpolation. In International conference on machine learning (pp. 799\u2013809)."},{"issue":"4","key":"6215_CR4","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1137\/S1052623495287022","volume":"7","author":"DP Bertsekas","year":"1997","unstructured":"Bertsekas, D. P. (1997). A new class of incremental gradient methods for least squares problems. SIAM Journal on Optimization, 7(4), 913\u2013926.","journal-title":"SIAM Journal on Optimization"},{"key":"6215_CR5","unstructured":"Carmon, Y., Duchi, J. C., Hinder, O., & Sidford, A. (2017). \u201cconvex until proven guilty\u201d: Dimensionfree acceleration of gradient descent on non-convex functions. In International conference on machine learning (pp. 654\u2013663)."},{"key":"6215_CR6","unstructured":"Cutkosky, A., & Mehta, H. (2020). Momentum improves normalized SGD. In International conference on machine learning (pp. 2260\u20132268)."},{"key":"6215_CR7","unstructured":"Dauphin, Y. N., De Vries, H., & Bengio, Y. (2015). Equilibrated adaptive learning rates for non-convex optimization. arXiv preprint arXiv:1502.04390."},{"key":"6215_CR8","unstructured":"Dozat, T. (2016). Incorporating nesterov momentum into adam. In ICLR Workshop"},{"key":"6215_CR9","unstructured":"Duchi, J., Hazan, E., & Singer, Y. (2011). Adaptive subgradient methods for online learning and stochastic optimization. Journal of Machine Learning Research, 12(7)."},{"issue":"4","key":"6215_CR10","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/s11023-020-09548-1","volume":"30","author":"L Floridi","year":"2020","unstructured":"Floridi, L., & Chiriatti, M. (2020). Gpt-3: Its nature, scope, limits, and consequences. Minds and Machines, 30(4), 681\u2013694.","journal-title":"Minds and Machines"},{"issue":"1","key":"6215_CR11","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1214\/18-EJS1395","volume":"12","author":"S Gadat","year":"2018","unstructured":"Gadat, S., Panloup, F., & Saadane, S. (2018). Stochastic heavy ball. Electronic Journal of Statistics, 12(1), 461\u2013529.","journal-title":"Electronic Journal of Statistics"},{"issue":"2","key":"6215_CR12","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1080\/10556789408805582","volume":"4","author":"AA Gaivoronski","year":"1994","unstructured":"Gaivoronski, A. A. (1994). Convergence properties of backpropagation for neural nets via theory of stochastic gradient methods. Part 1. Optimization Methods and Software, 4(2), 117\u2013134.","journal-title":"Optimization Methods and Software"},{"key":"6215_CR13","unstructured":"Ghadimi, E. (2015). Accelerating convergence of largescale optimization algorithms (Unpublished doctoral dissertation). KTH Royal Institute of Technology."},{"key":"6215_CR14","doi-asserted-by":"crossref","unstructured":"Ghadimi, E., Feyzmahdavian, H. R., & Johansson, M. (2015). Global convergence of the heavy-ball method for convex optimization. In 2015 European control conference (pp. 310\u2013315).","DOI":"10.1109\/ECC.2015.7330562"},{"issue":"4","key":"6215_CR15","doi-asserted-by":"publisher","first-page":"2341","DOI":"10.1137\/120880811","volume":"23","author":"S Ghadimi","year":"2013","unstructured":"Ghadimi, S., & Lan, G. (2013). Stochastic first-and zeroth-order methods for nonconvex stochastic programming. SIAM Journal on Optimization, 23(4), 2341\u20132368.","journal-title":"SIAM Journal on Optimization"},{"issue":"1\u20132","key":"6215_CR16","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10107-015-0871-8","volume":"156","author":"S Ghadimi","year":"2016","unstructured":"Ghadimi, S., & Lan, G. (2016). Accelerated gradient methods for nonconvex nonlinear and stochastic programming. Mathematical Programming, 156(1\u20132), 59\u201399.","journal-title":"Mathematical Programming"},{"key":"6215_CR17","unstructured":"Gitman, I., Lang, H., Zhang, P., & Xiao, L. (2019). Understanding the role of momentum in stochastic gradient methods. Advances in Neural Information Processing Systems, 32."},{"key":"6215_CR18","unstructured":"Gower, R. M., Loizou, N., Qian, X., Sailanbayev, A., Shulgin, E., & Richt\u00e1rik, P. (2019). SGD: General analysis and improved rates. In International conference on machine learning (pp. 5200\u20135209)."},{"key":"6215_CR19","doi-asserted-by":"crossref","unstructured":"He, K., Zhang, X., Ren, S., & Sun, J. (2016). Deep residual learning for image recognition. In Proceedings of the IEEE conference on computer vision and pattern recognition (pp. 770\u2013778).","DOI":"10.1109\/CVPR.2016.90"},{"key":"6215_CR20","unstructured":"Hendrikx, H., Xiao, L., Bubeck, S., Bach, F., & Massoulie, L. (2020). Statistically preconditioned accelerated gradient method for distributed optimization. In International conference on machine learning (pp. 4203\u20134227)."},{"key":"6215_CR21","first-page":"1","volume":"1","author":"G Hinton","year":"2012","unstructured":"Hinton, G., Srivastava, N., & Swersky, K. (2012). Lecture 6d-a separate, adaptive learning rate for each connection. Slides of Lecture Neural Networks for Machine Learning, 1, 1\u201331.","journal-title":"Slides of Lecture Neural Networks for Machine Learning"},{"key":"6215_CR22","unstructured":"Hu, C., Kwok, J. T.-Y., & Pan, W. (2009). Accelerated gradient methods for stochastic optimization and online learning. In Proceedings of the 23rd annual conference on neural information processing systems."},{"key":"6215_CR23","unstructured":"Huang, F., Gao, S., Pei, J., & Huang, H. (2020). Momentum-based policy gradient methods. In International conference on machine learning (pp. 4422\u20134433)."},{"key":"6215_CR24","doi-asserted-by":"crossref","unstructured":"Huang, G., Liu, Z., Van Der Maaten, L., & Weinberger, K. Q. (2017). Densely connected convolutional networks. In Proceedings of the IEEE conference on computer vision and pattern recognition (pp. 4700\u20134708).","DOI":"10.1109\/CVPR.2017.243"},{"issue":"2","key":"6215_CR25","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1504\/IJMMNO.2013.055204","volume":"4","author":"M Jamil","year":"2013","unstructured":"Jamil, M., & Yang, X.-S. (2013). A literature survey of benchmark functions for global optimisation problems. International Journal of Mathematical Modelling and Numerical Optimisation, 4(2), 150\u2013194.","journal-title":"International Journal of Mathematical Modelling and Numerical Optimisation"},{"key":"6215_CR26","unstructured":"Khan, M., Nielsen, D., Tangkaratt, V., Lin, W., Gal, Y., & Srivastava, A. (2018). Fast and scalable bayesian deep learning by weight-perturbation in adam. In International conference on machine learning (pp. 2611\u20132620)."},{"key":"6215_CR27","unstructured":"Kingma, D. P., & Ba, J. (2014). Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980."},{"key":"6215_CR28","unstructured":"Koehler, G. (2020). MNIST handwritten digit recognition in pytorch. Retrieved from https:\/\/nextjournal.com\/gkoehler\/pytorch-mnist"},{"key":"6215_CR29","unstructured":"Krizhevsky, A., Hinton, G., et al. (2009). Learning multiple layers of features from tiny images. Technical report, University of Toronto."},{"key":"6215_CR30","first-page":"1097","volume":"25","author":"A Krizhevsky","year":"2012","unstructured":"Krizhevsky, A., Sutskever, I., & Hinton, G. E. (2012). Imagenet classification with deep convolutional neural networks. Advances in Neural Information Processing Systems, 25, 1097\u20131105.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"6215_CR31","unstructured":"Lang, H., Zhang, P., & Xiao, L. (2019). Using statistics to automate stochastic optimization. arXiv preprint arXiv:1909.09785."},{"issue":"1","key":"6215_CR32","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/15M1009597","volume":"26","author":"L Lessard","year":"2016","unstructured":"Lessard, L., Recht, B., & Packard, A. (2016). Analysis and design of optimization algorithms via integral quadratic constraints. SIAM Journal on Optimization, 26(1), 57\u201395.","journal-title":"SIAM Journal on Optimization"},{"key":"6215_CR33","unstructured":"Li, X., & Orabona, F. (2019). On the convergence of stochastic gradient descent with adaptive stepsizes. In The 22nd international conference on artificial intelligence and statistics (pp. 983\u2013992)."},{"issue":"4","key":"6215_CR34","doi-asserted-by":"publisher","first-page":"2244","DOI":"10.1137\/141000270","volume":"25","author":"Q Lin","year":"2015","unstructured":"Lin, Q., Lu, Z., & Xiao, L. (2015). An accelerated randomized proximal coordinate gradient method and its application to regularized empirical risk minimization. SIAM Journal on Optimization, 25(4), 2244\u20132273.","journal-title":"SIAM Journal on Optimization"},{"key":"6215_CR35","unstructured":"Liu, L., Jiang, H., He, P., Chen, W., Liu, X., Gao, J., & Han, J. (2019). On the variance of the adaptive learning rate and beyond. arXiv preprint arXiv:1908.03265 ."},{"issue":"3","key":"6215_CR36","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/s10589-020-00220-z","volume":"77","author":"N Loizou","year":"2020","unstructured":"Loizou, N., & Richt\u00e1rik, P. (2020). Momentum and stochastic momentum for stochastic gradient, newton, proximal point and subspace descent methods. Computational Optimization and Applications, 77(3), 653\u2013710.","journal-title":"Computational Optimization and Applications"},{"key":"6215_CR37","unstructured":"Loizou, N., Vaswani, S., Laradji, I., & Lacoste-Julien, S. (2020). Stochastic Polyak step-size for SGD: An adaptive learning rate for fast convergence. arXiv preprint arXiv:2002.10542."},{"key":"6215_CR38","unstructured":"Loshchilov, I., & Hutter, F. (2017). Decoupled weight decay regularization. arXiv preprint arXiv:1711.05101."},{"key":"6215_CR39","unstructured":"Mai, V., & Johansson, M. (2020). Convergence of a stochastic gradient method with momentum for non-smooth non-convex optimization. In International conference on machine learning (pp. 6630\u20136639)."},{"issue":"1","key":"6215_CR40","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1002\/zamm.19290090105","volume":"9","author":"R Mises","year":"1929","unstructured":"Mises, R., & Pollaczek-Geiringer, H. (1929). Praktische verfahren der gleichungsaufl\u00f6sung. ZAMMJournal of Applied Mathematics and Mechanics\/ Zeitschrift f\u00fcr Angewandte Mathematik und Mechanik, 9(1), 58\u201377.","journal-title":"ZAMMJournal of Applied Mathematics and Mechanics\/ Zeitschrift f\u00fcr Angewandte Mathematik und Mechanik"},{"key":"6215_CR41","unstructured":"Nesterov, Y. (1983). A method of solving a convex programming problem with convergence rate O(1=k2). In Sov. math. dokl (Vol. 27)."},{"key":"6215_CR42","doi-asserted-by":"crossref","unstructured":"Nesterov, Y. (2003). Introductory lectures on convex optimization: A basic course (Vol. 87). Springer.","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"6215_CR43","unstructured":"Oberman, A. M., & Prazeres, M. (2019). Stochastic gradient descent with Polyak\u2019s learning rate. arXiv preprint arXiv:1903.08688."},{"issue":"2","key":"6215_CR44","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10851-015-0565-0","volume":"53","author":"P Ochs","year":"2015","unstructured":"Ochs, P., Brox, T., & Pock, T. (2015). ipiasco: inertial proximal algorithm for strongly convex optimization. Journal of Mathematical Imaging and Vision, 53(2), 171\u2013181.","journal-title":"Journal of Mathematical Imaging and Vision"},{"issue":"2","key":"6215_CR45","doi-asserted-by":"publisher","first-page":"1388","DOI":"10.1137\/130942954","volume":"7","author":"P Ochs","year":"2014","unstructured":"Ochs, P., Chen, Y., Brox, T., & Pock, T. (2014). ipiano: Inertial proximal algorithm for nonconvex optimization. SIAM Journal on Imaging Sciences, 7(2), 1388\u20131419.","journal-title":"SIAM Journal on Imaging Sciences"},{"issue":"5","key":"6215_CR46","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. (1964). Some methods of speeding up the convergence of iteration methods. Ussr Computational Mathematics and Mathematical Physics, 4(5), 1\u201317.","journal-title":"Ussr Computational Mathematics and Mathematical Physics"},{"key":"6215_CR47","unstructured":"Polyak, B. T. (1987). Introduction to optimization. Translations series in mathematics and engineering. Optimization Software."},{"issue":"53","key":"6215_CR48","first-page":"1","volume":"20","author":"P Probst","year":"2019","unstructured":"Probst, P., Boulesteix, A.-L., & Bischl, B. (2019). Tunability: Importance of hyperparameters of machine learning algorithms. Journal of Machine Learning Research, 20(53), 1\u201332.","journal-title":"Journal of Machine Learning Research"},{"issue":"1","key":"6215_CR49","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. (1999). On the momentum term in gradient descent learning algorithms. Neural Networks, 12(1), 145\u2013151.","journal-title":"Neural Networks"},{"key":"6215_CR50","unstructured":"Reddi, S. J., Kale, S., & Kumar, S. (2019). On the convergence of adam and beyond. arXiv preprint arXiv:1904.09237 ."},{"key":"6215_CR51","doi-asserted-by":"crossref","unstructured":"Robbins, H., & Monro, S. (1951). A stochastic approximation method. The Annals of Mathematical Statistics, 400\u2013407.","DOI":"10.1214\/aoms\/1177729586"},{"key":"6215_CR52","unstructured":"Rolinek, M., & Martius, G. (2018). L4: Practical lossbased stepsize adaptation for deep learning. arXiv preprint arXiv:1802.05074 ."},{"key":"6215_CR53","unstructured":"Scieur, D., & Pedregosa, F. (2020). Universal asymptotic optimality of Polyak momentum. In International conference on machine learning (pp. 8565\u20138572)."},{"key":"6215_CR54","unstructured":"Simsekli, U., Zhu, L., Teh, Y. W., & Gurbuzbalaban, M. (2020). Fractional underdamped langevin dynamics: Retargeting SGD with momentum under heavy-tailed gradient noise. In International conference on machine learning (pp. 8970\u20138980)."},{"issue":"9","key":"6215_CR55","doi-asserted-by":"publisher","first-page":"1837","DOI":"10.1007\/s10994-020-05903-6","volume":"109","author":"H Song","year":"2020","unstructured":"Song, H., Kim, S., Kim, M., & Lee, J.-G. (2020). Ada-boundary: accelerating DNN training via adaptive boundary batch selection. Machine Learning, 109(9), 1837\u20131853.","journal-title":"Machine Learning"},{"key":"6215_CR56","unstructured":"Tao, W., Long, S., Wu, G., & Tao, Q. (2021). The role of momentum parameters in the optimal convergence of adaptive Polyak\u2019s heavy-ball methods. arXiv preprint arXiv:2102.07314 ."},{"issue":"1","key":"6215_CR57","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1109\/LCSYS.2017.2722406","volume":"2","author":"B Van Scoy","year":"2017","unstructured":"Van Scoy, B., Freeman, R. A., & Lynch, K. M. (2017). The fastest known globally convergent first-order method for minimizing strongly convex functions. IEEE Control Systems Letters, 2(1), 49\u201354.","journal-title":"IEEE Control Systems Letters"},{"key":"6215_CR58","unstructured":"Ward, R., Wu, X., & Bottou, L. (2019). Adagrad stepsizes: Sharp convergence over nonconvex landscapes. In International conference on machine learning (pp. 6677\u20136686)."},{"key":"6215_CR59","unstructured":"Wilson, A. C., Roelofs, R., Stern, M., Srebro, N., & Recht, B. (2017). The marginal value of adaptive gradient methods in machine learning. arXiv preprint arXiv:1705.08292 ."},{"key":"6215_CR60","unstructured":"Yu, Y., Xu, P., & Gu, Q. (2018). Third-order smoothness helps: Faster stochastic optimization algorithms for finding local minima. In Advances in neural information processing systems, 31 ."},{"issue":"4","key":"6215_CR61","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/BF01128757","volume":"4","author":"S Zavriev","year":"1993","unstructured":"Zavriev, S., & Kostyuk, F. (1993). Heavy-ball method in nonconvex optimization problems. Computational Mathematics and Modeling, 4(4), 336\u2013341.","journal-title":"Computational Mathematics and Modeling"},{"key":"6215_CR62","unstructured":"Zeiler, M. D. (2012). Adadelta: an adaptive learning rate method. arXiv preprint arXiv:1212.5701."},{"key":"6215_CR63","unstructured":"Zhang, M., Lucas, J., Ba, J., & Hinton, G. E. (2019). Lookahead optimizer: k steps forward, 1 step back. In Advances in neural information processing systems (pp. 9597\u20139608)."},{"key":"6215_CR64","doi-asserted-by":"crossref","unstructured":"Zou, F., Shen, L., Jie, Z., Zhang, W., & Liu, W. (2019). A sufficient condition for convergences of adam and rmsprop. In Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition (pp. 11127\u201311135).","DOI":"10.1109\/CVPR.2019.01138"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-022-06215-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-022-06215-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-022-06215-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T00:02:43Z","timestamp":1689638563000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-022-06215-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,18]]},"references-count":64,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["6215"],"URL":"https:\/\/doi.org\/10.1007\/s10994-022-06215-7","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,18]]},"assertion":[{"value":"18 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not Applicable (no potential conflict of interest is reported by the authors).","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not Applicable (the study does not involve human subjects and\/or animals).","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"All the authors mentioned in the manuscript have agreed for authorship, read and approved the manuscript, and given consent for submission.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"All the authors mentioned in the manuscript have given consent for submission and subsequent publication of the manuscript. The manuscript will not be submitted elsewhere until the editorial process is completed.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}