arXiv (All)
open access
Adaptive Data Selection for Text Classification: Hierarchical Value with a Local Utility Budget
Selecting compact training sets from heterogeneous text sources requires balancing target relevance, label reliability, and coverage. For small classifiers, discarding unfamiliar but useful texts can be as harmful as retaining annotation errors. Gradient-based selection estimates immediate target ut
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
- HARP: Efficient Data Selection for Finetuning Large Language Models#1344612
- Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection#1155288
- DPC: Training-Free Text-to-SQL Candidate Selection via Dual-Paradigm Consistency#31353
- DPC: Training-Free Text-to-SQL Candidate Selection via Dual-Paradigm Consistency#19088
- MERGE: Multi-LLM Ensemble for Retrieval via Generative Enrichment#1144875
Record · ID 1400799
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