Hugging Face Trending Papers

Complexity-Budgeted, Interaction-Aware Interpretable Model for Tabular Data

Inherently interpretable classifiers for tabular data typically rely on sparse features, rules, or patterns that users can inspect directly. The marginal feature-screening step common to these methods can discard variables whose predictive value emerges only through joint configurations with other variables.

arXiv Machine Learning
Aug 19

TabNSM: Neural Sparse Mixer for Tabular Regression

TabNSM is a scalable regression framework for large-scale, high-dimensional tabular data that builds on sparse-attention and mixer architectures. Its core component, the Adaptive Sparse Interaction Module (ASIM), combines foreground feature discovery, sparse local interaction encoding, and Feature-Token Mixing to achieve near-linear complexity. For regression, TabNSM adds a Multi-Stage Regression Head, GridLoss (an ordinal-aware soft-binning objective), and RISE (a difficulty-aware sampling strategy), achieving strong predictive performance and practical scalability across nine real-world benchmarks, especially on high-dimensional and heterogeneous datasets.

By Ali Eslamian, Qiang Cheng
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
arXiv AI
Sep 16

A unified framework for global and local interpretability using adaptive derivative-ordered random explanation

The paper introduces Adaptive Derivative-Ordered Random Explanation (ADORE), a unified framework that uses first- and second-order derivatives to capture nonlinear feature interactions and feature-sample dynamics. ADORE combines global feature importance with local sample contributions, quantifying both magnitude and direction of feature impact while identifying critical samples. It achieves computational efficiency via randomized SVD and dynamic sparsity detection, outperforming LIME and SHAP across tabular, text, and image data, and is released as an open-source Python package on GitHub.

By Lemen Chao, Ming Lei, Anran Fanga
arXiv Machine Learning
Aug 31

SymboLLM-FE: LLM-Accelerated Symbolic Regression for Automated Feature Engineering on Tabular Data

SymboLLM-FE combines symbolic regression and large language models to automate feature engineering for tabular data. It first extracts mathematically expressive formulas that correlate strongly with the target, then refines them with LLMs to improve interpretability. Experiments on six real‑world datasets and four Kaggle competitions show that SymboLLM‑FE outperforms existing AutoFE methods while reducing the number of costly LLM calls.

By Zi-Jian Cheng, Zi-Yi Jia, Zhi Zhou, Yu-Feng Li, Lan-Zhe Guo
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