Verification plays an essential role in the formal analysis of
safety-critical systems. Most current verification methods have specific
requirements when working on Deep Neural Networks (DNNs). They either target
one particular network category, e.g., Feedforward Neural Networks (FNNs), or
networks with specific activation functions, e.g., RdLU. In this paper, we
develop a model-agnostic verification framework, called DeepAgn, and show that
it can be applied to FNNs, Recurrent Neural Networks (RNNs), or a mixture of
both. Under the assumption of Lipschitz continuity, DeepAgn analyses the
reachability of DNNs based on a novel optimisation scheme with a global
convergence guarantee. It does not require access to the network's internal
structures, such as layers and parameters. Through reachability analysis,
DeepAgn can tackle several well-known robustness problems, including computing
the maximum safe radius for a given input, and generating the ground-truth
adversarial examples. We also empirically demonstrate DeepAgn's superior
capability and efficiency in handling a broader class of deep neural networks,
including both FNNs, and RNNs with very deep layers and millions of neurons,
than other state-of-the-art verification approaches.

本文提出一种模型无关的验证框架 DeepAgn，通过 reachability analysis，可以解决计算给定输入的最大安全半径和生成地面实际的例子等多个已知鲁棒性问题，尤其适用于处理包括 FNN 和 RNN 在内的复杂深层神经网络的验证。

深度神经网络上的模型无关可达性分析

Model-Agnostic Reachability Analysis on Deep Neural Networks

Recently, NLP models have achieved remarkable progress across a variety of
tasks; however, they have also been criticized for being not robust. Many
robustness problems can be attributed to models exploiting spurious
correlations, or shortcuts between the training data and the task labels. Most
existing work identifies a limited set of task-specific shortcuts via human
priors or error analyses, which requires extensive expertise and efforts. In
this paper, we aim to automatically identify such spurious correlations in NLP
models at scale. We first leverage existing interpretability methods to extract
tokens that significantly affect model's decision process from the input text.
We then distinguish "genuine" tokens and "spurious" tokens by analyzing model
predictions across multiple corpora and further verify them through
knowledge-aware perturbations. We show that our proposed method can effectively
and efficiently identify a scalable set of "shortcuts", and mitigating these
leads to more robust models in multiple applications.

本研究提出了一种方法，利用解释性方法从文本中提取影响模型决策过程的标记，分析模型在多个语料库上的预测并进一步通过知识感知扰动来区分 ' 真正 ' 的标记和 ' 虚假 ' 标记，有效地识别出一组 ' 捷径 '，从而实现在多个应用中的更加鲁棒的模型。