CORTEXA
← Browse
arxivcs.LG2026-07-22

Instance Hardness-Based Relevance for Imbalanced Regression

Vitor M. Leitao, Juscimara G. Avelino, George D. C. Cavalcanti, Rafael M. O. Cruz

Imbalanced regression problems arise when the target variable has an asymmetric distribution, resulting in underrepresented value ranges in the dataset. Traditional approaches for identifying rare instances rely on a relevance function that assigns higher importance to specific regions of the target distribution. However, the effectiveness of imbalance-aware learning methods depends strongly on how relevance is defined. In more complex scenarios, such as bimodal distributions, traditional relevance functions struggle to capture rarity, as they assign fixed relevance values based solely on target values, thereby compromising the distinction between truly rare and normal instances. To address these limitations, this study proposes an Instance Hardness-based relevance function (InHaR) for identifying rare instances in regression problems. Unlike traditional relevance functions, the proposed approach incorporates learning difficulty, allowing rarity to be inferred not only from the target distribution but also from the difficulty of instances for the learning algorithm. This property is particularly important in bimodal scenarios, where rarity cannot be accurately inferred from target values alone. Experimental results demonstrate that the InHaR correctly identifies rare regions under bimodal distributions and, when used to guide resampling strategies such as Random Oversampling (RO) and Gaussian Noise (GN), leads to significant improvements in predictive performance compared to traditional relevance-based approaches. The code, dataset, and further details about the proposed method are publicly available at https://github.com/VitorLeitao/instance-hardness-Imbalanced-regression.

View free PDFSource page

Related papers

arxivcs.NEcs.LG2026-06-30

Evaluation of Population Initialization Methods for Genetic Programming-based Symbolic Regression

Lukas Kammerer, Gabriel Kronberger, Deaglan J. Bartlett, Harry Desmond, Pedro G. Ferreira, Stephan Winkler

We analyze the effect of optimizing the initial population of genetic programming (GP) for symbolic regression (SR) on the accuracy and complexity of solutions. We compare three well-established random initialization methods as well as initialization with small optimized solution…

View free PDFSource page
arxivcs.LG2026-07-22

Interpretable Fuzzy Rule-Based Regression Extension for Ex-Fuzzy Library

Cayan Deniz Kucuktopana, Javier Fumanal-Idocin, Richard Pitts, Javier Andreu-Perez

Machine learning models achieve high predictive accuracy in regression tasks, but their deployment in safety-critical and regulated domains requires interpretability. While fuzzy rule-based systems offer transparent, linguistically explicit interpretable models, Mamdani-style fuz…

View free PDFSource page
arxivcs.IRcs.LG2026-07-03

Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls

Kirill Shevkunov, Andrey Ploskonosov, Liudmila Prokhorenkova

In many machine learning applications, the most relevant items for a query should be efficiently retrieved. The relevance function is usually an expensive similarity model, making the exhaustive search infeasible. A typical solution is to train another model that separately embed…

View free PDFSource page
arxivcs.CVcs.AIcs.LGq-bio.TO2026-06-25

Distribution-based deep multiple instance learning for tumor proportion scoring in NSCLC

Krzysztof Pysz, Artur Bartczak, Jarosław Kwiecień, Piotr Krajewski, Witold Dyrka

Accurate assessment of tumor proportion score (TPS) in non-small cell lung cancer (NSCLC) is critical for treatment planning and prognosis. Key challenges include the tedious manual work required to annotate each slide, combined with the limited number of experts certified for th…

View free PDFSource page