arXiv:2607. 07060v1 Announce Type: cross Abstract: Inherently interpretable classifiers for tabular data typically rely on sparse features, rules, or patterns that users can inspect directly.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.
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:2607. 14096v1 Announce Type: new Abstract: In predictive modeling, the ability to explain why a model produces a given target prediction has become increasingly important [5, 10].
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."
arXiv:2605. 31272v2 Announce Type: replace Abstract: As predictive models are increasingly deployed in high-stakes settings such as credit approval, there is a growing need for post-hoc methods that provide recourse to affected individuals.
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.
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.