{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:21:57Z","timestamp":1774419717496,"version":"3.50.1"},"reference-count":30,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T00:00:00Z","timestamp":1743897600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T00:00:00Z","timestamp":1743897600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100020487","name":"Nature","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100020487","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,4,6]]},"DOI":"10.1109\/icassp49660.2025.10888203","type":"proceedings-article","created":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T17:15:19Z","timestamp":1741799719000},"page":"1-5","source":"Crossref","is-referenced-by-count":0,"title":["Sparse PCA with Oracle Rate in High Dimensions"],"prefix":"10.1109","author":[{"given":"Wenfu","family":"Zhong","sequence":"first","affiliation":[{"name":"ShanghaiTech University,School of Information Science and Technology,Shanghai,China"}]},{"given":"Ziping","family":"Zhao","sequence":"additional","affiliation":[{"name":"ShanghaiTech University,School of Information Science and Technology,Shanghai,China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1037\/h0071325"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1198\/jasa.2009.0121"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1198\/106186006X113430"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1080\/757584614"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1111\/1467-9876.00204"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1080\/757584395"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1198\/1061860032148"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.563524"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623403425629"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-013-0016-9"},{"issue":"7","key":"ref12","article-title":"Optimal solutions for sparse principal component analysis","volume":"9","author":"d\u2019Aspremont","year":"2008","journal-title":"Journal of Machine Learning Research"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOS1097"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOS1151"},{"key":"ref15","article-title":"Fantope projection and selection: A near-optimal convex relaxation of sparse PCA","volume-title":"Advances in Neural Information Processing Systems","volume":"26","author":"Vu"},{"key":"ref16","volume-title":"Convex Optimization & Euclidean Distance Geometry","author":"Dattorro","year":"2005"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmva.2007.06.007"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1093\/biostatistics\/kxp008"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1198\/016214501753382273"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1198\/016214506000000735"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1214\/09-AOS729"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.2307\/1390605"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1198\/0003130042836"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2601299"},{"key":"ref25","article-title":"Sparse PCA with oracle property","volume-title":"Advances in Neural Information Processing Systems","volume":"27","author":"Gu"},{"key":"ref26","article-title":"Tighten after relax: Minimax-optimal sparse PCA in polynomial time","volume-title":"Advances in Neural Information Processing Systems","volume":"27","author":"Wang","year":"2014"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/110836936"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1214\/17-AOS1568"},{"key":"ref29","first-page":"7101","article-title":"Nonconvex sparse graph learning under laplacian constrained graphical model","volume-title":"Advances in Neural Information Processing Systems","volume":"33","author":"Ying"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2023.3311523"}],"event":{"name":"ICASSP 2025 - 2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","location":"Hyderabad, India","start":{"date-parts":[[2025,4,6]]},"end":{"date-parts":[[2025,4,11]]}},"container-title":["ICASSP 2025 - 2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10887540\/10887541\/10888203.pdf?arnumber=10888203","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:24:16Z","timestamp":1774416256000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10888203\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,6]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/icassp49660.2025.10888203","relation":{},"subject":[],"published":{"date-parts":[[2025,4,6]]}}}