Automated Model Selection for Tabular Data
Avinash Amballa, Gayathri Akkinapalli, Manas Madine, Naga Pavana Priya Yarrabolu, Przemyslaw A. Grabowicz
TL;DR
This work tackles the challenge of selecting predictive feature interactions in tabular data, where naive grid searches are computationally prohibitive. It introduces two automated approaches—Priority-based Random Grid Search and Greedy Search (Forward/Backward)—to simultaneously select base and second-order interaction features within a linear modeling framework, using one-hot encoding for categoricals. Experiments on real-world Adult data reveal limited gains from interactions, while a synthetic dataset with ground-truth interactions shows near-optimal predictive power (approximate $R^2$ of $0.996$) and favorable runtimes, highlighting a trade-off between efficiency and accuracy. Overall, the results demonstrate that explicit, interpretable interaction selection can be effectively automated for tabular data, with practical implications for transparent, efficient predictive analytics on structured datasets.
Abstract
Structured data in the form of tabular datasets contain features that are distinct and discrete, with varying individual and relative importances to the target. Combinations of one or more features may be more predictive and meaningful than simple individual feature contributions. R's mixed effect linear models library allows users to provide such interactive feature combinations in the model design. However, given many features and possible interactions to select from, model selection becomes an exponentially difficult task. We aim to automate the model selection process for predictions on tabular datasets incorporating feature interactions while keeping computational costs small. The framework includes two distinct approaches for feature selection: a Priority-based Random Grid Search and a Greedy Search method. The Priority-based approach efficiently explores feature combinations using prior probabilities to guide the search. The Greedy method builds the solution iteratively by adding or removing features based on their impact. Experiments on synthetic demonstrate the ability to effectively capture predictive feature combinations.
