A two-stage entropy-maximization then entropy-minimization rectification, guided by a low-entropy prior of adversarial examples, improves test-time defense generalization on several benchmarks.
Square attack: a query-efficient black-box adversarial attack via random search
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
baseline 1
citation-polarity summary
fields
cs.CV 1years
2025 1verdicts
CONDITIONAL 1roles
baseline 1polarities
baseline 1representative citing papers
citing papers explorer
-
Rectifying Adversarial Sample with Low Entropy Prior for Test-Time Defense
A two-stage entropy-maximization then entropy-minimization rectification, guided by a low-entropy prior of adversarial examples, improves test-time defense generalization on several benchmarks.