{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:09:06Z","timestamp":1743001746439,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031340192"},{"type":"electronic","value":"9783031340208"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-34020-8_2","type":"book-chapter","created":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T10:02:30Z","timestamp":1685095350000},"page":"21-35","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Diagonal Barzilai-Borwein Rules in\u00a0Stochastic Gradient-Like Methods"],"prefix":"10.1007","author":[{"given":"Giorgia","family":"Franchini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Federica","family":"Porta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valeria","family":"Ruggiero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilaria","family":"Trombini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Zanni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,27]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.patrec.2019.08.029","volume":"128","author":"J Liang","year":"2019","unstructured":"Liang, J., Xu, Y., Bao, C., Quan, Y., Ji, H.: Barzilai\u2013Borwein-based adaptive learning rate for deep learning. Pattern Recogn. Lett. 128, 197\u2013203 (2019). https:\/\/doi.org\/10.1016\/j.patrec.2019.08.029","journal-title":"Pattern Recogn. Lett."},{"key":"2_CR2","unstructured":"Tan, C., Ma, S., Dai, Y.H., Qian, Y.: Barzilai\u2013Borwein step size for stochastic gradient method. In: Lee, D.D., Sugiyama, M., Luxburg, U.V., Guyon, I., Garnett, R. (eds.) Advances in Neural Information Processing Systems (NIPS 2016), vol. 29 (2016)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-030-95470-3_21","volume-title":"Machine Learning, Optimization, and Data Science","author":"G Franchini","year":"2022","unstructured":"Franchini, G., Ruggiero, V., Trombini, I.: Thresholding procedure via Barzilai\u2013Borwein rules for the steplength selection in stochastic gradient methods. In: Nicosia, G., et al. (eds.) LOD 2021. LNISA, vol. 13164, pp. 277\u2013282. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-95470-3_21"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.neucom.2018.06.002","volume":"314","author":"Z Yang","year":"2018","unstructured":"Yang, Z., Wang, C., Zang, Y., Li, J.: Mini-batch algorithms with Barzilai\u2013Borwein update step. Neurocomputing 314, 177\u2013185 (2018)","journal-title":"Neurocomputing"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Park, Y., Dhar, S., Boyd, S., Shah, M.: Variable metric proximal gradient method with diagonal Barzilai\u2013Borwein stepsize. In: 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), ICASSP 2020, pp. 3597\u20133601 (2020). https:\/\/doi.org\/10.1109\/ICASSP40776.2020.9054193","DOI":"10.1109\/ICASSP40776.2020.9054193"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Yang, Z., Ma, L.: Adaptive stochastic gradient descent for large-scale learning problems (2022). https:\/\/orcid.org\/0000-0002-1468-5042","DOI":"10.21203\/rs.3.rs-1066512\/v1"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s40305-022-00436-2","volume":"11","author":"TT Yu","year":"2022","unstructured":"Yu, T.T., Liu, X.W., Dai, Y.H., Sun, J.: A mini-batch proximal stochastic recursive gradient algorithm with diagonal Barzilai\u2013Borwein stepsize. J. Oper. Res. Soc. China 11, 277\u2013307 (2022)","journal-title":"J. Oper. Res. Soc. China"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Bottou, L.: On-Line Learning and Stochastic Approximations, pp. 9\u201342. Cambridge University Press, USA (1999)","DOI":"10.1017\/CBO9780511569920.003"},{"issue":"4","key":"2_CR9","doi-asserted-by":"publisher","first-page":"3312","DOI":"10.1137\/17M1154679","volume":"28","author":"R Bollapragada","year":"2018","unstructured":"Bollapragada, R., Byrd, R., Nocedal, J.: Adaptive sampling strategies for stochastic optimization. SIAM J. Optim. 28(4), 3312\u20133343 (2018)","journal-title":"SIAM J. Optim."},{"issue":"134","key":"2_CR10","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-012-0572-5","volume":"1","author":"RH Byrd","year":"2012","unstructured":"Byrd, R.H., Chin, G.M., Nocedal, J., Wu, Y.: Sample size selection in optimization methods for machine learning. Math. Program. 1(134), 127\u2013155 (2012)","journal-title":"Math. Program."},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-030-39081-5_17","volume-title":"Numerical Computations: Theory and Algorithms","author":"G Franchini","year":"2020","unstructured":"Franchini, G., Ruggiero, V., Zanni, L.: On the steplength selection in stochastic gradient methods. In: Sergeyev, Y.D., Kvasov, D.E. (eds.) NUMTA 2019. LNCS, vol. 11973, pp. 186\u2013197. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-39081-5_17"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/978-3-319-46128-1_50","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"H Karimi","year":"2016","unstructured":"Karimi, H., Nutini, J., Schmidt, M.: Linear convergence of gradient and proximal-gradient methods under the Polyak-\u0141ojasiewicz condition. In: Frasconi, P., Landwehr, N., Manco, G., Vreeken, J. (eds.) ECML PKDD 2016. LNCS (LNAI), vol. 9851, pp. 795\u2013811. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46128-1_50"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Applied Optimization. Kluwer Academic Publication, Boston (2004)","DOI":"10.1007\/978-1-4419-8853-9"}],"container-title":["Communications in Computer and Information Science","Optimization and Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-34020-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T10:08:14Z","timestamp":1685095694000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34020-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031340192","9783031340208"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34020-8_2","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OLA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Malaga","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ola2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ola2023.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"sciencesconf.org","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}