{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:36:15Z","timestamp":1787502975328,"version":"build-2736575974"},"reference-count":30,"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"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,12,10]]},"DOI":"10.1109\/bigdata50022.2020.9378111","type":"proceedings-article","created":{"date-parts":[[2021,3,19]],"date-time":"2021-03-19T17:10:21Z","timestamp":1616173821000},"page":"163-170","source":"Crossref","is-referenced-by-count":6,"title":["Fast and Accurate Tensor Decomposition without a High Performance Computing Machine"],"prefix":"10.1109","author":[{"given":"Huan","family":"He","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuanzhe","family":"Xi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joyce C","family":"Ho","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref30","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2014","journal-title":"International Conference on Learning Representations"},{"key":"ref10","article-title":"Stochastic gradients for large-scale tensor decomposition","author":"kolda","year":"2019"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0217316"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313548"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2729980"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/17M1120725"},{"key":"ref15","first-page":"712","article-title":"Regularized nonlinear acceleration","author":"scieur","year":"2016","journal-title":"Proceedings of the 30th International Conference on Neural Information Processing Systems"},{"key":"ref16","article-title":"Nonlinear acceleration of deep neural networks","author":"scieur","year":"2018"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2017.11.002"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973440.13"},{"key":"ref19","article-title":"Smoothout: Smoothing out sharp minima to improve generalization in deep learning","author":"wen","year":"2018"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2004.11.013"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1214\/18-AOAS1193"},{"key":"ref3","article-title":"Marble - high-throughput phenotyping from electronic health records via sparse nonnegative tensor factorization","author":"ho","year":"2014","journal-title":"KDD"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/110859063"},{"key":"ref29","article-title":"Foundations of the parafac procedure: Models and conditions for an \"explanatory\" multi-model factor analysis","author":"harshman","year":"1970"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.28"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/18M1203626"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2015.1009977"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2915921"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/120868323"},{"key":"ref1","article-title":"Foundations of the parafac procedure: Models and conditions for an \"explanatory\" multimodal factor analysis","author":"harshman","year":"1970"},{"key":"ref20","article-title":"Gradient noise convolution (gnc): Smoothing loss function for distributed large-batch sgd","author":"haruki","year":"2019"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/447"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1962-0145647-X"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0871-8"},{"key":"ref23","article-title":"Extrapolation for large-batch training in deep learning","author":"lin","year":"2020","journal-title":"CoRR"},{"key":"ref26","article-title":"Training gans with optimism","author":"daskalakis","year":"0"},{"key":"ref25","article-title":"A variational inequality perspective on generative adversarial nets","author":"gidel","year":"2018","journal-title":"CoRR"}],"event":{"name":"2020 IEEE International Conference on Big Data (Big Data)","location":"Atlanta, GA, USA","start":{"date-parts":[[2020,12,10]]},"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\/09378111.pdf?arnumber=9378111","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T11:45:04Z","timestamp":1656330304000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9378111\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,10]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/bigdata50022.2020.9378111","relation":{},"subject":[],"published":{"date-parts":[[2020,12,10]]}}}