{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T10:08:17Z","timestamp":1730282897203,"version":"3.28.0"},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1109\/mlsp.2016.7738864","type":"proceedings-article","created":{"date-parts":[[2016,11,10]],"date-time":"2016-11-10T16:40:41Z","timestamp":1478796041000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Variance reduction for optimization in speech recognition"],"prefix":"10.1109","author":[{"given":"Jen-Tzung","family":"Chien","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pei-Wen","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","first-page":"567","article-title":"Stochastic dual coordinate ascent methods for regularized loss minimization","volume":"14","author":"shalev-shwartz","year":"2013","journal-title":"Journal of Machine Learning Research"},{"key":"ref3","first-page":"735","article-title":"Deep learning via Hessian-free optimization","author":"martens","year":"2010","journal-title":"Proc 16th InternationalConf on Machine Learning (ICML)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.21437\/Interspeech.2016-192"},{"key":"ref6","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":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SLT.2014.7078565"},{"key":"ref5","first-page":"378","article-title":"Accelerated mini-batch stochastic dual coordinate ascent","volume":"26","author":"shalev-shwartz","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref8","first-page":"372","article-title":"A method of solving a convex programming problem with convergence rate O(l\/k2)","volume":"27","author":"nesterov","year":"1983","journal-title":"Soviet Mathematics Doklady"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0839-0"},{"key":"ref2","first-page":"1737","article-title":"SGD-QN: careful quasi-Newton stochastic gradient descent","volume":"10","author":"bordes","year":"2009","journal-title":"Journal of Machine Learning Research"},{"key":"ref9","article-title":"SDCA without duality","author":"shalev-shwartz","year":"2015","journal-title":"arXiv 1502 06177"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2197156"}],"event":{"name":"2016 IEEE 26th International Workshop on Machine Learning for Signal Processing (MLSP)","start":{"date-parts":[[2016,9,13]]},"location":"Vietri sul Mare, Salerno, Italy","end":{"date-parts":[[2016,9,16]]}},"container-title":["2016 IEEE 26th International Workshop on Machine Learning for Signal Processing (MLSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7605057\/7738802\/07738864.pdf?arnumber=7738864","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T07:13:23Z","timestamp":1480490003000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7738864\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/mlsp.2016.7738864","relation":{},"subject":[],"published":{"date-parts":[[2016,9]]}}}