Low-Budget Active Learning through Entropic Optimal Transport
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 19 of its 36 references that are in the map. First posted on arXiv 1 Oct 2026.
Builds on
19 of 36 references.
References · 19
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2025DINOv3cited by 1,297
- 2017Learning Generative Models with Sinkhorn Divergencescited by 310
- 2023A Survey on Self-supervised Learning: Algorithms, Applications, and Future Trendscited by 205
- 2022Active Learning on a Budget: Opposite Strategies Suit High and Low Budgetscited by 131
- 2022Active Learning Through a Covering Lenscited by 62
- 2018Fashionable Modelling with Fluxcited by 53
- 2019Sinkhorn Divergences for Unbalanced Optimal Transportcited by 52
- 2021Low Budget Active Learning via Wasserstein Distance: An Integer Programming Approachcited by 34
- 2023A comprehensive survey on deep active learning in medical image analysiscited by 32
- 2021GasHisSDB: A New Gastric Histopathology Image Dataset for Computer Aided Diagnosis of Gastric Cancercited by 17
7 more
- 2024Generalized Coverage for More Robust Low-Budget Active Learningcited by 15
- 2022Stability of Schr"odinger Potentials and Convergence of Sinkhorn's Algorithmcited by 13
- 2022Displacement smoothness of entropic optimal transportcited by 13
- 2021Quantitative Uniform Stability of the Iterative Proportional Fitting Procedurecited by 11
- 2023SelfEEG: A Python library for Self-Supervised Learning in Electroencephalographycited by 5
- 2024The Riemannian geometry of Sinkhorn divergencescited by 3
- 2025Coreset selection for the Sinkhorn divergence and generic smooth divergencescited by 3
Built on by
Not cited yet.