paper-with-me

홈 › Papers

Measuring Adversarial Robustness using a Voronoi-Epsilon Adversary

2020-05-06 · Hyeongji Kim, Pekka Parviainen, Ketil Malde

Previous studies on robustness have argued that there is a tradeoff between accuracy and adversarial accuracy. The tradeoff can be inevitable even when we neglect generalization. We argue that the tradeoff is inherent to the commonly used definition of adversarial accuracy, which uses an adversary that can construct adversarial points constrained by $\epsilon$-balls around data points. As $\epsilon$ gets large, the adversary may use real data points from other classes as adversarial examples. We propose a Voronoi-epsilon adversary which is constrained both by Voronoi cells and by $\epsilon$-balls. This adversary balances between two notions of perturbation. As a result, adversarial accuracy based on this adversary avoids a tradeoff between accuracy and adversarial accuracy on training data even when $\epsilon$ is large. Finally, we show that a nearest neighbor classifier is the maximally robust classifier against the proposed adversary on the training data.

📄 PDF Abstract BibTeX arXiv:2005.02540

Code (1)

hjk92g/proper_measure_robustness 공식 구현

Tasks

Adversarial Robustness

Similar Papers 제목 키워드 기반

Exponential Separation between Two Learning Models and Adversarial Robustness

2021-12-01 · NeurIPS 2021 12 · Grzegorz Gluch, Ruediger Urbanke

We prove an exponential separation for the sample/query complexity between the standard PAC-learning model and a version of the Equivalence-Query-learning model. In the PAC model all samples are provided at the beginning…

Adversarial RobustnessPAC learningVocal Bursts Valence Prediction

Adversarial Training with Voronoi Constraints

2019-05-02 · Marc Khoury, Dylan Hadfield-Menell

Adversarial examples are a pervasive phenomenon of machine learning models where seemingly imperceptible perturbations to the input lead to misclassifications for otherwise statistically accurate models. We propose a geo…

Adversarial Robustness: What fools you makes you stronger

2021-02-10 · Grzegorz Głuch, Rüdiger Urbanke

We prove an exponential separation for the sample complexity between the standard PAC-learning model and a version of the Equivalence-Query-learning model. We then show that this separation has interesting implications f…

Adversarial RobustnessPAC learning

Corruption-Robust Offline Reinforcement Learning

2021-06-11 · Xuezhou Zhang, Yiding Chen, Jerry Zhu, Wen Sun

We study the adversarial robustness in offline reinforcement learning. Given a batch dataset consisting of tuples $(s, a, r, s')$, an adversary is allowed to arbitrarily modify $\epsilon$ fraction of the tuples. From the…

Adversarial RobustnessOffline RLreinforcement-learningReinforcement Learning+1

On the Privacy Properties of GAN-generated Samples

2022-06-03 · Zinan Lin, Vyas Sekar, Giulia Fanti

The privacy implications of generative adversarial networks (GANs) are a topic of great interest, leading to several recent algorithms for training GANs with privacy guarantees. By drawing connections to the generalizati…