arXiv · 2610.01199
Low-Budget Active Learning through Entropic Optimal Transport
Abstract
We consider low-budget active learning, which consists of selecting a limited number of points, the coreset, such that a model can be trained to high accuracy on the selection only. This problem is particularly relevant in contexts where labeling requires costly expert intervention, as in medical applications. We leverage features extracted from a pretrained self-supervised model to represent the data, and perform coreset selection directly in this feature space. In this paper, we use entropic optimal transport, specifically the Sinkhorn divergence, as the coreset selection criterion, which first allows us to get dimension-free sample complexity results, and second admits computationally efficient gradient evaluations. This opens the way to using gradient-based algorithms to rapidly compute solution candidates, further improved by a swap-based local search, with guarantees on the solution quality. Experiments on image benchmarks and medical datasets show that our method outperforms state-of-the-art heuristics in low-budget settings.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Rim Hajal, Mathieu Besançon, Jérôme Malick. 2026-10-01. Low-Budget Active Learning through Entropic Optimal Transport. https://arxiv.org/abs/2610.01199
Cite the original work for its findings. Save a collection to share your selection of sources.