{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T18:14:50Z","timestamp":1764267290616,"version":"3.46.0"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"11-12","license":[{"start":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T00:00:00Z","timestamp":1727049600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T00:00:00Z","timestamp":1727049600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11825104"],"award-info":[{"award-number":["11825104"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12371273"],"award-info":[{"award-number":["12371273"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Shanghai Rising-Star Program","award":["23QA1404600"],"award-info":[{"award-number":["23QA1404600"]}]},{"name":"Young Elite Scientists Sponsorship Program by CAST","award":["2023QNRC001"],"award-info":[{"award-number":["2023QNRC001"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10994-024-06622-y","type":"journal-article","created":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T13:02:04Z","timestamp":1727096524000},"page":"8711-8748","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient and provable online reduced rank regression via online gradient descent"],"prefix":"10.1007","volume":"113","author":[{"given":"Xiao","family":"Liu","sequence":"first","affiliation":[]},{"given":"Weidong","family":"Liu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9362-508X","authenticated-orcid":false,"given":"Xiaojun","family":"Mao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,23]]},"reference":[{"key":"6622_CR1","doi-asserted-by":"publisher","unstructured":"Arce, P., Antognini, J., Kristjanpoller, W., & Salinas, L. (2015). An online vector error correction model for exchange rates forecasting. In: Proceedings of the international conference on pattern recognition applications and methods (pp. 193\u2013200). https:\/\/doi.org\/10.5220\/0005205901930200","DOI":"10.5220\/0005205901930200"},{"key":"6622_CR2","doi-asserted-by":"publisher","unstructured":"Balzano, L., Nowak, R., & Recht, B. (2010). Online identification and tracking of subspaces from highly incomplete information. In: 2010 48th annual Allerton conference on communication, control, and computing (Allerton) (pp. 704\u2013711). IEEE. https:\/\/doi.org\/10.1109\/ALLERTON.2010.5706976","DOI":"10.1109\/ALLERTON.2010.5706976"},{"issue":"2","key":"6622_CR3","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1214\/11-AOS876","volume":"39","author":"F Bunea","year":"2011","unstructured":"Bunea, F., She, Y., & Wegkamp, M. H. (2011). Optimal selection of reduced rank estimators of high-dimensional matrices. The Annals of Statistics, 39(2), 1282\u20131309. https:\/\/doi.org\/10.1214\/11-AOS876","journal-title":"The Annals of Statistics"},{"issue":"5","key":"6622_CR4","doi-asserted-by":"publisher","first-page":"2359","DOI":"10.1214\/12-AOS1039","volume":"40","author":"F Bunea","year":"2012","unstructured":"Bunea, F., She, Y., & Wegkamp, M. H. (2012). Joint variable and rank selection for parsimonious estimation of high-dimensional matrices. The Annals of Statistics, 40(5), 2359\u20132388. https:\/\/doi.org\/10.1214\/12-AOS1039","journal-title":"The Annals of Statistics"},{"issue":"4","key":"6622_CR5","doi-asserted-by":"publisher","first-page":"2342","DOI":"10.1109\/TIT.2011.2111771","volume":"57","author":"EJ Candes","year":"2011","unstructured":"Candes, E. J., & Plan, Y. (2011). Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements. IEEE Transactions on Information Theory, 57(4), 2342\u20132359. https:\/\/doi.org\/10.1109\/TIT.2011.2111771","journal-title":"IEEE Transactions on Information Theory"},{"issue":"9","key":"6622_CR6","doi-asserted-by":"publisher","first-page":"5806","DOI":"10.1109\/TIT.2020.2992234","volume":"66","author":"J Chen","year":"2020","unstructured":"Chen, J., Liu, D., & Li, X. (2020). Nonconvex rectangular matrix completion via gradient descent without $$l_{2,\\infty }$$ regularization. IEEE Transactions on Information Theory, 66(9), 5806\u20135841. https:\/\/doi.org\/10.1109\/TIT.2020.2992234","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"6622_CR7","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1093\/biomet\/ast036","volume":"100","author":"K Chen","year":"2013","unstructured":"Chen, K., Dong, H., & Chan, K. S. (2013). Reduced rank regression via adaptive nuclear norm penalization. Biometrika, 100(4), 901\u2013920. https:\/\/doi.org\/10.1093\/biomet\/ast036","journal-title":"Biometrika"},{"issue":"500","key":"6622_CR8","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1080\/01621459.2012.734178","volume":"107","author":"L Chen","year":"2012","unstructured":"Chen, L., & Huang, J. Z. (2012). Sparse reduced-rank regression for simultaneous dimension reduction and variable selection. Journal of the American Statistical Association, 107(500), 1533\u20131545. https:\/\/doi.org\/10.1080\/01621459.2012.734178","journal-title":"Journal of the American Statistical Association"},{"key":"6622_CR9","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2021.1933498","author":"X Chen","year":"2024","unstructured":"Chen, X., Lai, Z., Li, H., & Zhang, Y. (2024). Online statistical inference for stochastic optimization via Kiefer\u2013Wolfowitz methods. Journal of the American Statistical Association. https:\/\/doi.org\/10.1080\/01621459.2021.1933498","journal-title":"Journal of the American Statistical Association"},{"key":"6622_CR10","doi-asserted-by":"publisher","first-page":"1707","DOI":"10.1007\/s11425-020-1785-0","volume":"65","author":"X Chen","year":"2022","unstructured":"Chen, X., Liu, W., & Mao, X. (2022). Robust reduced rank regression in a distributed setting. Science China Mathematics, 65, 1707\u20131730. https:\/\/doi.org\/10.1007\/s11425-020-1785-0","journal-title":"Science China Mathematics"},{"issue":"4","key":"6622_CR11","doi-asserted-by":"publisher","first-page":"3098","DOI":"10.1137\/19M1290000","volume":"30","author":"Y Chen","year":"2020","unstructured":"Chen, Y., Chi, Y., Fan, J., Ma, C., & Yan, Y. (2020). Noisy matrix completion: Understanding statistical guarantees for convex relaxation via nonconvex optimization. SIAM Journal on Optimization, 30(4), 3098\u20133121. https:\/\/doi.org\/10.1137\/19M1290000","journal-title":"SIAM Journal on Optimization"},{"issue":"12","key":"6622_CR12","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1109\/LSP.2007.907995","volume":"14","author":"RC De Lamare","year":"2007","unstructured":"De Lamare, R. C., & Sampaio-Neto, R. (2007). Reduced-rank adaptive filtering based on joint iterative optimization of adaptive filters. IEEE Signal Processing Letters, 14(12), 980\u2013983. https:\/\/doi.org\/10.1109\/LSP.2007.907995","journal-title":"IEEE Signal Processing Letters"},{"key":"6622_CR13","doi-asserted-by":"publisher","first-page":"2503","DOI":"10.1109\/TSP.2009.2018641","volume":"57","author":"RC De Lamare","year":"2009","unstructured":"De Lamare, R. C., & Sampaio-Neto, R. (2009). Adaptive reduced-rank processing based on joint and iterative interpolation, decimation, and filtering. IEEE Transactions on Signal Processing, 57, 2503\u20132514. https:\/\/doi.org\/10.1109\/TSP.2009.2018641","journal-title":"IEEE Transactions on Signal Processing"},{"key":"6622_CR14","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1109\/TVT.2009.2038391","volume":"59","author":"RC De Lamare","year":"2009","unstructured":"De Lamare, R. C., & Sampaio-Neto, R. (2009). Reduced-rank space-time adaptive interference suppression with joint iterative least squares algorithms for spread-spectrum systems. IEEE Transactions on Vehicular Technology, 59, 1217\u20131228. https:\/\/doi.org\/10.1109\/TVT.2009.2038391","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"6622_CR15","unstructured":"Dubois, B., Delmas, J. F., & Obozinski, G. (2019). Fast algorithms for sparse reduced-rank regression. In: The 22nd international conference on artificial intelligence and statistics (pp. 2415\u20132424). PMLR."},{"key":"6622_CR16","doi-asserted-by":"publisher","unstructured":"Ghadimi, E., Feyzmahdavian, H. R., & Johansson, M. (2015). Global convergence of the heavy-ball method for convex optimization. In 2015 European control conference (ECC) (pp. 310\u2013315). IEEE. https:\/\/doi.org\/10.1109\/ECC.2015.7330562","DOI":"10.1109\/ECC.2015.7330562"},{"issue":"3\u20134","key":"6622_CR17","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1561\/9781680831719","volume":"2","author":"E Hazan","year":"2016","unstructured":"Hazan, E. (2016). Introduction to online convex optimization. Foundations and Trends\u00ae in Optimization, 2(3\u20134), 157\u2013325. https:\/\/doi.org\/10.1561\/9781680831719","journal-title":"Foundations and Trends\u00ae in Optimization"},{"key":"6622_CR18","unstructured":"Hazan, E., Rakhlin, A., & Bartlett, P. (2007). Adaptive online gradient descent. In Advances in neural information processing systems (Vol. 20, pp 1\u20138). Curran Associates, Inc."},{"key":"6622_CR19","doi-asserted-by":"publisher","first-page":"20402","DOI":"10.48550\/arXiv.1906.07255","volume":"33","author":"M Herbster","year":"2020","unstructured":"Herbster, M., Pasteris, S., & Tse, L. (2020). Online matrix completion with side information. Advances in Neural Information Processing Systems, 33, 20402\u201320414.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"6622_CR20","doi-asserted-by":"publisher","first-page":"986","DOI":"10.1109\/TCOMM.2002.1010618","volume":"50","author":"ML Honig","year":"2002","unstructured":"Honig, M. L., & Goldstein, J. S. (2002). Adaptive reduced-rank interference suppression based on the multistage wiener filter. IEEE Transactions on Communications, 50, 986\u2013994. https:\/\/doi.org\/10.1109\/TCOMM.2002.1010618","journal-title":"IEEE Transactions on Communications"},{"issue":"3","key":"6622_CR21","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1109\/78.905856","volume":"49","author":"Y Hua","year":"2001","unstructured":"Hua, Y., Nikpour, M., & Stoica, P. (2001). Optimal reduced-rank estimation and filtering. IEEE Transactions on Signal Processing, 49(3), 457\u2013469. https:\/\/doi.org\/10.1109\/78.905856","journal-title":"IEEE Transactions on Signal Processing"},{"key":"6622_CR22","doi-asserted-by":"publisher","unstructured":"Huang, D., & Torre, F. D. l. (2010). Bilinear kernel reduced rank regression for facial expression synthesis. In European conference on computer vision (pp. 364\u2013377). Springer. https:\/\/doi.org\/10.1007\/978-3-642-15552-9_27","DOI":"10.1007\/978-3-642-15552-9_27"},{"issue":"2","key":"6622_CR23","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/0047-259X(75)90042-1","volume":"5","author":"AJ Izenman","year":"1975","unstructured":"Izenman, A. J. (1975). Reduced-rank regression for the multivariate linear model. Journal of Multivariate Analysis, 5(2), 248\u2013264. https:\/\/doi.org\/10.1016\/0047-259X(75)90042-1","journal-title":"Journal of Multivariate Analysis"},{"key":"6622_CR24","doi-asserted-by":"publisher","first-page":"4520","DOI":"10.5555\/3157382.3157603","volume":"29","author":"C Jin","year":"2016","unstructured":"Jin, C., Kakade, S. M., & Netrapalli, P. (2016). Provable efficient online matrix completion via non-convex stochastic gradient descent. Advances in Neural Information Processing Systems, 29, 4520\u20134528. https:\/\/doi.org\/10.5555\/3157382.3157603","journal-title":"Advances in Neural Information Processing Systems"},{"key":"6622_CR25","doi-asserted-by":"publisher","unstructured":"Kidambi, R., Netrapalli, P., Jain, P., & Kakade, S. (2018). On the insufficiency of existing momentum schemes for stochastic optimization. In: 2018 Information Theory and Applications workshop (ITA) (pp. 1\u20139). IEEE. https:\/\/doi.org\/10.1109\/ITA.2018.8503173","DOI":"10.1109\/ITA.2018.8503173"},{"key":"6622_CR26","unstructured":"Kingma, D. P., & Ba, J. (2015). International Conference on Learning Representations (ICLR) (pp. 1\u201313)."},{"key":"6622_CR27","volume-title":"Stochastic approximation and recursive algorithms and applications","author":"H Kushner","year":"2003","unstructured":"Kushner, H., & Yin, G. G. (2003). Stochastic approximation and recursive algorithms and applications (Vol. 35). Springer."},{"issue":"8","key":"6622_CR28","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.3390\/sym14081617","volume":"14","author":"W Liu","year":"2022","unstructured":"Liu, W., Liu, G., & Tang, Y. (2022). Robust sparse reduced-rank regression with response dependency. Symmetry, 14(8), 1617\u20131629. https:\/\/doi.org\/10.3390\/sym14081617","journal-title":"Symmetry"},{"key":"6622_CR29","doi-asserted-by":"publisher","first-page":"18261","DOI":"10.48550\/arXiv.2007.07989","volume":"33","author":"Y Liu","year":"2020","unstructured":"Liu, Y., Gao, Y., & Yin, W. (2020). An improved analysis of stochastic gradient descent with momentum. Advances in Neural Information Processing Systems, 33, 18261\u201318271. https:\/\/doi.org\/10.48550\/arXiv.2007.07989","journal-title":"Advances in Neural Information Processing Systems"},{"key":"6622_CR30","doi-asserted-by":"publisher","unstructured":"Lois, B., & Vaswani, N. (2015). Online matrix completion and online robust PCA. In 2015 IEEE International Symposium on Information Theory (ISIT) (pp. 1826\u20131830). IEEE. https:\/\/doi.org\/10.1109\/ISIT.2015.7282771","DOI":"10.1109\/ISIT.2015.7282771"},{"key":"6622_CR31","doi-asserted-by":"publisher","unstructured":"Ma, C., Wang, K., Chi, Y., & Chen, Y. (2018). Implicit regularization in nonconvex statistical estimation: Gradient descent converges linearly for phase retrieval and matrix completion. In: International conference on machine learning (pp. 3345\u20133354). PMLR. https:\/\/doi.org\/10.1007\/s10208-019-09429-9","DOI":"10.1007\/s10208-019-09429-9"},{"issue":"1","key":"6622_CR32","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/1756006.1756008","volume":"11","author":"J Mairal","year":"2010","unstructured":"Mairal, J., Bach, F., Ponce, J., & Sapiro, G. (2010). Online learning for matrix factorization and sparse coding. Journal of Machine Learning Research, 11(1), 19\u201360. https:\/\/doi.org\/10.1145\/1756006.1756008","journal-title":"Journal of Machine Learning Research"},{"issue":"1","key":"6622_CR33","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y. (2013). Gradient methods for minimizing composite functions. Mathematical Programming, 140(1), 125\u2013161. https:\/\/doi.org\/10.1007\/s10107-012-0629-5","journal-title":"Mathematical Programming"},{"issue":"3","key":"6622_CR34","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1109\/TSP.2004.842191","volume":"53","author":"M Nicoli","year":"2005","unstructured":"Nicoli, M., & Spagnolini, U. (2005). Reduced-rank channel estimation for time-slotted mobile communication systems. IEEE Transactions on Signal Processing, 53(3), 926\u2013944. https:\/\/doi.org\/10.1109\/TSP.2004.842191","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"4","key":"6622_CR35","doi-asserted-by":"publisher","first-page":"2165","DOI":"10.1137\/17M1150189","volume":"11","author":"D Park","year":"2018","unstructured":"Park, D., Kyrillidis, A., Caramanis, C., & Sanghavi, S. (2018). Finding low-rank solutions via nonconvex matrix factorization, efficiently and provably. SIAM Journal on Imaging Sciences, 11(4), 2165\u20132204. https:\/\/doi.org\/10.1137\/17M1150189","journal-title":"SIAM Journal on Imaging Sciences"},{"issue":"5","key":"6622_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0041-5553(64)90137-5","volume":"4","author":"BT Polyak","year":"1964","unstructured":"Polyak, B. T. (1964). Some methods of speeding up the convergence of iteration methods. Ussr Computational Mathematics and Mathematical Physics, 4(5), 1\u201317. https:\/\/doi.org\/10.1016\/0041-5553(64)90137-5","journal-title":"Ussr Computational Mathematics and Mathematical Physics"},{"key":"6622_CR37","doi-asserted-by":"publisher","first-page":"1700","DOI":"10.1109\/TCOMM.2003.818089","volume":"51","author":"H Qian","year":"2003","unstructured":"Qian, H., & Batalama, S. N. (2003). Data record-based criteria for the selection of an auxiliary vector estimator of the MMSE\/MVDR filter. IEEE Transactions on Communications, 51, 1700\u20131708. https:\/\/doi.org\/10.1109\/TCOMM.2003.818089","journal-title":"IEEE Transactions on Communications"},{"issue":"8","key":"6622_CR38","doi-asserted-by":"publisher","first-page":"5007","DOI":"10.1109\/ICASSP.2013.6638807","volume":"60","author":"C Qiu","year":"2014","unstructured":"Qiu, C., Vaswani, N., Lois, B., et al. (2014). Recursive robust PCA or recursive sparse recovery in large but structured noise. IEEE Transactions on Information Theory, 60(8), 5007\u20135039. https:\/\/doi.org\/10.1109\/ICASSP.2013.6638807","journal-title":"IEEE Transactions on Information Theory"},{"key":"6622_CR39","doi-asserted-by":"crossref","unstructured":"Robinson, P. (1974). Identification, estimation and large-sample theory for regressions containing unobservable variables. International Economic Review, 680\u2013692.","DOI":"10.2307\/2525734"},{"key":"6622_CR40","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0165-1684(91)90058-Q","volume":"25","author":"LL Scharf","year":"1991","unstructured":"Scharf, L. L. (1991). The SVD and reduced rank signal processing. Signal Processing, 25, 113\u2013133. https:\/\/doi.org\/10.1016\/0165-1684(91)90058-Q","journal-title":"Signal Processing"},{"issue":"2","key":"6622_CR41","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1561\/9781601985477","volume":"4","author":"S Shalev-Shwartz","year":"2012","unstructured":"Shalev-Shwartz, S. (2012). Online learning and online convex optimization. Foundations and Trends\u00ae in Machine Learning, 4(2), 107\u2013194. https:\/\/doi.org\/10.1561\/9781601985477","journal-title":"Foundations and Trends\u00ae in Machine Learning"},{"issue":"1","key":"6622_CR42","first-page":"97","volume":"104","author":"Y She","year":"2017","unstructured":"She, Y. (2017). Selective factor extraction in high dimensions. Biometrika, 104(1), 97\u2013110.","journal-title":"Biometrika"},{"issue":"1","key":"6622_CR43","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1111\/rssb.12295","volume":"81","author":"Y She","year":"2019","unstructured":"She, Y., & Tran, H. (2019). On cross-validation for sparse reduced rank regression. Journal of the Royal Statistical Society Series B: Statistical Methodology, 81(1), 145\u2013161. https:\/\/doi.org\/10.1111\/rssb.12295","journal-title":"Journal of the Royal Statistical Society Series B: Statistical Methodology"},{"key":"6622_CR44","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2022.2050243","author":"KM Tan","year":"2022","unstructured":"Tan, K. M., Sun, Q., & Witten, D. (2022). Sparse reduced-rank Huber regression in high dimensions. Journal of the American Statistical Association. https:\/\/doi.org\/10.1080\/01621459.2022.2050243","journal-title":"Journal of the American Statistical Association"},{"key":"6622_CR45","unstructured":"Tu, S., Boczar, R., Simchowitz, M., Soltanolkotabi, M., & Recht, B. (2016) Low-rank solutions of linear matrix equations via procrustes flow. In International conference on machine learning (pp. 964\u2013973). PMLR."},{"key":"6622_CR46","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2853-8","volume-title":"Multivariate reduced-rank regression: Theory and applications","author":"R Velu","year":"2013","unstructured":"Velu, R., & Reinsel, G. C. (2013). Multivariate reduced-rank regression: Theory and applications (Vol. 136). Springer. https:\/\/doi.org\/10.1007\/978-1-4757-2853-8"},{"key":"6622_CR47","doi-asserted-by":"publisher","unstructured":"Vershynin, R. (2012). Introduction to the non-asymptotic analysis of random matrices. In Compressed sensing: Theory and applications (pp. 210\u2014268). Cambridge University Press. https:\/\/doi.org\/10.1017\/CBO9780511794308.006","DOI":"10.1017\/CBO9780511794308.006"},{"key":"6622_CR48","doi-asserted-by":"publisher","DOI":"10.1017\/9781108627771","volume-title":"High-dimensional statistics: A non-asymptotic viewpoint","author":"MJ Wainwright","year":"2019","unstructured":"Wainwright, M. J. (2019). High-dimensional statistics: A non-asymptotic viewpoint (Vol. 48). Cambridge University Press. https:\/\/doi.org\/10.1017\/9781108627771"},{"key":"6622_CR49","unstructured":"Wang, L., Zhang, X., & Gu, Q. (2017). A unified computational and statistical framework for nonconvex low-rank matrix estimation. In Artificial intelligence and statistics (pp. 981\u2013990). PMLR."},{"key":"6622_CR50","doi-asserted-by":"publisher","unstructured":"Yang, Y. F., & Zhao, Z. (2020). Online robust reduced-rank regression. In 2020 IEEE 11th sensor array and multichannel signal processing workshop (SAM) (pp. 1\u20135). IEEE. https:\/\/doi.org\/10.1109\/SAM48682.2020.9104268","DOI":"10.1109\/SAM48682.2020.9104268"},{"issue":"1","key":"6622_CR51","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M Yuan","year":"2006","unstructured":"Yuan, M., & Lin, Y. (2006). Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 68(1), 49\u201367. https:\/\/doi.org\/10.1111\/j.1467-9868.2005.00532.x","journal-title":"Journal of the Royal Statistical Society: Series B (Statistical Methodology)"},{"key":"6622_CR52","unstructured":"Zhao, R., Tan, V., & Xu, H. (2017). Online nonnegative matrix factorization with general divergences. In Artificial intelligence and statistics (pp. 37\u201345). PMLR."},{"issue":"9","key":"6622_CR53","doi-asserted-by":"publisher","first-page":"2342","DOI":"10.1109\/TSP.2018.2799193","volume":"66","author":"Z Zhao","year":"2018","unstructured":"Zhao, Z., & Palomar, D. P. (2018). Mean-reverting portfolio with budget constraint. IEEE Transactions on Signal Processing, 66(9), 2342\u20132357. https:\/\/doi.org\/10.1109\/TSP.2018.2799193","journal-title":"IEEE Transactions on Signal Processing"},{"key":"6622_CR54","doi-asserted-by":"publisher","unstructured":"Zhao, Z., & Palomar, D. P. (2018b). Sparse reduced rank regression with nonconvex regularization. In 2018 IEEE statistical signal processing workshop (SSP) (pp. 811\u2013815). IEEE. https:\/\/doi.org\/10.1109\/SSP.2018.8450724","DOI":"10.1109\/SSP.2018.8450724"},{"issue":"7","key":"6622_CR55","doi-asserted-by":"publisher","first-page":"1681","DOI":"10.1109\/TSP.2019.2893862","volume":"67","author":"Z Zhao","year":"2019","unstructured":"Zhao, Z., Zhou, R., & Palomar, D. P. (2019). Optimal mean-reverting portfolio with leverage constraint for statistical arbitrage in finance. IEEE Transactions on Signal Processing, 67(7), 1681\u20131695. https:\/\/doi.org\/10.1109\/TSP.2019.2893862","journal-title":"IEEE Transactions on Signal Processing"},{"key":"6622_CR56","unstructured":"Zinkevich, M. (2003). Online convex programming and generalized infinitesimal gradient ascent. In International Conference on Machine Learning (pp. 928\u2013936). PMLR."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-024-06622-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-024-06622-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-024-06622-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T18:12:52Z","timestamp":1764267172000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-024-06622-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,23]]},"references-count":56,"journal-issue":{"issue":"11-12","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["6622"],"URL":"https:\/\/doi.org\/10.1007\/s10994-024-06622-y","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2024,9,23]]},"assertion":[{"value":"18 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There is no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}