arXiv Machine Learning
Towards optimal selection schedules for online active learning
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Statistics ML
Oct 7
Multi-Task Active Learning with Efficient Resource Allocation
arXiv:2610.07045v1 Announce Type: cross Abstract: Many scientific studies allow costly auxiliary information to be collected during data labeling but not at deployment. Examples include diagnostic te...
arXiv Machine Learning
Sep 10
Understanding Uncertainty Sampling via Equivalent Loss
arXiv:2307.02719v5 Announce Type: replace Abstract: Uncertainty sampling is a classical active-learning strategy, yet the statistical objective induced by its query rule is often implicit. We introdu...
arXiv AI
Aug 5
One Knob to Rule Them All: A Unified Optimal Transport View of Cold-Start Active Learning
arXiv:2608. 03249v1 Announce Type: new Abstract: Cold-Start Active Learning (CSAL) aims to select a valuable subset from an unlabeled pool without any prior knowledge or human assistance.
arXiv AI
Aug 5
How Many Labels Are Enough? ALDA: Active Learning Deployment Advisor for Medical Image Classification
arXiv:2608. 03511v1 Announce Type: cross Abstract: Active learning (AL) promises to reduce the cost of medical imaging projects by lowering the number of clinical labels required.
arXiv Machine Learning
Oct 8
Oracle-Efficient and Parameter-Free Agnostic Smoothed Online Learning
arXiv:2610. 10499v1 Announce Type: new Abstract: Online learning is an attractive framework in many domains because it permits well-defined learning even when data are dependent or chosen adversarially.
arXiv AI
Jul 14
Learning to Fine-tune Foundation Models under Resource Limitations
arXiv:2607. 10694v1 Announce Type: cross Abstract: We study the problem of optimal continual fine-tuning for a pre-trained Foundation Model deployed at a resource-limited device.