mlsanityData to 13 Oct 2026

Active Learning for Regression based on Wasserstein distance and GroupSort Neural Networks

arXiv 2403.15108 ↗First posted 22 Mar 2024cs.LG math.ST stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

This paper addresses a new active learning strategy for regression problems. The presented Wasserstein active regression model is based on the principles of distribution-matching to measure the representativeness of the labeled dataset. The Wasserstein distance is computed using GroupSort Neural Networks. The use of such networks provides theoretical foundations giving a way to quantify errors with explicit bounds for their size and depth. This solution is combined with another uncertainty-based approach that is more outlier-tolerant to complete the query strategy. Finally, this method is compared with other classical and recent solutions. The study empirically shows the pertinence of such a representativity-uncertainty approach, which provides good estimation all along the query procedure. Moreover, the Wasserstein active regression often achieves more precise estimations and tends to improve accuracy faster than other models.

Key facts. No citing papers in the map yet (data through 13 Oct 2026). Builds on 14 of its 34 references that are in the map. First posted on arXiv 22 Mar 2024.

Builds on

14 of 34 references.

References · 14

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,093
  2. 2017Improved Training of Wasserstein GANscited by 2,226
  3. 2020A Survey of Deep Active Learningcited by 550
  4. 2018Regularisation of Neural Networks by Enforcing Lipschitz Continuitycited by 311
  5. 2023Effective Data Augmentation With Diffusion Modelscited by 282
  6. 2021Curriculum Learning: A Surveycited by 257
  7. 2018Sorting out Lipschitz function approximationcited by 212
  8. 2019Deep Active Learning: Unified and Principled Method for Query and Trainingcited by 93
  9. 2018Some Theoretical Properties of GANscited by 27
  10. 2020Approximating Lipschitz continuous functions with GroupSort neural networkscited by 27
  11. 2018Active Learning for Regression Using Greedy Samplingcited by 26
  12. 2022Active Learning for Regression by Inverse Distance Weightingcited by 9
2 more
  1. 2020Pool-Based Unsupervised Active Learning for Regression Using Iterative Representativeness-Diversity Maximization (iRDM)cited by 7
  2. 2022Optimal 1-Wasserstein Distance for WGANscited by 3

Built on by

Not cited yet.