Data-Driven Lipschitz Continuity: A Cost-Effective Approach to Improve Adversarial Robustness
<|reference_start|>Data-Driven Lipschitz Continuity: A Cost-Effective Approach to Improve Adversarial Robustness: The security and robustness of deep neural networks (DNNs) have become increasingly concerning. This paper aims to provide both a theoretical foundation and a practical solution to ensure the reliability of DNNs. We explore the concept of Lipschitz continuity to certify the robustness of DNNs against adversarial attacks, which aim to mislead the network with adding imperceptible perturbations into inputs. We propose a novel algorithm that remaps the input domain into a constrained range, reducing the Lipschitz constant and potentially enhancing robustness. Unlike existing adversarially trained models, where robustness is enhanced by introducing additional examples from other datasets or generative models, our method is almost cost-free as it can be integrated with existing models without requiring re-training. Experimental results demonstrate the generalizability of our method, as it can be combined with various models and achieve enhancements in robustness. Furthermore, our method achieves the best robust accuracy for CIFAR10, CIFAR100, and ImageNet datasets on the RobustBench leaderboard.<|reference_end|>
@article{chen2024data-driven,
    title={Data-Driven Lipschitz Continuity: A Cost-Effective Approach to Improve
  Adversarial Robustness},
    author={Erh-Chung Chen, Pin-Yu Chen, I-Hsin Chung, Che-Rung Lee},
    journal={arXiv preprint arXiv:2406.19622},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.19622},
    primaryClass={cs.LG cs.AI}
}