{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T10:03:00Z","timestamp":1771063380709,"version":"3.50.1"},"reference-count":31,"publisher":"Informa UK Limited","issue":"6","license":[{"start":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T00:00:00Z","timestamp":1714348800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004052","name":"KAUST","doi-asserted-by":"publisher","award":["URF\/1\/2281-01-01"],"award-info":[{"award-number":["URF\/1\/2281-01-01"]}],"id":[{"id":"10.13039\/501100004052","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004052","name":"KAUST","doi-asserted-by":"publisher","award":["URF\/1\/2584-01-01"],"award-info":[{"award-number":["URF\/1\/2584-01-01"]}],"id":[{"id":"10.13039\/501100004052","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100005156","name":"Alexander von Humboldt Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100005156","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1080\/10556788.2024.2339226","type":"journal-article","created":{"date-parts":[[2024,4,30]],"date-time":"2024-04-30T04:55:42Z","timestamp":1714452942000},"page":"1352-1382","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":3,"title":["Approximating Hessian matrices using Bayesian inference: a\u00a0new approach for quasi-Newton methods in stochastic optimization"],"prefix":"10.1080","volume":"39","author":[{"given":"Andr\u00e9 Gustavo","family":"Carlon","sequence":"first","affiliation":[{"name":"Computer, Electrical and Mathematical Sciences & Engineering Division (CEMSE), King Abdullah University of Science & Technology (KAUST), Thuwal, Saudi Arabia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis","family":"Espath","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, University of Nottingham, Nottingham, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ra\u00fal","family":"Tempone","sequence":"additional","affiliation":[{"name":"Computer, Electrical and Mathematical Sciences & Engineering Division (CEMSE), King Abdullah University of Science & Technology (KAUST), Thuwal, Saudi Arabia"},{"name":"Department of Mathematics, RWTH Aachen University, Aachen, Germany"},{"name":"Alexander von Humboldt Professor in Mathematics for Uncertainty Quantification, RWTH Aachen University, Aachen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2024,4,29]]},"reference":[{"key":"e_1_3_3_2_1","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms5308"},{"key":"e_1_3_3_3_1","unstructured":"R. Bollapragada J. Nocedal D. Mudigere H.J. Shi and P.T.P. Tang A progressive batching L-BFGS method for machine learning in International Conference on Machine Learning PMLR 2018 pp. 620\u2013629."},{"key":"e_1_3_3_4_1","first-page":"1737","article-title":"Sgd-qn: Careful quasi-Newton stochastic gradient descent","volume":"10","author":"Bordes A.","year":"2009","unstructured":"A. Bordes, L. Bottou, and P. Gallinari, Sgd-qn: Careful quasi-Newton stochastic gradient descent, J. Mach. Learn. Res. 10 (2009), pp. 1737\u20131754.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_3_3_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1080173"},{"key":"e_1_3_3_6_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"e_1_3_3_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/10079923X"},{"key":"e_1_3_3_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/140954362"},{"key":"e_1_3_3_9_1","unstructured":"A. Carlon L. Espath R. Lopez and R. Tempone Multi-iteration stochastic optimizers preprint (2020). Available at arXiv."},{"key":"e_1_3_3_10_1","unstructured":"A. Defazio F. Bach and S. Lacoste-Julien SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives in Advances in Neural Information Processing Systems Montreal QC Canada 2014 pp. 1646\u20131654."},{"key":"e_1_3_3_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1019005"},{"key":"e_1_3_3_12_1","unstructured":"D. Dua and C. Graff UCI machine learning repository (2022). Available at http:\/\/archive.ics.uci.edu\/ml."},{"key":"e_1_3_3_13_1","first-page":"2386","article-title":"Practical quasi-Newton methods for training deep neural networks","volume":"33","author":"Goldfarb D.","year":"2020","unstructured":"D. Goldfarb, Y. Ren, and A. Bahamou, Practical quasi-Newton methods for training deep neural networks, Adv. Neural. Inf. Process. Syst. 33 (2020), pp. 2386\u20132396.","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"e_1_3_3_14_1","unstructured":"R. Gower D. Goldfarb and P. Richt\u00e1rik Stochastic block BFGS: Squeezing more curvature out of data in International Conference on Machine Learning PMLR 2016 pp. 1869\u20131878."},{"key":"e_1_3_3_15_1","unstructured":"R.M. Gower N. Loizou X. Qian A. Sailanbayev E. Shulgin and P. Richt\u00e1rik SGD: General analysis and improved rates in International Conference on Machine Learning PMLR 2019 pp. 5200\u20135209."},{"key":"e_1_3_3_16_1","unstructured":"P. Hennig Fast probabilistic optimization from noisy gradients in International Conference on Machine Learning PMLR 2013 pp. 62\u201370."},{"key":"e_1_3_3_17_1","first-page":"315","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","volume":"26","author":"Johnson R.","year":"2013","unstructured":"R. Johnson and T. Zhang, Accelerating stochastic gradient descent using predictive variance reduction, Adv. Neural. Inf. Process. Syst. 26 (2013), pp. 315\u2013323.","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"e_1_3_3_18_1","unstructured":"R. Kohavi Scaling up the accuracy of naive-bayes classifiers: A decision-tree hybrid in KDD Portland OR USA Vol. 96 1996 pp. 202\u2013207."},{"key":"e_1_3_3_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2672978"},{"key":"e_1_3_3_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2020.3023660"},{"key":"e_1_3_3_21_1","unstructured":"P. Moritz R. Nishihara and M. Jordan A linearly-convergent stochastic L-BFGS algorithm in Artificial Intelligence and Statistics Cadiz Spain 2016 pp. 249\u2013258."},{"key":"e_1_3_3_22_1","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Nesterov Y.","year":"2013","unstructured":"Y. Nesterov, Introductory Lectures on Convex Optimization: A Basic Course, Vol. 87, Springer Science & Business Media, Cham, Switzerland, 2013."},{"key":"e_1_3_3_23_1","unstructured":"L.M. Nguyen J. Liu K. Scheinberg and M. Tak\u00e1\u010d SARAH: A novel method for machine learning problems using stochastic recursive gradient in International Conference on Machine Learning PMLR 2017 pp. 2613\u20132621."},{"key":"e_1_3_3_24_1","doi-asserted-by":"crossref","unstructured":"V. Pan and J. Reif Efficient parallel solution of linear systems in Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing Providence RI USA 1985 pp. 143\u2013152.","DOI":"10.1145\/22145.22161"},{"key":"e_1_3_3_25_1","volume-title":"Introduction to Optimization. Optimization Software","author":"Polyak B.T.","year":"1987","unstructured":"B.T. Polyak, Introduction to Optimization. Optimization Software, Vol. 1, Inc., Publications Division, New York, 1987."},{"key":"e_1_3_3_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1030-6"},{"key":"e_1_3_3_27_1","unstructured":"N.N. Schraudolph J. Yu and S. G\u00fcnter A stochastic quasi-Newton method for online convex optimization in Artificial Intelligence and Statistics PMLR 2007 pp. 436\u2013443."},{"key":"e_1_3_3_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1373190"},{"key":"e_1_3_3_29_1","unstructured":"J. Sohl-Dickstein B. Poole and S. Ganguli Fast large-scale optimization by unifying stochastic gradient and quasi-Newton methods in International Conference on Machine Learning Beijing China 2014 pp. 604\u2013612."},{"key":"e_1_3_3_30_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-7-173"},{"key":"e_1_3_3_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1053141"},{"key":"e_1_3_3_32_1","unstructured":"Y. Xie R. Byrd and J. Nocedal Analysis of the BFGS method with errors preprint (2019). Available at arXiv arXiv:1901.09063."}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2024.2339226","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T14:48:00Z","timestamp":1734965280000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2024.2339226"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,29]]},"references-count":31,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["10.1080\/10556788.2024.2339226"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2024.2339226","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,29]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2022-09-08","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-03-13","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-04-29","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}