NLP Verification: Towards a General Methodology for Certifying Robustness
Preprint
Abstract
Deep neural networks have exhibited substantial success in the field of Natural Language Processing (NLP) and ensuring their safety and reliability is crucial: there are safety critical contexts where such models must be robust to variability or attack, and give guarantees over their output. Unlike Computer Vision, NLP lacks a unified verification methodology and, despite recent advancements in literature, they are often light on the pragmatical issues of NLP verification. In this paper, we make an 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 two-fold. Firstly, we give a general characterisation of verifiable subspaces that result from embedding sentences into continuous spaces. We identify, and give an effective method to deal with, the technical challenge of semantic generalisability of verified subspaces; and propose it as a standard metric in the NLP verification pipelines (alongside with the standard metrics of model accuracy and model verifiability). Secondly, we propose a general methodology to analyse the effect of the embedding gap, a problem that refers to the discrepancy between verification of geometric subpspaces on the one hand, and semantic meaning of sentences which the geometric subspaces are supposed to represent, on the other hand. In extreme cases, poor choices in embedding of sentences may invalidate verification results. We propose a number of practical NLP methods that can help to identify the effects of the embedding gap; and in particular we propose the metric of falsifiability of semantic subpspaces as another fundamental metric to be reported as part of the NLP verification pipeline. We believe that together these general principles pave the way towards a more consolidated and effective development of this new domain.Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Certified Robustness to Text Adversarial Attacks by Randomized [MASK]Computational Linguistics, 2023
- PRIMA: general and precise neural network certification via scalable convex hull approximationsProceedings of the ACM on Programming Languages, 2022
- Cert-RNN: Towards Certifying the Robustness of Recurrent Neural Networks2021
- Algorithms for Verifying Deep Neural NetworksFoundations and Trends® in Optimization, 2021
- Intraclass correlation – A discussion and demonstration of basic featuresPLOS ONE, 2019
- An abstract domain for certifying neural networksProceedings of the ACM on Programming Languages, 2019
- A Formally-Verified C Static AnalyzerACM SIGPLAN Notices, 2015
- Abstract interpretation | Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)2014
- The quickhull algorithm for convex hullsACM Transactions on Mathematical Software, 1996
- The singular value decomposition: Its computation and some applicationsIEEE Transactions on Automatic Control, 1980