Density-Aware Farthest Point Sampling
Not on the map. Why?
Abstract (arXiv)
We focus on training machine learning regression models in scenarios where the availability of labeled training data is limited due to computational constraints or high labeling costs. Thus, selecting suitable training sets from unlabeled data is essential for balancing performance and efficiency. For the selection of the training data, we focus on passive and model-agnostic sampling methods that only consider the data feature representations. We derive an upper bound for the expected prediction error of Lipschitz continuous regression models that linearly depends on the weighted fill distance of the training set: a quantity we can estimate simply by considering the data features. We introduce ''Density-Aware Farthest Point Sampling'' (DA-FPS), a novel sampling method. We prove that DA-FPS provides approximate minimizers for a data-driven estimation of the weighted fill distance, thereby aiming at minimizing our derived bound. We conduct experiments using two regression models across three datasets. The results demonstrate that DA-FPS significantly reduces the mean absolute prediction error compared to other sampling strategies.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 13 of its 50 references that are in the map. First posted on arXiv 16 Sep 2025.
Builds on
13 of 50 references.
References · 13
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2016Automatic chemical design using a data-driven continuous representation of moleculescited by 765
- 2020Benchmarking Graph Neural Networkscited by 680
- 2019Data Shapley: Equitable Valuation of Data for Machine Learningcited by 629
- 2020A Survey of Deep Active Learningcited by 554
- 2023Data Selection for Language Models via Importance Resamplingcited by 329
- 2020GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learningcited by 226
- 2023LAVA: Data Valuation without Pre-Specified Learning Algorithmscited by 69
- 2020Fast and Eager k-Medoids Clustering: O(k) Runtime Improvement of the PAM, CLARA, and CLARANS Algorithmscited by 36
- 2020Coresets for Robust Training of Neural Networks against Noisy Labelscited by 24
- 2024An Experimental Design Framework for Label-Efficient Supervised Finetuning of Large Language Modelscited by 23
- 2021Data Twinningcited by 10
1 more
Built on by
Citing papers per year: 2026: 1.
1 paper.