{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:15:22Z","timestamp":1753884922394,"version":"3.41.2"},"reference-count":26,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","funder":[{"DOI":"10.13039\/100005326","name":"Yale University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100005326","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM Journal on Mathematics of Data Science"],"published-print":{"date-parts":[[2025,9,30]]},"DOI":"10.1137\/23m1617096","type":"journal-article","created":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T12:01:06Z","timestamp":1752062466000},"page":"965-992","source":"Crossref","is-referenced-by-count":1,"title":["Select without Fear: Almost All Minibatch Schedules Generalize Optimally"],"prefix":"10.1137","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5165-3317","authenticated-orcid":true,"given":"Konstantinos E.","family":"Nikolakakis","sequence":"first","affiliation":[{"name":"This work was developed while this author was a postdoctoral researcher with the Department of Electrical and Computer Engineering (ECE), Yale University, New Haven, CT 06511 USA. Current affiliation: SES AI, Woburn, MA 01801 USA."}]},{"given":"Amin","family":"Karbasi","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Yale University, New Haven, CT 06511 USA, and Robust Intelligence (now part of CISCO), San Francisco, CA 94107 USA."}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3459-5044","authenticated-orcid":true,"given":"Dionysis","family":"Kalogerias","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Yale University, New Haven, CT 06511 USA."}]}],"member":"351","published-online":{"date-parts":[[2025,7,9]]},"reference":[{"key":"ref1","first-page":"25033","volume-title":"Advances in Neural Information Processing Systems, Vol. 34","author":"Amir I.","year":"2021"},{"key":"ref3","first-page":"23539","volume-title":"Advances in Neural Information Processing Systems, Vol. 35","author":"Amir I.","year":"2022"},{"key":"ref4","first-page":"4381","volume-title":"Advances in Neural Information Processing Systems, Vol. 33","author":"Bassily R.","year":"2020"},{"key":"ref5","volume-title":"Convex Optimization Algorithms","author":"Bertsekas D.","year":"2015"},{"key":"ref6","volume-title":"Nonlinear Programming, Athena Scientific","author":"Bertsekas D. P.","year":"1999"},{"key":"ref7","first-page":"499","volume":"2","author":"Bousquet O.","year":"2002","journal-title":"J. Mach. Learn. Res."},{"key":"ref10","first-page":"19836","volume-title":"Advances in Neural Information Processing Systems","volume":"34","author":"Farghly T.","year":"2021"},{"key":"ref11","volume-title":"Advances in Neural Information Processing Systems, Vol. 29","author":"Feldman V.","year":"2016"},{"key":"ref12","volume-title":"Advances in Neural Information Processing Systems, Vol. 31","author":"Feldman V.","year":"2018"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/15M1049695"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/17M1147846"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-019-01440-w","volume":"186","author":"G\u00fcrb\u00fczbalaban M.","year":"2021","journal-title":"Math. Program."},{"key":"ref21","doi-asserted-by":"crossref","first-page":"1234","DOI":"10.1162\/neco_a_01588","volume":"35","author":"Huang Z.","year":"2023","journal-title":"Neural Comput."},{"key":"ref22","first-page":"2690","volume":"12","author":"Kim B.","year":"2023","journal-title":"Inf. Inference"},{"key":"ref25","first-page":"1","volume":"22","author":"Lei Y.","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"ref26","first-page":"38557","volume-title":"Advances in Neural Information Processing Systems, Vol. 35","author":"Lei Y.","year":"2022"},{"key":"ref36","doi-asserted-by":"crossref","unstructured":"A. Nedi\u0107 and D. Bertsekas, Convergence rate of incremental subgradient algorithms, in Stochastic Optimization: Algorithms and Applications, Springer, Boston, 2001, pp. 223\u2013264, https:\/\/doi.org\/10.1007\/978-1-4757-6594-6_11.","DOI":"10.1007\/978-1-4757-6594-6_11"},{"key":"ref37","volume-title":"Advances in Neural Information Processing Systems, Vol. 32","author":"Negrea J.","year":"2019"},{"key":"ref38","first-page":"31525","volume-title":"Advances in Neural Information Processing Systems, Vol. 35","author":"Nikolakakis K.","year":"2022"},{"key":"ref41","first-page":"546","volume-title":"Proceedings of the IEEE International Symposium on Information Theory","author":"Pensia A.","year":"2018"},{"key":"ref47","first-page":"26080","volume-title":"Advances in Neural Information Processing Systems, Vol. 34","author":"Wang B.","year":"2021"},{"key":"ref48","first-page":"24222","volume-title":"Advances in Neural Information Processing Systems, Vol. 34","author":"Wang H.","year":"2021"},{"key":"ref51","first-page":"26523","volume-title":"Advances in Neural Information Processing Systems, Vol. 34","author":"Xing Y.","year":"2021"},{"key":"ref52","volume-title":"Advances in Neural Information Processing Systems, Vol. 30","author":"Xu A.","year":"2017"},{"key":"ref56","first-page":"27290","volume-title":"Advances in Neural Information Processing Systems, Vol. 34","author":"Zhou P.","year":"2021"},{"key":"ref57","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s10994-021-06056-w","volume":"111","author":"Zhou Y.","year":"2022","journal-title":"Mach. Learn."}],"container-title":["SIAM Journal on Mathematics of Data Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T12:01:11Z","timestamp":1752062471000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/23M1617096"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,9]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9,30]]}},"alternative-id":["10.1137\/23M1617096"],"URL":"https:\/\/doi.org\/10.1137\/23m1617096","relation":{},"ISSN":["2577-0187"],"issn-type":[{"value":"2577-0187","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,9]]}}}