{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T06:46:12Z","timestamp":1747291572930,"version":"3.28.0"},"reference-count":32,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T00:00:00Z","timestamp":1629676800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T00:00:00Z","timestamp":1629676800000},"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":[[2021,8,23]]},"DOI":"10.23919\/eusipco54536.2021.9616032","type":"proceedings-article","created":{"date-parts":[[2021,12,8]],"date-time":"2021-12-08T21:55:53Z","timestamp":1639000553000},"page":"1050-1054","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Implementation of Stochastic Proximal Point Algorithm for Matrix and Tensor Completion"],"prefix":"10.23919","author":[{"given":"Aysegul","family":"Bumin","sequence":"first","affiliation":[]},{"given":"Kejun","family":"Huang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref32","first-page":"1","article-title":"The movielens datasets: History and context","volume":"5","author":"harper","year":"2015","journal-title":"ACM Transactions on Interactive Intelligent Systems (TiiS)"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1002\/sapm192761164"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/15M1017909"},{"key":"ref11","article-title":"Incremental constraint projection-proximal methods for nonsmooth convex optimization","author":"wang","year":"2013","journal-title":"SIAM J Control Optim (to appear)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/17M1135086"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/18M1230323"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/18M1178244"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1908018116"},{"key":"ref16","article-title":"Manifold proximal point algorithms for dual principal component pursuit and orthogonal dictionary learning","author":"chen","year":"2020","journal-title":"ArXiv Preprint"},{"journal-title":"Nonlinear Programming","year":"1999","author":"bertsekas","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1017\/9781108583664"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(94)90052-3"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.39"},{"key":"ref4","first-page":"2121","article-title":"Adaptive sub gradient methods for online learning and stochastic optimization","volume":"12","author":"duchi","year":"2011","journal-title":"Journal of Machine Learning Research"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/27\/2\/025010"},{"key":"ref3","first-page":"1646","article-title":"Saga: A fast incremental gradient method with support for non-strongly convex composite objectives","author":"defazio","year":"2014","journal-title":"Advances in neural information processing systems"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0472-0"},{"key":"ref29","first-page":"836","article-title":"Low-rank matrix and tensor completion via adaptive sampling","author":"krishnamurthy","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref5","article-title":"Adam: A method for stochastic optimization","author":"diederik","year":"2014","journal-title":"Proceedings of the 3rd International Conference on Learning Representations"},{"key":"ref8","article-title":"Stochastic proximal iteration: a non-asymptotic improvement upon stochastic gradient descent","author":"ryu","year":"2014","journal-title":"Preprint"},{"key":"ref7","first-page":"3","article-title":"Incremental gradient, subgradient, and proximal methods for convex optimization: A survey","volume":"2010","author":"bertsekas","year":"2011","journal-title":"Optimization for Machine Learning"},{"key":"ref2","first-page":"315","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","author":"johnson","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/0314056"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1080173"},{"journal-title":"Numerical Optimization","year":"2006","author":"nocedal","key":"ref20"},{"key":"ref22","first-page":"2973","article-title":"Matrix completion has no spurious local minimum","author":"ge","year":"0","journal-title":"Neural Inform Process Syst 2016"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2598574"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2937282"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2690524"},{"key":"ref25","first-page":"2773","article-title":"Tensor decompositions for learning latent variable models","volume":"15","author":"anandkumar","year":"2014","journal-title":"Journal of Machine Learning Research"}],"event":{"name":"2021 29th European Signal Processing Conference (EUSIPCO)","start":{"date-parts":[[2021,8,23]]},"location":"Dublin, Ireland","end":{"date-parts":[[2021,8,27]]}},"container-title":["2021 29th European Signal Processing Conference (EUSIPCO)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9615915\/9615917\/09616032.pdf?arnumber=9616032","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,21]],"date-time":"2022-03-21T20:57:47Z","timestamp":1647896267000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9616032\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,23]]},"references-count":32,"URL":"https:\/\/doi.org\/10.23919\/eusipco54536.2021.9616032","relation":{},"subject":[],"published":{"date-parts":[[2021,8,23]]}}}