Choosing a parallel heterogeneous ensemble method for tabular classification
Not on the map. Why?
Abstract (arXiv)
Parallel ensemble methods were compared on 56 small-to-medium tabular classification tasks drawn from OpenML CC18. A set of ``best practice'' recommendations on the use of ensemble methods was derived from these observations. It was later validated on 28 additional tasks using TabArena's precomputed data, where the recommendation set significantly outperformed Single Best and matched or exceeded individual ensemble methods. Two key observations were made. First, Blending and Stacking are inconsistent, but their inconsistencies are independent and happen on different tasks. Second, while Hard Voting's probabilistic classification is rather weak, a consequence of using vote proportions as posterior estimates, Robust Soft Voting's probabilistic classification is particularly successful, especially in the multiclass case.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 9 of its 18 references that are in the map. First posted on arXiv 6 Jul 2026.
Builds on
9 of 18 references.
References · 9
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2017Counterfactual Fairnesscited by 802
- 2018Path-Specific Counterfactual Fairnesscited by 179
- 2021Towards a Unified Framework for Fair and Stable Graph Representation Learningcited by 128
- 2022Learning Fair Node Representations with Graph Counterfactual Fairnesscited by 58
- 2023Realistic Synthetic Financial Transactions for Anti-Money Laundering Modelscited by 47
- 2023Provably Powerful Graph Neural Networks for Directed Multigraphscited by 24
- 2023Towards Fair Graph Neural Networks via Graph Counterfactualcited by 23
- 2024Fairness-Accuracy Trade-Offs: A Causal Perspectivecited by 10
Built on by
Not cited yet.