{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:42Z","timestamp":1740122682999,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T00:00:00Z","timestamp":1713916800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T00:00:00Z","timestamp":1713916800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100006192","name":"Advanced Scientific Computing Research","doi-asserted-by":"crossref","award":["DE-AC02-06CH11357"],"award-info":[{"award-number":["DE-AC02-06CH11357"]}],"id":[{"id":"10.13039\/100006192","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":[[2024,6]]},"DOI":"10.1007\/s10589-024-00563-x","type":"journal-article","created":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T08:02:13Z","timestamp":1713945733000},"page":"405-442","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Stochastic average model methods"],"prefix":"10.1007","volume":"88","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2023-0837","authenticated-orcid":false,"given":"Matt","family":"Menickelly","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6099-2772","authenticated-orcid":false,"given":"Stefan M.","family":"Wild","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,24]]},"reference":[{"issue":"4","key":"563_CR1","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1023\/A:1010091628740","volume":"1","author":"N Aires","year":"1999","unstructured":"Aires, N.: Algorithms to find exact inclusion probabilities for conditional Poisson sampling and Pareto $$\\pi $$ps sampling designs. Methodol. Comput. Appl. Probab. 1(4), 457\u2013469 (1999). https:\/\/doi.org\/10.1023\/A:1010091628740","journal-title":"Methodol. Comput. Appl. Probab."},{"issue":"2","key":"563_CR2","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1287\/ijoo.2019.0016","volume":"1","author":"J Blanchet","year":"2019","unstructured":"Blanchet, J., Cartis, C., Menickelly, M., Scheinberg, K.: Convergence rate analysis of a stochastic trust-region method via supermartingales. INFORMS J. Optim. 1(2), 92\u2013119 (2019). https:\/\/doi.org\/10.1287\/ijoo.2019.0016","journal-title":"INFORMS J. Optim."},{"issue":"2","key":"563_CR3","doi-asserted-by":"publisher","first-page":"024001","DOI":"10.1088\/1361-6471\/abd009","volume":"48","author":"R Bollapragada","year":"2020","unstructured":"Bollapragada, R., Menickelly, M., Nazarewicz, W., O\u2019Neal, J., Reinhard, P.-G., Wild, S.M.: Optimization and supervised machine learning methods for fitting numerical physics models without derivatives. J. Phys. G Nucl. Part. Phys. 48(2), 024001 (2020). https:\/\/doi.org\/10.1088\/1361-6471\/abd009","journal-title":"J. Phys. G Nucl. Part. Phys."},{"key":"563_CR4","unstructured":"Bottou, L., Bousquet, O.: The tradeoffs of large scale learning. In: Advances in Neural Information Processing Systems (2007). https:\/\/papers.neurips.cc\/paper\/2007\/hash\/0d3180d672e08b4c5312dcdafdf6ef36-Abstract.html"},{"issue":"2","key":"563_CR5","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."},{"key":"563_CR6","doi-asserted-by":"publisher","first-page":"102662","DOI":"10.1016\/j.advengsoft.2019.03.005","volume":"135","author":"MA Bouhlel","year":"2019","unstructured":"Bouhlel, M.A., Hwang, J.T., Bartoli, N., Lafage, R., Morlier, J., Martins, J.R.: A python surrogate modeling framework with derivatives. Adv. Eng. Softw. 135, 102662 (2019). https:\/\/doi.org\/10.1016\/j.advengsoft.2019.03.005","journal-title":"Adv. Eng. Softw."},{"issue":"4","key":"563_CR7","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/s12532-019-00161-7","volume":"11","author":"C Cartis","year":"2019","unstructured":"Cartis, C., Roberts, L.: A derivative-free Gauss-Newton method. Math. Program. Comput. 11(4), 631\u2013674 (2019). https:\/\/doi.org\/10.1007\/s12532-019-00161-7","journal-title":"Math. Program. Comput."},{"issue":"2","key":"563_CR8","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10107-017-1141-8","volume":"169","author":"R Chen","year":"2018","unstructured":"Chen, R., Menickelly, M., Scheinberg, K.: Stochastic optimization using a trust-region method and random models. Math. Program. 169(2), 447\u2013487 (2018). https:\/\/doi.org\/10.1007\/s10107-017-1141-8","journal-title":"Math. Program."},{"issue":"1","key":"563_CR9","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/jmva.1999.1872","volume":"74","author":"SX Chen","year":"2000","unstructured":"Chen, S.X.: General properties and estimation of conditional Bernoulli models. J. Multivar. Anal. 74(1), 69\u201387 (2000). https:\/\/doi.org\/10.1006\/jmva.1999.1872","journal-title":"J. Multivar. Anal."},{"issue":"3","key":"563_CR10","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1093\/biomet\/81.3.457","volume":"81","author":"X-H Chen","year":"1994","unstructured":"Chen, X.-H., Dempster, A.P., Liu, J.S.: Weighted finite population sampling to maximize entropy. Biometrika 81(3), 457\u2013469 (1994). https:\/\/doi.org\/10.1093\/biomet\/81.3.457","journal-title":"Biometrika"},{"key":"563_CR11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust-Region Methods. SIAM (2000). https:\/\/doi.org\/10.1137\/1.9780898719857","journal-title":"SIAM"},{"key":"563_CR12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718768","author":"AR Conn","year":"2009","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Introduction to derivative-free optimization. SIAM (2009). https:\/\/doi.org\/10.1137\/1.9780898718768","journal-title":"SIAM"},{"issue":"27","key":"563_CR13","first-page":"1","volume":"19","author":"D Csiba","year":"2018","unstructured":"Csiba, D., Richt\u00e1rik, P.: Importance sampling for minibatches. J. Mach. Learn. Res. 19(27), 1\u201321 (2018)","journal-title":"J. Mach. Learn. Res."},{"key":"563_CR14","unstructured":"Defazio, A., Bach, F.R., Lacoste-Julien, S.: SAGA: a fast incremental gradient method with support for non-strongly convex composite objectives. In: Ghahramani, Z., Welling, M., Cortes, C., Lawrence, N.D., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems, vol. 27. pp. 1646\u20131654 (2014). http:\/\/papers.nips.cc\/paper\/5258-saga-a-fast-incremental-gradient-method-with-support-for-non-strongly-convex-composite-objectives"},{"issue":"4","key":"563_CR15","doi-asserted-by":"publisher","first-page":"2341","DOI":"10.1137\/120880811","volume":"23","author":"S Ghadimi","year":"2013","unstructured":"Ghadimi, S., Lan, G.: Stochastic first- and zeroth-order methods for nonconvex stochastic programming. SIAM J. Optim. 23(4), 2341\u20132368 (2013). https:\/\/doi.org\/10.1137\/120880811","journal-title":"SIAM J. Optim."},{"key":"563_CR16","unstructured":"Gower, R., Le Roux, N., Bach, F.: Tracking the gradients using the Hessian: a new look at variance reducing stochastic methods. In: International Conference on Artificial Intelligence and Statistics, pp. 707\u2013715. PMLR (2018)"},{"key":"563_CR17","unstructured":"Hanzely, F., Richtarik, P.: Accelerated coordinate descent with arbitrary sampling and best rates for minibatches. In: Chaudhuri, K., Sugiyama, M. (eds.) Proceedings of the Twenty-Second International Conference on Artificial Intelligence and Statistics, vol. 89, pp. 304\u2013312. PMLR (2019). https:\/\/proceedings.mlr.press\/v89\/hanzely19a.html"},{"key":"563_CR18","unstructured":"Horv\u00e1th, S., Richtarik, P.: Nonconvex variance reduced optimization with arbitrary sampling. In: Chaudhuri, K., Salakhutdinov, R. (eds.) Proceedings of the 36th International Conference on Machine Learning, vol. 97, pp. 2781\u20132789. PMLR (2019). https:\/\/proceedings.mlr.press\/v97\/horvath19a.html"},{"key":"563_CR19","unstructured":"Johnson, R., Zhang, T.: Accelerating stochastic gradient descent using predictive variance reduction. In: Burges, C.J.C., Bottou, L., Welling, M., Ghahramani, Z., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems, vol. 26, pp. 315\u2013323. Curran Associates Inc (2013)"},{"issue":"3","key":"563_CR20","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1214\/aoms\/1177729392","volume":"22","author":"J Kiefer","year":"1952","unstructured":"Kiefer, J., Wolfowitz, J.: Stochastic estimation of the maximum of a regression function. Ann. Math. Stat. 22(3), 462\u2013466 (1952). https:\/\/doi.org\/10.1214\/aoms\/1177729392","journal-title":"Ann. Math. Stat."},{"key":"563_CR21","unstructured":"Menickelly, M.: Avoiding geometry improvement in derivative-free model-based methods via randomization (2023). arXiv preprint arXiv:2305.17336"},{"issue":"1","key":"563_CR22","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/080724083","volume":"20","author":"JJ Mor\u00e9","year":"2009","unstructured":"Mor\u00e9, J.J., Wild, S.M.: Benchmarking derivative-free optimization algorithms. SIAM J. Optim. 20(1), 172\u2013191 (2009). https:\/\/doi.org\/10.1137\/080724083","journal-title":"SIAM J. Optim."},{"key":"563_CR23","unstructured":"Needell, D., Ward, R., Srebro, N.: Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm. In: Ghahramani, Z., Welling, M., Cortes, C., Lawrence, N., Weinberger, K. (eds.) Advances in Neural Information Processing Systems, vol. 27. Curran Associates Inc (2014)"},{"issue":"6","key":"563_CR24","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.1007\/s11590-015-0916-1","volume":"10","author":"P Richt\u00e1rik","year":"2016","unstructured":"Richt\u00e1rik, P., Tak\u00e1\u010d, M.: On optimal probabilities in stochastic coordinate descent methods. Optim. Lett. 10(6), 1233\u20131243 (2016). https:\/\/doi.org\/10.1007\/s11590-015-0916-1","journal-title":"Optim. Lett."},{"issue":"3","key":"563_CR25","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1214\/aoms\/1177729586","journal-title":"Ann. Math. Stat."},{"key":"563_CR26","unstructured":"Roux, N., Schmidt, M., Bach, F.: A stochastic gradient method with an exponential convergence rate for finite training sets. Adv. Neural Inf. Process. Syst. 25 (2012). https:\/\/papers.neurips.cc\/paper\/2012\/hash\/905056c1ac1dad141560467e0a99e1cf-Abstract.html"},{"issue":"1\u20132","key":"563_CR27","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10107-016-1030-6","volume":"162","author":"M Schmidt","year":"2017","unstructured":"Schmidt, M., Roux, N.L., Bach, F.: Minimizing finite sums with the stochastic average gradient. Math. Program. 162(1\u20132), 83\u2013112 (2017). https:\/\/doi.org\/10.1007\/s10107-016-1030-6","journal-title":"Math. Program."},{"key":"563_CR28","volume-title":"Sampling Algorithms","author":"Y Till\u00e9","year":"2006","unstructured":"Till\u00e9, Y.: Sampling Algorithms. Springer, Berlin (2006)"},{"key":"563_CR29","volume-title":"High-Dimensional Probability: An Introduction with Applications in Data Science","author":"R Vershynin","year":"2018","unstructured":"Vershynin, R.: High-Dimensional Probability: An Introduction with Applications in Data Science, vol. 47. Cambridge University Press, Cambridge (2018)"},{"key":"563_CR30","doi-asserted-by":"publisher","unstructured":"Wild, S.M.: Solving derivative-free nonlinear least squares problems with POUNDERS. In: Terlaky, T., Anjos, M.F., Ahmed, S. (eds.) Advances and Trends in Optimization with Engineering Applications, pp. 529\u2013540. SIAM (2017). https:\/\/doi.org\/10.1137\/1.9781611974683.ch40","DOI":"10.1137\/1.9781611974683.ch40"},{"issue":"2","key":"563_CR31","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s10589-010-9367-x","volume":"51","author":"H Zhang","year":"2012","unstructured":"Zhang, H., Conn, A.R.: On the local convergence of a derivative-free algorithm for least-squares minimization. Comput. Optim. Appl. 51(2), 481\u2013507 (2012). https:\/\/doi.org\/10.1007\/s10589-010-9367-x","journal-title":"Comput. Optim. Appl."},{"issue":"6","key":"563_CR32","doi-asserted-by":"publisher","first-page":"3555","DOI":"10.1137\/09075531X","volume":"20","author":"H Zhang","year":"2010","unstructured":"Zhang, H., Conn, A.R., Scheinberg, K.: A derivative-free algorithm for least-squares minimization. SIAM J. Optim. 20(6), 3555\u20133576 (2010). https:\/\/doi.org\/10.1137\/09075531X","journal-title":"SIAM J. Optim."},{"key":"563_CR33","unstructured":"Zhang, L., Mahdavi, M., Jin, R.: Linear convergence with condition number independent access of full gradients. In: Advances in Neural Information Processing Systems, vol. 26 (2013). https:\/\/papers.nips.cc\/paper\/2013\/hash\/37f0e884fbad9667e38940169d0a3c95-Abstract.html"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00563-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-024-00563-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00563-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T16:09:32Z","timestamp":1715616572000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-024-00563-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,24]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["563"],"URL":"https:\/\/doi.org\/10.1007\/s10589-024-00563-x","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2024,4,24]]},"assertion":[{"value":"6 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2024","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 declare no competing interests beyond the stated funding.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}