{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T19:23:38Z","timestamp":1740165818832,"version":"3.37.3"},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC and the Shenzhen Research Institute, City University of Hong Kong","doi-asserted-by":"publisher","award":["11871411"],"award-info":[{"award-number":["11871411"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Hong Kong Research Grants Council (RGC) General Research Fund","award":["11301718","11300519","11300721","11311822"],"award-info":[{"award-number":["11301718","11300519","11300721","11311822"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1109\/tnnls.2022.3152270","type":"journal-article","created":{"date-parts":[[2022,3,2]],"date-time":"2022-03-02T20:29:34Z","timestamp":1646252974000},"page":"9536-9541","source":"Crossref","is-referenced-by-count":1,"title":["On Optimal Learning With Random Features"],"prefix":"10.1109","volume":"34","author":[{"given":"Jiamin","family":"Liu","sequence":"first","affiliation":[{"name":"School of Statistics, Renmin University of China, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6008-6614","authenticated-orcid":false,"given":"Heng","family":"Lian","sequence":"additional","affiliation":[{"name":"Department of Mathematics, City University of Hong Kong, Hong Kong"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-006-0196-8"},{"key":"ref12","article-title":"Optimal rates for learning with Nyström stochastic gradient methods","author":"lin","year":"2017","journal-title":"arXiv 1710 07797"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/SERIES1345"},{"key":"ref14","first-page":"1","article-title":"Distributed learning with regularized least squares","volume":"18","author":"lin","year":"2017","journal-title":"J Mach Learn Res"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.spl.2017.03.020"},{"key":"ref11","first-page":"1657","article-title":"Less is more: Nyström computational regularization","volume":"1","author":"rudi","year":"2015","journal-title":"Proc 28th Int Conf Neural Inf Process Syst"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1214\/16-AOS1472"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2019.2934729"},{"key":"ref21","first-page":"1","article-title":"Convergences of regularized algorithms and stochastic gradient methods with random projections","volume":"21","author":"lin","year":"2020","journal-title":"J Mach Learn Res"},{"key":"ref2","first-page":"1177","article-title":"Random features for large-scale kernel machines","author":"rahimi","year":"2007","journal-title":"Proc Adv Neural Inf Process Syst"},{"journal-title":"Harmonic Analysis and the Theory of Probability","year":"1957","author":"cooper","key":"ref1"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6420\/aa72b2"},{"key":"ref16","article-title":"Optimal convergence for distributed learning with stochastic gradient methods and spectral algorithms","author":"lin","year":"2018","journal-title":"arXiv 1801 07226"},{"key":"ref19","first-page":"3375","article-title":"Optimal rates for multi-pass stochastic gradient methods","volume":"18","author":"lin","year":"2017","journal-title":"J Mach Learn Res"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970128"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2014.2387313"},{"key":"ref7","first-page":"1","article-title":"Towards a unified analysis of random Fourier features","author":"li","year":"2019","journal-title":"Proc 36th Int Conf Mach Learn (ICML)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2476659"},{"key":"ref4","first-page":"1144","article-title":"Optimal rates for random Fourier features","author":"sriperumbudur","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref3","first-page":"1313","article-title":"Weighted sums of random kitchen sinks: Replacing minimization with randomization in learning","author":"rahimi","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref6","first-page":"1","article-title":"Generalization properties of learning with random features","author":"rudi","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref5","first-page":"862","article-title":"On the error of random Fourier features","author":"sutherland","year":"2015","journal-title":"Proc Conf Uncertainty of Artificial Intelligence"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/10299535\/09724643.pdf?arnumber=9724643","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T19:28:21Z","timestamp":1699903701000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9724643\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11]]},"references-count":22,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2022.3152270","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"type":"print","value":"2162-237X"},{"type":"electronic","value":"2162-2388"}],"subject":[],"published":{"date-parts":[[2023,11]]}}}