{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:12Z","timestamp":1740122652397,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T00:00:00Z","timestamp":1655683200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T00:00:00Z","timestamp":1655683200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004063","name":"Knut och Alice Wallenbergs Stiftelse","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004063","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003252","name":"Lund University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003252","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2022,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We consider a stochastic version of the proximal point algorithm for convex optimization problems posed on a Hilbert space. A typical application of this is supervised learning. While the method is not new, it has not been extensively analyzed in this form. Indeed, most related results are confined to the finite-dimensional setting, where error bounds could depend on the dimension of the space. On the other hand, the few existing results in the infinite-dimensional setting only prove very weak types of convergence, owing to weak assumptions on the problem. In particular, there are no results that show strong convergence with a rate. In this article, we bridge these two worlds by assuming more regularity of the optimization problem, which allows us to prove convergence with an (optimal) sub-linear rate also in an infinite-dimensional setting. In particular, we assume that the objective function is the expected value of a family of convex differentiable functions. While we require that the full objective function is strongly convex, we do not assume that its constituent parts are so. Further, we require that the gradient satisfies a weak local Lipschitz continuity property, where the Lipschitz constant may grow polynomially given certain guarantees on the variance and higher moments near the minimum. We illustrate these results by discretizing a concrete infinite-dimensional classification problem with varying degrees of accuracy.<\/jats:p>","DOI":"10.1007\/s10589-022-00380-0","type":"journal-article","created":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T07:05:38Z","timestamp":1655708738000},"page":"181-210","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Sub-linear convergence of a stochastic proximal iteration method in Hilbert space"],"prefix":"10.1007","volume":"83","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7428-9546","authenticated-orcid":false,"given":"Monika","family":"Eisenmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6123-4271","authenticated-orcid":false,"given":"Tony","family":"Stillfjord","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9766-2024","authenticated-orcid":false,"given":"M\u00e5ns","family":"Williamson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,20]]},"reference":[{"issue":"5","key":"380_CR1","doi-asserted-by":"publisher","first-page":"3235","DOI":"10.1109\/TIT.2011.2182178","volume":"58","author":"A Agarwal","year":"2012","unstructured":"Agarwal, A., Bartlett, P.L., Ravikumar, P., Wainwright, M.J.: Information-theoretic lower bounds on the oracle complexity of stochastic convex optimization. IEEE Trans. Inf. Theory 58(5), 3235\u20133249 (2012). https:\/\/doi.org\/10.1109\/TIT.2011.2182178","journal-title":"IEEE Trans. Inf. Theory"},{"key":"380_CR2","unstructured":"Asi, H., Duchi, J.C.: Modeling simple structures and geometry for better stochastic optimization algorithms. In: Chaudhuri, K., Sugiyama, M. (eds.) Proceedings of the Twenty-Second International Conference on Artificial Intelligence and Statistics. Proceedings of Machine Learning Research, vol. 89, pp. 2425\u20132434. PMLR, Naha, Japan (2019). https:\/\/proceedings.mlr.press\/v89\/asi19a.html"},{"issue":"3","key":"380_CR3","doi-asserted-by":"publisher","first-page":"2257","DOI":"10.1137\/18M1230323","volume":"29","author":"H Asi","year":"2019","unstructured":"Asi, H., Duchi, J.C.: Stochastic (approximate) proximal point methods: convergence, optimality, and adaptivity. SIAM J. Optim. 29(3), 2257\u20132290 (2019). https:\/\/doi.org\/10.1137\/18M1230323","journal-title":"SIAM J. Optim."},{"key":"380_CR4","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-1-4419-5542-5","volume-title":"Nonlinear Differential Equations of Monotone Types in Banach Spaces","author":"V Barbu","year":"2010","unstructured":"Barbu, V.: Nonlinear Differential Equations of Monotone Types in Banach Spaces, p. 272. Springer, New York (2010). https:\/\/doi.org\/10.1007\/978-1-4419-5542-5"},{"key":"380_CR5","doi-asserted-by":"publisher","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn. CMS Books in Mathematics\/Ouvrages de Math\u00e9matiques de la SMC, p. 619. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-48311-5","DOI":"10.1007\/978-3-319-48311-5"},{"issue":"2, Ser. B","key":"380_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10107-011-0472-0","volume":"129","author":"DP Bertsekas","year":"2011","unstructured":"Bertsekas, D.P.: Incremental proximal methods for large scale convex optimization. Math. Program. 129(2, Ser. B), 163\u2013195 (2011). https:\/\/doi.org\/10.1007\/s10107-011-0472-0","journal-title":"Math. Program."},{"issue":"4","key":"380_CR7","doi-asserted-by":"publisher","first-page":"2235","DOI":"10.1137\/15M1017909","volume":"26","author":"P Bianchi","year":"2016","unstructured":"Bianchi, P.: Ergodic convergence of a stochastic proximal point algorithm. SIAM J. Optim. 26(4), 2235\u20132260 (2016). https:\/\/doi.org\/10.1137\/15M1017909","journal-title":"SIAM J. Optim."},{"issue":"1","key":"380_CR8","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/s10957-016-0978-y","volume":"171","author":"P Bianchi","year":"2016","unstructured":"Bianchi, P., Hachem, W.: Dynamical behavior of a stochastic forward\u2013backward algorithm using random monotone operators. J. Optim. Theory Appl. 171(1), 90\u2013120 (2016). https:\/\/doi.org\/10.1007\/s10957-016-0978-y","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"380_CR9","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1137\/16M1080173","journal-title":"SIAM Rev."},{"issue":"3","key":"380_CR10","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1093\/imanum\/drs032","volume":"33","author":"Z Brze\u017aniak","year":"2013","unstructured":"Brze\u017aniak, Z., Carelli, E., Prohl, A.: Finite-element-based discretizations of the incompressible Navier\u2013Stokes equations with multiplicative random forcing. IMA J. Numer. Anal. 33(3), 771\u2013824 (2013). https:\/\/doi.org\/10.1093\/imanum\/drs032","journal-title":"IMA J. Numer. Anal."},{"issue":"3","key":"380_CR11","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0166-218X(87)90064-3","volume":"16","author":"DS Clark","year":"1987","unstructured":"Clark, D.S.: Short proof of a discrete Gronwall inequality. Discrete Appl. Math. 16(3), 279\u2013281 (1987). https:\/\/doi.org\/10.1016\/0166-218X(87)90064-3","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"380_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/18M1178244","volume":"29","author":"D Davis","year":"2019","unstructured":"Davis, D., Drusvyatskiy, D.: Stochastic model-based minimization of weakly convex functions. SIAM J. Optim. 29(1), 207\u2013239 (2019). https:\/\/doi.org\/10.1137\/18M1178244","journal-title":"SIAM J. Optim."},{"issue":"3, Ser. A","key":"380_CR13","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein, J., Bertsekas, D.P.: On the Douglas\u2013Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55(3, Ser. A), 293\u2013318 (1992). https:\/\/doi.org\/10.1007\/BF01581204","journal-title":"Math. Program."},{"key":"380_CR14","unstructured":"Eisenmann, M.: Methods for the temporal approximation of nonlinear, nonautonomous evolution equations. PhD thesis, TU Berlin (2019)"},{"issue":"6","key":"380_CR15","doi-asserted-by":"publisher","first-page":"1387","DOI":"10.1007\/s10208-018-09412-w","volume":"19","author":"M Eisenmann","year":"2019","unstructured":"Eisenmann, M., Kov\u00e1cs, M., Kruse, R., Larsson, S.: On a randomized backward Euler method for nonlinear evolution equations with time-irregular coefficients. Found. Comput. Math. 19(6), 1387\u20131430 (2019). https:\/\/doi.org\/10.1007\/s10208-018-09412-w","journal-title":"Found. Comput. Math."},{"key":"380_CR16","unstructured":"Fagan, F., Iyengar, G.: Unbiased scalable softmax optimization. ArXiv Preprint, arXiv:1803.08577 (2018)"},{"issue":"2","key":"380_CR17","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/0329022","volume":"29","author":"O G\u00fcler","year":"1991","unstructured":"G\u00fcler, O.: On the convergence of the proximal point algorithm for convex minimization. SIAM J. Control Optim. 29(2), 403\u2013419 (1991). https:\/\/doi.org\/10.1137\/0329022","journal-title":"SIAM J. Control Optim."},{"issue":"2","key":"380_CR18","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/1031049","volume":"31","author":"WW Hager","year":"1989","unstructured":"Hager, W.W.: Updating the inverse of a matrix. SIAM Rev. 31(2), 221\u2013239 (1989). https:\/\/doi.org\/10.1137\/1031049","journal-title":"SIAM Rev."},{"key":"380_CR19","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1017\/CBO9781107340848","volume-title":"Control Theory for Partial Differential Equations: Continuous and Approximation Theories. I. Encyclopedia of Mathematics and its Applications","author":"I Lasiecka","year":"2000","unstructured":"Lasiecka, I., Triggiani, R.: Control Theory for Partial Differential Equations: Continuous and Approximation Theories. I. Encyclopedia of Mathematics and its Applications, vol. 74, p. 644. Cambridge University Press, Cambridge (2000). https:\/\/doi.org\/10.1017\/CBO9781107340848 . (Abstract parabolic systems)"},{"issue":"1","key":"380_CR20","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/s10957-021-01821-2","volume":"189","author":"I Necoara","year":"2021","unstructured":"Necoara, I.: General convergence analysis of stochastic first-order methods for composite optimization. J. Optim. Theory Appl. 189(1), 66\u201395 (2021). https:\/\/doi.org\/10.1007\/s10957-021-01821-2","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"380_CR21","doi-asserted-by":"publisher","first-page":"1421","DOI":"10.1090\/S0002-9947-97-01478-5","volume":"349","author":"NS Papageorgiou","year":"1997","unstructured":"Papageorgiou, N.S.: Convex integral functionals. Trans. Am. Math. Soc. 349(4), 1421\u20131436 (1997). https:\/\/doi.org\/10.1090\/S0002-9947-97-01478-5","journal-title":"Trans. Am. Math. Soc."},{"key":"380_CR22","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1515\/9783110532982","volume-title":"Applied Nonlinear Functional Analysis. An Introduction","author":"NS Papageorgiou","year":"2018","unstructured":"Papageorgiou, N.S., Winkert, P.: Applied Nonlinear Functional Analysis. An Introduction, p. 612. De Gruyter, Berlin (2018). https:\/\/doi.org\/10.1515\/9783110532982"},{"key":"380_CR23","unstructured":"Patrascu, A., Irofti, P.: Stochastic proximal splitting algorithm for composite minimization. ArXiv Preprint, arXiv:1912.02039v2 (2020)"},{"issue":"198","key":"380_CR24","first-page":"1","volume":"18","author":"A Patrascu","year":"2018","unstructured":"Patrascu, A., Necoara, I.: Nonasymptotic convergence of stochastic proximal point methods for constrained convex optimization. J. Mach. Learn. Res. 18(198), 1\u201342 (2018)","journal-title":"J. Mach. Learn. Res."},{"key":"380_CR25","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1093\/oso\/9780198501787.001.0001","volume-title":"Domain Decomposition Methods for Partial Differential Equations Numerical Mathematics and Scientific Computation","author":"A Quarteroni","year":"1999","unstructured":"Quarteroni, A., Valli, A.: Domain Decomposition Methods for Partial Differential Equations Numerical Mathematics and Scientific Computation, p. 360. Oxford University Press, New York (1999)"},{"issue":"10","key":"380_CR26","doi-asserted-by":"publisher","first-page":"7036","DOI":"10.1109\/TIT.2011.2154375","volume":"57","author":"M Raginsky","year":"2011","unstructured":"Raginsky, M., Rakhlin, A.: Information-based complexity, feedback and dynamics in convex programming. IEEE Trans. Inf. Theory 57(10), 7036\u20137056 (2011). https:\/\/doi.org\/10.1109\/TIT.2011.2154375","journal-title":"IEEE Trans. Inf. Theory"},{"key":"380_CR27","doi-asserted-by":"publisher","first-page":"209","DOI":"10.2140\/pjm.1970.33.209","volume":"33","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: On the maximal monotonicity of subdifferential mappings. Pac. J. Math. 33, 209\u2013216 (1970)","journal-title":"Pac. J. Math."},{"issue":"5","key":"380_CR28","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14(5), 877\u2013898 (1976). https:\/\/doi.org\/10.1137\/0314056","journal-title":"SIAM J. Control Optim."},{"issue":"3","key":"380_CR29","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1080\/17442508208833217","volume":"7","author":"RT Rockafellar","year":"1982","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: On the interchange of subdifferentiation and conditional expectations for convex functionals. Stochastics 7(3), 173\u2013182 (1982). https:\/\/doi.org\/10.1080\/17442508208833217","journal-title":"Stochastics"},{"issue":"3","key":"380_CR30","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1007\/s00245-019-09617-7","volume":"82","author":"L Rosasco","year":"2020","unstructured":"Rosasco, L., Villa, S., V\u0169, B.C.: Convergence of stochastic proximal gradient algorithm. Appl. Math. Optim. 82(3), 891\u2013917 (2020). https:\/\/doi.org\/10.1007\/s00245-019-09617-7","journal-title":"Appl. Math. Optim."},{"key":"380_CR31","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-0348-0513-1","volume-title":"Nonlinear Partial Differential Equations with Applications","author":"T Roub\u00ed\u010dek","year":"2013","unstructured":"Roub\u00ed\u010dek, T.: Nonlinear Partial Differential Equations with Applications, 2nd edn., p. 476. Springer, Basel (2013). https:\/\/doi.org\/10.1007\/978-3-0348-0513-1","edition":"2"},{"key":"380_CR32","unstructured":"Ryu, E., Boyd, S.: Stochastic proximal iteration: a non-asymptotic improvement upon stochastic gradient descent. www.math.ucla.edu\/eryu\/papers\/spi.pdf (2016). Accessed 20 March 2020"},{"issue":"6","key":"380_CR33","doi-asserted-by":"publisher","first-page":"778","DOI":"10.4208\/jcm.1906-m2018-0282","volume":"37","author":"EK Ryu","year":"2019","unstructured":"Ryu, E.K., Yin, W.: Proximal\u2013proximal\u2013gradient method. J. Comput. Math. 37(6), 778\u2013812 (2019). https:\/\/doi.org\/10.4208\/jcm.1906-m2018-0282","journal-title":"J. Comput. Math."},{"issue":"5","key":"380_CR34","doi-asserted-by":"publisher","first-page":"1832","DOI":"10.1109\/tac.2019.2890888","volume":"64","author":"A Salim","year":"2019","unstructured":"Salim, A., Bianchi, P., Hachem, W.: Snake: a stochastic proximal gradient algorithm for regularized problems over large graphs. IEEE Trans. Automat. Control 64(5), 1832\u20131847 (2019). https:\/\/doi.org\/10.1109\/tac.2019.2890888","journal-title":"IEEE Trans. Automat. Control"},{"issue":"4","key":"380_CR35","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/s11222-015-9560-y","volume":"25","author":"P Toulis","year":"2015","unstructured":"Toulis, P., Airoldi, E.M.: Scalable estimation strategies based on stochastic approximations: classical results and new insights. Stat. Comput. 25(4), 781\u2013795 (2015). https:\/\/doi.org\/10.1007\/s11222-015-9560-y","journal-title":"Stat. Comput."},{"issue":"4","key":"380_CR36","doi-asserted-by":"publisher","first-page":"1694","DOI":"10.1214\/16-AOS1506","volume":"45","author":"P Toulis","year":"2017","unstructured":"Toulis, P., Airoldi, E.M.: Asymptotic and finite-sample properties of estimators based on stochastic gradients. Ann. Stat. 45(4), 1694\u20131727 (2017). https:\/\/doi.org\/10.1214\/16-AOS1506","journal-title":"Ann. Stat."},{"key":"380_CR37","unstructured":"Toulis, P., Airoldi, E., Rennie, J.: Statistical analysis of stochastic gradient methods for generalized linear models. In: Xing, E.P., Jebara, T. (eds.) Proceedings of the 31st International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 32, pp. 667\u2013675. PMLR, Bejing, China (2014). https:\/\/proceedings.mlr.press\/v32\/toulis14.html"},{"key":"380_CR38","doi-asserted-by":"crossref","unstructured":"Toulis, P., Horel, T., Airoldi, E.M.: The proximal Robbins\u2013Monro method. ArXiv Preprint, arXiv:1510.00967v4 (2020)","DOI":"10.1111\/rssb.12405"},{"key":"380_CR39","unstructured":"Toulis, P., Tran, D., Airoldi, E.: Towards stability and optimality in stochastic gradient descent. In: Gretton, A., Robert, C.C. (eds.) Proceedings of the 19th International Conference on Artificial Intelligence and Statistics. Proceedings of Machine Learning Research, vol. 51, pp. 1290\u20131298. PMLR, Cadiz, Spain (2016). http:\/\/proceedings.mlr.press\/v51\/toulis16.html"},{"key":"380_CR40","unstructured":"Tran, D., Toulis, P., Airoldi, E.M.: Stochastic gradient descent methods for estimation with large data sets. ArXiv Preprint, arXiv:1509.06459 (2015)"},{"key":"380_CR41","doi-asserted-by":"publisher","unstructured":"Zeidler, E.: Nonlinear Functional Analysis and Its Applications. II\/B, pp. 469\u20131202. Springer, New York (1990). https:\/\/doi.org\/10.1007\/978-1-4612-0985-0. Nonlinear monotone operators","DOI":"10.1007\/978-1-4612-0985-0"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00380-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-022-00380-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-022-00380-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,23]],"date-time":"2023-11-23T11:57:00Z","timestamp":1700740620000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-022-00380-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,20]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["380"],"URL":"https:\/\/doi.org\/10.1007\/s10589-022-00380-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2022,6,20]]},"assertion":[{"value":"24 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2022","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 computations were enabled by resources provided by the Swedish National Infrastructure for Computing (SNIC) at LUNARC partially funded by the Swedish Research Council through grant agreement no. 2018\u201305973.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Computations"}},{"value":"The authors have no conflicts of interest to declare that are relevant to the content of this article.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest\/Competing interests"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":6,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}