[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"branding":3,"analytics":7,"article-a-math-framework-that-maps-every-possible-decision-tree":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},3428,"a-math-framework-that-maps-every-possible-decision-tree","A Math Framework That Maps Every Possible Decision Tree","Researchers propose Algebraic Decision Tree Counting, a formal method for exhaustively analyzing the full space of optimal decision trees without guessing.","A new framework lets researchers audit every viable decision tree a model could produce, not just the one it picked.\n\nA team of researchers has published a method called Algebraic Decision Tree Counting (ADTC) that reframes decision tree analysis as a sum-of-products computation over an algebraic structure called a semiring. The approach unifies optimization, counting, and sampling into a single framework, and a dynamic programming algorithm keeps the computation tractable despite the hypothesis space growing doubly exponential with tree depth. Their software, emtrees, runs the method against real-world datasets to surface trade-offs across accuracy, size, and fairness simultaneously.\n\nExplainable AI has a credibility problem: most auditing tools inspect the model you got, not the full landscape of models you could have gotten. ADTC is a rare attempt to close that gap formally, offering evidence-based model selection rather than post-hoc rationalization. In sensitive domains like lending or healthcare, knowing that a chosen tree is optimal across multiple criteria - not just accurate - is exactly the kind of proof regulators are starting to demand.\n\nThe complexity bound of O*(n^O(Delta)) in the number of features is honest about its limits: deep trees with many features will still strain compute. But for the shallow, interpretable trees that Explainable AI actually prizes, this looks like a practical tool, not just a theoretical exercise.","[\"explainable ai\",\"machine learning\",\"decision trees\",\"research\"]","2026-07-03T04:00:00.000Z","2026-07-03T05:45:55.099Z","2026-07-03T05:45:58.063Z","published",null,[],"ai",[26,27,28,29],"explainable ai","machine learning","decision trees","research",[31],{"name":32,"url":33},"arXiv cs.AI","https:\u002F\u002Farxiv.org\u002Fabs\u002F2607.02069",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"]