跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2606.12289 · v3

The Standard Interpretable Model: Design interpretable machine learning methods from elementary symmetries

首次提交 2026-06-11 00:26
版本更新 2026-11-05 06:09
雷达观测 2026-11-06 11:06
arXiv ↗PDF ↗

摘要

As Artificial Intelligence models grow in complexity, interpretability has become an indispensable tool for understanding, debugging, and controlling their computations. However, interpretability lacks general theories to deductively design interpretable methods. This gap between theories and methods results in a fragmented literature and inconsistent evaluation protocols. To fill this gap, we introduce the Standard Interpretable Model (SIM), a general theory that enables the deductive design of interpretable methods from first principles. Specifically, the SIM summarises, in a set of premises, what interpretability is for a target entity. From these premises, the SIM systematically derives interpretability symmetries and corresponding constraints. One can then build interpretable models by either introducing constraints in the optimisation problem or by compiling constraints into an interpretable architecture. The most important finding, both theoretical and empirical, is that full expressivity and interpretability symmetries can coexist in the same model, showing that the trade-off between accuracy and interpretability is an artefact of model design. We demonstrate this on language models (LMs), where SIM-based LMs match the performance of equivalent opaque LMs without making any compromise on interpretability. Beyond this, the SIM shows how to improve the interpretability of existing pre-trained models, highlights underexplored research directions, and unifies a discipline that has long been fragmented, offering pedagogical grounding for interpretability curricula.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只观测到一个版本,无法比较变化。之后收录新版本时,会在这里对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v3 · 2026-11-05 06:09 · 最新观测版本

The Standard Interpretable Model: Design interpretable machine learning methods from elementary symmetries

As Artificial Intelligence models grow in complexity, interpretability has become an indispensable tool for understanding, debugging, and controlling their computations. However, interpretability lacks general theories to deductively design interpretable methods. This gap between theories and methods results in a fragmented literature and inconsistent evaluation protocols. To fill this gap, we introduce the Standard Interpretable Model (SIM), a general theory that enables the deductive design of interpretable methods from first principles. Specifically, the SIM summarises, in a set of premises, what interpretability is for a target entity. From these premises, the SIM systematically derives interpretability symmetries and corresponding constraints. One can then build interpretable models by either introducing constraints in the optimisation problem or by compiling constraints into an interpretable architecture. The most important finding, both theoretical and empirical, is that full expressivity and interpretability symmetries can coexist in the same model, showing that the trade-off between accuracy and interpretability is an artefact of model design. We demonstrate this on language models (LMs), where SIM-based LMs match the performance of equivalent opaque LMs without making any compromise on interpretability. Beyond this, the SIM shows how to improve the interpretability of existing pre-trained models, highlights underexplored research directions, and unifies a discipline that has long been fragmented, offering pedagogical grounding for interpretability curricula.

查看此版本解读 →查看此版本原文 ↗