arXiv (All)
open access
Understanding Uncertainty Sampling via Equivalent Loss
Uncertainty sampling is a classical active-learning strategy, yet the statistical objective induced by its query rule is often implicit. We introduce the equivalent loss, whose gradient is the original loss gradient multiplied by the query probability. This construction places probabilistic, margin-
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
- AdaProb: Efficient Machine Unlearning via Adaptive Probability#128319
- Active Learning with Imperfect Labels: Optimal Labeler Assignment and Sample Selection#1142594
- Noisy fitness evaluation in genetic algorithms and the dynamics of learning#245191
- The strong converse exponent of composable randomness extraction against quantum side information#1116194
- Online combinatorial optimization with stochastic decision sets and adversarial losses#141510
Record · ID 972846
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