{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T10:47:14Z","timestamp":1775472434651,"version":"3.50.1"},"reference-count":60,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSFC, China","award":["62101350"],"award-info":[{"award-number":["62101350"]}]},{"name":"NSF ECCS","award":["1808159"],"award-info":[{"award-number":["1808159"]}]},{"name":"NSF ECCS","award":["IIS-1910118"],"award-info":[{"award-number":["IIS-1910118"]}]},{"name":"ARO","award":["W911NF-19-1-0247"],"award-info":[{"award-number":["W911NF-19-1-0247"]}]},{"name":"NSF","award":["CIF-1910385"],"award-info":[{"award-number":["CIF-1910385"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/tsp.2022.3163896","type":"journal-article","created":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T19:41:05Z","timestamp":1648755665000},"page":"1803-1818","source":"Crossref","is-referenced-by-count":13,"title":["Stochastic Mirror Descent for Low-Rank Tensor Decomposition Under Non-Euclidean Losses"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3923-056X","authenticated-orcid":false,"given":"Wenqiang","family":"Pu","sequence":"first","affiliation":[{"name":"Shenzhen Research Institute of Big Data, Shenzhen, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1951-5234","authenticated-orcid":false,"given":"Shahana","family":"Ibrahim","sequence":"additional","affiliation":[{"name":"Electrical Engineering and Computer Science Department, Oregon State University, Corvallis, OR, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4847-9586","authenticated-orcid":false,"given":"Xiao","family":"Fu","sequence":"additional","affiliation":[{"name":"Electrical Engineering and Computer Science Department, Oregon State University, Corvallis, OR, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1263-9365","authenticated-orcid":false,"given":"Mingyi","family":"Hong","sequence":"additional","affiliation":[{"name":"Electrical and Computer Engineering Department, University of Minnesota, Minneapolis, MN, USA"}]}],"member":"263","reference":[{"key":"ref39","article-title":"Stochastic model-based minimization under high-order growth","author":"davis","year":"2018"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1287\/ijoo.2018.0008"},{"key":"ref33","first-page":"120","article-title":"The enron email dataset database schema and brief statistical report","volume":"4","author":"shetty","year":"2004"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9413830"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/130936361"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/17M1112303"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/17M1138558"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2016.0817"},{"key":"ref35","first-page":"2859","article-title":"Detecting overlapping and correlated communities without pure nodes: Identifiability and algorithm","author":"huang","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2008.04-08-771"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2009.02.002"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00168"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/120891009"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(02)00231-6"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2690524"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/120868323"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973440.13"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/100808034"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/17M1140790"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2503260"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E92.A.708"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2982321"},{"key":"ref50","first-page":"2121","article-title":"Adaptive subgradient methods for online learning and stochastic optimization","volume":"12","author":"duchi","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref51","article-title":"On the convergence of a class of adam-type algorithms for non-convex optimization","author":"chen","year":"0","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref59","article-title":"Plant pollinator data at hj andrews experimental forest","author":"jones","year":"2011","journal-title":"Environmental Data Initiative ver 5"},{"key":"ref58","article-title":"FROSTT: The formidable repository of open sparse tensors and tools","author":"smith","year":"2017"},{"key":"ref57","first-page":"7847","article-title":"Crowdsourcing via pairwise co-occurrences: Identifiability and algorithms","author":"ibrahim","year":"0","journal-title":"Proc 33rd Int Conf Neural Inf Process Syst"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2862383"},{"key":"ref55","article-title":"Tensorlab 3.0","author":"vervliet","year":"2016"},{"key":"ref54","article-title":"Tensor toolbox for MATLAB v. 3.0","author":"kola","year":"2017"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1284-2"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1137\/16M1099546"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2017.8335432"},{"key":"ref11","first-page":"388","article-title":"Learning mixtures of smooth product distributions: Identifiability and algorithm","author":"kargas","year":"0","journal-title":"Proc 22nd Int Conf Artif Intell Statist"},{"key":"ref40","article-title":"On the convergence rate of stochastic mirror descent for nonsmooth nonconvex optimization","author":"zhang","year":"2018"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2962031"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2975353"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-013-0341-y"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/110859063"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/cem.1236"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2269903"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/120887795"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2576427"},{"key":"ref4","first-page":"2773","article-title":"Tensor decompositions for learning latent variable models","volume":"15","author":"anandkumar","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2013.2297439"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/18M1203626"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.3003544"},{"key":"ref8","first-page":"1","article-title":"Learning from binary multiway data: Probabilistic tensor decomposition and its statistical optimality","volume":"21","author":"wang","year":"2020","journal-title":"J Mach Learn Res"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/19M1266265"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2015.2481563"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3010719"},{"key":"ref46","article-title":"Algorithms for nonnegative matrix factorization with the kullback-leibler divergence","author":"hien","year":"2020"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2021.3090960"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2601299"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1561\/2400000003"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(67)90040-7"},{"key":"ref41","article-title":"Provable Bregman-Divergence based methods for nonconvex and non-Lipschitz problems","author":"li","year":"2019"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2019.2938663"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.23919\/EUSIPCO.2019.8903161"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/78\/9675017\/9745762-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/9675017\/09745762.pdf?arnumber=9745762","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,6]],"date-time":"2022-06-06T20:04:17Z","timestamp":1654545857000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9745762\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":60,"URL":"https:\/\/doi.org\/10.1109\/tsp.2022.3163896","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}