Pith. sign in

(GG) MoE vs. MLP on Tabular Data

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

In recent years, significant efforts have been directed toward adapting modern neural network architectures for tabular data. However, despite their larger number of parameters and longer training and inference times, these models often fail to consistently outperform vanilla multilayer perceptron (MLP) neural networks. Moreover, MLP-based ensembles have recently demonstrated superior performance and efficiency compared to advanced deep learning methods. Therefore, rather than focusing on building deeper and more complex deep learning models, we propose investigating whether MLP neural networks can be replaced with more efficient architectures without sacrificing performance. In this paper, we first introduce GG MoE, a mixture-of-experts (MoE) model with a Gumbel-Softmax gating function. We then demonstrate that GG MoE with an embedding layer achieves the highest performance across $38$ datasets compared to standard MoE and MLP models. Finally, we show that both MoE and GG MoE utilize significantly fewer parameters than MLPs, making them a promising alternative for scaling and ensemble methods.

citation-role summary

background 1

citation-polarity summary

fields

cs.LG 1

years

2025 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

unclear 1

representative citing papers

Universal Embeddings of Tabular Data

cs.LG · 2025-07-08 · conditional · novelty 5.0

Rows of a table are embedded by training a graph auto-encoder on a table-derived weighted graph, giving smaller universal embeddings than EmbDI-style random-walk embeddings on two Kaggle datasets.

citing papers explorer

Showing 1 of 1 citing paper.

  • Universal Embeddings of Tabular Data cs.LG · 2025-07-08 · conditional · none · ref 5 · internal anchor

    Rows of a table are embedded by training a graph auto-encoder on a table-derived weighted graph, giving smaller universal embeddings than EmbDI-style random-walk embeddings on two Kaggle datasets.