{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:46:13Z","timestamp":1743043573106,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":34,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819722617"},{"type":"electronic","value":"9789819722594"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-2259-4_11","type":"book-chapter","created":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T09:02:31Z","timestamp":1713949351000},"page":"142-154","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Probabilistic Guarantees of\u00a0Stochastic Recursive Gradient in\u00a0Non-convex Finite Sum Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2131-1812","authenticated-orcid":false,"given":"Yanjie","family":"Zhong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-0597-0970","authenticated-orcid":false,"given":"Jiaqi","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1247-8197","authenticated-orcid":false,"given":"Soumendra","family":"Lahiri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,25]]},"reference":[{"key":"11_CR1","unstructured":"Allen-Zhu, Z., Hazan, E.: Variance reduction for faster non-convex optimization. In: International Conference on Machine Learning, pp. 699\u2013707. PMLR (2016)"},{"issue":"3","key":"11_CR2","doi-asserted-by":"publisher","first-page":"1361","DOI":"10.3150\/14-BEJ605","volume":"21","author":"R Bardenet","year":"2015","unstructured":"Bardenet, R., Maillard, O.A.: Concentration inequalities for sampling without replacement. Bernoulli 21(3), 1361\u20131385 (2015)","journal-title":"Bernoulli"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Boucheron, S., Lugosi, G., Massart, P.: Concentration Inequalities: A Nonasymptotic Theory of Independence. Oxford University Press (2013)","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"},{"key":"11_CR4","unstructured":"Defazio, A., Bach, F., Lacoste-Julien, S.: SAGA: a fast incremental gradient method with support for non-strongly convex composite objectives. In: Advances in Neural Information Processing Systems, pp. 1646\u20131654 (2014)"},{"key":"11_CR5","unstructured":"Fang, C., Li, C.J., Lin, Z., Zhang, T.: SPIDER: near-optimal non-convex optimization via stochastic path integrated differential estimator. In: Proceedings of the 32nd International Conference on Neural Information Processing Systems, pp. 687\u2013697 (2018)"},{"issue":"4","key":"11_CR6","doi-asserted-by":"publisher","first-page":"2341","DOI":"10.1137\/120880811","volume":"23","author":"S Ghadimi","year":"2013","unstructured":"Ghadimi, S., Lan, G.: Stochastic first-and zeroth-order methods for nonconvex stochastic programming. SIAM J. Optim. 23(4), 2341\u20132368 (2013)","journal-title":"SIAM J. Optim."},{"key":"11_CR7","unstructured":"Goodfellow, I., Bengio, Y., Courville, A.: Deep Learning. MIT Press (2016)"},{"key":"11_CR8","unstructured":"Harvey, N.J., Liaw, C., Plan, Y., Randhawa, S.: Tight analyses for non-smooth stochastic gradient descent. In: Conference on Learning Theory, pp. 1579\u20131613. PMLR (2019)"},{"key":"11_CR9","unstructured":"Harvey, N.J., Liaw, C., Randhawa, S.: Simple and optimal high-probability bounds for strongly-convex stochastic gradient descent. arXiv preprint arXiv:1909.00843 (2019)"},{"issue":"301","key":"11_CR10","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58(301), 13\u201330 (1963)","journal-title":"J. Am. Stat. Assoc."},{"key":"11_CR11","unstructured":"Horv\u00e1th, S., Lei, L., Richt\u00e1rik, P., Jordan, M.I.: Adaptivity of stochastic gradient methods for nonconvex optimization. arXiv preprint arXiv:2002.05359 (2020)"},{"key":"11_CR12","unstructured":"Jain, P., Nagaraj, D., Netrapalli, P.: Making the last iterate of SGD information theoretically optimal. In: Conference on Learning Theory, pp. 1752\u20131755. PMLR (2019)"},{"key":"11_CR13","series-title":"Springer Texts in Statistics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-7138-7","volume-title":"An Introduction to Statistical Learning","author":"G James","year":"2013","unstructured":"James, G., Witten, D., Hastie, T., Tibshirani, R.: An Introduction to Statistical Learning. STS, vol. 103. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-7138-7"},{"key":"11_CR14","unstructured":"Ji, K., Wang, Z., Weng, B., Zhou, Y., Zhang, W., Liang, Y.: History-gradient aided batch size adaptation for variance reduced algorithms. In: International Conference on Machine Learning, pp. 4762\u20134772. PMLR (2020)"},{"key":"11_CR15","unstructured":"Jin, C., Netrapalli, P., Ge, R., Kakade, S.M., Jordan, M.I.: A short note on concentration inequalities for random vectors with Subgaussian norm. arXiv preprint arXiv:1902.03736 (2019)"},{"key":"11_CR16","unstructured":"Johnson, R., Zhang, T.: Accelerating stochastic gradient descent using predictive variance reduction. In: Advances in Neural Information Processing Systems, vol. 26, pp. 315\u2013323 (2013)"},{"key":"11_CR17","unstructured":"Kakade, S.M., Tewari, A.: On the generalization ability of online strongly convex programming algorithms. In: Advances in Neural Information Processing Systems, pp. 801\u2013808 (2009)"},{"key":"11_CR18","unstructured":"Le\u00a0Roux, N., Schmidt, M., Bach, F.: A stochastic gradient method with an exponential convergence rate for finite training sets. In: Proceedings of the 25th International Conference on Neural Information Processing Systems, vol. 2, pp. 2663\u20132671 (2012)"},{"key":"11_CR19","unstructured":"Lei, L., Jordan, M.: Less than a single pass: stochastically controlled stochastic gradient. In: Artificial Intelligence and Statistics, pp. 148\u2013156. PMLR (2017)"},{"issue":"2","key":"11_CR20","doi-asserted-by":"publisher","first-page":"1473","DOI":"10.1137\/19M1256919","volume":"30","author":"L Lei","year":"2020","unstructured":"Lei, L., Jordan, M.I.: On the adaptivity of stochastic gradient-based optimization. SIAM J. Optim. 30(2), 1473\u20131500 (2020)","journal-title":"SIAM J. Optim."},{"key":"11_CR21","unstructured":"Lei, L., Ju, C., Chen, J., Jordan, M.I.: Non-convex finite-sum optimization via SCSG methods. In: Proceedings of the 31st International Conference on Neural Information Processing Systems, pp. 2345\u20132355 (2017)"},{"key":"11_CR22","unstructured":"Li, X., Orabona, F.: A high probability analysis of adaptive SGD with momentum. arXiv preprint arXiv:2007.14294 (2020)"},{"key":"11_CR23","unstructured":"Li, Z.: SSRGD: simple stochastic recursive gradient descent for escaping saddle points. In: Advances in Neural Information Processing Systems, vol. 32, pp. 1523\u20131533 (2019)"},{"key":"11_CR24","unstructured":"Li, Z., Bao, H., Zhang, X., Richt\u00e1rik, P.: PAGE: a simple and optimal probabilistic gradient estimator for nonconvex optimization. In: International Conference on Machine Learning, pp. 6286\u20136295. PMLR (2021)"},{"key":"11_CR25","unstructured":"Li, Z., Li, J.: A simple proximal stochastic gradient method for nonsmooth nonconvex optimization. In: Proceedings of the 32nd International Conference on Neural Information Processing Systems, pp. 5569\u20135579 (2018)"},{"key":"11_CR26","doi-asserted-by":"publisher","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course, vol.\u00a087. Springer, New York (2003). https:\/\/doi.org\/10.1007\/978-1-4419-8853-9","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"11_CR27","unstructured":"Nguyen, L.M., Liu, J., Scheinberg, K., Tak\u00e1\u010d, M.: SARAH: a novel method for machine learning problems using stochastic recursive gradient. In: International Conference on Machine Learning, pp. 2613\u20132621. PMLR (2017)"},{"key":"11_CR28","unstructured":"Nguyen, L.M., Liu, J., Scheinberg, K., Tak\u00e1\u010d, M.: Stochastic recursive gradient algorithm for nonconvex optimization. arXiv preprint arXiv:1705.07261 (2017)"},{"key":"11_CR29","doi-asserted-by":"publisher","unstructured":"Pinelis, I.: An approach to inequalities for the distributions of infinite-dimensional martingales. In: Dudley, R.M., Hahn, M.G., Kuelbs, J. (eds.) Probability in Banach Spaces, 8: Proceedings of the Eighth International Conference. Progress in Probability, vol. 30, pp. 128\u2013134. Birkh\u00e4user, Boston (1992). https:\/\/doi.org\/10.1007\/978-1-4612-0367-4_9","DOI":"10.1007\/978-1-4612-0367-4_9"},{"key":"11_CR30","doi-asserted-by":"publisher","first-page":"1679","DOI":"10.1214\/aop\/1176988477","volume":"22","author":"I Pinelis","year":"1994","unstructured":"Pinelis, I.: Optimum bounds for the distributions of martingales in Banach spaces. Ann. Probab. 22, 1679\u20131706 (1994)","journal-title":"Ann. Probab."},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"Reddi, S.J., Hefny, A., Sra, S., Poczos, B., Smola, A.: Stochastic variance reduction for nonconvex optimization. In: International Conference on Machine Learning, pp. 314\u2013323. PMLR (2016)","DOI":"10.1109\/ALLERTON.2016.7852377"},{"key":"11_CR32","unstructured":"Tran-Dinh, Q., Pham, N.H., Phan, D.T., Nguyen, L.M.: Hybrid stochastic gradient descent algorithms for stochastic nonconvex optimization. arXiv preprint arXiv:1905.05920 (2019)"},{"key":"11_CR33","unstructured":"Wang, Z., Ji, K., Zhou, Y., Liang, Y., Tarokh, V.: SpiderBoost and momentum: faster variance reduction algorithms. In: Advances in Neural Information Processing Systems, vol. 32, pp. 2406\u20132416 (2019)"},{"key":"11_CR34","unstructured":"Zhou, D., Chen, J., Cao, Y., Tang, Y., Yang, Z., Gu, Q.: On the convergence of adaptive gradient methods for nonconvex optimization. arXiv preprint arXiv:1808.05671 (2018)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-2259-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T23:17:58Z","timestamp":1714000678000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-2259-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819722617","9789819722594"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-2259-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"25 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pakdd2024.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}