{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T08:32:36Z","timestamp":1729672356670,"version":"3.28.0"},"reference-count":23,"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,11]]},"DOI":"10.1109\/ssp49050.2021.9513769","type":"proceedings-article","created":{"date-parts":[[2021,8,19]],"date-time":"2021-08-19T20:19:20Z","timestamp":1629404360000},"page":"316-320","source":"Crossref","is-referenced-by-count":1,"title":["The Perturbed Prox-Preconditioned Spider Algorithm for EM-Based Large Scale Learning"],"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":"Ecole Polytechnique,CMAP,Palaiseau Cedex,France,91 128"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2009.00698.x"},{"key":"ref11","first-page":"7967","article-title":"Stochastic Expectation Maximization with Variance Reduction","author":"chen","year":"2018","journal-title":"Advances in Neural IInformation Processing Systems"},{"key":"ref12","first-page":"2837","article-title":"On the Global Convergence of (Fast) Incremental Expectation Maximization Methods","author":"karimi","year":"2019","journal-title":"Advances in Neural IInformation Processing Systems"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-021-10023-9"},{"key":"ref14","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":"ref15","article-title":"Faster Variance Reduced Stochastic Expectation Maximization for Nonconvex Finite-Sum Optimization","author":"fort","year":"2021","journal-title":"proceedings of the 2021 IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP)"},{"key":"ref16","article-title":"The Perturbed Prox-Preconditioned SPIDER algorithm: non-asymptotic convergence bounds","author":"fort","year":"2021","journal-title":"2021 IEEE Statistical Signal Processing Workshop (SSP)"},{"journal-title":"Monte Carlo Methods in Financial Engineering","year":"2004","author":"glasserman","key":"ref17"},{"key":"ref18","first-page":"55695579","article-title":"A simple proximal stochastic gradient method for nonsmooth nonconvex optimization","author":"li","year":"2018","journal-title":"Proceedings of the 32Nd International Conference on Neural Information Processing Systems"},{"key":"ref19","first-page":"2406","article-title":"Spiderboost and momentum: Faster variance reduction algorithms","volume":"32","author":"wang","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1990.10474930"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/9780470191613"},{"key":"ref6","first-page":"73","article-title":"The SEM algorithm: a probabilistic teacher algorithm derived from the EM algorithm for the mixture problem","volume":"2","author":"celeux","year":"1985","journal-title":"Computational Statistics Quarterly"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1059655912"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-75894-2"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1018031103"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176346060"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum Likelihood from Incomplete Data via the EM Algorithm","volume":"39","author":"dempster","year":"1977","journal-title":"J Roy Stat Soc B Met"},{"key":"ref9","first-page":"355","author":"neal","year":"1998","journal-title":"A View of the EM Algorithm That Justifies Incremental Sparse and Other Variants"},{"key":"ref20","article-title":"Perturbed Prox-Preconditioned SPIDER for finite-sum optimization","author":"fort","year":"2021","journal-title":"Tech Rep"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1201\/b10905"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2000.10474330"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2013.829001"}],"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\/09513769.pdf?arnumber=9513769","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:34:22Z","timestamp":1725662062000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9513769\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,11]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/ssp49050.2021.9513769","relation":{},"subject":[],"published":{"date-parts":[[2021,7,11]]}}}