[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"branding":3,"analytics":7,"article-coding-agents-get-a-cheaper-way-to-improve-themselves":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},6765,"coding-agents-get-a-cheaper-way-to-improve-themselves","Coding Agents Get a Cheaper Way to Improve Themselves","SIFT uses an AI judge to rank code patches before costly benchmark tests, cutting the compute needed for self-improving coding agents.","A new framework lets coding agents rewrite their own code and pick the best version without burning through a testing budget to find it.\n\nResearchers describe SIFT (Self Improvement via Fast Tree-search), a system for agents that recursively modify their own implementations. Earlier self-improvement setups judged each candidate patch by rerunning it against a slice of benchmark tasks - accurate, but slow enough to become the whole bottleneck. SIFT adds a cheaper filtering step first: an LLM acts as judge, comparing patches head-to-head, and those pairwise results feed a regularized Bradley-Terry model, the same style of math used to rank players from win-loss records. Only the patches that come out on top get the expensive full evaluation, run on the Polyglot coding benchmark inside a disaggregated tree search.\n\nThe real constraint on self-improving code agents has never been whether the idea works - it has been paying for enough evaluation runs to tell good patches from bad ones. Reserving the costly benchmark runs for a small shortlist, instead of every candidate, is what lets SIFT reportedly beat prior tree-search self-evolution approaches on the full Polyglot benchmark while using less CPU time, less wall-clock time, and less API spend.\n\nWorth remembering: the judge here is still a model guessing which patch is better, not a ground-truth signal. If it misjudges early, the search can prune away the strongest candidates before they ever reach a real test.","[\"self-improving-ai\",\"coding-agents\",\"tree-search\",\"llm-as-judge\"]","2026-09-18T04:00:00.000Z","2026-09-18T15:40:43.878Z","2026-09-18T15:40:55.824Z","published",null,[],"ai",[26,27,28,29],"self-improving-ai","coding-agents","tree-search","llm-as-judge",[31],{"name":32,"url":33},"arXiv cs.AI","https:\u002F\u002Farxiv.org\u002Fabs\u002F2609.19526",0,{"sections":36},[37,40,44,49,54,58,62,67,72,77,82,87,92,97],{"name":38,"slug":24,"count":39,"latest_published_at":18},"AI",3958,{"name":41,"slug":42,"count":43,"latest_published_at":18},"Security","security",652,{"name":45,"slug":46,"count":47,"latest_published_at":48},"Policy","policy",338,"2026-09-11T04:00:00.000Z",{"name":50,"slug":51,"count":52,"latest_published_at":53},"Deals","deals",179,"2026-06-29T20:02:07.000Z",{"name":55,"slug":56,"count":57,"latest_published_at":18},"Hardware","hardware",155,{"name":59,"slug":60,"count":61,"latest_published_at":18},"Science","science",116,{"name":63,"slug":64,"count":65,"latest_published_at":66},"Consumer Tech","consumer-tech",99,"2026-09-09T17:27:33.000Z",{"name":68,"slug":69,"count":70,"latest_published_at":71},"Dev Tools","dev-tools",76,"2026-09-18T01:04:54.000Z",{"name":73,"slug":74,"count":75,"latest_published_at":76},"Software","software",75,"2026-09-10T20:41:21.000Z",{"name":78,"slug":79,"count":80,"latest_published_at":81},"Startups","startups",55,"2026-09-09T23:14:29.000Z",{"name":83,"slug":84,"count":85,"latest_published_at":86},"Gaming","gaming",43,"2026-09-10T12:18:06.000Z",{"name":88,"slug":89,"count":90,"latest_published_at":91},"General","general",41,"2026-09-08T01:57:23.000Z",{"name":93,"slug":94,"count":95,"latest_published_at":96},"Reviews","reviews",20,"2026-06-24T12:00:01.000Z",{"name":98,"slug":99,"count":100,"latest_published_at":101},"How-To","how-to",6,"2026-06-16T09:00:00.000Z"]