Aug 2026· Lecture Notes in Computer Science· pp. 116-133· 0 citations· 50 references
Computer Science
TL;DR
By unifying these diverse models under a single formal framework, the first rigorous, cross-architecture comparison of their interpretability is enabled, enabling the first rigorous, cross-architecture comparison of their interpretability.
Abstract
Prototype-based neural networks are hailed as interpretable-by-design architectures. Recently, Abductive Latent Explanations (ALE) were introduced to provide formal, mathematically guaranteed explanations that leverage the intrinsic structure of these networks to ensure both predictive safety and human readability. ALEs rely on computing tight bounds on latent space distances to produce formal explanations. However, existing ALE formulations are rigidly confined to Euclidean latent spaces. This leaves a critical gap: modern state-of-the-art architectures increasingly rely on non-Euclidean representations - such as spherical metrics, Gaussian densities, and dimensional projections - rendering current formal explanation methods incompatible. In this work, we generalize the ALE framework to support non-Euclidean prototype architectures. For each geometric variant, we systematically derive how to either map the architecture to existing bounds or construct novel, architecture-specific bounding algorithms. We validate our theoretical constructions by computing subset-minimal formal explanations on fully trained image classifiers. By unifying these diverse models under a single formal framework, we enable the first rigorous, cross-architecture comparison of their interpretability.
This work presents a unified framework for probabilistic explainability based on sparse, anchored linear models, applicable to both binary classification and continuous regression, and addresses the resulting empirical problem using a Mixed Integer Programming formulation that yields provably optimal empirical solution...
F. Koriche, Jean-Marie Lagniez, Chi Tran· 0 citations
Prototype-based neural networks provide inherent interpretability through case-based reasoning, yet suffer from critical limitations: prototypes converge to redundant features, fail to capture diverse semantic parts, and lack quantitative interpretability assessment. We propose Diversity-Aware Prototype Learning (DAPL)...
A*-Thought-V2 is presented, a geometric dynamics of LLM guided framework that models CoT as a hidden-state trajectory and replaces hard deletion with an explicit-implicit interleaved latent architecture that reflects broader soft targets that encourage richer step-level feature learning.
Xiao-An Xu, Si-Yuan Liu, Shuo Wang et al.· 1 citation
Generative Verification (GenV) is introduced, which distills an offline Z3-equivalence oracle into a reference-free, continuous reference-equivalence score by repurposing the language model's native vocabulary space and theoretically proves that structural, verdict-only verification heuristics are mathematically bounde...
Vikash Singh, Debargha Ganguly, Aman Goel et al.· 0 citations
The framework is operator-agnostic - it decouples logical structure from the choice of underlying continuous semantics, revealing, through the first controlled comparison of its kind, that this choice alone can swing performance by over 30 points on the same task.
Zi-Han Shao, Chang Lu, Renate A. Schmidt et al.· Proceedings of the 32nd ACM...· 0 citations
This work introduces IntroConformal, a training-free Conformal Risk Control (CRC) framework that provides finite-sample, distribution-free factuality guarantees and proposes verification probability, a stronger score capturing the model's self-administered judgment on claim factuality.
Md. Atabuzzaman, Christian Alexander, Chris Thomas· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.