[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"branding":3,"analytics":7,"article-robophd-evolves-ai-agent-pipelines-to-beat-rivals-at-every-price":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},5243,"robophd-evolves-ai-agent-pipelines-to-beat-rivals-at-every-price","RoboPhD evolves AI agent pipelines to beat rivals at every price","A new evolutionary AI system called RoboPhD assembles agent programs from nine priced LLM APIs to beat rivals' accuracy at their own price points.","RoboPhD, an evolutionary meta-agent, beat rival AI agents on both cost and accuracy at the same time, and it only needed up to 100 training examples per task to do it.\n\nThe system, described in a new arXiv paper, starts with a priced menu of nine LLM endpoints, brief documentation of a task and its API, and a simple seed agent. From there it evolves complete agent programs aimed at a specific per-problem cost target, usually set to match what an incumbent competitor already charges. The researchers ran it against two unrelated benchmarks: DS-1000, which checks generated code by actually executing it, and PaperFindingBench, which uses an LLM judge to score how well an agent retrieves relevant scientific papers.\n\nOn official leaderboard submissions for both benchmarks, RoboPhD's agents took every Pareto-frontier slot but one, meaning almost no other entry offered better accuracy for the same price, or a lower price for the same accuracy. That included beating both the highest-scoring competitor and the cheapest one, on their own turf. If a technique like this holds up outside arXiv leaderboards, it's a rough afternoon for anyone selling a thin agent wrapper around someone else's foundation model.\n\nWorth remembering: this is a self-reported leaderboard result on two specific, narrow benchmarks, not an independent audit of general-purpose agents in production.","[\"ai agents\",\"llm benchmarks\",\"evolutionary algorithms\",\"arxiv\"]","2026-08-18T04:00:00.000Z","2026-08-18T11:23:30.798Z","2026-08-18T11:23:42.587Z","published",null,[],"ai",[26,27,28,29],"ai agents","llm benchmarks","evolutionary algorithms","arxiv",[31],{"name":32,"url":33},"arXiv cs.AI","https:\u002F\u002Farxiv.org\u002Fabs\u002F2608.16207",0,{"sections":36},[37,41,45,50,55,60,65,70,75,79,84,89,94,99],{"name":38,"slug":24,"count":39,"latest_published_at":40},"AI",3293,"2026-08-20T04:00:00.000Z",{"name":42,"slug":43,"count":44,"latest_published_at":40},"Security","security",435,{"name":46,"slug":47,"count":48,"latest_published_at":49},"Policy","policy",210,"2026-08-19T09:32:27.000Z",{"name":51,"slug":52,"count":53,"latest_published_at":54},"Deals","deals",179,"2026-06-29T20:02:07.000Z",{"name":56,"slug":57,"count":58,"latest_published_at":59},"Hardware","hardware",140,"2026-08-19T18:25:42.000Z",{"name":61,"slug":62,"count":63,"latest_published_at":64},"Consumer Tech","consumer-tech",95,"2026-08-18T16:05:00.000Z",{"name":66,"slug":67,"count":68,"latest_published_at":69},"Science","science",90,"2026-08-19T18:41:02.000Z",{"name":71,"slug":72,"count":73,"latest_published_at":74},"Software","software",73,"2026-08-18T07:51:50.000Z",{"name":76,"slug":77,"count":78,"latest_published_at":18},"Dev Tools","dev-tools",69,{"name":80,"slug":81,"count":82,"latest_published_at":83},"Startups","startups",47,"2026-08-19T19:13:46.000Z",{"name":85,"slug":86,"count":87,"latest_published_at":88},"Gaming","gaming",41,"2026-07-09T04:00:00.000Z",{"name":90,"slug":91,"count":92,"latest_published_at":93},"General","general",33,"2026-08-18T22:18:13.000Z",{"name":95,"slug":96,"count":97,"latest_published_at":98},"Reviews","reviews",20,"2026-06-24T12:00:01.000Z",{"name":100,"slug":101,"count":102,"latest_published_at":103},"How-To","how-to",6,"2026-06-16T09:00:00.000Z"]