{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:09:27Z","timestamp":1740100167368,"version":"3.37.3"},"reference-count":20,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,11]],"date-time":"2021-07-11T00:00:00Z","timestamp":1625961600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,11]],"date-time":"2021-07-11T00:00:00Z","timestamp":1625961600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100009515","name":"Fondation Simone et Cino Del Duca","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100009515","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,11]]},"DOI":"10.1109\/ssp49050.2021.9513846","type":"proceedings-article","created":{"date-parts":[[2021,8,19]],"date-time":"2021-08-19T20:19:20Z","timestamp":1629404360000},"page":"96-100","source":"Crossref","is-referenced-by-count":2,"title":["The Perturbed Prox-Preconditioned Spider Algorithm: Non-Asymptotic Convergence Bounds"],"prefix":"10.1109","author":[{"given":"G.","family":"Fort","sequence":"first","affiliation":[{"name":"Université de Toulouse & CNRS,IMT,Toulouse,France,F-31062"}]},{"given":"E.","family":"Moulines","sequence":"additional","affiliation":[{"name":"CMAP, Ecole Polytechnique, Route de Saclay,Palaiseau Cedex,France,91128"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Gradient-based algorithms with applications to signal-recovery problems","author":"beck","year":"2010","journal-title":"Convex Optimization in Signal Processing and Communications"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9569-8_10"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1561\/9781601987174"},{"key":"ref13","first-page":"26132621","article-title":"Sarah: A novel method for machine learning problems using stochastic recursive gradient","author":"nguyen","year":"0"},{"key":"ref14","first-page":"689","article-title":"SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path-Integrated Differential Estimator","author":"fang","year":"2018","journal-title":"Advances in Neural IInformation Processing Systems"},{"key":"ref15","first-page":"16972","article-title":"A stochastic path integral differential estimator expectation maximization algorithm","volume":"33","author":"fort","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"ref16","first-page":"1","article-title":"On perturbed proximal gradient algorithms","volume":"18","author":"atchad\u00e9","year":"2017","journal-title":"Journal of Machine Learning Research"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-021-10023-9"},{"key":"ref18","article-title":"Perturbed Prox-Preconditioned SPIDER for finite-sum optimization","author":"fort","year":"2021","journal-title":"Tech Rep"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/120880811"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1030-6"},{"key":"ref3","first-page":"315","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","volume":"26","author":"johnson","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref6","first-page":"3720","article-title":"Neon2: Finding local minima via first-order oracles","author":"allen-zhu","year":"2018","journal-title":"NeurIPS"},{"key":"ref5","article-title":"Natasha 2: Faster non-convex optimization than sgd","volume":"31","author":"allen-zhu","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref8","first-page":"2406","article-title":"SpiderBoost and Momentum: Faster Stochastic Variance Reduction Algorithms","volume":"32","author":"wang","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref7","first-page":"1153","article-title":"Proximal stochastic methods for nonsmooth nonconvex finite-sum optimization","author":"reddi","year":"2016","journal-title":"Proceedings of the 30th International Conference on Neural Information Processing Systems"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/16M1080173"},{"key":"ref1","article-title":"The Perturbed Prox-Preconditioned SPIDER algorithm for EM-based large scale learning","author":"fort","year":"2021","journal-title":"2021 IEEE Statistical Signal Processing Workshop (SSP)"},{"key":"ref9","first-page":"315","article-title":"Accelerating Stochastic Gradient Descent using Predictive Variance Reduction","volume":"26","author":"johnson","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1018031103"}],"event":{"name":"2021 IEEE Statistical Signal Processing Workshop (SSP)","start":{"date-parts":[[2021,7,11]]},"location":"Rio de Janeiro, Brazil","end":{"date-parts":[[2021,7,14]]}},"container-title":["2021 IEEE Statistical Signal Processing Workshop (SSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9513646\/9513732\/09513846.pdf?arnumber=9513846","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T23:23:24Z","timestamp":1659482604000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9513846\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,11]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/ssp49050.2021.9513846","relation":{},"subject":[],"published":{"date-parts":[[2021,7,11]]}}}