Skip to content
Open access

Ensemble–based instance selection for multi–target regression using kernel sparse modeling

Aug 2026 · Journal of King Saud University: Computer and Information Sciences · Vol 38 · 0 citations · 58 references
Computer Science

TL;DR

The proposed method introduces Sparse Modeling Representative Selection (SMRS) to characterize the self-representativeness of instances, where a block-sparse coefficient matrix is learned to identify representative training samples.

Abstract

This paper proposes a novel instance selection (IS) method for multi-target regression (MTR). The proposed method introduces Sparse Modeling Representative Selection (SMRS) to characterize the self-representativeness of instances, where a block-sparse coefficient matrix is learned to identify representative training samples. Considering that MTR data contain both input-space structures and multi-target output-space dependencies, we assume that the self-representative relationships in the input and output spaces should be consistent. Based on this assumption, a Frobenius-norm-based discrepancy minimization term and a Hilbert-Schmidt Independence Criterion (HSIC)-based relevance maximization term are incorporated to encourage the model to learn consistent and statistically dependent self-representation structures across the two spaces. To capture nonlinear instance relationships, the proposed model is further extended to a kernelized formulation. In addition, an ensemble framework is developed to exploit target correlations from multiple target-aware subspaces, thereby improving the robustness of instance selection. A parameter-free adaptive thresholding strategy is also designed to automatically determine the selected subset from the learned instance-score distribution. Extensive experiments on multiple benchmark MTR datasets demonstrate that the proposed methods can effectively reduce the training data size while preserving or improving downstream predictive performance compared with representative instance selection and data reduction baselines.

Read PDF

Similar papers

Conference Open access Sep 2026

EMMS: Evidential Multi-Label Multi-Dimensional Selection

Multi-label data often contain high-dimensional features, outlier instances, and noisy labels, all of which can lead to the curse of dimensionality and decreased performance in downstream tasks. Although numerous data reduction methods have been developed, existing approaches face two major limitations: 1) existing met...

Li Yang, Yan-Yong Huang, Jin-Yuan Chang et al. · 0 citations
Book Open access Aug 2026

Sparse Additive Models for Domain Generalization

This work incorporates an additive structure into the DG framework and employs ℓq,1 -norm regularization to induce sparsity, thereby enabling structured feature selection and enhancing interpretability and presents two distinct realizations: an additive kernel-based formulation and a neural additive model-based approac...

Jia-Yi Wang, Han Li · 0 citations
Preprint Sep 2026

Transfer Learning with Heterogeneous Feature Spaces in Linear Regression

Transfer learning improves target-task performance by leveraging related source data. Most methods assume shared feature spaces, yet in many applications, each source observes only a subset of target covariates. Classical imputation fails here due to block missingness, and standard imputation matrices are not optimized...

Ze-Jing Zheng, Rui Huang, Jun-Long Zhao · 0 citations
Preprint Sep 2026

Joint-Sparse Transfer Learning for High-Dimensional Multi-Output Regression

Multitask linear models can improve estimation and prediction by exploiting structure shared across responses, bridging taskwise fitting and complete pooling. In many applications, however, the objective is estimation in a data-limited target domain, while data-rich but heterogeneous source domains are available. Borro...

Sun-Woong Lim, Mladen Kolar · 0 citations
Aug 2026

Inverse-based Lasso Regression: Novel Algorithms for Feature Selection and Multicollinearity Mitigation

Novel algorithms for estimating Lasso regression parameters by reformulating the problem as an inverse single-point optimization task are introduced, eliminating the need for explicit regularization parameter specification while maintaining robust feature selection capabilities and effective multicollinearity mitigatio...

Gribanova Ekaterina, Gerasimov Roman · 0 citations
#machine learning Preprint Sep 2026

A Kernel-Based Modular Discriminant Analysis Framework for Small-Sample Learning

A systematic cross-domain study of KLPCDA reveals consistent patterns in the interaction of the three core objectives variance, between-class, and within-class terms, providing a unified and interpretable understanding of their roles in stabilizing representations and enhancing discrimination in SSS settings.

Ling-Xiao Qu, Yan Pei · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.