arrow
Return

Robust-multi-task gradient boosting

delete2026-01-21
delete0
delete
OA
AI
S
Seyedsaman Emami *
G
Gonzalo Martínez-Mu Noz
D
Daniel Hernández-Lobato
DOI:10.1016/j.eswa.2025.130696delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
The objective of this study is to develop a robust boosting framework capable of handling heterogeneous and outlier tasks in Multi-Task Learning (MTL). Conventional MTL methods assume strong relatedness among tasks, which often fails in real-world scenarios involving adversarial or unaligned tasks that degrade performance. To address this limitation, we propose Robust Multi-Task Gradient Boosting (R-MTGB), a novel ensemble framework that explicitly models task heterogeneity within the gradient boosting paradigm. The methodology structures learning into three sequential stages: (1) shared representation learning to extract common patterns across tasks, (2) outlier-aware partitioning using a learnable task-specific parameter to separate and reweight outlier and non-outlier tasks, and (3) task-specific fine-tuning to refine individual predictors. Extensive experiments on both synthetic and real-world datasets demonstrate that R-MTGB consistently improves predictive accuracy, effectively identifies outlier tasks, and enhances generalization compared to state-of-the-art methods. The achieved results confirm that R-MTGB not only ensures robust performance and interpretability through task-level outlier scores but also provides a scalable and principled framework for reliable multi-task learning in heterogeneous environments.
Keywords:
Robust-multi-task learning
Gradient boosting
Outlier detection
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Expert Systems with Applications cover
Expert Systems with Applications
IF:
7.5
Papers:
2.9W
Citations:
10.2W

Organization

A
autonomous university of madrid
Scholars:
457
Papers: 222
Citations: 0