arXiv AI

Do Neural Networks Preserve Case Structure? Case-Based Decomposition, Interpretation, and Decision Consistency

The paper investigates whether neural networks retain a case-based structure in their learned representations, enabling the decomposition of decision margins into contributions from individual training cases. By linking neural networks to Case-Based Decision Theory (CBDT), the authors identify conditions under which this recovered structure can be interpreted within CBDT and demonstrate that the resulting interpretation is consistent with the network’s original decisions. Experiments on a controlled CBDT setting and three real-world decision tasks confirm the viability of this approach.

arXiv Machine Learning
Sep 24

NeuroRule: Making Black-Box Neural Networks Explainable through Rule-set Evolution

NeuroRule is a knowledge distillation framework that transforms high‑capacity neural networks into explainable rule‑sets. It adapts the EVOTER rule‑set evolution infrastructure to evolve propositional logic expressions that capture the neural network’s performance. The approach includes a conciseness objective to enhance explainability and demonstrates viability even without access to the original training data.

By Tapaswini Kodavanti, Hormoz Shahrzad, Risto Miikkulainen
arXiv Machine Learning
Jul 27

Neural Feature Governance: Extending Atom Prevalence

arXiv:2607. 21671v1 Announce Type: new Abstract: Neural network compression and interpretability remain open challenges in modern deep learn- ing, where billion-parameter architectures deliver impressive accuracy at the cost of trans- parency, computational efficiency, and reliable uncertainty quantification.

By Idris Karel Seunda Ekwe, Patrick Tenga Shako, Ernest Parfait Fokou\'e
arXiv Machine Learning
Sep 14

Language Is an Insufficient Substrate for Quantitative Reasoning, and Consequential Domains Need Large Quantitative Models

The article argues that large language models (LLMs) are inadequate for consequential quantitative tasks such as pricing, risk assessment, and medical triage because language is a lossy representation of quantitative data that cannot be reversed. It formalizes this limitation as a property of the training representation rather than model capacity and identifies three essential properties—reproducibility, traceable lineage to source records, and calibrated uncertainty—that language substrates cannot provide. The authors propose a new class of models, Large Quantitative Models (LQMs), designed to meet these requirements.

By Reuben Vandeventer, David Imrem, David J. Wild
arXiv AI
Sep 10

A Theoretical Analysis of Provable Compositional Generalization in Neural Networks: A Necessary and Sufficient Condition

The paper presents a necessary and sufficient condition for provable compositional generalization in neural networks, identifying two key principles: structural alignment and unambiguous minimized representations. It rigorously proves this condition, verifies it in Lean 4, and demonstrates its applicability in few-shot settings, including the SCAN jump task. The authors also outline an algorithmic approach and illustrate it with a minimal example, all derived purely from mathematical analysis without empirical validation.

By Yuanpeng Li