Scalable, Transferable Meta-network for Data Selection Requires a Different Loss (and Why the Obvious Choice is Problematic)
Paper recorded by Signals 4 on 2026-10-01 in cs.CL. Abstract reproduced from arXiv; link to the original below.
Published 2026-10-01 on arXiv · recorded by Signals 4 on 2026-10-02
Category: cs.CL · 自然语言处理 · first seen 2026-10-02
Abstract
Data selection is critical for training large language models on massive and heterogeneous corpora. Meta-learning for Training-data Selection offers a principled alternative to heuristic scoring by learning data weights from a target validation objective, but existing methods face a trade-off between fine-grained valuation and transferability to unseen data. A natural solution is to replace per-sa
Read on arXiv →
Cite this page: Scalable, Transferable Meta-network for Data Selection Requires a Different Loss (and Why the Obvious Choice is Problematic): the #4 most recent of 311 cs.CL papers we have recorded (as of 2026-10-01). Source: Signals 4 (Signals API) — https://data.jiangzhang.ca/signals4/t/papers/scalable-transferable-meta-network-for-data-selection-requires-a-different-loss-.html
Free to quote with attribution to “Signals 4 (Signals API)”. Machine-readable:
papers.json
Get 4 AI signals a day by email — free.
Get 4 AI signals a day by email — free