{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T21:36:40Z","timestamp":1773524200000,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T00:00:00Z","timestamp":1699401600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T00:00:00Z","timestamp":1699401600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100009595","name":"Service Public de Wallonie","doi-asserted-by":"publisher","award":["2010235 - ARIAC by DIGITALWALLONIA4.AI"],"award-info":[{"award-number":["2010235 - ARIAC by DIGITALWALLONIA4.AI"]}],"id":[{"id":"10.13039\/501100009595","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s10994-023-06427-5","type":"journal-article","created":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T13:02:39Z","timestamp":1699448559000},"page":"993-1042","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimizing model-agnostic random subspace ensembles"],"prefix":"10.1007","volume":"113","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5492-2498","authenticated-orcid":false,"given":"V\u00e2n Anh","family":"Huynh-Thu","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Geurts","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,8]]},"reference":[{"key":"6427_CR1","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1080\/00031305.1992.10475879","volume":"463","author":"NS Altman","year":"1992","unstructured":"Altman, N. S. (1992). An introduction to kernel and nearest-neighbor nonparametric regression. The American Statistician, 463, 175\u2013185.","journal-title":"The American Statistician"},{"key":"6427_CR2","unstructured":"Balin, M.F., Abid, A., & Zou, J. (2019). Concrete autoencoders: Differentiable feature selection and reconstruction. In Chaudhuri, K. & Salakhutdinov, R. (Eds.) Proceedings of the 36th international conference on machine learning (Vol. 97, pp. 444\u2013453). PMLR."},{"key":"6427_CR3","doi-asserted-by":"crossref","unstructured":"Boser, B.E., Guyon, I., & Vapnik, V.N. (1992). A training algorithm for optimal margin classifiers. In Proceedings of the 5th annual ACM workshop on computational learning theory (pp. 144\u2013152). ACM Press.","DOI":"10.1145\/130385.130401"},{"issue":"2","key":"6427_CR4","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF00058655","volume":"24","author":"L Breiman","year":"1996","unstructured":"Breiman, L. (1996). Bagging predictors. Machine learning, 24(2), 123\u2013140.","journal-title":"Machine learning"},{"issue":"1","key":"6427_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L. (2001). Random forests. Machine learning, 45(1), 5\u201332.","journal-title":"Machine learning"},{"key":"6427_CR7","volume-title":"Classification and regression trees","author":"L Breiman","year":"1984","unstructured":"Breiman, L., Friedman, J. H., Olsen, R. A., & Stone, C. J. (1984). Classification and regression trees. Wadsworth International."},{"key":"6427_CR8","volume-title":"Classification and regression trees","author":"L Breiman","year":"1984","unstructured":"Breiman, L., Friedman, J., Stone, C. J., & Olshen, R. (1984). Classification and regression trees. Chapman and Hall\/CRC."},{"key":"6427_CR9","series-title":"Research track","first-page":"414","volume-title":"Machine learning and knowledge discovery in databases","author":"J Don\u00e0","year":"2021","unstructured":"Don\u00e0, J., & Gallinari, P., et al. (2021). Differentiable feature selection, a reparameterization approach. Research trackIn N. Oliver, F. P\u00e9rez-Cruz, S. Kramer, J. Read, & J. A. Lozano (Eds.), Machine learning and knowledge discovery in databases (pp. 414\u2013429). Springer."},{"key":"6427_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3437-9","volume-title":"Sequential Monte Carlo methods in practice","author":"A Doucet","year":"2001","unstructured":"Doucet, A., de Freitas, N., & Gordon, N. (2001). Sequential Monte Carlo methods in practice. New York: Springer."},{"issue":"1","key":"6427_CR11","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y Freund","year":"1997","unstructured":"Freund, Y., & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119\u2013139.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"6427_CR12","first-page":"1","volume":"19","author":"J Friedman","year":"1991","unstructured":"Friedman, J. (1991). Multivariate adaptive regression splines. The Annals of Statistics, 19(1), 1\u201367.","journal-title":"The Annals of Statistics"},{"issue":"5","key":"6427_CR13","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1214\/aos\/1013203451","volume":"29","author":"JH Friedman","year":"2001","unstructured":"Friedman, J. H. (2001). Greedy function approximation: A gradient boosting machine. The Annals of Statistics, 29(5), 1189\u20131232.","journal-title":"The Annals of Statistics"},{"issue":"1","key":"6427_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10994-006-6226-1","volume":"36","author":"P Geurts","year":"2006","unstructured":"Geurts, P., Ernst, D., & Wehenkel, L. (2006). Extremely randomized trees. Machine Learning, 36(1), 3\u201342.","journal-title":"Machine Learning"},{"issue":"10","key":"6427_CR15","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/84537.84552","volume":"33","author":"PW Glynn","year":"1990","unstructured":"Glynn, P. W. (1990). Likelihood ratio gradient estimation for stochastic systems. Communications of the ACM, 33(10), 75\u201384.","journal-title":"Communications of the ACM"},{"key":"6427_CR16","unstructured":"Grinsztajn, L., Oyallon, E., & Varoquaux, G. (2022). Why do tree-based models still outperform deep learning on typical tabular data?. In Proceedings of the neural information processing systems track on datasets and benchmarks."},{"issue":"8","key":"6427_CR17","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1109\/34.709601","volume":"20","author":"TK Ho","year":"1998","unstructured":"Ho, T. K. (1998). The random subspace method for constructing decision forests. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(8), 832\u2013844.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"9","key":"6427_CR18","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0012776","volume":"5","author":"VA Huynh-Thu","year":"2010","unstructured":"Huynh-Thu, V. A., Irrthum, A., Wehenkel, L., & Geurts, P. (2010). Inferring regulatory networks from expression data using tree-based methods. PLoS ONE, 5(9), e12776.","journal-title":"PLoS ONE"},{"key":"6427_CR19","first-page":"2777","volume":"12","author":"R Jenatton","year":"2011","unstructured":"Jenatton, R., Audibert, J.-Y., & Bach, F. (2011). Structured variable selection with sparsity-inducing norms. Journal of Machine Learning Research, 12, 2777\u20132824.","journal-title":"Journal of Machine Learning Research"},{"key":"6427_CR20","unstructured":"LeCun, Y., Cortes, C., & Burges, C.J.C. (1998). The MNIST database of handwritten digits. http:\/\/yann.lecun.com\/exdb\/mnist\/."},{"issue":"6","key":"6427_CR21","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1145\/3136625","volume":"50","author":"J Li","year":"2018","unstructured":"Li, J., Cheng, K., Wang, S., Morstatter, F., Trevino, R. P., Tang, J., & Liu, H. (2018). Feature selection: A data perspective. ACM Computing Surveys (CSUR), 50(6), 94.","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"6427_CR22","volume-title":"Advances in neural information processing systems","author":"SM Lundberg","year":"2017","unstructured":"Lundberg, S. M., & Lee, S.-I., et al. (2017). A unified approach to interpreting model predictions. In I. Guyon (Ed.), Advances in neural information processing systems. Curran Associates, Inc."},{"issue":"8","key":"6427_CR23","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1038\/nmeth.2016","volume":"9","author":"D Marbach","year":"2012","unstructured":"Marbach, D., Costello, J. C., K\u00fcffner, R., Vega, N., Prill, R. J., Camacho, D. M., & ... & Stolovitzky, G. (2012). Wisdom of crowds for robust gene network inference. Nature Methods, 9(8), 796\u2013804.","journal-title":"Nature Methods"},{"issue":"14","key":"6427_CR24","doi-asserted-by":"publisher","first-page":"6286","DOI":"10.1073\/pnas.0913357107","volume":"107","author":"D Marbach","year":"2010","unstructured":"Marbach, D., Prill, R. J., Schaffter, T., Mattiussi, C., Floreano, D., & Stolovitzky, G. (2010). Revealing strengths and weaknesses of methods for gene network inference. Proceedings of the National Academy of Sciences, 107(14), 6286\u20136291.","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"6427_CR25","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., \u2026 Duchesnay, E. (2011). Scikit-learn: Machine learning in Python. Journal of Machine Learning Research, 12, 2825\u20132830.","journal-title":"Journal of Machine Learning Research"},{"key":"6427_CR26","doi-asserted-by":"crossref","unstructured":"Ribeiro, M.T., Singh, S., Guestrin, C. (2016). Why should I trust you?: Explaining the predictions of any classifier. In Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining (pp. 1135\u20131144). Association for Computing Machinery.","DOI":"10.1145\/2939672.2939778"},{"key":"6427_CR27","volume-title":"Discrete event systems: Sensitivity analysis and stochastic optimization by the score function method","author":"RY Rubinstein","year":"1993","unstructured":"Rubinstein, R. Y., & Shapiro, A. (1993). Discrete event systems: Sensitivity analysis and stochastic optimization by the score function method. Hoboken: Wiley."},{"key":"6427_CR28","unstructured":"Sheth, R., & Fusi, N. (2020). Differentiable feature selection by discrete relaxation. In Chiappa, S. & Calandra, R. (Eds.), Proceedings of the twenty third international conference on artificial intelligence and statistics (Vol. 108, pp. 1564\u20131572). PMLR."},{"key":"6427_CR29","unstructured":"Staines, J., & Barber, D. (2013). Optimization by variational bounding. In Proceedings of the 2013 European symposium on artificial neural networks, computational intelligence and machine learning (ESANN 2013) (pp. 473\u2013478)."},{"issue":"45","key":"6427_CR30","first-page":"1","volume":"22","author":"Y Tian","year":"2021","unstructured":"Tian, Y., & Feng, Y. (2021). RaSE: random subspace ensemble classification. Journal of Machine Learning Research, 22(45), 1\u201393.","journal-title":"Journal of Machine Learning Research"},{"issue":"1","key":"6427_CR31","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1111\/j.1467-9868.2005.00490.x","volume":"67","author":"R Tibshirani","year":"2005","unstructured":"Tibshirani, R., Saunders, M., Rosset, S., Zhu, J., & Knight, K. (2005). Sparsity and smoothness via the fused lasso. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 67(1), 91\u2013108.","journal-title":"Journal of the Royal Statistical Society: Series B (Statistical Methodology)"},{"issue":"3","key":"6427_CR32","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF00992696","volume":"8","author":"RJ Williams","year":"1992","unstructured":"Williams, R. J. (1992). Simple statistical gradient-following algorithms for connectionist reinforcement learning. Machine Learning, 8(3), 229\u2013256.","journal-title":"Machine Learning"},{"key":"6427_CR33","unstructured":"Yamada, Y., Lindenbaum, O., Negahban, S., & Kluger, Y. (2020). Feature selection using stochastic gates. In Daum\u00e9, H. & Singh, A. (Eds.), Proceedings of the 37th international conference on machine learning (Vol. 119, pp. 10648\u201310659). PMLR."},{"key":"6427_CR34","unstructured":"Yang, J., Lindenbaum, O., & Kluger, Y. (2022). Locally sparse neural networks for tabular biomedical data. In Chaudhuri, K., Jegelka, S., Song, L., Szepesv\u00e1ri, C., Niu, G. & Sabato, S. (Eds.), International conference on machine learning, ICML 2022, 17\u201323 July 2022, Baltimore, Maryland, USA (Vol. 162, pp. 25123\u201325153). PMLR."},{"issue":"512","key":"6427_CR35","doi-asserted-by":"publisher","first-page":"1770","DOI":"10.1080\/01621459.2015.1036994","volume":"110","author":"R Zhu","year":"2015","unstructured":"Zhu, R., Zeng, D., & Kosorok, M. R. (2015). Reinforcement learning trees. Journal of the American Statistical Association, 110(512), 1770\u20131784.","journal-title":"Journal of the American Statistical Association"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-023-06427-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-023-06427-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-023-06427-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T18:03:27Z","timestamp":1764266607000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-023-06427-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,8]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["6427"],"URL":"https:\/\/doi.org\/10.1007\/s10994-023-06427-5","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,8]]},"assertion":[{"value":"9 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","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"}]}}