{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,18]],"date-time":"2026-09-18T18:28:24Z","timestamp":1789756104234,"version":"4.0.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T00:00:00Z","timestamp":1714348800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T00:00:00Z","timestamp":1714348800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"NSF","award":["1740796"],"award-info":[{"award-number":["1740796"]}]},{"name":"NSF","award":["2008434"],"award-info":[{"award-number":["2008434"]}]},{"name":"NSF","award":["2140057"],"award-info":[{"award-number":["2140057"]}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-22-1-2154"],"award-info":[{"award-number":["N00014-22-1-2154"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"crossref","award":["PGSD3-532673-2019"],"award-info":[{"award-number":["PGSD3-532673-2019"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s10107-024-02078-z","type":"journal-article","created":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T07:02:34Z","timestamp":1714374154000},"page":"651-679","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Sample complexity analysis for adaptive optimization algorithms with stochastic oracles"],"prefix":"10.1007","volume":"209","author":[{"given":"Billy","family":"Jin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Katya","family":"Scheinberg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8511-9649","authenticated-orcid":false,"given":"Miaolan","family":"Xie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,4,29]]},"reference":[{"issue":"2","key":"2078_CR1","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10107-017-1137-4","volume":"169","author":"C Cartis","year":"2017","unstructured":"Cartis, C., Scheinberg, K.: Global convergence rate analysis of unconstrained optimization methods based on probabilistic models. Math. Program. 169(2), 337\u2013375 (2017). https:\/\/doi.org\/10.1007\/s10107-017-1137-4","journal-title":"Math. Program."},{"issue":"1","key":"2078_CR2","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1137\/18M1216250","volume":"30","author":"C Paquette","year":"2020","unstructured":"Paquette, C., Scheinberg, K.: A stochastic line search method with expected complexity analysis. SIAM J. Optim. 30(1), 349\u2013376 (2020)","journal-title":"SIAM J. Optim."},{"key":"2078_CR3","doi-asserted-by":"crossref","unstructured":"Berahas, A.S., Cao, L., Scheinberg, K.: Global convergence rate analysis of a generic line search algorithm with noise. SIAM J. Optim. 1489\u20131518 (2019)","DOI":"10.1137\/19M1291832"},{"issue":"2","key":"2078_CR4","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)","journal-title":"INFORMS J. Optim."},{"issue":"3","key":"2078_CR5","doi-asserted-by":"publisher","first-page":"1579","DOI":"10.1093\/imanum\/drx043","volume":"38","author":"S Gratton","year":"2018","unstructured":"Gratton, S., Royer, C.W., Vicente, L.N., Zhang, Z.: Complexity and global rates of trust-region methods based on probabilistic models. IMA J. Numer. Anal. 38(3), 1579\u20131597 (2018)","journal-title":"IMA J. Numer. Anal."},{"key":"2078_CR6","doi-asserted-by":"crossref","unstructured":"Cao, L., Berahas, A.S., Scheinberg, K.: First-and Second-Order High Probability Complexity Bounds for Trust-Region Methods with Noisy Oracles (2022). arXiv:2205.03667","DOI":"10.1007\/s10107-023-01999-5"},{"key":"2078_CR7","doi-asserted-by":"crossref","unstructured":"Scheinberg, K., Xie, M.: Stochastic adaptive regularization method with cubics: a high probability complexity bound. In: Winter Simulation Conference (2023)","DOI":"10.1109\/WSC60868.2023.10408598"},{"key":"2078_CR8","unstructured":"Arjevani, Y., Carmon, Y., Duchi, J.C., Foster, D.J., Srebro, N., Woodworth, B.: Lower Bounds for Non-convex Stochastic Optimization (2019). arXiv:1912.02365"},{"key":"2078_CR9","unstructured":"Kingma, D.P., Ba, J.: Adam: A Method for Stochastic Optimization (2014). arXiv:1412.6980"},{"key":"2078_CR10","unstructured":"Tan, C., Ma, S., Dai, Y.-H., Qian, Y.: Barzilai\u2013Borwein step size for stochastic gradient descent. In: Advances in Neural Information Processing Systems, vol. 29, pp. 685\u2013693. Curran Associates Inc., NY (2016)"},{"key":"2078_CR11","doi-asserted-by":"crossref","unstructured":"Rinaldi, F., Vicente, L., Zeffiro, D.: Stochastic trust-region and direct-search methods: a weak tail bound condition and reduced sample sizing (2023). arXiv:2202.11074","DOI":"10.1137\/22M1543446"},{"issue":"4","key":"2078_CR12","doi-asserted-by":"publisher","first-page":"3145","DOI":"10.1137\/15M1042425","volume":"28","author":"S Shashaani","year":"2018","unstructured":"Shashaani, S., Hashemi, F.S., Pasupathy, R.: Astro-df: a class of adaptive sampling trust-region algorithms for derivative-free stochastic optimization. SIAM J. Optim. 28(4), 3145\u20133176 (2018)","journal-title":"SIAM J. Optim."},{"key":"2078_CR13","unstructured":"Regier, J., Jordan, M.I., McAuliffe, J.: Fast black-box variational inference through stochastic trust-region optimization. Proceedings of the 31st International Conference on Neural Information Processing Systems, pp. 2399\u20132408. Curran Associates Inc., NY (2017)"},{"key":"2078_CR14","doi-asserted-by":"publisher","unstructured":"Berahas, A.S., Xie, M., Zhou, B.: A Sequential Quadratic Programming Method with High Probability Complexity Bounds for Nonlinear Equality Constrained Stochastic Optimization (2023). https:\/\/doi.org\/10.48550\/ARXIV.2301.00477","DOI":"10.48550\/ARXIV.2301.00477"},{"key":"2078_CR15","doi-asserted-by":"publisher","unstructured":"Menickelly, M., Wild, S.M., Xie, M.: A Stochastic Quasi-Newton Method in the Absence of Common Random Numbers (2023). https:\/\/doi.org\/10.48550\/ARXIV.2302.09128","DOI":"10.48550\/ARXIV.2302.09128"},{"key":"2078_CR16","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s10208-021-09513-z","volume":"22","author":"AS Berahas","year":"2021","unstructured":"Berahas, A.S., Cao, L., Choromanski, K., Scheinberg, K.: A theoretical and empirical comparison of gradient approximations in derivative-free optimization. Found. Comput. Math. 22, 507\u2013560 (2021)","journal-title":"Found. Comput. Math."},{"key":"2078_CR17","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1080\/00401706.1960.10489888","volume":"2","author":"FJ Anscombe","year":"1960","unstructured":"Anscombe, F.J.: Rejection of outliers. Technometrics 2, 123\u2013146 (1960)","journal-title":"Technometrics"},{"key":"2078_CR18","unstructured":"Yin, D., Chen, Y., Kannan, R., Bartlett, P.: Byzantine-robust distributed learning: towards optimal statistical rates. In: International Conference on Machine Learning, pp. 5650\u20135659. PMLR (2018)"},{"key":"2078_CR19","doi-asserted-by":"publisher","unstructured":"Spall, J.C.: Stochastic optimization and the simultaneous perturbation method. In: Proceedings of the 31st Conference on Winter Simulation: Simulation\u2014A Bridge to the Future\u2014Volume 1. WSC \u201999, pp. 101\u2013109. Association for Computing Machinery, New York, NY, USA (1999). https:\/\/doi.org\/10.1145\/324138.324170","DOI":"10.1145\/324138.324170"},{"key":"2078_CR20","unstructured":"Feller, W.: An Introduction to Probability Theory and Its Applications, vol. 1. Wiley (1968). http:\/\/www.amazon.ca\/exec\/obidos\/redirect?tag=citeulike04-20 &path=ASIN\/0471257087"},{"key":"2078_CR21","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. Springer (2015)","DOI":"10.1007\/978-1-4939-1384-8_8"},{"key":"2078_CR22","unstructured":"Jin, B., Scheinberg, K., Xie, M.: High probability complexity bounds for line search based on stochastic oracles. In: Ranzato, M., Beygelzimer, A., Dauphin, Y., Liang, P.S., Vaughan, J.W. (eds.) Advances in Neural Information Processing Systems, vol. 34, pp. 9193\u20139203 (2021). https:\/\/proceedings.neurips.cc\/paper\/2021\/file\/4cb811134b9d39fc3104bd06ce75abad-Paper.pdf"},{"issue":"2","key":"2078_CR23","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)","journal-title":"SIAM Rev."},{"key":"2078_CR24","unstructured":"Bach, F., Moulines, E.: Non-asymptotic analysis of stochastic approximation algorithms for machine learning. In: Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a Meeting Held 12\u201314 December 2011, Granada, Spain, pp. 451\u2013459 (2011). http:\/\/papers.nips.cc\/paper\/4316-non-asymptotic-analysis-of-stochastic-approximation-algorithms-for-machine-learning"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02078-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-024-02078-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02078-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T11:52:55Z","timestamp":1736941975000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-024-02078-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,29]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["2078"],"URL":"https:\/\/doi.org\/10.1007\/s10107-024-02078-z","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,29]]},"assertion":[{"value":"20 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}