The paper introduces a low-budget active learning approach that selects a small coreset of data points for training high-accuracy models, particularly useful when labeling is expensive, such as in medical contexts. It uses features from a pretrained self-supervised model and applies entropic optimal transport—specifically the Sinkhorn divergence—as the selection criterion, enabling dimension-free sample complexity and efficient gradient-based optimization. The method combines gradient-based candidate generation with a swap-based local search, achieving superior performance over existing heuristics on image and medical datasets.
By Rim Hajal, Mathieu Besan\c{c}on, J\'er\^ome Malick
arXiv:2609.10311v1 Announce Type: cross
Abstract: The lottery ticket hypothesis posits the existence of winning tickets: sparse subnetworks that, when trained in isolation from their original initial...
By Benedikt Tscheschner, Eduardo Veas, Marc Masana
arXiv:2606. 01666v1 Announce Type: cross Abstract: The scaling of Large Language Models (LLMs) has driven significant performance gains but created substantial challenges in inference efficiency.
By Udbhav Bamba, Arnav Chavan, Aryamaan Thakur, Steve Teig, Deepak Gupta
arXiv:2501. 17377v4 Announce Type: replace-cross Abstract: Deep Reinforcement Learning (DRL) has emerged as a promising approach for solving Combinatorial Optimization (CO) problems, such as the 3D Bin Packing Problem (3D-BPP), Traveling Salesman Problem (TSP), or Vehicle Routing Problem (VRP), but these neural solvers often exhibit brittleness when facing distribution shifts.
By Han Fang, Paul Weng, Yutong Ban
arXiv:2609.15883v1 Announce Type: cross
Abstract: Offline reinforcement learning aims to learn a policy solely from fixed datasets, which often contain multimodal action distributions. Flow policies...
By Jaehun Shon, Jinha Choi, Jongwook Jeon, Jongmin Lee
arXiv:2602. 01179v2 Announce Type: replace Abstract: Gradual domain adaptation (GDA) aims to mitigate domain shift by progressively adapting models from the source domain to the target domain via intermediate domains.
By Zhichao Chen, Zhan Zhuang, Yunfei Teng, Hao Wang, Fangyikang Wang, Zhengnan Li, Tianqiao Liu, Haoxuan Li, Zhouchen Lin
arXiv:2506. 20573v4 Announce Type: replace-cross Abstract: Public datasets, crucial for modern machine learning and statistical inference, often contain low-quality or contaminated samples that can harm model performance.
By Kristian Minchev, Dimitar I. Dimitrov, Nikola Konstantinov
arXiv:2608.30699v1 Announce Type: cross
Abstract: Long-tailed distributions are prevalent in real-world semi-supervised learning (SSL), where pseudo-labels tend to favor majority classes, leading to...
By Yue Cheng, Jiajun Zhang, Xiaohui Gao, Weiwei Xing, Zhanxing Zhu
arXiv:2607. 07083v1 Announce Type: cross Abstract: Subsampling significantly reduces the number of measurements, thereby streamlining data processing and transfer overhead, and shortening acquisition time across diverse real-world applications.
By Beomgu Kang, Hyunseok Seo
arXiv:2608. 09091v1 Announce Type: cross Abstract: Transfer learning is particularly useful in settings with limited training data, and within image classification it is common to transfer learn upon massive datasets like ImageNet , CIFAR-100, or COCO .
By Jing Ning, James D. Braza
arXiv:2307.12226v3 Announce Type: replace-cross
Abstract: Machine learning models -- including prominent zero-shot models -- are often trained on datasets whose labels are only a small proportion of...
By Nicholas Roberts, Xintong Li, Dyah Adila, Sonia Cromp, Tzu-Heng Huang, Jitian Zhao, Frederic Sala
arXiv:2609.01493v1 Announce Type: cross
Abstract: Black-Box Optimization (BBO) has found broad applications, but evolutionary algorithms and Bayesian optimization face efficiency challenges as real-w...
By Chao Qian, Chen-Guang Wang, Rong-Xi Tan, Ke Xue