Pith. sign in

REVIEW 1 cited by

On the Existence of the Adversarial Bayes Classifier (Extended Version)

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

arxiv 2112.01694 v4 pith:BSQ3IS6T submitted 2021-12-03 cs.LG stat.ML

classification cs.LGstat.ML
keywords adversarialrobustnessbayesclassifierexistenceresultsversionerrors
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Adversarial robustness is a critical property in a variety of modern machine learning applications. While it has been the subject of several recent theoretical studies, many important questions related to adversarial robustness are still open. In this work, we study a fundamental question regarding Bayes optimality for adversarial robustness. We provide general sufficient conditions under which the existence of a Bayes optimal classifier can be guaranteed for adversarial robustness. Our results can provide a useful tool for a subsequent study of surrogate losses in adversarial robustness and their consistency properties. This manuscript is the extended and corrected version of the paper \emph{On the Existence of the Adversarial Bayes Classifier} published in NeurIPS 2021. There were two errors in theorem statements in the original paper -- one in the definition of pseudo-certifiable robustness and the other in the measurability of $A^\e$ for arbitrary metric spaces. In this version we correct the errors. Furthermore, the results of the original paper did not apply to some non-strictly convex norms and here we extend our results to all possible norms.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Consensus-based optimization for closed-box adversarial attacks and a connection to evolution strategies

    math.OC 2025-06 conditional novelty 5.0 of 10

    Consensus-based optimization matches or beats natural evolution strategies as a closed-box adversarial attack method in easier attack scenarios, and consensus hopping is shown to be a gradient-descent-like limit of CBO.

Pith tools