Universal Feature Selection for Simultaneous Interpretability of Multitask Datasets
Not on the map. Why?
Abstract (arXiv)
Extracting meaningful features from complex, high-dimensional datasets across scientific domains remains challenging. Current methods often struggle with scalability, limiting their applicability to large datasets, or make restrictive assumptions about feature-property relationships, hindering their ability to capture complex interactions. BoUTS's general and scalable feature selection algorithm surpasses these limitations to identify both universal features relevant to all datasets and task-specific features predictive for specific subsets. Evaluated on seven diverse chemical regression datasets, BoUTS achieves state-of-the-art feature sparsity while maintaining prediction accuracy comparable to specialized methods. Notably, BoUTS's universal features enable domain-specific knowledge transfer between datasets, and suggest deep connections in seemingly-disparate chemical datasets. We expect these results to have important repercussions in manually-guided inverse problems. Beyond its current application, BoUTS holds immense potential for elucidating data-poor systems by leveraging information from similar data-rich systems. BoUTS represents a significant leap in cross-domain feature selection, potentially leading to advancements in various scientific fields.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 8 of its 60 references that are in the map. First posted on arXiv 21 Mar 2024.
Builds on
8 of 60 references.
References · 8
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
- 2021E(n) Equivariant Graph Neural Networkscited by 965
- 2021Tabular Data: Deep Learning is Not All You Needcited by 535
- 2017Deep Reinforcement Learning for De-Novo Drug Designcited by 161
- 2019Gradient Boosted Feature Selectioncited by 13
- 2013Sparse Overlapping Sets Lasso for Multitask Learning and its Application to fMRI Analysiscited by 4
- 2022Gradient Boosting Performs Gaussian Process Inferencecited by 4
- 2014A Unifying Framework for Typical Multi-Task Multiple Kernel Learning Problemscited by 1
Built on by
Citing papers per year: 2024: 1.
1 paper.
- 2024Joint Optimization of Piecewise Linear Ensemblescited by 0
- 2024Joint Optimization of Piecewise Linear Ensembles1 May 2024