arXiv (All)
open access
HARP: Efficient Data Selection for Finetuning Large Language Models
Finetuning data selection requires balancing two competing goals: selecting examples that improve the downstream objective, and doing so without repeatedly finetuning models. Train-free selectors are scalable but rely on proxies such as embedding similarity or clustering, which may not match the tar
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
- When Audit Quality Fails to Predict Downstream Utility: A Counterfactual Study of Synthetic-Data Selectors for Low-Resource African NLP#1013116
- Prof-K: Probabilistic One-Pass Filtering for Efficient Top-k Selection#1155288
- VocabTailor: Dynamic Vocabulary Selection for Downstream Tasks in Small Language Models#153119
- Sequential Sampling for Binary Classification: Two LLMs are (Almost) All You Need#1117357
- CODEBLOCK: Learning to Supervise Code at the Right Granularity#1118609
Record · ID 1344612
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