[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"branding":3,"analytics":7,"article-ai-discovery-search-gets-a-built-in-skeptic":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},9922,"ai-discovery-search-gets-a-built-in-skeptic","AI Discovery Search Gets a Built-In Skeptic","Researchers built an AI search method that only reports candidates it can statistically guarantee are real, trading a long shortlist for a trustworthy one.","A new search algorithm for AI-driven scientific discovery would rather return nothing than return a lie.\n\nResearchers behind a method called CISE, short for Conformal Interval-Driven Self-Evolution, are targeting a specific failure in AI systems that iteratively search for scientific breakthroughs. These systems often lean on cheap proxy reward signals to judge candidates, since running full, high-fidelity tests on every option is too expensive, and those proxies sometimes score infeasible candidates highly. CISE instead builds a statistically calibrated confidence interval for each candidate's properties, using conformal inference and density-ratio estimation, and only passes a candidate through if every required interval sits entirely inside the feasible zone. Tested on three self-evolving search tasks in materials science, every candidate CISE returned checked out under expensive, high-fidelity evaluation, while baseline methods returned longer lists that included candidates which failed the real test.\n\nThat distinction matters because validation, not idea generation, is the actual bottleneck in computational science: synthesizing and testing a candidate material in the real world costs far more than generating another guess. A shorter list of guaranteed winners is worth more to a lab with a limited budget than a longer list padded with maybes.\n\nIt is a quietly skeptical response to the current enthusiasm for AI that proposes thousands of candidates per hour: proposing fast is easy, and proving it right is still the hard part.","[\"ai\",\"materials-science\",\"machine-learning\",\"scientific-research\"]","2026-10-05T04:00:00.000Z","2026-10-05T13:28:23.980Z","2026-10-05T13:28:30.142Z","published",null,[],"ai",[24,26,27,28],"materials-science","machine-learning","scientific-research",[30],{"name":31,"url":32},"arXiv cs.AI","https:\u002F\u002Farxiv.org\u002Fabs\u002F2610.02975",0,{"sections":35},[36,39,43,48,53,58,62,67,71,75,80,85,90,95],{"name":37,"slug":24,"count":38,"latest_published_at":18},"AI",6166,{"name":40,"slug":41,"count":42,"latest_published_at":18},"Security","security",859,{"name":44,"slug":45,"count":46,"latest_published_at":47},"Policy","policy",444,"2026-10-03T15:02:01.000Z",{"name":49,"slug":50,"count":51,"latest_published_at":52},"Deals","deals",323,"2026-10-04T13:00:00.000Z",{"name":54,"slug":55,"count":56,"latest_published_at":57},"Hardware","hardware",204,"2026-10-03T14:50:50.000Z",{"name":59,"slug":60,"count":61,"latest_published_at":18},"Science","science",177,{"name":63,"slug":64,"count":65,"latest_published_at":66},"Consumer Tech","consumer-tech",158,"2026-10-03T03:21:12.000Z",{"name":68,"slug":69,"count":70,"latest_published_at":18},"Dev Tools","dev-tools",97,{"name":72,"slug":73,"count":70,"latest_published_at":74},"Software","software","2026-10-04T10:00:00.000Z",{"name":76,"slug":77,"count":78,"latest_published_at":79},"Startups","startups",92,"2026-10-04T14:36:25.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",51,"2026-10-05T02:35:01.000Z",{"name":91,"slug":92,"count":93,"latest_published_at":94},"Reviews","reviews",32,"2026-10-02T18:00:00.000Z",{"name":96,"slug":97,"count":98,"latest_published_at":99},"How-To","how-to",7,"2026-10-01T09:00:00.000Z"]