arXiv AI

WisdomNet: trustable machine learning toward error-free classification

arXiv Machine Learning
5d ago

Attack logics, not outputs: Concept-based Property Attacks for Shortcut Elimination in Neural Networks

The paper introduces concept-based property attacks, which target logical inconsistencies in human‑interpretable concepts (e.g., “red ∧ octagonal → stop_sign”) rather than merely flipping final class labels. It formalizes these properties, proves that attacking them reduces the search space compared to class‑level attacks, and implements them using concept‑based explainable AI techniques. Empirical results across vision and code‑processing models show that retraining with these attacks preserves robustness gains while better eliminating semantic biases.

By Raik Dankworth, Felix M\"achtle, Thomas Eisenbarth, Gesina Schwalbe
arXiv AI
Aug 24

Prediction certification cannot replace explanation certification: a competence envelope for trustworthy AI under compound stress

The paper argues that prediction‑based certifications—such as accuracy, calibration, and conformal coverage—are insufficient to guarantee trustworthy AI. It proves a separation theorem showing that a model can appear reliable under all prediction‑side certificates yet differ arbitrarily in explanation fidelity and deployment behaviour. The authors propose a competence envelope framework that combines both prediction and explanation certification to detect such hidden failures.

By Nataliya Shakhovska, Ivan Izonin, Stergios-Aristoteles Mitoulis
arXiv AI
Jun 30

Few-class Fidelity: Evaluating Explanations of Real-conditions CNN classifiers with Optimized Perturbations

arXiv:2606. 28391v1 Announce Type: cross Abstract: The wide use of Convolutional Neural Networks (CNN) in numerous domains and real-world classification applications is justified by their high precision and automation speed, helping users concentrate on higher-expertise tasks.

By Wistan Marchadour, Pedro Soto Vega, Franck Vermet, Mathieu Hatt
arXiv Machine Learning
Oct 19

Escaping Parameter Space: Tight Generalization Bounds via Representation Quality

The paper presents a tight generalization bound for deterministic neural networks that relies on the quality of their last hidden layer representations rather than traditional parameter-space metrics. By using a parameter‑free k‑nearest‑neighbor classifier to assess representation quality, the bound decomposes into three measurable components—local class geometry, decoder‑network agreement, and training stability—providing both a non‑vacuous certificate and a diagnostic tool for understanding generalization. Experiments show the bound achieves an 8.0‑percentage‑point gap to test error on CIFAR‑10 with ResNet‑18, yields the first non‑vacuous certificates on CIFAR‑100, and certifies 1.4 % on CIFAR‑10 and 23.1 % on 1,000‑class ImageNet using frozen DINOv2 representations.

By Niclas G\"oring, Shuofeng Zhang, Branton DeMoss, Ard A. Louis