{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T12:52:43Z","timestamp":1753275163524,"version":"3.37.3"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61861166002","61672514","61976202","61977038","61603162","61876074"],"award-info":[{"award-number":["61861166002","61672514","61976202","61977038","61603162","61876074"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004826","name":"Beijing Natural Science Foundation","doi-asserted-by":"publisher","award":["4172068","4182079"],"award-info":[{"award-number":["4172068","4182079"]}],"id":[{"id":"10.13039\/501100004826","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Strategic Priority Research Program of Chinese Academy of Sciences","award":["XDB28000000"],"award-info":[{"award-number":["XDB28000000"]}]},{"DOI":"10.13039\/501100004739","name":"Youth Innovation Promotion Association CAS","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004739","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Hong Kong Research Grant Council","award":["16303817"],"award-info":[{"award-number":["16303817"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2021,6,1]]},"DOI":"10.1109\/tkde.2019.2956700","type":"journal-article","created":{"date-parts":[[2019,11,29]],"date-time":"2019-11-29T21:08:08Z","timestamp":1575061688000},"page":"2467-2478","source":"Crossref","is-referenced-by-count":2,"title":["Fast Stochastic Ordinal Embedding With Variance Reduction and Adaptive Step Size"],"prefix":"10.1109","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4178-0907","authenticated-orcid":false,"given":"Ke","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1719-3358","authenticated-orcid":false,"given":"Jinshan","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1154-9053","authenticated-orcid":false,"given":"Jiechao","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3512-7277","authenticated-orcid":false,"given":"Qianqian","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7141-708X","authenticated-orcid":false,"given":"Xiaochun","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3865-8145","authenticated-orcid":false,"given":"Wei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10584-0_26"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2925609"},{"key":"ref32","first-page":"199","article-title":"Finding global optima in nonconvex stochastic semidefinite optimization with variance reduction","author":"zeng","year":"2018","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref31","first-page":"314","article-title":"Stochastic variance reduction for nonconvex optimization","author":"reddi","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"ref37","first-page":"109","article-title":"The quest for ground truth in musical artist similarity","author":"ellis","year":"2002","journal-title":"Proc Int Soc Music Inf Retrieval Conf"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/15M1053141"},{"key":"ref35","first-page":"795","article-title":"Linear convergence of gradient and proximal-gradient methods under the Polyak-Lojasiewicz condition","author":"hamed karimi and","year":"2016","journal-title":"Proc Eur Conf Mach Learn Knowl Discovery Databases"},{"journal-title":"Problem Complexity and Method Efficiency in Optimization","year":"1983","author":"nemirovsky","key":"ref34"},{"key":"ref10","first-page":"2711","article-title":"Finite sample prediction and recovery bounds for ordinal embedding","author":"jain","year":"2016","journal-title":"Proc Annu Conf Neural Inf Process Syst"},{"key":"ref11","first-page":"491","article-title":"Learning multi-modal similarity","volume":"12","author":"mcfee and","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref12","first-page":"2240","article-title":"Active ranking using pairwise comparisons","author":"jamieson","year":"2011","journal-title":"Proc Annu Conf Neural Inf Process Syst"},{"key":"ref13","first-page":"1241","article-title":"Statistical consistency of ranking methods in a rank-differentiable probability space","author":"lan","year":"2012","journal-title":"Proc Annu Conf Neural Inf Process Syst"},{"key":"ref14","first-page":"69","article-title":"The crowd-median algorithm","author":"heikinheimo","year":"2013","journal-title":"Proc AAAI Conf Human Comput Crowdsourcing"},{"key":"ref15","first-page":"227","article-title":"Cost-effective hits for relative similarity comparisons","author":"wilber","year":"2014","journal-title":"Proc AAAI Conf Human Comput Crowdsourcing"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.223"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.115"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.118"},{"key":"ref19","first-page":"11","article-title":"Generalized non-metric multidimensional scaling","author":"agarwal","year":"2007","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref28","first-page":"847","article-title":"Local ordinal embedding","author":"terada","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289694"},{"key":"ref27","first-page":"4142","article-title":"Learning low-dimensional metrics","author":"mason","year":"2017","journal-title":"Proc Annu Conf Neural Inf Process Syst"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289565"},{"key":"ref6","first-page":"137","article-title":"An active learning algorithm for ranking from pairwise preferences with an almost optimal query complexity","volume":"13","author":"ailon","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(63)90382-3"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120287"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.3150\/15-BEJ792"},{"key":"ref7","first-page":"40","article-title":"Uniqueness of ordinal embedding","author":"kleindessner","year":"2014","journal-title":"Proc Conf Learn Theory"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289621"},{"key":"ref9","first-page":"1472","article-title":"Multiview triplet embedding: Learning attributes in multiple maps","author":"amid","year":"2015","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289630"},{"key":"ref20","first-page":"673","article-title":"Adaptively learning the crowd kernel","author":"tamuz","year":"2011","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref22","first-page":"315","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","author":"johnson","year":"2013","journal-title":"Proc Annu Conf Neural Inf Process Syst"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/MLSP.2012.6349720"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/8.1.141"},{"key":"ref23","first-page":"685","article-title":"Barzilai-borwein step size for stochastic gradient descent","author":"tan","year":"2016","journal-title":"Proc Annu Conf Neural Inf Process Syst"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2017.148"},{"key":"ref25","first-page":"3738","article-title":"Stochastic non-convex ordinal embedding with stabilized Barzilai-Borwein step size","author":"ma","year":"2018","journal-title":"Proc AAAI Conf Artif Intell"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/9427778\/08918070.pdf?arnumber=8918070","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:50:53Z","timestamp":1652194253000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8918070\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,1]]},"references-count":38,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2019.2956700","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"type":"print","value":"1041-4347"},{"type":"electronic","value":"1558-2191"},{"type":"electronic","value":"2326-3865"}],"subject":[],"published":{"date-parts":[[2021,6,1]]}}}