{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,13]],"date-time":"2026-10-13T18:36:32Z","timestamp":1791916592057,"version":"4.3.4"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Research Grants Council of the Hong Kong Special Administrative Region","award":["614513"],"award-info":[{"award-number":["614513"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2019,9,1]]},"DOI":"10.1109\/tkde.2018.2867533","type":"journal-article","created":{"date-parts":[[2018,8,29]],"date-time":"2018-08-29T16:27:00Z","timestamp":1535560020000},"page":"1665-1679","source":"Crossref","is-referenced-by-count":28,"title":["Accelerated and Inexact Soft-Impute for Large-Scale Matrix and Tensor Completion"],"prefix":"10.1109","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8944-8618","authenticated-orcid":false,"given":"Quanming","family":"Yao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"James T.","family":"Kwok","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-004-5022-1"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/b98874"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2015.08.003"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-012-0044-1"},{"key":"ref31","first-page":"2906","article-title":"Accelerated training for matrix-norm regularization: A boosting approach","author":"zhang","year":"2012","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/110859646"},{"key":"ref37","first-page":"1231","article-title":"Efficient and practical stochastic subgradient descent for nuclear norm regularization","author":"avron","year":"2012","journal-title":"Proc 29th Int Conf Mach Learn"},{"key":"ref36","first-page":"3367","article-title":"Matrix completion and low-rank SVD via fast alternating least squares","volume":"16","author":"hastie","year":"2015","journal-title":"J Mach Learn Res"},{"key":"ref35","first-page":"1188","article-title":"Sketchy decisions: Convex low-rank matrix optimization with optimal storage","author":"yurtsever","year":"2017","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/130934271"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9045-x"},{"key":"ref11","first-page":"615","article-title":"An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems","volume":"6","author":"toh","year":"2010","journal-title":"Pacific J Optimization"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.7146\/dpb.v27i537.7070"},{"key":"ref13","first-page":"2287","article-title":"Spectral regularization algorithms for learning large incomplete matrices","volume":"11","author":"mazumder","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref14","article-title":"Proximal gradient descent and acceleration","author":"tibshirani","year":"2010"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553434"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.271"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref28","first-page":"575","article-title":"Nuclear norm minimization via active subspace selection","author":"hsieh","year":"2014","journal-title":"Proc 31st Int Conf Mach Learn"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.39"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479898334605"},{"key":"ref3","first-page":"1177","article-title":"Prediction and clustering in signed networks: A local to global perspective","volume":"15","author":"chiang","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2511584"},{"key":"ref29","first-page":"1","article-title":"Adaptive restart for accelerated gradient schemes","volume":"15","author":"o'donoghue","year":"2012","journal-title":"Found Comput Math"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-016-0930-5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2018.01.014"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2356461"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972818.5"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401944"},{"key":"ref46","first-page":"503","article-title":"Uncoverning groups via heterogeneous interaction analysis","author":"lei","year":"2009","journal-title":"Proc IEEE Int Conf Data Mining"},{"key":"ref20","article-title":"Estimation of low-rank tensors via convex optimization","author":"tomioka","year":"2010"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030109"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.3934\/ipi.2015.9.601"},{"key":"ref22","first-page":"2825","article-title":"Multitask learning meets tensor factorization: Task imputation via convex optimization","author":"wimalawarne","year":"2014","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s10543-013-0455-z"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.chemolab.2010.08.004"},{"key":"ref42","first-page":"1081","article-title":"Analysis of multi-stage convex relaxation for sparse regularization","volume":"11","author":"zhang","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1561\/2400000003"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1214\/09-AOS729"},{"key":"ref23","first-page":"4002","article-title":"Accelerated inexact soft-impute for fast large-scale matrix completion","author":"yao","year":"2015","journal-title":"Proc 24th Int Joint Conf Artif Intell"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref26","first-page":"1458","article-title":"Convergence rates of inexact proximal-gradient methods for convex optimization","author":"schmidt","year":"2011","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref43","author":"boyd","year":"2009","journal-title":"Convex optimization"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553431"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8789435\/08449114.pdf?arnumber=8449114","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:09:19Z","timestamp":1657746559000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8449114\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,1]]},"references-count":48,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2018.2867533","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,1]]}}}