[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"branding":3,"analytics":7,"article-new-method-adore-tries-to-explain-ai-decisions-faster":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},6417,"new-method-adore-tries-to-explain-ai-decisions-faster","New Method ADORE Tries to Explain AI Decisions Faster","A new open-source tool called ADORE aims to explain both broad model behavior and individual predictions more efficiently than LIME or SHAP.","A new open-source tool wants to make machine learning models less of a black box, and do it faster than the current standard-bearers.\n\nResearchers have released ADORE (Adaptive Derivative-Ordered Random Explanation), a method for explaining why machine learning models make the decisions they do. It uses first- and second-order derivatives to handle nonlinear relationships in the data, and combines global feature importance with local, sample-level explanations in one pass instead of two separate processes. To keep things fast on large datasets, it leans on randomized singular value decomposition and dynamic sparsity detection. The team tested it across tabular, text, and image data and says it beat LIME and SHAP on both accuracy of explanations and computational efficiency.\n\nThis matters because explainability tools are infrastructure, not features. LIME and SHAP are the default choices in healthcare and finance precisely because regulators and auditors demand some accounting for automated decisions, and both tools are known to slow to a crawl on high-dimensional data. If ADORE's efficiency claims hold up outside the paper's own benchmarks, that's a real operational fix, not just an academic curiosity.\n\nThe catch is the usual one: the comparisons come from the people who built the thing. LIME and SHAP earned their dominance over years of independent scrutiny and messy production use, not a single paper. ADORE is on GitHub now, which is the right first step - but it has that same gauntlet ahead of it.","[\"explainable-ai\",\"machine-learning\",\"open-source\",\"research\"]","2026-09-16T04:00:00.000Z","2026-09-17T15:18:15.867Z","2026-09-17T15:18:27.751Z","published",null,[],"ai",[26,27,28,29],"explainable-ai","machine-learning","open-source","research",[31],{"name":32,"url":33},"arXiv cs.AI","https:\u002F\u002Farxiv.org\u002Fabs\u002F2609.17171",0,{"sections":36},[37,41,46,51,56,60,64,69,74,78,83,88,93,98],{"name":38,"slug":24,"count":39,"latest_published_at":40},"AI",3853,"2026-09-17T08:27:09.000Z",{"name":42,"slug":43,"count":44,"latest_published_at":45},"Security","security",648,"2026-09-17T04:00:00.000Z",{"name":47,"slug":48,"count":49,"latest_published_at":50},"Policy","policy",338,"2026-09-11T04:00:00.000Z",{"name":52,"slug":53,"count":54,"latest_published_at":55},"Deals","deals",179,"2026-06-29T20:02:07.000Z",{"name":57,"slug":58,"count":59,"latest_published_at":45},"Hardware","hardware",154,{"name":61,"slug":62,"count":63,"latest_published_at":45},"Science","science",114,{"name":65,"slug":66,"count":67,"latest_published_at":68},"Consumer Tech","consumer-tech",99,"2026-09-09T17:27:33.000Z",{"name":70,"slug":71,"count":72,"latest_published_at":73},"Software","software",75,"2026-09-10T20:41:21.000Z",{"name":75,"slug":76,"count":77,"latest_published_at":45},"Dev Tools","dev-tools",73,{"name":79,"slug":80,"count":81,"latest_published_at":82},"Startups","startups",55,"2026-09-09T23:14:29.000Z",{"name":84,"slug":85,"count":86,"latest_published_at":87},"Gaming","gaming",43,"2026-09-10T12:18:06.000Z",{"name":89,"slug":90,"count":91,"latest_published_at":92},"General","general",41,"2026-09-08T01:57:23.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"]