{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:31:58Z","timestamp":1740123118445,"version":"3.37.3"},"reference-count":72,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T00:00:00Z","timestamp":1578355200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T00:00:00Z","timestamp":1578355200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s10994-019-05865-4","type":"journal-article","created":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T17:03:14Z","timestamp":1578416594000},"page":"899-938","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["High-dimensional model recovery from random sketched data by exploring intrinsic sparsity"],"prefix":"10.1007","volume":"109","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7858-5438","authenticated-orcid":false,"given":"Tianbao","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lijun","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qihang","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shenghuo","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,7]]},"reference":[{"key":"5865_CR1","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/S0022-0000(03)00025-4","volume":"66","author":"D Achlioptas","year":"2003","unstructured":"Achlioptas, D. (2003). Database-friendly random projections: Johnson-Lindenstrauss with binary coins. Journal of Computer and System Sciences, 66, 671\u2013687.","journal-title":"Journal of Computer and System Sciences"},{"doi-asserted-by":"crossref","unstructured":"Ailon, N. & Chazelle, B. (2006). Approximate nearest neighbors and the fast Johnson\u2013Lindenstrauss transform. In Proceedings of the ACM symposium on theory of computing (STOC) (pp. 557\u2013563).","key":"5865_CR2","DOI":"10.1145\/1132516.1132597"},{"issue":"1","key":"5865_CR3","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1137\/060673096","volume":"39","author":"N Ailon","year":"2009","unstructured":"Ailon, N., & Chazelle, B. (2009). The fast Johnson-Lindenstrauss transform and approximate nearest neighbors. SIAM Journal on Computing, 39(1), 302\u2013322.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"5865_CR4","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10994-006-7550-1","volume":"65","author":"MF Balcan","year":"2006","unstructured":"Balcan, M. F., Blum, A., & Vempala, S. (2006). Kernels as features: On kernels, margins, and low-dimensional mappings. Machine Learning, 65(1), 79\u201394.","journal-title":"Machine Learning"},{"unstructured":"Bartz, D. Hatrick, K. Hesse, C. W. M\u00fcller, K. R. & Lemm, S. (2011). Directional variance adjustment: Improving covariance estimates for high-dimensional portfolio optimization. arXiv:1109.3069","key":"5865_CR5"},{"key":"5865_CR6","doi-asserted-by":"publisher","first-page":"e1000173","DOI":"10.1371\/journal.pcbi.1000173","volume":"4","author":"A Ben-Hur","year":"2008","unstructured":"Ben-Hur, A., Ong, C. S., Sonnenburg, S., Sch\u00f6lkopf, B., & R\u00e4tsch, G. (2008). Support vector machines and kernels for computational biology. PLOS Computational Biology, 4, e1000173.","journal-title":"PLOS Computational Biology"},{"issue":"4","key":"5865_CR7","doi-asserted-by":"publisher","first-page":"1705","DOI":"10.1214\/08-AOS620","volume":"37","author":"PJ Bickel","year":"2009","unstructured":"Bickel, P. J., Ritov, Y., & Tsybakov, A. B. (2009). Simultaneous analysis of Lasso and Dantzig selector. Annals of Statistics, 37(4), 1705\u20131732.","journal-title":"Annals of Statistics"},{"doi-asserted-by":"crossref","unstructured":"Blum, A. (2005) Random projection, margins, kernels, and feature-selection. In Proceedings of the 2005 international conference on subspace, latent structure and feature selection (vol. 3940, pp. 52\u201368). Springer.","key":"5865_CR8","DOI":"10.1007\/11752790_3"},{"issue":"3","key":"5865_CR9","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1137\/120874540","volume":"34","author":"C Boutsidis","year":"2013","unstructured":"Boutsidis, C., & Gittens, A. (2013). Improved matrix algorithms via the subsampled randomized Hadamard transform. SIAM Journal on Matrix Analysis and Applications, 34(3), 1301\u20131340.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"doi-asserted-by":"crossref","unstructured":"Boutsidis, C., Mahoney, M. W., & Drineas, P. (2009). An improved approximation algorithm for the column subset selection problem. In Proceedings of the twentieth annual ACM-SIAM symposium on discrete algorithms (pp. 968\u2013977).","key":"5865_CR10","DOI":"10.1137\/1.9781611973068.105"},{"key":"5865_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., & Vandenberghe, L. (2004). Convex optimization. Cambridge: Cambridge University Press."},{"unstructured":"Brank, J., Grobelnik, M., Mili\u0107-Frayling, N., & Mladeni\u0107, D. (2002). Feature selection using support vector machines. In Proceedings of the international conference on data mining methods and databases for engineering, finance, and other fields (pp. 84\u201389).","key":"5865_CR12"},{"issue":"6","key":"5865_CR13","doi-asserted-by":"publisher","first-page":"2313","DOI":"10.1214\/009053606000001523","volume":"35","author":"E Candes","year":"2007","unstructured":"Candes, E., & Tao, T. (2007). The Dantzig selector: Statistical estimation when $$p$$ is much larger than $$n$$. The Annals of Statistics, 35(6), 2313\u20132351.","journal-title":"The Annals of Statistics"},{"unstructured":"Dasgupta, A., Kumar, R., & Sarl\u00f3s, T. (2010). A sparse Johnson\u2013Lindenstrauss transform. In Proceedings of the 42nd ACM symposium on theory of computing, STOC \u201910 (pp. 341\u2013350).","key":"5865_CR14"},{"issue":"1","key":"5865_CR15","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1002\/rsa.10073","volume":"22","author":"S Dasgupta","year":"2003","unstructured":"Dasgupta, S., & Gupta, A. (2003). An elementary proof of a theorem of Johnson and Lindenstrauss. Random Structures & Algorithms, 22(1), 60\u201365.","journal-title":"Random Structures & Algorithms"},{"unstructured":"Defazio, A., Bach, F. R., & Lacoste-Julien, S. (2014). SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives. In Advances in neural information processing systems (NIPS) (pp. 1646\u20131654).","key":"5865_CR16"},{"doi-asserted-by":"crossref","unstructured":"Drineas, P., Mahoney, M. W., & Muthukrishnan, S. (2006). Sampling algorithms for l2 regression and applications. In ACM-SIAM symposium on discrete algorithms (SODA) (pp. 1127\u20131136).","key":"5865_CR17","DOI":"10.1145\/1109557.1109682"},{"key":"5865_CR18","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1137\/07070471X","volume":"30","author":"P Drineas","year":"2008","unstructured":"Drineas, P., Mahoney, M. W., & Muthukrishnan, S. (2008). Relative-error cur matrix decompositions. SIAM Journal Matrix Analysis Applications, 30, 844\u2013881.","journal-title":"SIAM Journal Matrix Analysis Applications"},{"issue":"2","key":"5865_CR19","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00211-010-0331-6","volume":"117","author":"P Drineas","year":"2011","unstructured":"Drineas, P., Mahoney, M. W., Muthukrishnan, S., & Sarl\u00f3s, T. (2011). Faster least squares approximation. Numerische Mathematik, 117(2), 219\u2013249.","journal-title":"Numerische Mathematik"},{"key":"5865_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511794308","volume-title":"Compressed sensing: Theory and applications","author":"YC Eldar","year":"2012","unstructured":"Eldar, Y. C., & Kutyniok, G. (2012). Compressed sensing: Theory and applications. Cambridge: Cambridge University Press."},{"unstructured":"Goldberger, J., Roweis, S., Hinton, G. & Salakhutdinov, R. (2005). Neighbourhood components analysis. In Advances in neural information processing systems (NIPS) (pp. 513\u2013520).","key":"5865_CR21"},{"key":"5865_CR22","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1023\/A:1012487302797","volume":"46","author":"I Guyon","year":"2002","unstructured":"Guyon, I., Weston, J., Barnhill, S., & Vapnik, V. (2002). Gene selection for cancer classification using support vector machines. Machine Learning (ML), 46, 389\u2013422.","journal-title":"Machine Learning (ML)"},{"issue":"2","key":"5865_CR23","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1137\/090771806","volume":"53","author":"N Halko","year":"2011","unstructured":"Halko, N., Martinsson, P. G., & Tropp, J. A. (2011). Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions. SIAM Review, 53(2), 217\u2013288.","journal-title":"SIAM Review"},{"issue":"1","key":"5865_CR24","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1214\/15-EJS1029","volume":"9","author":"J Jia","year":"2015","unstructured":"Jia, J., & Rohe, K. (2015). Preconditioning the Lasso for sign consistency. Electronic Journal of Statistics, 9(1), 1150\u20131172. https:\/\/doi.org\/10.1214\/15-EJS1029.","journal-title":"Electronic Journal of Statistics"},{"unstructured":"Johnson, R., & Zhang, T. (2013). Accelerating stochastic gradient descent using predictive variance reduction. In Advances in neural information processing systems (NIPS) (pp. 315\u2013323).","key":"5865_CR25"},{"doi-asserted-by":"crossref","unstructured":"Johnson, W., & Lindenstrauss, J. (1984). Extensions of Lipschitz mappings into a Hilbert space. In Conference in modern analysis and probability (New Haven, Connecticut, 1982) (vol.\u00a026, pp. 189\u2013206).","key":"5865_CR26","DOI":"10.1090\/conm\/026\/737400"},{"issue":"R2","key":"5865_CR27","doi-asserted-by":"publisher","first-page":"R182","DOI":"10.1093\/hmg\/ddr378","volume":"20","author":"L Jostins","year":"2011","unstructured":"Jostins, L., & Barrett, J. C. (2011). Genetic risk prediction in complex disease. Human Molecular Genetics, 20(R2), R182\u2013R188.","journal-title":"Human Molecular Genetics"},{"key":"5865_CR28","volume-title":"On the duality of strong convexity and strong smoothness: learning applications and matrix regularization","author":"SM Kakade","year":"2009","unstructured":"Kakade, S. M., Shalev-Shwartz, S., & Tewari, A. (2009). On the duality of strong convexity and strong smoothness: learning applications and matrix regularization. Toyota Technological Institute: Technical report."},{"unstructured":"Kane, D. M., & Nelson, J. (2014). Sparser Johnson\u2013Lindenstrauss transforms. Journal of the ACM, 61, 4:1\u20134:23.","key":"5865_CR29"},{"key":"5865_CR30","doi-asserted-by":"publisher","first-page":"2435","DOI":"10.1093\/hmg\/ddr116","volume":"20","author":"J Kang","year":"2011","unstructured":"Kang, J., Kugathasan, S., Georges, M., Zhao, H., & Cho, J. H. (2011). Improved risk prediction for Crohn\u2019s disease with a multi-locus approach. Human Molecular Genetics, 20, 2435\u20132442.","journal-title":"Human Molecular Genetics"},{"key":"5865_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22147-7","volume-title":"Oracle inequalities in empirical risk minimization and sparse recovery problems","author":"V Koltchinskii","year":"2011","unstructured":"Koltchinskii, V. (2011). Oracle inequalities in empirical risk minimization and sparse recovery problems. Berlin: Springer."},{"doi-asserted-by":"crossref","unstructured":"Koltchinskii, V. (2011). Oracle inequalities in empirical risk minimization and sparse recovery problems: \u00c9cole D\u2019\u00c9t\u00e9 de Probabilit\u00e9s de Saint-Flour XXXVIII-2008. Ecole d\u2019\u00e9t\u00e9 de probabilit\u00e9s de Saint-Flour: Springer.","key":"5865_CR32","DOI":"10.1007\/978-3-642-22147-7"},{"key":"5865_CR33","first-page":"361","volume":"5","author":"DD Lewis","year":"2004","unstructured":"Lewis, D. D., Yang, Y., Rose, T. G., & Li, F. (2004). Rcv1: A new benchmark collection for text categorization research. Journal of Machine Learning Research (JMLR), 5, 361\u2013397.","journal-title":"Journal of Machine Learning Research (JMLR)"},{"unstructured":"Lin, Q., Lu, Z., & Xiao, L. (2014). An accelerated proximal coordinate gradient method. In NIPS (pp. 3059\u20133067).","key":"5865_CR34"},{"unstructured":"Ma, P., Mahoney, M. W., & Yu, B. (2014). A statistical perspective on algorithmic leveraging. In Proceedings of the 31th International conference on machine learning (ICML) (pp. 91\u201399).","key":"5865_CR35"},{"issue":"2","key":"5865_CR36","first-page":"123","volume":"3","author":"MW Mahoney","year":"2011","unstructured":"Mahoney, M. W. (2011). Randomized algorithms for matrices and data. Foundations and Trends in Machine Learning, 3(2), 123\u2013224.","journal-title":"Foundations and Trends in Machine Learning"},{"issue":"3","key":"5865_CR37","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1073\/pnas.0803205106","volume":"106","author":"MW Mahoney","year":"2009","unstructured":"Mahoney, M. W., & Drineas, P. (2009). Cur matrix decompositions for improved data analysis. Proceedings of the National Academy of Sciences, 106(3), 697\u2013702.","journal-title":"Proceedings of the National Academy of Sciences"},{"unstructured":"Maillard, O., & Munos, R. (2009). Compressed least-squares regression. In NIPS (pp. 1213\u20131221).","key":"5865_CR38"},{"issue":"1\u20132","key":"5865_CR39","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1023\/B:MACH.0000035475.85309.1b","volume":"57","author":"TM Mitchell","year":"2004","unstructured":"Mitchell, T. M., Hutchinson, R., Niculescu, R. S., Pereira, F., Wang, X., Just, M., et al. (2004). Learning to decode cognitive states from brain images. Machine Learning, 57(1\u20132), 145\u2013175.","journal-title":"Machine Learning"},{"unstructured":"Nelson, J. (2015). Johnson\u2013Lindenstrauss notes. Technical report, MIT.","key":"5865_CR40"},{"unstructured":"Nelson, J., & Nguyen, H. L. (2012). OSNAP: Faster numerical linear algebra algorithms via sparser subspace embeddings. CoRR. Retreived 2018. arXiv:abs\/1211.1002.","key":"5865_CR41"},{"key":"5865_CR42","doi-asserted-by":"publisher","first-page":"1595","DOI":"10.1214\/009053607000000578","volume":"36","author":"D Paul","year":"2008","unstructured":"Paul, D., Bair, E., Hastie, T., & Tibshirani, R. (2008). Preconditioning for feature selection and regression in high-dimensional problems. The Annals of Statistics, 36, 1595\u20131618.","journal-title":"The Annals of Statistics"},{"unstructured":"Paul, S., Boutsidis, C., Magdon-Ismail, M. & Drineas, P. (2013). Random projections for support vector machines. In AISTATS (pp. 498\u2013506).","key":"5865_CR43"},{"issue":"9","key":"5865_CR44","doi-asserted-by":"publisher","first-page":"5096","DOI":"10.1109\/TIT.2015.2450722","volume":"61","author":"M Pilanci","year":"2015","unstructured":"Pilanci, M., & Wainwright, M. J. (2015). Randomized sketches of convex programs with sharp guarantees. IEEE Transactions on Information Theory, 61(9), 5096\u20135115.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"5865_CR45","first-page":"1842","volume":"17","author":"M Pilanci","year":"2016","unstructured":"Pilanci, M., & Wainwright, M. J. (2016). Iterative hessian sketch: Fast and accurate solution approximation for constrained least-squares. Journal of Machine Learning Research, 17(1), 1842\u20131879.","journal-title":"Journal of Machine Learning Research"},{"unstructured":"Plan, Y., & Vershynin, R. (2011). One-bit compressed sensing by linear programming. CoRR. Retreived 2018. arXiv:abs\/1109.4299.","key":"5865_CR46"},{"key":"5865_CR47","doi-asserted-by":"publisher","first-page":"i369","DOI":"10.1093\/bioinformatics\/bti1053","volume":"21","author":"G R\u00e4tsch","year":"2005","unstructured":"R\u00e4tsch, G., Sonnenburg, S., & Sch\u00f6lkopf, B. (2005a). RASE: Recognition of alternatively spliced exons in C. elegans. Bioinformatics, 21, i369\u2013i377.","journal-title":"Bioinformatics"},{"doi-asserted-by":"crossref","unstructured":"Ratsch, G., Sonnenburg, S., & Scholkopf, B. (2005b). Rase: Recognition of alternatively spliced exons in C. elegans. In Proceedings of the international conference on intelligent systems for molecular biology (ISMB) (supplement of bioinformatics) (pp. 369\u2013377).","key":"5865_CR48","DOI":"10.1093\/bioinformatics\/bti1053"},{"issue":"3","key":"5865_CR49","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/s11263-013-0636-x","volume":"105","author":"J S\u00e1nchez","year":"2013","unstructured":"S\u00e1nchez, J., Perronnin, F., Mensink, T., & Verbeek, J. J. (2013). Image classification with the fisher vector: Theory and practice. International Journal of Computer Vision, 105(3), 222\u2013245.","journal-title":"International Journal of Computer Vision"},{"unstructured":"Shalev-Shwartz, S., & Zhang, T. (2013a). Accelerated mini-batch stochastic dual coordinate ascent. In Advances in Neural Information Processing Systems (NIPS) (pp. 378\u2013385).","key":"5865_CR50"},{"key":"5865_CR51","first-page":"567","volume":"14","author":"S Shalev-Shwartz","year":"2013","unstructured":"Shalev-Shwartz, S., & Zhang, T. (2013b). Stochastic dual coordinate ascent methods for regularized loss minimization. Journal of Machine Learning Research (JMLR), 14, 567\u2013599.","journal-title":"Journal of Machine Learning Research (JMLR)"},{"unstructured":"Shalev-Shwartz, S., & Zhang, T. (2014). Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization. In ICML (pp. 64\u201372).","key":"5865_CR52"},{"key":"5865_CR53","first-page":"2615","volume":"10","author":"Q Shi","year":"2009","unstructured":"Shi, Q., Petterson, J., Dror, G., Langford, J., Smola, A., & Vishwanathan, S. (2009a). Hash kernels for structured data. Journal of Machine Learning Research (JMLR), 10, 2615\u20132637.","journal-title":"Journal of Machine Learning Research (JMLR)"},{"unstructured":"Shi, Q., Petterson, J., Dror, G., Langford, J., Smola, A. J., Strehl, A. L., & Vishwanathan, V. (2009b). Hash kernels. In Proceedings of the international conference on artificial intelligence and statistics (AISTATS) (pp. 496\u2013503).","key":"5865_CR54"},{"unstructured":"Shi, Q., Shen, C., Hill, R., & van\u00a0den Hengel, A. (2012). Is margin preserved after random projection? In Proceedings of the international conference on machine learning (ICML).","key":"5865_CR55"},{"unstructured":"Simianer, P., Riezler, S., & Dyer, C. (2012). Joint feature selection in distributed stochastic learning for large-scale discriminative training in SMT. In Proceedings of annual meeting of the association for computational linguistics (ACL) (pp. 11\u201321).","key":"5865_CR56"},{"unstructured":"Sonnenburg, S., & Franc, V. (2010). Coffin: A computational framework for linear SVMS. In Proceedings of the 27th international conference on machine learning (ICML-10) (pp. 999\u20131006).","key":"5865_CR57"},{"key":"5865_CR58","doi-asserted-by":"publisher","first-page":"S7","DOI":"10.1186\/1471-2105-8-S10-S7","volume":"8","author":"S Sonnenburg","year":"2007","unstructured":"Sonnenburg, S., Schweikert, G., Philips, P., Behr, J., & Ratsch, G. (2007). Accurate splice site prediction using support vector machines. BMC Bioinformatics, 8, S7.","journal-title":"BMC Bioinformatics"},{"unstructured":"Sridharan, K., Shalev-Shwartz, S., & Srebro, N. (2008). Fast rates for regularized objectives. In Advances in neural information processing systems (NIPS) (pp. 1545\u20131552).","key":"5865_CR59"},{"key":"5865_CR60","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R. (1996). Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society (Series B), 58, 267\u2013288.","journal-title":"Journal of the Royal Statistical Society (Series B)"},{"issue":"1\u20132","key":"5865_CR61","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1142\/S1793536911000787","volume":"3","author":"JA Tropp","year":"2011","unstructured":"Tropp, J. A. (2011). Improved analysis of the subsampled randomized hadamard transform. Advances in Adaptive Data Analysis, 3(1\u20132), 115\u2013126.","journal-title":"Advances in Adaptive Data Analysis"},{"issue":"12","key":"5865_CR62","doi-asserted-by":"publisher","first-page":"5728","DOI":"10.1109\/TIT.2009.2032816","volume":"55","author":"MJ Wainwright","year":"2009","unstructured":"Wainwright, M. J. (2009). Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting. IEEE Transactions on Information Theory, 55(12), 5728\u20135741.","journal-title":"IEEE Transactions on Information Theory"},{"doi-asserted-by":"crossref","unstructured":"Weinberger, K. Q., Dasgupta, A., Langford, J., Smola, A. J., & Attenberg, J. (2009). Feature hashing for large scale multitask learning. In Proceedings of the international conference on machine learning (ICML) (pp. 1113\u20131120).","key":"5865_CR63","DOI":"10.1145\/1553374.1553516"},{"issue":"2","key":"5865_CR64","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1137\/120869997","volume":"23","author":"L Xiao","year":"2013","unstructured":"Xiao, L., & Zhang, T. (2013). A proximal-gradient homotopy method for the sparse least-squares problem. SIAM Journal on Optimization, 23(2), 1062\u20131091.","journal-title":"SIAM Journal on Optimization"},{"issue":"4","key":"5865_CR65","doi-asserted-by":"publisher","first-page":"2057","DOI":"10.1137\/140961791","volume":"24","author":"L Xiao","year":"2014","unstructured":"Xiao, L., & Zhang, T. (2014). A proximal stochastic gradient method with progressive variance reduction. SIAM Journal on Optimization, 24(4), 2057\u20132075.","journal-title":"SIAM Journal on Optimization"},{"unstructured":"Yang, T. (2013). Trading computation for communication: Distributed stochastic dual coordinate ascent. In Advances in neural information processing systems (NIPS) (pp. 629\u2013637).","key":"5865_CR66"},{"unstructured":"Yen, I. E., Lin, T., Lin, S., Ravikumar, P. K., & Dhillon, I. S. (2014). Sparse random feature algorithm as coordinate descent in Hilbert space. In NIPS (pp. 2456\u20132464).","key":"5865_CR67"},{"unstructured":"Zhang, L., Mahdavi, M., Jin, R., Yang, T., & Zhu, S. (2013). Recovering the optimal solution by dual random projection. In Proceedings of the conference on learning theory (COLT) (pp. 135\u2013157).","key":"5865_CR68"},{"issue":"11","key":"5865_CR69","doi-asserted-by":"publisher","first-page":"7300","DOI":"10.1109\/TIT.2014.2359204","volume":"60","author":"L Zhang","year":"2014","unstructured":"Zhang, L., Mahdavi, M., Jin, R., Yang, T., & Zhu, S. (2014). Random projections for classification: A recovery approach. IEEE Transactions on Information Theory (IEEE TIT), 60(11), 7300\u20137316.","journal-title":"IEEE Transactions on Information Theory (IEEE TIT)"},{"key":"5865_CR70","first-page":"2541","volume":"7","author":"P Zhao","year":"2006","unstructured":"Zhao, P., & Yu, B. (2006). On model election consistency of lasso. JMLR, 7, 2541\u20132563.","journal-title":"JMLR"},{"unstructured":"Zhou, S., Lafferty, J. D., & Wasserman, L. A. (2007). Compressed regression. In NIPS (pp. 1713\u20131720).","key":"5865_CR71"},{"key":"5865_CR72","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1111\/j.1467-9868.2005.00503.x","volume":"67","author":"H Zou","year":"2003","unstructured":"Zou, H., & Hastie, T. (2003). Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 67, 301\u2013320.","journal-title":"Journal of the Royal Statistical Society: Series B (Statistical Methodology)"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-019-05865-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-019-05865-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-019-05865-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,29]],"date-time":"2024-07-29T20:56:58Z","timestamp":1722286618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-019-05865-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,7]]},"references-count":72,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["5865"],"URL":"https:\/\/doi.org\/10.1007\/s10994-019-05865-4","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2020,1,7]]},"assertion":[{"value":"28 August 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 December 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}