{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T14:40:12Z","timestamp":1730385612213,"version":"3.28.0"},"reference-count":19,"publisher":"Informa UK Limited","issue":"4","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2024,7,3]]},"DOI":"10.1080\/10556788.2024.2306383","type":"journal-article","created":{"date-parts":[[2024,2,5]],"date-time":"2024-02-05T11:41:32Z","timestamp":1707133292000},"page":"699-724","update-policy":"http:\/\/dx.doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":0,"title":["Optimized convergence of stochastic gradient descent by weighted averaging"],"prefix":"10.1080","volume":"39","author":[{"given":"Melinda","family":"Hagedorn","sequence":"first","affiliation":[{"name":"Math.-Nat. Fakult\u00e4t, Heinrich Heine Univ, D\u00fcsseldorf, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"Jarre","sequence":"additional","affiliation":[{"name":"Math.-Nat. Fakult\u00e4t, Heinrich Heine Univ, D\u00fcsseldorf, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2024,2,5]]},"reference":[{"key":"e_1_3_4_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-016-0109-7"},{"key":"e_1_3_4_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2705559"},{"key":"e_1_3_4_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2211477"},{"key":"e_1_3_4_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-9473(01)00065-2"},{"key":"e_1_3_4_6_1","doi-asserted-by":"publisher","DOI":"10.3390\/app13052935"},{"key":"e_1_3_4_7_1","unstructured":"P. Izmailov D. Podoprikhin T. Garipov D. Vetrov and A.G. Wilson Averaging weights leads to wider optima and better generalization in arXiv preprint arXiv:1803.05407; 2018."},{"key":"e_1_3_4_8_1","unstructured":"F. Jarre and F. Lieder A Derivative-Free and Ready-to-Use NLP Solver for Matlab or Octave in Preprint http:\/\/www.opt.uni-duesseldorf.de\/\u02dcjarre\/dot\/mwdc.pdf; 2017."},{"key":"e_1_3_4_9_1","unstructured":"R. Johnson and T. Zhang Accelerating stochastic gradient descent using predictive variance reduction in Burges C.J. (Hrsg.) Bottou L. (Hrsg.) Welling M. (Hrsg.) Ghahramani Z. (Hrsg.) Weinberger K.Q. (Hrsg.) Advances in Neural Information Processing Systems Bd. 26 Curran Associates Inc. 2013."},{"key":"e_1_3_4_10_1","volume-title":"Survey Sampling","author":"Kish L.","year":"1965","unstructured":"L. Kish, Survey Sampling, John Wiley & Sons, Inc, New York, 1965."},{"key":"e_1_3_4_11_1","first-page":"2963","article-title":"On almost sure convergence rates of stochastic gradient methods","author":"Liu J.","year":"2022","unstructured":"J. Liu and Y. Yuan, On almost sure convergence rates of stochastic gradient methods, Conf. Learn. Theory PMLR (2022), pp. 2963\u20132983.","journal-title":"Conf. Learn. Theory"},{"key":"e_1_3_4_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-020-00220-z"},{"key":"e_1_3_4_13_1","article-title":"Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm","volume":"27","author":"Needell D.","year":"2014","unstructured":"D. Needell, R. Ward, and N. Srebro, Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm, Adv. Neural. Inf. Process. Syst. 27 (2014).\u00a0https:\/\/proceedings.neurips.cc\/paper\/2014\/file\/f29c21d4897f78948b91f03172341b7b-Paper.pdf.","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"e_1_3_4_14_1","first-page":"3222","article-title":"Iterate averaging as regularization for stochastic gradient descent","author":"Neu G.","year":"2018","unstructured":"G. Neu and L. Rosasco, Iterate averaging as regularization for stochastic gradient descent, Conf. Learn. Theory PMLR (2018), pp. 3222\u20133242.","journal-title":"Conf. Learn. Theory"},{"key":"e_1_3_4_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(64)90137-5"},{"key":"e_1_3_4_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/0330046"},{"key":"e_1_3_4_17_1","unstructured":"B.T. Polyak Introduction to optimization 1987."},{"key":"e_1_3_4_18_1","unstructured":"G. Repository https:\/\/github.com\/MHagedorn\/averaging; 2023."},{"key":"e_1_3_4_19_1","first-page":"3935","article-title":"Almost sure convergence rates for stochastic gradient descent and stochastic heavy ball","author":"Sebbouh O.","year":"2021","unstructured":"O. Sebbouh, R.M. Gower, and A. Defazio, Almost sure convergence rates for stochastic gradient descent and stochastic heavy ball, Conf. Learn. Theory PMLR (2021), pp. 3935\u20133971.","journal-title":"Conf. Learn. Theory"},{"key":"e_1_3_4_20_1","first-page":"71","article-title":"Stochastic gradient descent for non-smooth optimization: Convergence results and optimal averaging schemes","author":"Shamir O.","year":"2013","unstructured":"O. Shamir and T. Zhang, Stochastic gradient descent for non-smooth optimization: Convergence results and optimal averaging schemes, Int. Conf. Mach. Learn. PMLR (2013), pp. 71\u201379.","journal-title":"Int. Conf. Mach. Learn."}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2024.2306383","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T14:04:00Z","timestamp":1730383440000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2024.2306383"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,5]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,7,3]]}},"alternative-id":["10.1080\/10556788.2024.2306383"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2024.2306383","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"type":"print","value":"1055-6788"},{"type":"electronic","value":"1029-4937"}],"subject":[],"published":{"date-parts":[[2024,2,5]]},"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-23","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-01-12","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-02-05","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}