REVIEW 1 cited by
Adversarial Boot Camp: label free certified robustness in one epoch
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Machine learning models are vulnerable to adversarial attacks. One approach to addressing this vulnerability is certification, which focuses on models that are guaranteed to be robust for a given perturbation size. A drawback of recent certified models is that they are stochastic: they require multiple computationally expensive model evaluations with random noise added to a given input. In our work, we present a deterministic certification approach which results in a certifiably robust model. This approach is based on an equivalence between training with a particular regularized loss, and the expected values of Gaussian averages. We achieve certified models on ImageNet-1k by retraining a model with this loss for one epoch without the use of label information.
Forward citations
Cited by 1 Pith paper
-
Fast Rates for Semi-Supervised Learning via Data-Augmentation Graph Regularization
Graph-regularized learning on data-augmentation graphs has transductive error ≤ C/n_L + R_DA(y), where R_DA is the graph-cut mass of augmentations crossing label boundaries.
Discussion (0). Continue with ORCID to comment.