Customer Churn Prediction on Structured Data Using FT-Transformer and Stacking Ensembles
Not on the map. Why?
Abstract (arXiv)
Customer churn prediction is essential across data-driven industries such as insurance, digital banking, eCommerce, and subscription platforms, where retaining existing customers is typically more cost-effective than acquiring new ones. Predicting churn on structured datasets remains challenging due to class imbalance, nonlinear feature interactions, and heterogeneous feature types. Tree-based ensemble methods consistently demonstrate strong performance in these contexts, often outperforming conventional neural networks. This study introduces a validated hybrid architecture that integrates feature-tokenized transformers (FT-Transformer) with gradient-boosted trees through calibration-aware stacking. The proposed framework addresses persistent gaps in statistical validation, probability calibration, and reproducibility found in prior research. The FT-Transformer captures higher-order feature interactions using self-attention, while XGBoost captures gradient-boosted decision boundaries with complementary inductive biases. Class imbalance is handled using class-weighted loss functions, thereby avoiding synthetic oversampling and preserving minority-class distributions. The models are ensembled using out-of-fold (OOF) stacking with a logistic regression meta-learner, which recalibrates overconfident base model outputs and learns optimal combination weights. On a public bank churn dataset, the hybrid model achieves 62.10% F1, 0.861 AUC-ROC, and 0.647 PR-AUC, outperforming the Multi-Layer Perceptron (MLP) baseline by 3.37 F1 points and 0.027 AUC under 5x5 cross-validation with 95% confidence intervals reported. Ablation studies demonstrate that both the transformer component and stacking strategy contribute materially to performance. The proposed methodology offers a reproducible and extensible reference architecture for contemporary churn prediction on structured tabular data.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 16 of its 53 references that are in the map. First posted on arXiv 26 May 2026.
Builds on
16 of 53 references.
References · 16
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
- 2016Layer Normalizationcited by 5,579
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
- 2017On Calibration of Modern Neural Networkscited by 4,860
- 2016Gaussian Error Linear Units (GELUs)cited by 3,431
- 2021Revisiting Deep Learning Models for Tabular Datacited by 725
- 2022TabPFN: A Transformer That Solves Small Tabular Classification Problems in a Secondcited by 643
- 2019TabNet: Attentive Interpretable Tabular Learningcited by 640
- 2021Tabular Data: Deep Learning is Not All You Needcited by 530
- 2020TabTransformer: Tabular Data Modeling Using Contextual Embeddingscited by 398
- 2020AutoGluon-Tabular: Robust and Accurate AutoML for Structured Datacited by 368
4 more
- 2021SAINT: Improved Neural Networks for Tabular Data via Row Attention and Contrastive Pre-Trainingcited by 310
- 2022Why do tree-based models still outperform deep learning on tabular data?cited by 198
- 2023ExcelFormer: A neural network surpassing GBDTs on tabular datacited by 33
- 2025Improving Deep Tabular Learningcited by 1
Built on by
Not cited yet.