{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T11:14:28Z","timestamp":1730200468470,"version":"3.28.0"},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T00:00:00Z","timestamp":1607558400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T00:00:00Z","timestamp":1607558400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,12,10]],"date-time":"2020-12-10T00:00:00Z","timestamp":1607558400000},"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":[[2020,12,10]]},"DOI":"10.1109\/bigdata50022.2020.9378351","type":"proceedings-article","created":{"date-parts":[[2021,3,19]],"date-time":"2021-03-19T21:10:21Z","timestamp":1616188221000},"page":"2217-2222","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing Convergence for Iterative Learning of ARIMA for Stationary Time Series"],"prefix":"10.1109","author":[{"given":"Kevin","family":"Styp-Rekowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Odej","family":"Kao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","author":"zinkevich","year":"2003","journal-title":"Proceedings of the 20th International Conference on Machine Learning (ICML-03)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-6080(98)00116-6"},{"key":"ref12","first-page":"543","article-title":"A method for unconstrained convex minimization problem with the rate of convergence o (1\/k^ 2)","volume":"269","author":"nesterov","year":"1983","journal-title":"Doklady an USSR"},{"key":"ref13","first-page":"2121","article-title":"Adaptive subgradient methods for online learning and stochastic optimization","volume":"12","author":"duchi","year":"2011","journal-title":"Journal of Machine Learning Research"},{"key":"ref14","first-page":"26","article-title":"Lecture 6.5-rmsprop: Divide the gradient by a running average of its recent magnitude","volume":"4","author":"tieleman","year":"2012","journal-title":"COURSERA Neural Networks for Machine Learning"},{"article-title":"Adam: A method for stochastic optimization","year":"2014","author":"kingma","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780195099713.001.0001"},{"article-title":"Online importance weight aware updates","year":"2010","author":"karampatziakis","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0864-7"},{"article-title":"An overview of gradient descent optimization algorithms","year":"2016","author":"ruder","key":"ref19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/9653230"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.energy.2016.10.068"},{"key":"ref6","article-title":"Online arima algorithms for time series prediction","author":"liu","year":"2016","journal-title":"THIRTIETH AAAI Conference on Artificial Intelligence"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/UCC-Companion.2018.00037"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2916341"},{"article-title":"On the convergence of adam and beyond","year":"2019","author":"reddi","key":"ref7"},{"key":"ref2","article-title":"An application of the arima model to real-estate prices in hong kong","author":"raymond","year":"1997","journal-title":"Journal of Property Finance"},{"article-title":"On the convergence of a class of adam-type algorithms for non-convex optimization","year":"2018","author":"chen","key":"ref9"},{"journal-title":"Time Series Analysis Forecasting and Control","year":"2015","author":"box","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/NNSP.1992.253713"},{"article-title":"Gradient descent revisited via an adaptive online learning rate","year":"2018","author":"ravaut","key":"ref22"},{"key":"ref21","first-page":"343","article-title":"No more pesky learning rates","author":"schaul","year":"2013","journal-title":"International Conference on Machine Learning"},{"article-title":"Adaptive gradient methods with dynamic bound of learning rate","year":"2019","author":"luo","key":"ref24"},{"article-title":"Improving generalization performance by switching from adam to sgd","year":"2017","author":"keskar","key":"ref23"},{"key":"ref25","article-title":"Bearing data set","author":"lee","year":"2007","journal-title":"IMS University of Cincinnati NASA Ames Prognostics Data Repository Rexnord Technical Services"}],"event":{"name":"2020 IEEE International Conference on Big Data (Big Data)","start":{"date-parts":[[2020,12,10]]},"location":"Atlanta, GA, USA","end":{"date-parts":[[2020,12,13]]}},"container-title":["2020 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9377717\/9377728\/09378351.pdf?arnumber=9378351","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T15:45:32Z","timestamp":1656344732000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9378351\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,10]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/bigdata50022.2020.9378351","relation":{},"subject":[],"published":{"date-parts":[[2020,12,10]]}}}