[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"branding":3,"analytics":7,"article-a-simple-math-check-that-kills-bad-ai-experiments-early":10,"sections":35},{"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":30,"feedback":34,"feedback_at":22,"cost_usd":34,"total_tokens":34},2658,"a-simple-math-check-that-kills-bad-ai-experiments-early","A Simple Math Check That Kills Bad AI Experiments Early","Researchers propose a pre-screening rule that can tell you before you build whether an evolutionary training loop will actually beat a much cheaper alternative.","A new screening rule claims to predict, before a single line of code is written, whether a costly evolutionary training loop is worth building at all.\n\nThe paper introduces a metric called recovery R, computed as the best single-shot gradient statistic divided by the best gain from any cheap baseline method. If R hits 90% or above, the rule says skip the outer loop entirely. The authors validated it on a series of pre-registered internal experiments: in both analyzed cases, R came in near 1.0, the gate fired, and the evolutionary loop was abandoned. One project saved an estimated 400 or more GPU-hours in compute plus weeks of implementation work, at a screening cost of just 50-70 GPU-hours — a 6-8x efficiency gain.\n\nEvolutionary and population-based training loops — where you run many generations of models to optimize architecture or weights — can cost 100 to 1,000 times more than a straightforward gradient-based training run. The dirty secret of ML research is that this cost is usually discovered only after the experiment is done and the loop underperforms. A cheap pre-flight check that catches dead ends early has real value, especially as compute costs dominate research budgets.\n\nThe rule is explicitly falsifiable: any task where R falls below 90% but the outer loop still fails would break it. That intellectual honesty is notable — most ML papers do not ship with a built-in refutation condition.","[\"machine learning\",\"ai research\",\"neural networks\",\"compute efficiency\"]","2026-06-30T04:00:00.000Z","2026-06-30T10:24:11.869Z","2026-06-30T10:24:14.709Z","published",null,[],"ai",[26,27,28,29],"machine learning","ai research","neural networks","compute efficiency",[31],{"name":32,"url":33},"arXiv cs.AI","https:\u002F\u002Farxiv.org\u002Fabs\u002F2606.29119",0,{"sections":36},[37,41,46,51,56,61,66,71,76,81,86,90,95,100],{"name":38,"slug":24,"count":39,"latest_published_at":40},"AI",2590,"2026-07-16T04:00:00.000Z",{"name":42,"slug":43,"count":44,"latest_published_at":45},"Security","security",294,"2026-07-15T19:59:48.000Z",{"name":47,"slug":48,"count":49,"latest_published_at":50},"Deals","deals",179,"2026-06-29T20:02:07.000Z",{"name":52,"slug":53,"count":54,"latest_published_at":55},"Policy","policy",158,"2026-07-16T00:02:48.000Z",{"name":57,"slug":58,"count":59,"latest_published_at":60},"Hardware","hardware",122,"2026-07-14T19:46:26.000Z",{"name":62,"slug":63,"count":64,"latest_published_at":65},"Consumer Tech","consumer-tech",93,"2026-07-13T13:20:48.000Z",{"name":67,"slug":68,"count":69,"latest_published_at":70},"Software","software",70,"2026-07-13T19:52:25.000Z",{"name":72,"slug":73,"count":74,"latest_published_at":75},"Science","science",66,"2026-07-10T10:29:37.000Z",{"name":77,"slug":78,"count":79,"latest_published_at":80},"Dev Tools","dev-tools",59,"2026-07-07T04:00:00.000Z",{"name":82,"slug":83,"count":84,"latest_published_at":85},"Gaming","gaming",41,"2026-07-09T04:00:00.000Z",{"name":87,"slug":88,"count":84,"latest_published_at":89},"Startups","startups","2026-06-29T20:55:50.000Z",{"name":91,"slug":92,"count":93,"latest_published_at":94},"General","general",29,"2026-07-10T22:28:58.000Z",{"name":96,"slug":97,"count":98,"latest_published_at":99},"Reviews","reviews",20,"2026-06-24T12:00:01.000Z",{"name":101,"slug":102,"count":103,"latest_published_at":104},"How-To","how-to",6,"2026-06-16T09:00:00.000Z"]