中文
相关论文

相关论文: [Re] Double Sampling Randomized Smoothing

200 篇论文

Large-scale pre-trained language models have shown outstanding performance in a variety of NLP tasks. However, they are also known to be significantly brittle against specifically crafted adversarial examples, leading to increasing interest…

计算与语言 · 计算机科学 2023-05-12 Han Cheol Moon , Shafiq Joty , Ruochen Zhao , Megh Thakkar , Xu Chi

Federated learning is an emerging data-private distributed learning framework, which, however, is vulnerable to adversarial attacks. Although several heuristic defenses are proposed to enhance the robustness of federated learning, they do…

机器学习 · 计算机科学 2024-03-05 Cheng Chen , Bhavya Kailkhura , Ryan Goldhahn , Yi Zhou

Machine learning models have demonstrated remarkable success across diverse domains but remain vulnerable to adversarial attacks. Empirical defense mechanisms often fail, as new attacks constantly emerge, rendering existing defenses…

机器学习 · 计算机科学 2024-10-25 Anupriya Kumari , Devansh Bhardwaj , Sukrit Jindal

We show how to turn any classifier that classifies well under Gaussian noise into a new classifier that is certifiably robust to adversarial perturbations under the $\ell_2$ norm. This "randomized smoothing" technique has been proposed…

机器学习 · 计算机科学 2019-06-18 Jeremy M Cohen , Elan Rosenfeld , J. Zico Kolter

This paper presents novel methods for estimating certified radii in randomized smoothing, a technique crucial for certifying the robustness of neural networks against adversarial perturbations. Our proposed techniques significantly improve…

机器学习 · 计算机科学 2025-03-13 Zixuan Liang

Randomized smoothing (RS) is a well known certified defense against adversarial attacks, which creates a smoothed classifier by predicting the most likely class under random noise perturbations of inputs during inference. While initial work…

机器学习 · 计算机科学 2023-04-21 Soumalya Nandi , Sravanti Addepalli , Harsh Rangwani , R. Venkatesh Babu

Randomized smoothing is a recent technique that achieves state-of-art performance in training certifiably robust deep neural networks. While the smoothing family of distributions is often connected to the choice of the norm used for…

机器学习 · 计算机科学 2022-07-06 Motasem Alfarra , Adel Bibi , Philip H. S. Torr , Bernard Ghanem

Certified defenses such as randomized smoothing have shown promise towards building reliable machine learning systems against $\ell_p$-norm bounded attacks. However, existing methods are insufficient or unable to provably defend against…

机器学习 · 计算机科学 2022-06-30 Zhongkai Hao , Chengyang Ying , Yinpeng Dong , Hang Su , Jun Zhu , Jian Song

Deep Neural Network (DNN) trained by the gradient descent method is known to be vulnerable to maliciously perturbed adversarial input, aka. adversarial attack. As one of the countermeasures against adversarial attack, increasing the model…

计算机视觉与模式识别 · 计算机科学 2019-05-31 Adnan Siraj Rakin , Zhezhi He , Li Yang , Yanzhi Wang , Liqiang Wang , Deliang Fan

Randomized Smoothing (RS), being one of few provable defenses, has been showing great effectiveness and scalability in terms of defending against $\ell_2$-norm adversarial perturbations. However, the cost of MC sampling needed in RS for…

机器学习 · 计算机科学 2021-08-03 Huimin Zeng , Jiahao Su , Furong Huang

Certification of neural networks is an important and challenging problem that has been attracting the attention of the machine learning community since few years. In this paper, we focus on randomized smoothing (RS) which is considered as…

机器学习 · 计算机科学 2022-09-14 Pol Labarbarie , Hatem Hajri , Marc Arnaudon

Implicit models such as Deep Equilibrium Models (DEQs) have emerged as promising alternative approaches for building deep neural networks. Their certified robustness has gained increasing research attention due to security concerns.…

机器学习 · 计算机科学 2024-11-05 Weizhi Gao , Zhichao Hou , Han Xu , Xiaorui Liu

The study of provable adversarial robustness has mostly been limited to classification tasks and models with one-dimensional real-valued outputs. We extend the scope of certifiable robustness to problems with more general and structured…

机器学习 · 计算机科学 2022-01-13 Aounon Kumar , Tom Goldstein

As a certified defensive technique, randomized smoothing has received considerable attention due to its scalability to large datasets and neural networks. However, several important questions remain unanswered, such as (i) whether the…

机器学习 · 计算机科学 2020-06-09 Tianhang Zheng , Di Wang , Baochun Li , Jinhui Xu

Randomized classifiers have been shown to provide a promising approach for achieving certified robustness against adversarial attacks in deep learning. However, most existing methods only leverage Gaussian smoothing noise and only work for…

机器学习 · 计算机科学 2020-10-21 Dinghuai Zhang , Mao Ye , Chengyue Gong , Zhanxing Zhu , Qiang Liu

Randomized smoothing has achieved great success for certified robustness against adversarial perturbations. Given any arbitrary classifier, randomized smoothing can guarantee the classifier's prediction over the perturbed input with…

计算机视觉与模式识别 · 计算机科学 2022-08-22 Hanbin Hong , Yuan Hong

Deep neural networks are known to be vulnerable to adversarial attacks. Current methods of defense from such attacks are based on either implicit or explicit regularization, e.g., adversarial training. Randomized smoothing, the averaging of…

Randomized smoothing is the current state-of-the-art method for producing provably robust classifiers. While randomized smoothing typically yields robust $\ell_2$-ball certificates, recent research has generalized provable robustness to…

机器学习 · 计算机科学 2023-09-26 Samuel Pfrommer , Brendon G. Anderson , Somayeh Sojoudi

Randomized smoothing, using just a simple isotropic Gaussian distribution, has been shown to produce good robustness guarantees against $\ell_2$-norm bounded adversaries. In this work, we show that extending the smoothing technique to…

机器学习 · 计算机科学 2020-08-17 Aounon Kumar , Alexander Levine , Tom Goldstein , Soheil Feizi

Randomized smoothing is a popular way of providing robustness guarantees against adversarial attacks: randomly-smoothed functions have a universal Lipschitz-like bound, allowing for robustness certificates to be easily computed. In this…

机器学习 · 计算机科学 2020-12-16 Alexander Levine , Aounon Kumar , Thomas Goldstein , Soheil Feizi