Papers › Improving the Accuracy-Robustness Trade-Off of Classifiers via Adaptive Smoothing

Improving the Accuracy-Robustness Trade-Off of Classifiers via Adaptive Smoothing

29 Jan 2023arXiv:2301.12554archive 2025-07-28

Yatong Bai, Brendon G. Anderson, Aerin Kim, Somayeh Sojoudi

While prior research has proposed a plethora of methods that build neural classifiers robust against adversarial robustness, practitioners are still reluctant to adopt them due to their unacceptably severe clean accuracy penalties. This paper significantly alleviates this accuracy-robustness trade-off by mixing the output probabilities of a standard classifier and a robust classifier, where the standard network is optimized for clean accuracy and is not robust in general. We show that the robust base classifier's confidence difference for correct and incorrect examples is the key to this improvement. In addition to providing intuitions and empirical evidence, we theoretically certify the robustness of the mixed classifier under realistic assumptions. Furthermore, we adapt an adversarial input detector into a mixing network that adaptively adjusts the mixture of the two base models, further reducing the accuracy penalty of achieving robustness. The proposed flexible method, termed "adaptive smoothing", can work in conjunction with existing or even future methods that improve clean accuracy, robustness, or adversary detection. Our empirical evaluation considers strong attack methods, including AutoAttack and adaptive attack. On the CIFAR-100 dataset, our method achieves an 85.21% clean accuracy while maintaining a 38.72% ℓ_∞-AutoAttacked (ϵ= 8/255) accuracy, becoming the second most robust method on the RobustBench CIFAR-100 benchmark as of submission, while improving the clean accuracy by ten percentage points compared with all listed models. The code that implements our method is available at https://github.com/Bai-YT/AdaptiveSmoothing.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2301.12554")

Code

Syntology Ran 0 of 8 code samples harvested from 1 repository linked to this paper; 8 have no recorded run.

By repository: official repository: 8 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

bai-yt/adaptivesmoothing officialmentioned in papermentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

8 samples harvested; 0 ran; 0 honoured the contract we drafted; 8 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

8unverified

Licence: 0 of the 8 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from bai-yt/adaptivesmoothing. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

L1_projection bai-yt/adaptivesmoothing/comp_autoattack/autopgd_base.py official repository unverified MIT (permissive) · 1c16a011a0349571 · report
assemble_data bai-yt/adaptivesmoothing/adaptive_smoothing/prepare_data.py official repository unverified MIT (permissive) · 4734cca6699e8aac · report
check_range_output bai-yt/adaptivesmoothing/comp_autoattack/checks.py official repository unverified MIT (permissive) · f219074d942e3b32 · report
comp_pgd_attack bai-yt/adaptivesmoothing/adaptive_smoothing/attacks.py official repository unverified MIT (permissive) · 9d155aa2b6ebc707 · report
load_data bai-yt/adaptivesmoothing/adaptive_smoothing/prepare_data.py official repository unverified MIT (permissive) · 070460386bfb8f43 · report
pgd_update bai-yt/adaptivesmoothing/adaptive_smoothing/attacks.py official repository unverified MIT (permissive) · cc49f7b6dd72223e · report
reduce bai-yt/adaptivesmoothing/adaptive_smoothing/losses.py official repository unverified MIT (permissive) · 849d15297f8360ce · report
single_pgd_attack bai-yt/adaptivesmoothing/adaptive_smoothing/attacks.py official repository unverified MIT (permissive) · f484c71520aed670 · report

Tasks

Adversarial Robustness

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Adversarial Robustness CIFAR-10 Mixed classifier Accuracy 95.23 #1 of 5 Archive leaderboard report
Adversarial Robustness CIFAR-10 Mixed classifier Attack: AutoAttack 68.06 #1 of 5 Archive leaderboard report
Adversarial Robustness CIFAR-10 Mixed classifier Robust Accuracy 68.06 #1 of 5 Archive leaderboard report
Adversarial Robustness CIFAR-100 Mixed Classifier AutoAttacked Accuracy 38.72 #1 of 2 Archive leaderboard report
Adversarial Robustness CIFAR-100 Mixed Classifier Clean Accuracy 85.21 #1 of 2 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

BASE

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections