{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T09:01:10Z","timestamp":1771232470017,"version":"3.50.1"},"reference-count":30,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T00:00:00Z","timestamp":1639526400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T00:00:00Z","timestamp":1639526400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T00:00:00Z","timestamp":1639526400000},"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,12,15]]},"DOI":"10.1109\/bigdata52589.2021.9671859","type":"proceedings-article","created":{"date-parts":[[2022,1,13]],"date-time":"2022-01-13T20:39:16Z","timestamp":1642106356000},"page":"1940-1949","source":"Crossref","is-referenced-by-count":1,"title":["Mitigating Divergence of Latent Factors via Dual Ascent for Low Latency Event Prediction Models"],"prefix":"10.1109","author":[{"given":"Alex","family":"Shtoff","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yair","family":"Koren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref30","first-page":"8","article-title":"An efficient primal-dual hybrid gradient algorithm for total variation image restoration","volume":"34","author":"zhu","year":"2008","journal-title":"UCLA CAM report"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(02)00231-6"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23525-7_2"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-010-0251-1"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0957-3"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/18M1178244"},{"key":"ref15","first-page":"2121","article-title":"Adaptive subgradient methods for online learning and stochastic optimization","author":"duchi","year":"2011","journal-title":"The Journal of Machine Learning Research"},{"key":"ref16","first-page":"283","article-title":"Optimization;: Symposium of the Institute of Mathematics and Its Applications","author":"fletcher","year":"1969","journal-title":"A Method for Nonlinear Constraints in Minimization Problems"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1080\/00207728108963798"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1964-11178-2"},{"key":"ref19","article-title":"Fastest rates for stochastic mirror descent methods","author":"hanzely","year":"2018","journal-title":"arXiv preprint arXiv 1803 07374"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098103"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357801"},{"key":"ref27","article-title":"Bayesian a\/b testing at vwo","author":"stucchio","year":"2015","journal-title":"Whitepaper Visual Website Optimizer"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3041021.3054184"},{"key":"ref6","first-page":"166","article-title":"Gradient methods for constrained maxima, with weakened assumptions","author":"arrow","year":"1958","journal-title":"Studies in Linear and Nonlinear Programming"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401167"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357821"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/18M1230323"},{"key":"ref7","first-page":"21958","article-title":"Minibatch stochastic approximate proximal point methods","volume":"33","author":"asi","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2507157.2507221"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973655"},{"key":"ref1","year":"0","journal-title":"Vespa - the big data serving engine"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/BF00927673"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3106426.3109433"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186075"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.127"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0149-x"},{"key":"ref26","first-page":"2503","article-title":"Hidden technical debt in machine learning systems","volume":"28","author":"sculley","year":"2015","journal-title":"Advances in neural information processing systems"},{"key":"ref25","article-title":"Stochastic proximal iteration: a non-asymptotic improvement upon stochastic gradient descent","author":"ryu","year":"2014","journal-title":"Author website early draft"}],"event":{"name":"2021 IEEE International Conference on Big Data (Big Data)","location":"Orlando, FL, USA","start":{"date-parts":[[2021,12,15]]},"end":{"date-parts":[[2021,12,18]]}},"container-title":["2021 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9671263\/9671273\/09671859.pdf?arnumber=9671859","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:55:37Z","timestamp":1652201737000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9671859\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,15]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/bigdata52589.2021.9671859","relation":{},"subject":[],"published":{"date-parts":[[2021,12,15]]}}}