Papers › A Panda? No, It's a Sloth: Slowdown Attacks on Adaptive Multi-Exit Neural Network Inference

A Panda? No, It's a Sloth: Slowdown Attacks on Adaptive Multi-Exit Neural Network Inference

6 Oct 2020ICLR 2021 1arXiv:2010.02432archive 2025-07-28

Sanghyun Hong, Yiğitcan Kaya, Ionuţ-Vlad Modoranu, Tudor Dumitraş

Recent increases in the computational demands of deep neural networks (DNNs), combined with the observation that most input samples require only simple models, have sparked interest in input-adaptive multi-exit architectures, such as MSDNets or Shallow-Deep Networks. These architectures enable faster inferences and could bring DNNs to low-power devices, e.g., in the Internet of Things (IoT). However, it is unknown if the computational savings provided by this approach are robust against adversarial pressure. In particular, an adversary may aim to slowdown adaptive DNNs by increasing their average inference time$-$a threat analogous to the denial-of-service attacks from the Internet. In this paper, we conduct a systematic evaluation of this threat by experimenting with three generic multi-exit DNNs (based on VGG16, MobileNet, and ResNet56) and a custom multi-exit architecture, on two popular image classification benchmarks (CIFAR-10 and Tiny ImageNet). To this end, we show that adversarial example-crafting techniques can be modified to cause slowdown, and we propose a metric for comparing their impact on different architectures. We show that a slowdown attack reduces the efficacy of multi-exit DNNs by 90-100%, and it amplifies the latency by 1.5-5× in a typical IoT deployment. We also show that it is possible to craft universal, reusable perturbations and that the attack can be effective in realistic black-box scenarios, where the attacker has limited knowledge about the victim. Finally, we show that adversarial training provides limited protection against slowdowns. These results suggest that further research is needed for defending multi-exit architectures against this emerging threat. Our code is available at https://github.com/sanghyun-hong/deepsloth.

PaperPDFConference PDFCodeCode 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="2010.02432")

Code

Syntology Ran 1 of 17 code samples harvested from 1 repository linked to this paper; 16 have no recorded run. Of those that ran: 1 ran · honoured contract.

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

sanghyun-hong/deepsloth 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

17 samples harvested; 1 ran; 1 honoured the contract we drafted; 16 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.

1ran · honoured contract
16unverified

Licence: 0 of the 17 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 sanghyun-hong/deepsloth. “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.

feature_reduction_formula sanghyun-hong/deepsloth/utils.py official repository ran · honoured contract fingerprinted MIT (permissive) · f79d8861a3c36477 · report
PGD sanghyun-hong/deepsloth/attacks/PGDs.py official repository unverified MIT (permissive) · de06046620195b86 · report
PGD_avg sanghyun-hong/deepsloth/attacks/PGDs.py official repository unverified MIT (permissive) · 96433a42de458de2 · report
PGD_max sanghyun-hong/deepsloth/attacks/PGDs.py official repository unverified MIT (permissive) · 1d50c333062f5b9a · report
accuracy sanghyun-hong/deepsloth/datasets.py official repository unverified MIT (permissive) · 0ae2381aa39b7e94 · report
convert_num_early_exits_at_each_ic_to_cumulative_dis sanghyun-hong/deepsloth/delay_attack_cost.py official repository unverified MIT (permissive) · e0235251ee546bc1 · report
convert_set_of_early_exit_samples_to_cumulative_dist sanghyun-hong/deepsloth/delay_attack_cost.py official repository unverified MIT (permissive) · 971a65c04cc88912 · report
get_class_wise_lists sanghyun-hong/deepsloth/scenarios.py official repository unverified MIT (permissive) · 61f6c47663e10368 · report
get_loader sanghyun-hong/deepsloth/model_funcs.py official repository unverified MIT (permissive) · 2afaaf23c911b3e5 · report
get_plot_data_and_auc sanghyun-hong/deepsloth/delay_attack_cost.py official repository unverified MIT (permissive) · 4d847ffe4199fc69 · report
get_subsets sanghyun-hong/deepsloth/utils.py official repository unverified MIT (permissive) · 23687b95e2b07471 · report
load_from_pickle sanghyun-hong/deepsloth/utils.py official repository unverified MIT (permissive) · 6a4c4e404ba00cd1 · report
load_train_loader sanghyun-hong/deepsloth/datasets.py official repository unverified MIT (permissive) · e5ae7732cd5d8200 · report
load_valid_loader sanghyun-hong/deepsloth/datasets.py official repository unverified MIT (permissive) · e19e45cb0c0659ae · report
profile sanghyun-hong/deepsloth/profiler.py official repository unverified MIT (permissive) · dbcc2e5aa63869de · report
scenario_1_split sanghyun-hong/deepsloth/scenarios.py official repository unverified MIT (permissive) · 2a83ddc10a6bd194 · report
update_numpy sanghyun-hong/deepsloth/scenarios.py official repository unverified MIT (permissive) · eb2987c7e3d2b22b · report

Tasks

Image Classificationimage-classification

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

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