Pith. sign in

REVIEW 1 cited by

(GG) MoE vs. MLP on Tabular Data

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2502.03608 v1 pith:IOHH3AG3 submitted 2025-02-05 cs.LG cs.AI

classification cs.LGcs.AI
keywords modelsneuralperformancearchitecturescompareddatadeeplearning
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Universal Embeddings of Tabular Data

    cs.LG 2025-07 conditional novelty 5.0 of 10

    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.

Pith tools