Active Learning for Regression by Inverse Distance Weighting
Not on the map. Why?
Abstract (arXiv)
This paper proposes an active learning (AL) algorithm to solve regression problems based on inverse-distance weighting functions for selecting the feature vectors to query. The algorithm has the following features: (i) supports both pool-based and population-based sampling; (ii) is not tailored to a particular class of predictors; (iii) can handle known and unknown constraints on the queryable feature vectors; and (iv) can run either sequentially, or in batch mode, depending on how often the predictor is retrained. The potentials of the method are shown in numerical tests on illustrative synthetic problems and real-world datasets. An implementation of the algorithm, which we call IDEAL (Inverse-Distance based Exploration for Active Learning), is available at http://cse.lab.imtlucca.it/~bemporad/ideal.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 6 of its 44 references that are in the map. First posted on arXiv 14 Apr 2022.
Builds on
6 of 44 references.
References · 6
- 2018Efficient representation and approximation of model predictive control laws via deep learningcited by 55
- 2018Pool-Based Sequential Active Learning for Regressioncited by 33
- 2018Active Learning for Regression Using Greedy Samplingcited by 26
- 2019Global optimization via inverse distance weighting and radial basis functionscited by 16
- 2020Pool-Based Unsupervised Active Learning for Regression Using Iterative Representativeness-Diversity Maximization (iRDM)cited by 7
- 2019Active preference learning based on radial basis functionscited by 3
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 2; 2025: 2; 2026: 3.
9 papers.
- 2023Streaming Active Learning for Regression Problems Using Regression via Classificationcited by 2
- 2025Distributionally robust minimization in meta-learning for system identificationcited by 2
- 2022An active learning method for solving competitive multi-agent decision-making and control problemscited by 0
- 2024Active Learning for Regression based on Wasserstein distance and GroupSort Neural Networkscited by 0
- 2024Nonmyopic Global Optimisation via Approximate Dynamic Programmingcited by 0
- 2025Budget-constrained Active Learning to Effectively De-censor Survival Datacited by 0
- 2026Adaptive Active Learning for Regression via Reinforcement Learningcited by 0
- 2026TCL: Enabling Fast and Efficient Cross-Hardware Tensor Program Optimization via Continual Learningcited by 0
- 2026Harnessing Source Heterogeneity for Cluster-Structured Transfer Learningcited by 0
- 2026Harnessing Source Heterogeneity for Cluster-Structured Transfer Learning3 Jun 2026
- 2026TCL: Enabling Fast and Efficient Cross-Hardware Tensor Program Optimization via Continual Learning14 Apr 2026
- 2026Adaptive Active Learning for Regression via Reinforcement Learning11 Mar 2026
- 2025Budget-constrained Active Learning to Effectively De-censor Survival Data14 Oct 2025
- 2025Distributionally robust minimization in meta-learning for system identification22 Jun 2025
- 2024Nonmyopic Global Optimisation via Approximate Dynamic Programming6 Dec 2024
- 2024Active Learning for Regression based on Wasserstein distance and GroupSort Neural Networks22 Mar 2024
- 2023Streaming Active Learning for Regression Problems Using Regression via Classification2 Sep 2023
- 2022An active learning method for solving competitive multi-agent decision-making and control problems23 Dec 2022