Benchmarking Optimizers for MLPs in Tabular Deep Learning
Yury Gorishniy, Ivan Rubachev, Dmitrii Feoktistov, Artem Babenko

TL;DR
This paper systematically benchmarks 15 optimizers for MLPs in tabular deep learning, finding Muon outperforms AdamW and that exponential moving averages can enhance optimizer performance.
Contribution
It provides the first comprehensive comparison of optimizers for tabular MLPs, highlighting Muon as a superior choice and evaluating simple enhancement techniques.
Findings
Muon optimizer consistently outperforms AdamW.
Exponential moving averages improve AdamW performance.
Benchmark results across 17 datasets support these conclusions.
Abstract
MLP is a heavily used backbone in modern deep learning (DL) architectures for supervised learning on tabular data, and AdamW is the go-to optimizer used to train tabular DL models. Unlike architecture design, however, the choice of optimizer for tabular DL has not been examined systematically, despite new optimizers showing promise in other domains. To fill this gap, we benchmark 15 optimizers on 17 tabular datasets for training MLP-based models in the standard supervised learning setting under a shared experiment protocol. Our main finding is that the Muon optimizer consistently outperforms AdamW, and thus should be considered a strong and practical choice for practitioners and researchers, if the associated training efficiency overhead is affordable. Additionally, we find exponential moving average of model weights to be a simple yet effective technique that improves AdamW on vanilla…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
