arXiv AI

SelectArena: A Modern Benchmark for Feature Selection on Real-world Tabular Data

SelectArena is a new benchmark for feature selection on real-world tabular data, evaluating 15 popular methods across 71 curated datasets for both classification and regression tasks. The study uses standardized protocols and modern foundation models, revealing trade-offs among predictive performance, runtime, stability, and validity. Tree-based methods (CART, RFImportance) and the F-Test emerge as Pareto-optimal choices, while search-based methods perform poorly in speed and stability.

arXiv Machine Learning
Jul 17

ROOFS: RObust biOmarker Feature Selection

arXiv:2601. 05151v3 Announce Type: replace-cross Abstract: Feature selection (FS) is essential for biomarker discovery and clinical predictive modeling.

By Anastasiia Bakhmach, Paul Dufoss\'e, Simon Charpigny, Florence Monville, Laurent Greillier, Fabrice Barl\'esi, S\'ebastien Benzekry
arXiv Machine Learning
Aug 31

Advancing Interaction-Sensitive Feature Selection: Novel Relief-Based Algorithms, Expanded Comparisons, and Recommendations for Biomedical Data Mining

The paper refactors and expands the scikit-rebate Python package, adding new Relief‑Based Algorithm (RBA) variants such as SWRF*, mu‑Relief, and five novel methods that use alternative neighbor selection and feature scoring strategies. Benchmarking across diverse genomic simulations shows that most RBAs, except mu‑Relief, effectively detect 2‑way interactions in noisy data, with far‑scoring variants like MultiSWRFDB* excelling at interaction detection but being less sensitive to main effects. The refactored package achieves 10‑ to 35‑fold runtime reductions, and the new RBAs maintain strong performance for both main effects and 2‑way epistatic interactions, preserving predictive signals for downstream modeling.

By Kia Kazemi-Nia, Harsh Bandhey, Philip J. Freda, Ryan J. Urbanowicz
arXiv AI
Jun 30

Beyond IID: How General Are Tabular Foundation Models, Really?

arXiv:2606. 30410v1 Announce Type: cross Abstract: Foundation models for predictive machine learning on tabular data have recently gained significant traction in academia and industry.

By Lennart Purucker, Andrej Tschalzev, Nick Erickson, Gioia Blayer, David Holzm\"uller, Alan Arazi, Alexander Pfefferle, Mustafa Tajjar, Ga\"el Varoquaux, Frank Hutter
arXiv Machine Learning
Sep 24

Support-Compiled Feature Folding: More Evidence at Lower Memory Across Tabular Foundation Models

Support-Compiled Feature Folding (SCFF) is a training‑free inference framework that addresses the feature‑side scaling dilemma in tabular foundation models by routing support‑ranked features through bounded leaves of the native encoder, checking residual evidence, and merging encoded messages for a single contextual prediction. This approach transforms quadratic pairwise mixing into linear‑in‑width work with a bounded local working set, achieving dataset‑macro accuracy and NLL improvements across six backbones on an 18‑dataset wide‑table slice. SCFF delivers significant GPU‑memory savings (median 2.09×–2.36×) and, when constrained by a peak‑memory ceiling, further boosts accuracy by up to 4.06 points over the widest single‑leaf baseline. whyItMatters":"SCFF demonstrates that memory‑efficient inference can simultaneously improve accuracy and reduce resource usage in tabular foundation models, offering a practical solution for deploying these models at scale."

By Tian Zhou, Beverly Jin, Xue Wang, Linxiao Yang, Wenwei Wang, Bingqing Peng, Mengni Ye, Jinjie Gu, Liang Sun