arXiv (All)
open access
Towards optimal selection schedules for online active learning
We consider the problem of online linear classification, where a stream of unlabeled samples is available, and annotation is costly. We investigate the optimal query policy, that prescribes whether and when a sample should be labeled and used for a training step, or instead discarded, so as to minim
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Train Smarter, Not Harder: Switching Signal-Guided Training in Active Learning#974893
- Active Learning for Decision Making#486183
- An Analysis of Active Learning Algorithms using Real-World Crowd-sourced Text Annotations#138885
- Soft Strategy Selection for Batch-Mode Active Learning#1201557
- Active learning#1302058
Record · ID 1387750
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive