[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"branding":3,"analytics":7,"article-swe-router-cuts-ai-coding-costs-by-watching-before-deciding":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},3370,"swe-router-cuts-ai-coding-costs-by-watching-before-deciding","SWE-Router Cuts AI Coding Costs by Watching Before Deciding","A new routing system lets a cheap model take the first few turns on a coding task before escalating to a pricier one — saving money without tanking results.","Not every bug needs a frontier model.\n\nResearchers have published SWE-Router, a routing system designed for multi-turn AI coding agents that decides mid-task — not upfront — whether to hand a problem off to a more expensive model. The system lets a cheaper model run for a few exploratory turns, reads what it finds, then decides whether to keep going or escalate. The paper includes a Bayes-optimality theorem arguing that routing on a partial trajectory is mathematically never worse than routing on the task description alone, and is strictly better when those early turns are informative. The team also released a multi-LLM trajectory dataset so others can reproduce the results.\n\nThe key insight is that a task description is a poor signal on its own: a one-line prompt could be hiding a typo fix or a multi-module refactor, and you cannot tell until someone starts digging. By waiting for partial results before committing to a model tier, SWE-Router sidesteps what the authors call an \"information-theoretic Bayes-error floor\" — a hard ceiling on how accurate upfront routing can ever be. That has real cost implications for any team running agentic coding pipelines at scale.\n\nCurrent LLM routers, including those already baked into some coding tools, almost universally decide on the first token of context. SWE-Router's temporal approach is a meaningful structural departure, not an incremental tweak — though \"greatly improves cost efficiency while maintaining the majority of performance\" is doing a lot of work in a sentence, and the gap between \"majority\" and \"all\" is where the real-world trade-off lives.","[\"ai\",\"dev-tools\",\"llm-routing\",\"software-engineering\"]","2026-07-02T04:00:00.000Z","2026-07-02T08:28:14.980Z","2026-07-02T08:28:17.842Z","published",null,[],"ai",[24,26,27,28],"dev-tools","llm-routing","software-engineering",[30],{"name":31,"url":32},"arXiv cs.AI","https:\u002F\u002Farxiv.org\u002Fabs\u002F2607.00053",0,{"sections":35},[36,40,45,50,55,60,65,70,75,79,84,88,93,98],{"name":37,"slug":24,"count":38,"latest_published_at":39},"AI",2590,"2026-07-16T04:00:00.000Z",{"name":41,"slug":42,"count":43,"latest_published_at":44},"Security","security",294,"2026-07-15T19:59:48.000Z",{"name":46,"slug":47,"count":48,"latest_published_at":49},"Deals","deals",179,"2026-06-29T20:02:07.000Z",{"name":51,"slug":52,"count":53,"latest_published_at":54},"Policy","policy",158,"2026-07-16T00:02:48.000Z",{"name":56,"slug":57,"count":58,"latest_published_at":59},"Hardware","hardware",122,"2026-07-14T19:46:26.000Z",{"name":61,"slug":62,"count":63,"latest_published_at":64},"Consumer Tech","consumer-tech",93,"2026-07-13T13:20:48.000Z",{"name":66,"slug":67,"count":68,"latest_published_at":69},"Software","software",70,"2026-07-13T19:52:25.000Z",{"name":71,"slug":72,"count":73,"latest_published_at":74},"Science","science",66,"2026-07-10T10:29:37.000Z",{"name":76,"slug":26,"count":77,"latest_published_at":78},"Dev Tools",59,"2026-07-07T04:00:00.000Z",{"name":80,"slug":81,"count":82,"latest_published_at":83},"Gaming","gaming",41,"2026-07-09T04:00:00.000Z",{"name":85,"slug":86,"count":82,"latest_published_at":87},"Startups","startups","2026-06-29T20:55:50.000Z",{"name":89,"slug":90,"count":91,"latest_published_at":92},"General","general",29,"2026-07-10T22:28:58.000Z",{"name":94,"slug":95,"count":96,"latest_published_at":97},"Reviews","reviews",20,"2026-06-24T12:00:01.000Z",{"name":99,"slug":100,"count":101,"latest_published_at":102},"How-To","how-to",6,"2026-06-16T09:00:00.000Z"]