Imbalanced Regression Pipeline Recommendation
Not on the map. Why?
Abstract (arXiv)
Imbalanced problems are prevalent in various real-world scenarios and are extensively explored in classification tasks. However, they also present challenges for regression tasks due to the rarity of certain target values. A common alternative is to employ balancing algorithms in preprocessing to address dataset imbalance. However, due to the variety of resampling methods and learning models, determining the optimal solution requires testing many combinations. Furthermore, the learning model, dataset, and evaluation metric affect the best strategies. This work proposes the Meta-learning for Imbalanced Regression (Meta-IR) framework, which diverges from existing literature by training meta-classifiers to recommend the best pipeline composed of the resampling strategy and learning model per task in a zero-shot fashion. The meta-classifiers are trained using a set of meta-features to learn how to map the meta-features to the classes indicating the best pipeline. We propose two formulations: Independent and Chained. Independent trains the meta-classifiers to separately indicate the best learning algorithm and resampling strategy. Chained involves a sequential procedure where the output of one meta-classifier is used as input for another to model intrinsic relationship factors. The Chained scenario showed superior performance, suggesting a relationship between the learning algorithm and the resampling strategy per task. Compared with AutoML frameworks, Meta-IR obtained better results. Moreover, compared with baselines of six learning algorithms and six resampling algorithms plus no resampling, totaling 42 (6 X 7) configurations, Meta-IR outperformed all of them. The code, data, and further information of the experiments can be found on GitHub: https://github.com/JusciAvelino/Meta-IR.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 10 of its 87 references that are in the map. First posted on arXiv 16 Jul 2025.
Builds on
10 of 87 references.
References · 10
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
- 2014OpenML: networked science in machine learningcited by 526
- 2019AutoML: A Survey of the State-of-the-Artcited by 390
- 2019FLAML: A Fast and Lightweight AutoML Librarycited by 106
- 2016Evaluation of a Tree-based Pipeline Optimization Tool for Automating Data Sciencecited by 75
- 2018How Complex is your classification problem? A survey on measuring classification complexitycited by 66
- 2021LightAutoML: AutoML Solution for a Large Financial Services Ecosystemcited by 32
- 2022The choice of scaling technique matters for classification performancecited by 25
- 2016UBL: an R package for Utility-based Learningcited by 12
- 2021Naive Automated Machine Learningcited by 8
Built on by
Citing papers per year: 2026: 1.
1 paper.