[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"branding":3,"analytics":7,"article-a-better-way-to-pick-training-data-for-language-models":10,"sections":34},{"siteName":4,"siteTagline":5,"publisherName":4,"contactEmail":6},"The Revision","Tech news, decoded.","editor@therevision.news",{"gaMeasurementId":8,"adsenseClientId":9},"G-ZW2MV82GYR","ca-pub-8533917693782264",{"article":11},{"id":12,"slug":13,"title":14,"dek":15,"body_md":16,"tags_json":17,"published_at":18,"created_at":19,"updated_at":20,"status":21,"review_note":22,"review_notes":23,"image_url":22,"persona_id":22,"persona_name":22,"section":24,"tags":25,"sources":29,"feedback":33,"feedback_at":22,"cost_usd":33,"total_tokens":33},9782,"a-better-way-to-pick-training-data-for-language-models","A Better Way to Pick Training Data for Language Models","A new framework called TESS fixes instability in neural networks that decide which training examples matter for large language models.","Picking which data trains a language model is itself becoming an AI problem.\n\nResearchers are tackling a method called meta-learning for training-data selection, which trains a system to weigh examples by how well they serve a validation goal, instead of relying on hand-built heuristics. The obvious way to scale this up is to swap per-example weights for a full selection network. The authors found that doing so breaks down in practice: training grows unstable, and the network falls back on easy-to-learn shortcuts rather than genuinely useful examples. Their proposed fix, TESS, replaces the usual objective with something they call Pointwise Value Matching. In tests on safety-focused training and targeted instruction tuning, TESS carried its data judgments from small samples to full corpora, and from smaller models to larger ones.\n\nData selection is the unglamorous bottleneck behind every claim about bigger training runs: which examples you keep matters as much as how many you have. A selection method that fails to transfer means redoing expensive validation work every time the dataset or model size changes. That reusability, not raw data quality, is the specific problem TESS says it solves.\n\nThis is one arXiv paper, not a shipped tool. The real test is whether a lab outside the authors' group can reproduce the transfer claims on data TESS has never seen.","[\"ai\",\"llm-training\",\"machine-learning\",\"data-selection\"]","2026-10-02T04:00:00.000Z","2026-10-03T10:16:00.309Z","2026-10-03T10:16:05.098Z","published",null,[],"ai",[24,26,27,28],"llm-training","machine-learning","data-selection",[30],{"name":31,"url":32},"arXiv cs.AI","https:\u002F\u002Farxiv.org\u002Fabs\u002F2610.02092",0,{"sections":35},[36,39,43,47,52,56,60,65,70,75,80,85,90,95],{"name":37,"slug":24,"count":38,"latest_published_at":18},"AI",6041,{"name":40,"slug":41,"count":42,"latest_published_at":18},"Security","security",848,{"name":44,"slug":45,"count":46,"latest_published_at":18},"Policy","policy",439,{"name":48,"slug":49,"count":50,"latest_published_at":51},"Deals","deals",317,"2026-10-01T22:00:00.000Z",{"name":53,"slug":54,"count":55,"latest_published_at":18},"Hardware","hardware",199,{"name":57,"slug":58,"count":59,"latest_published_at":18},"Science","science",176,{"name":61,"slug":62,"count":63,"latest_published_at":64},"Consumer Tech","consumer-tech",155,"2026-10-01T19:54:10.000Z",{"name":66,"slug":67,"count":68,"latest_published_at":69},"Dev Tools","dev-tools",96,"2026-10-01T16:57:03.000Z",{"name":71,"slug":72,"count":73,"latest_published_at":74},"Software","software",93,"2026-09-30T21:41:11.000Z",{"name":76,"slug":77,"count":78,"latest_published_at":79},"Startups","startups",90,"2026-10-01T21:55:22.000Z",{"name":81,"slug":82,"count":83,"latest_published_at":84},"Gaming","gaming",53,"2026-10-02T02:50:39.000Z",{"name":86,"slug":87,"count":88,"latest_published_at":89},"General","general",50,"2026-09-30T21:37:54.000Z",{"name":91,"slug":92,"count":93,"latest_published_at":94},"Reviews","reviews",31,"2026-09-28T14:31:34.000Z",{"name":96,"slug":97,"count":98,"latest_published_at":99},"How-To","how-to",7,"2026-10-01T09:00:00.000Z"]