English

Neural Concept Verifier: Scaling Prover-Verifier Games via Concept Encodings

Machine Learning 2026-02-05 v3 Artificial Intelligence

Abstract

While Prover-Verifier Games (PVGs) offer a promising path toward verifiability in nonlinear classification models, they have not yet been applied to complex inputs such as high-dimensional images. Conversely, expressive concept encodings effectively allow to translate such data into interpretable concepts but are often utilised in the context of low-capacity linear predictors. In this work, we push towards real-world verifiability by combining the strengths of both approaches. We introduce Neural Concept Verifier (NCV), a unified framework combining PVGs for formal verifiability with concept encodings to handle complex, high-dimensional inputs in an interpretable way. NCV achieves this by utilizing recent minimally supervised concept discovery models to extract structured concept encodings from raw inputs. A prover then selects a subset of these encodings, which a verifier, implemented as a nonlinear predictor, uses exclusively for decision-making. Our evaluations show that NCV outperforms classic concept-based models and pixel-based PVG classifier baselines on high-dimensional, logically complex datasets and helps mitigate shortcut behavior. Overall, we demonstrate NCV as a promising step toward concept-level, verifiable AI.

Keywords

Cite

@article{arxiv.2507.07532,
  title  = {Neural Concept Verifier: Scaling Prover-Verifier Games via Concept Encodings},
  author = {Berkant Turan and Suhrab Asadulla and David Steinmann and Kristian Kersting and Wolfgang Stammer and Sebastian Pokutta},
  journal= {arXiv preprint arXiv:2507.07532},
  year   = {2026}
}

Comments

24 pages, 5 figures, 11 tables, revised references. An earlier version of this work was presented at the ICML 2025 Workshop on Actionable Interpretability