{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:34:42Z","timestamp":1760146482589,"version":"build-2065373602"},"reference-count":33,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2024,11,8]],"date-time":"2024-11-08T00:00:00Z","timestamp":1731024000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100010226","name":"Scientific Research Platform Project of Education Department of Guangdong Province","doi-asserted-by":"publisher","award":["2021KCXTD038","2022KSYS003","2022ZDJS065","PX-161241546"],"award-info":[{"award-number":["2021KCXTD038","2022KSYS003","2022ZDJS065","PX-161241546"]}],"id":[{"id":"10.13039\/501100010226","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Discipline Construction and Promotion Project of Guangdong Province","award":["2021KCXTD038","2022KSYS003","2022ZDJS065","PX-161241546"],"award-info":[{"award-number":["2021KCXTD038","2022KSYS003","2022ZDJS065","PX-161241546"]}]},{"name":"Education and Teaching Reform Project of Hanshan Normal University","award":["2021KCXTD038","2022KSYS003","2022ZDJS065","PX-161241546"],"award-info":[{"award-number":["2021KCXTD038","2022KSYS003","2022ZDJS065","PX-161241546"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Axioms"],"abstract":"<jats:p>This paper introduces the Group Forward\u2013Backward Orthogonal Matching Pursuit (Group-FoBa-OMP) algorithm, a novel approach for sparse feature selection. The core innovations of this algorithm include (1) an integrated backward elimination process to correct earlier misidentified groups; (2) a versatile convex smooth model that generalizes previous research; (3) the strategic use of gradient information to expedite the group selection phase; and (4) a theoretical validation of its performance in terms of support set recovery, variable estimation accuracy, and objective function optimization. These advancements are supported by experimental evidence from both synthetic and real-world data, demonstrating the algorithm\u2019s effectiveness.<\/jats:p>","DOI":"10.3390\/axioms13110774","type":"journal-article","created":{"date-parts":[[2024,11,12]],"date-time":"2024-11-12T03:53:14Z","timestamp":1731383594000},"page":"774","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Group Forward\u2013Backward Orthogonal Matching Pursuit for General Convex Smooth Functions"],"prefix":"10.3390","volume":"13","author":[{"given":"Zhongxing","family":"Peng","sequence":"first","affiliation":[{"name":"School of Computer Information Engineering, Hanshan Normal University, Chaozhou 521041, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gengzhong","family":"Zheng","sequence":"additional","affiliation":[{"name":"School of Computer Information Engineering, Hanshan Normal University, Chaozhou 521041, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Computer Information Engineering, Hanshan Normal University, Chaozhou 521041, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2024,11,8]]},"reference":[{"key":"ref_1","first-page":"1157","article-title":"An Introduction to Variable and Feature Selection","volume":"3","author":"Guyon","year":"2003","journal-title":"J. Mach. Learn. Res."},{"key":"ref_2","unstructured":"Ng, A.Y. (2004, January 4\u20138). Feature selection, L 1 vs. L 2 regularization, and rotational invariance. Proceedings of the Twenty-First International Conference on Machine Learning, Banff, AB, Canada."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"2507","DOI":"10.1093\/bioinformatics\/btm344","article-title":"A review of feature selection techniques in bioinformatics","volume":"23","author":"Saeys","year":"2007","journal-title":"Bioinformatics"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Wang, R., Qin, Y., Wang, Z., and Zheng, H. (2022). Group-Based Sparse Representation for Compressed Sensing Image Reconstruction with Joint Regularization. Electronics, 11.","DOI":"10.3390\/electronics11020182"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"4689","DOI":"10.1109\/TIT.2011.2146690","article-title":"Adaptive forward-backward greedy algorithm for learning sparse representations","volume":"57","author":"Zhang","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","article-title":"Enhancing sparsity by reweighted L1 minimization","volume":"14","author":"Candes","year":"2008","journal-title":"J. Fourier Anal. Appl."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","article-title":"Regression shrinkage and selection via the lasso","volume":"58","author":"Tibshirani","year":"1996","journal-title":"J. R. Stat. Soc. Ser. Methodol."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"2109","DOI":"10.1214\/08-AOS659","article-title":"Some sharp performance bounds for least squares regression with L1 regularization","volume":"37","author":"Zhang","year":"2009","journal-title":"Ann. Stat."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"2231","DOI":"10.1109\/TIT.2004.834793","article-title":"Greed is good: Algorithmic results for sparse approximation","volume":"50","author":"Tropp","year":"2004","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"4655","DOI":"10.1109\/TIT.2007.909108","article-title":"Signal recovery from random measurements via Orthogonal Matching Pursuit","volume":"53","author":"Tropp","year":"2007","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"6215","DOI":"10.1109\/TIT.2011.2162263","article-title":"Sparse recovery with orthogonal matching pursuit under RIP","volume":"57","author":"Zhang","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Bi, X., Leng, L., Kim, C., Liu, X., Du, Y., and Liu, F. (2021). Constrained Backtracking Matching Pursuit Algorithm for Image Reconstruction in Compressed Sensing. Appl. Sci., 11.","DOI":"10.3390\/app11041435"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Shao, C., Wei, X., Ye, P., and Xing, S. (2023). Efficiency of Orthogonal Matching Pursuit for Group Sparse Recovery. Axioms, 12.","DOI":"10.3390\/axioms12040389"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1214\/009053606000000092","article-title":"Boosting for high-dimensional linear models","volume":"34","author":"Buhlmann","year":"2006","journal-title":"Ann. Stat."},{"key":"ref_15","unstructured":"Liu, J., Fujimaki, R., and Ye, J. (2014, January 21\u201326). Forward-Backward Greedy Algorithms for General Convex Smooth Functions over A Cardinality Constraint. Proceedings of the International Conference on Machine Learning (ICML-2014), Beijing, China."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"3704","DOI":"10.1109\/TSP.2007.894265","article-title":"An empirical Bayesian strategy for solving the simultaneous sparse approximation problem","volume":"55","author":"Wipf","year":"2007","journal-title":"IEEE Trans. Signal Process"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/TSP.2008.2005866","article-title":"Multi-task compressive sensing","volume":"57","author":"Ji","year":"2009","journal-title":"IEEE Trans. Signal Process"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","article-title":"Model selection and estimation in regression with grouped variables","volume":"68","author":"Yuan","year":"2006","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"ref_19","first-page":"1179","article-title":"Consistency of the group lasso and multiple kernel learning","volume":"9","author":"Bach","year":"2008","journal-title":"J. Mach. Learn. Res."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1978","DOI":"10.1214\/09-AOS778","article-title":"The Benefit of Group Sparsity","volume":"38","author":"Huang","year":"2010","journal-title":"Ann. Stat."},{"key":"ref_21","first-page":"3371","article-title":"Learning with structured sparsity","volume":"12","author":"Huang","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref_22","unstructured":"Louici, K., Pontil, M., Tsybakov, A.B., and Van De Deer, S.A. (2009, January 18\u201321). Taking advantage of sparsity in multi-task learning. Proceedings of the Conference on Learning Theory (COLT-2009), Montreal, QC, Canada."},{"key":"ref_23","unstructured":"Lozano, A., Swirszcz, G., and Abe, N. (2009, January 7\u201310). Group Orthogonal Matching Pursuit for Variable Selection and Prediction. Proceedings of the Advances in Neural Information Processing Systems (NIPS-2009), Vancouver, BC, Canada."},{"key":"ref_24","unstructured":"Lozano, A., Swirszcz, G., and Abe, N. (2011, January 11\u201313). Group Orthogonal Matching Pursuit for Logistic Regression. Proceedings of the International Conference on Artificial Intelligence and Statistics (AISTATS-2011), Fort Lauderdale, FL, USA."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"4203","DOI":"10.1109\/TIT.2005.858979","article-title":"Decoding by linear programming","volume":"51","author":"Candes","year":"2005","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_26","first-page":"555","article-title":"On the consistency of feature selection using greedy least squares regression","volume":"10","author":"Zhao","year":"2009","journal-title":"J. Mach. Learn. Res."},{"key":"ref_27","unstructured":"Jalali, A., Johnson, C.C., and Ravikumar, P.D. (2011, January 12\u201315). On learning discrete graphical models using greedy methods. Proceedings of the Advances in Neural Information Processing Systems (NIPS-2011), Granada, Spain."},{"key":"ref_28","first-page":"807","article-title":"Greedy sparsityconstrained optimization","volume":"14","author":"Bahmani","year":"2013","journal-title":"J. Mach. Learn. Res."},{"key":"ref_29","unstructured":"Negahban, S., Ravikumar, P.D., Wainwright, M.J., and Yu, B. (2009, January 7\u201310). A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers. Proceedings of the Advances in Neural Information Processing Systems (NIPS-2009), Vancouver, BC, Canada."},{"key":"ref_30","first-page":"394","article-title":"On the reciprocal of the general algebraic matrix","volume":"26","author":"Moore","year":"1920","journal-title":"Bull. Am. Math. Soc."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1017\/S0305004100030401","article-title":"A generalized inverse for matrices","volume":"51","author":"Penrose","year":"1955","journal-title":"Proc. Camb. Philos. Soc."},{"key":"ref_32","first-page":"2541","article-title":"On model selection consistency of Lasso","volume":"7","author":"Zhao","year":"2006","journal-title":"J. Mach. Learn. Res."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Boyd, S., and Vandenberghe, L. (2004). Convex Optimization, Cambridge Univesity Press.","DOI":"10.1017\/CBO9780511804441"}],"container-title":["Axioms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2075-1680\/13\/11\/774\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T16:29:03Z","timestamp":1760113743000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2075-1680\/13\/11\/774"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,8]]},"references-count":33,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2024,11]]}},"alternative-id":["axioms13110774"],"URL":"https:\/\/doi.org\/10.3390\/axioms13110774","relation":{},"ISSN":["2075-1680"],"issn-type":[{"type":"electronic","value":"2075-1680"}],"subject":[],"published":{"date-parts":[[2024,11,8]]}}}