[2603.01013] Feature-Weighted Maximum Representative Subsampling

Computer Science > Machine Learning arXiv:2603.01013 (cs) [Submitted on 1 Mar 2026] Title:Feature-Weighted Maximum Representative Subsampling Authors:Tony Hauptmann, Stefan Kramer View a PDF of the paper titled Feature-Weighted Maximum Representative Subsampling, by Tony Hauptmann and Stefan Kramer View PDF HTML (experimental) Abstract:In the social sciences, it is often necessary to debias studies and surveys before valid conclusions can be drawn. Debiasing algorithms enable the computational removal of bias using sample weights. However, an issue arises when only a subset of features is highly biased, while the rest is already representative. Algorithms need to strongly alter the sample distribution to manage a few highly biased features, which can in turn introduce bias into already representative variables. To address this issue, we developed a method that uses feature weights to minimize the impact of highly biased features on the computation of sample weights. Our algorithm is based on Maximum Representative Subsampling (MRS), which debiases datasets by aligning a non-representative sample with a representative one through iterative removal of elements to create a representative subsample. The new algorithm, named feature-weighted MRS (FW-MRS), decreases the emphasis on highly biased features, allowing it to retain more instances for downstream tasks. The feature weights are derived from the feature importance of a domain classifier trained to differentiate between t...