论文标题

通过逻辑推理通过统计学习来改善认证的鲁棒性

Improving Certified Robustness via Statistical Learning with Logical Reasoning

论文作者

Yang, Zhuolin, Zhao, Zhikuan, Wang, Boxin, Zhang, Jiawei, Li, Linyi, Pei, Hengzhi, Karlas, Bojan, Liu, Ji, Guo, Heng, Zhang, Ce, Li, Bo

论文摘要

最近已经做出了密集的算法努力,以使复杂ML模型的认证鲁棒性快速改善。但是,当前的鲁棒性认证方法只能在有限的扰动半径下进行认证。鉴于现有的纯数据驱动的统计方法已经达到了瓶颈,因此我们建议将统计ML模型与知识(表示为逻辑规则表示)整合为使用Markov逻辑网络(MLN,以进一步提高整体认证的鲁棒性)作为推理组成部分。这对帕尔达(Parandig)的稳健性进行了证实,尤其是构成了帕尔达(Paradig)的鲁棒性,尤其是构成了帕尔达(Paradig)。迈向理解这些问题的一步,我们首先证明了认证MLN的鲁棒性的计算复杂性是由这种硬度结果引导的,然后我们得出了第一个认证的鲁棒性,用于MLN,通过仔细分析不同的模型,我们在包括高度图像和自然图像上进行了五个数据集。优于最先进的表现。

Intensive algorithmic efforts have been made to enable the rapid improvements of certificated robustness for complex ML models recently. However, current robustness certification methods are only able to certify under a limited perturbation radius. Given that existing pure data-driven statistical approaches have reached a bottleneck, in this paper, we propose to integrate statistical ML models with knowledge (expressed as logical rules) as a reasoning component using Markov logic networks (MLN, so as to further improve the overall certified robustness. This opens new research questions about certifying the robustness of such a paradigm, especially the reasoning component (e.g., MLN). As the first step towards understanding these questions, we first prove that the computational complexity of certifying the robustness of MLN is #P-hard. Guided by this hardness result, we then derive the first certified robustness bound for MLN by carefully analyzing different model regimes. Finally, we conduct extensive experiments on five datasets including both high-dimensional images and natural language texts, and we show that the certified robustness with knowledge-based logical reasoning indeed significantly outperforms that of the state-of-the-arts.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源