NLP verification: towards a general methodology for certifying robustness
Authors:
Open Access
- 2 April 2025
- journal article
- Published by Cambridge University Press (CUP) in European Journal of Applied Mathematics
- Vol. 37 (1) , 180-237
Abstract
Machine learning has exhibited substantial success in the field of natural language processing (NLP). For example, large language models have empirically proven to be capable of producing text of high complexity and cohesion. However, at the same time, they are prone to inaccuracies and hallucinations. As these systems are increasingly integrated into real-world applications, ensuring their safety and reliability becomes a primary concern. There are safety critical contexts where such models must be robust to variability or attack and give guarantees over their output. Computer vision had pioneered the use of formal verification of neural networks for such scenarios and developed common verification standards and pipelines, leveraging precise formal reasoning about geometric properties of data manifolds. In contrast, NLP verification methods have only recently appeared in the literature. While presenting sophisticated algorithms in their own right, these papers have not yet crystallised into a common methodology. They are often light on the pragmatical issues of NLP verification, and the area remains fragmented. In this paper, we attempt to distil and evaluate general components of an NLP verification pipeline that emerges from the progress in the field to date. Our contributions are twofold. First, we propose a general methodology to analyse the effect of the embedding gap – a problem that refers to the discrepancy between verification of geometric subspaces, and the semantic meaning of sentences which the geometric subspaces are supposed to represent. We propose a number of practical NLP methods that can help to quantify the effects of the embedding gap. Second, we give a general method for training and verification of neural networks that leverages a more precise geometric estimation of semantic similarity of sentences in the embedding space and helps to overcome the effects of the embedding gap in practice.Keywords
All Related Versions
This publication has 68 references indexed in Scilit:
- SoK: Certified Robustness for Deep Neural Networks2023
- Scalable Quantitative Verification for Deep Neural Networks2021
- Scalable Verified Training for Provably Robust Image Classification2019
- Certified Robustness to Adversarial Examples with Differential Privacy2019
- Black-Box Generation of Adversarial Text Sequences to Evade Deep Learning Classifiers2018
- AI2: Safety and Robustness Certification of Neural Networks with Abstract Interpretation2018
- Maximum Resilience of Artificial Neural Networks2017
- The Zonotope Abstract Domain Taylor1+2009
- Verification by Abstract Interpretation2003
- Formal verification of an ARM processor1999