mlsanityData to 14 Oct 2026

Hybrid Autoencoders for Tabular Data: Leveraging Model-Based Augmentation in Low-Label Settings

arXiv 2511.06961 ↗First posted 10 Nov 2025cs.LG cs.AIcited by 5

Not on the map. Why?

Abstract (arXiv)

Deep neural networks often under-perform on tabular data due to their sensitivity to irrelevant features and a spectral bias toward smooth, low-frequency functions. These limitations hinder their ability to capture the sharp, high-frequency signals that often define tabular structure, especially under limited labeled samples. While self-supervised learning (SSL) offers promise in such settings, it remains challenging in tabular domains due to the lack of effective data augmentations. We propose a hybrid autoencoder that combines a neural encoder with an oblivious soft decision tree (OSDT) encoder, each guided by its own stochastic gating network that performs sample-specific feature selection. Together, these structurally different encoders and model-specific gating networks implement model-based augmentation, producing complementary input views tailored to each architecture. The two encoders, trained with a shared decoder and cross-reconstruction loss, learn distinct yet aligned representations that reflect their respective inductive biases. During training, the OSDT encoder (robust to noise and effective at modeling localized, high-frequency structure) guides the neural encoder toward representations more aligned with tabular data. At inference, only the neural encoder is used, preserving flexibility and SSL compatibility. Spectral analysis highlights the distinct inductive biases of each encoder. Our method achieves consistent gains in low-label classification and regression across diverse tabular datasets, outperforming deep and tree-based supervised baselines.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 21 of its 40 references that are in the map. First posted on arXiv 10 Nov 2025.

Builds on

21 of 40 references.

References · 21

  1. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
  2. 2018On the Spectral Bias of Neural Networkscited by 1,341
  3. 2022TabPFN: A Transformer That Solves Small Tabular Classification Problems in a Secondcited by 674
  4. 2019TabNet: Attentive Interpretable Tabular Learningcited by 648
  5. 2021Tabular Data: Deep Learning is Not All You Needcited by 535
  6. 2021SAINT: Improved Neural Networks for Tabular Data via Row Attention and Contrastive Pre-Trainingcited by 319
  7. 2019Neural Oblivious Decision Ensembles for Deep Learning on Tabular Datacited by 203
  8. 2022Why do tree-based models still outperform deep learning on tabular data?cited by 199
  9. 2024Why Tabular Foundation Models Should Be a Research Prioritycited by 106
  10. 2021SubTab: Subsetting Features of Tabular Data for Self-Supervised Representation Learningcited by 104
  11. 2021Locally Sparse Neural Networks for Tabular Biomedical Datacited by 34
  12. 2023Interpretable Deep Clustering for Tabular Datacited by 19
9 more
  1. 2025SUMO: Subspace-Aware Moment-Orthogonalization for Accelerating Memory-Efficient LLM Trainingcited by 19
  2. 2024AdaRankGrad: Adaptive Gradient-Rank and Moments for Memory-Efficient LLMs Training and Fine-Tuningcited by 17
  3. 2021Deep Unsupervised Feature Selection by Discarding Nuisance and Correlated Featurescited by 11
  4. 2021Support Recovery with Stochastic Gates: Theory and Application for Linear Modelscited by 8
  5. 2023Anomaly Detection with Variance Stabilized Density Estimationcited by 8
  6. 2023Contextual Feature Selection with Conditional Stochastic Gatescited by 7
  7. 2014Autoencoder Treescited by 6
  8. 2024To Predict or Not To Predict? Proportionally Masked Autoencoders for Tabular Data Imputationcited by 5
  9. 2024FineGates: LLMs Finetuning with Compression using Stochastic Gatescited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 5.

5 papers.