Pith. sign in

REVIEW 1 cited by

On the Permanence of Backdoors in Evolving Models

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 2206.04677 v2 pith:V5POQ5DI submitted 2022-06-08 cs.CR cs.CVcs.LG

On the Permanence of Backdoors in Evolving Models

classification cs.CR cs.CVcs.LG
keywords modelsbackdoorsbackdoordatafine-tuningtime-varyingattacksdrifts
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Existing research on training-time attacks for deep neural networks (DNNs), such as backdoors, largely assume that models are static once trained, and hidden backdoors trained into models remain active indefinitely. In practice, models are rarely static but evolve continuously to address distribution drifts in the underlying data. This paper explores the behavior of backdoor attacks in time-varying models, whose model weights are continually updated via fine-tuning to adapt to data drifts. Our theoretical analysis shows how fine-tuning with fresh data progressively "erases" the injected backdoors, and our empirical study illustrates how quickly a time-varying model "forgets" backdoors under a variety of training and attack settings. We also show that novel fine-tuning strategies using smart learning rates can significantly accelerate backdoor forgetting. Finally, we discuss the need for new backdoor defenses that target time-varying models specifically.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. DOPA: Stealthy and Generalizable Backdoor Attacks from a Single Client under Challenging Federated Constraints

    cs.CR 2025-08 unverdicted novelty 5.0

    A single malicious client can craft a persistent, stealthy backdoor trigger for federated learning by simulating divergent local training paths and optimizing the trigger for consensus across those paths.