Robust multi-task boosting using clustering and local ensembling
Not on the map. Why?
Abstract (arXiv)
Multi-Task Learning (MTL) aims to boost predictive performance by sharing information across related tasks, yet conventional methods often suffer from negative transfer when unrelated or noisy tasks are forced to share representations. We propose Robust Multi-Task Boosting using Clustering and Local Ensembling (RMB-CLE), a principled MTL framework that integrates error-based task clustering with local ensembling. Unlike prior work that assumes fixed clusters or hand-crafted similarity metrics, RMB-CLE derives inter-task similarity directly from cross-task errors, which admit a risk decomposition into functional mismatch and irreducible noise, providing a theoretically grounded mechanism to prevent negative transfer. Tasks are grouped adaptively via agglomerative clustering, and within each cluster, a local ensemble enables robust knowledge sharing while preserving task-specific patterns. Experiments show that RMB-CLE recovers ground-truth clusters in synthetic data and consistently outperforms multi-task, single-task, and pooling-based ensemble methods across diverse real-world and synthetic benchmarks. These results demonstrate that RMB-CLE is not merely a combination of clustering and boosting but a general and scalable framework that establishes a new basis for robust multi-task learning.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 16 of its 73 references that are in the map. First posted on arXiv 15 Feb 2026.
Builds on
16 of 73 references.
References · 16
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
- 2020Gradient Surgery for Multi-Task Learningcited by 1,210
- 2017A Survey on Multi-Task Learningcited by 838
- 2018Multi-Task Learning as Multi-Objective Optimizationcited by 809
- 2021Revisiting Deep Learning Models for Tabular Datacited by 725
- 2018Taskonomy: Disentangling Task Transfer Learningcited by 631
- 2021Tabular Data: Deep Learning is Not All You Needcited by 530
- 2019Which Tasks Should Be Learned Together in Multi-task Learning?cited by 367
- 2021Efficiently Identifying Task Groupings for Multi-Task Learningcited by 218
- 2023When Do Neural Nets Outperform Boosted Trees on Tabular Data?cited by 218
- 2019A Comparative Analysis of XGBoostcited by 80
- 2021Understanding and Improving Fairness-Accuracy Trade-offs in Multi-Task Learningcited by 34
4 more
- 2018Taking Advantage of Multitask Learning for Fair Classificationcited by 24
- 2015Efficient Output Kernel Learning for Multiple Taskscited by 9
- 2013Convex Discriminative Multitask Clusteringcited by 5
- 2025Robust-Multi-Task Gradient Boostingcited by 1
Built on by
Not cited yet.