arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.10135cs.LGstat.ML
收藏

DiffRNN:循环神经网络的差分验证

DiffRNN: Differential Verification of Recurrent Neural Networks

University of Southern California(南加州大学)

Sara Mohammadinejad, Brandon Paulsen, Chao Wang, Jyotirmoy V. Deshmukh

摘要:

诸如长短期记忆(LSTM)网络的循环神经网络(RNN)在诸如图像处理、数据分类、语音识别的各种应用中以及作为自治系统中的控制器已经变得流行。在实际环境中,通常需要在资源受限的平台(如移动电话或嵌入式设备)上部署此类RNN。由于这些组件的内存占用和能耗成为瓶颈,因此有兴趣使用一系列启发式技术来压缩和优化这些网络。然而,这些技术不能保证优化网络的安全性,例如,对抗对抗性输入,或者优化网络和原始网络的等价性。为了解决这个问题,我们提出了RNN,RNN的第一个差分验证方法,以证明两个结构相似的神经网络的等价性。基于ReLU的前馈神经网络的差分验证的现有工作不适用于RNN,其中无法避免非线性激活函数,如Sigmoid和Tanh。RNN还带来了独特的挑战,例如处理顺序输入,复杂的反馈结构以及门和状态之间的相互作用。在RNN中,我们通过用线性约束非线性激活函数,然后求解约束优化问题来计算高维空间中非线性表面上的紧密边界框来克服这些挑战。然后使用dReal SMT求解器证明这些边界框的合理性。我们在各种基准测试中证明了我们的技术的实际有效性,并表明RNN优于POPQORN等最先进的RNN验证工具。

英文摘要:

Recurrent neural networks (RNNs) such as Long Short Term Memory (LSTM) networks have become popular in a variety of applications such as image processing, data classification, speech recognition, and as controllers in autonomous systems. In practical settings, there is often a need to deploy such RNNs on resource-constrained platforms such as mobile phones or embedded devices. As the memory footprint and energy consumption of such components become a bottleneck, there is interest in compressing and optimizing such networks using a range of heuristic techniques. However, these techniques do not guarantee the safety of the optimized network, e.g., against adversarial inputs, or equivalence of the optimized and original networks. To address this problem, we propose DIFFRNN, the first differential verification method for RNNs to certify the equivalence of two structurally similar neural networks. Existing work on differential verification for ReLUbased feed-forward neural networks does not apply to RNNs where nonlinear activation functions such as Sigmoid and Tanh cannot be avoided. RNNs also pose unique challenges such as handling sequential inputs, complex feedback structures, and interactions between the gates and states. In DIFFRNN, we overcome these challenges by bounding nonlinear activation functions with linear constraints and then solving constrained optimization problems to compute tight bounding boxes on nonlinear surfaces in a high-dimensional space. The soundness of these bounding boxes is then proved using the dReal SMT solver. We demonstrate the practical efficacy of our technique on a variety of benchmarks and show that DIFFRNN outperforms state-of-the-art RNN verification tools such as POPQORN.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑