Active Test-Time Adaptation (ATTA)

• Active Test-Time Adaptation (ATTA) is a deployment-time learning framework that uses a limited annotation budget to adjust models under distribution shifts.
• It combines supervised querying of high-entropy samples with unsupervised pseudo-labeling to stabilize model performance during online adaptation.
• Variants like SimATTA, TAPS, and EATTA exemplify how tailored acquisition and update strategies can mitigate catastrophic forgetting and improve accuracy.

to=arxiv_search 玩大发快三json {"query":"Active Test-Time Adaptation arXiv ATTA test-time adaptation active querying selective adaptation", "max_results": 10, "sort_by": "submittedDate", "sort_order": "descending"} to=arxiv_search ುತ್ತಿದ್ದಾರೆjson {"query":"(Cho et al., 2024) OR (Gui et al., 2024) OR (Lee et al., 24 May 2025) OR (Sarkar et al., 26 Jul 2025) OR (Bao et al., 23 Apr 2026)", "max_results": 10, "sort_by": "submittedDate", "sort_order": "descending"} Active Test-Time Adaptation (ATTA) is a deployment-time learning setting in which a source-pretrained model encounters a streaming target domain under distribution shift, has no access to source data at test time, and is allowed to acquire only a small, budgeted amount of supervision online while adapting continually. In its narrow formulation, ATTA was introduced as a middle ground between fully test-time adaptation (FTTA/TTA), which is unlabeled at deployment, and active domain adaptation (ADA), which is typically heavier and assumes access to a target dataset; in broader usage, the term also encompasses selective test-time procedures that actively decide which test samples, supports, or updates are worth using under budget, reliability, or latency constraints (Gui et al., 2024).

1. Formal definition and scope

The canonical ATTA formulation starts from a source-pretrained model $f(x;\phi)$ with test-time parameters initialized as $\theta(0)=\phi$. At time $t$, the model receives a streaming target mini-batch $U_{te}(t)$, selects a labeled subset $D_{te}(t)=ActAlg(U_{te}(t))$, accumulates queried labels into $D_{tr}(t)$, and updates online under a total labeling budget $\mathcal B$. The paper that introduced ATTA writes the objective as

$$\theta(t)^* := \operatorname*{argmin}_{\theta(t)} \left( \mathbb{E}_{(x,y,t)\in D_{tr}(t)}[\ell_{CE}(f(x;\theta(t)), y)] + \mathbb{E}_{(x,t)\in U_{te}(t)}[\ell_U(f(x;\theta(t)))] \right),$$

thereby coupling a supervised loss on queried target labels with an unsupervised loss on the current unlabeled stream (Gui et al., 2024).

This setting differs from standard TTA because labels may be queried during deployment; from classical active learning because adaptation is immediate, streaming, and source-free; and from ADA because no pre-collected target dataset or source-data access is assumed at test time. The same distinction reappears across later task-specific variants. In semantic segmentation, ATASeg queries a few pixel labels per incoming test image and updates after exactly one gradient step per image (Yuan et al., 2023). In medical promptable segmentation, EviATTA queries only a sparse set of pixels and converts them into point prompts for a medical SAM (Chen et al., 15 Mar 2026). In VLM-oriented streaming setups, TAPS uses one test sample at a time, requiring an immediate query decision under bounded memory and latency constraints (Sarkar et al., 26 Jul 2025).

A recurring source of ambiguity is that “active” is used in more than one sense. Some methods query human labels, as in SimATTA, BiTTA, TAPS, ATASeg, EATTA, EviATTA, and CPATTA. Others are active only in the sense of selective adaptation over unlabeled test data: EATA actively selects reliable and non-redundant samples for entropy minimization (Niu et al., 2022), while Ramen actively retrieves a customized support set of previously seen unlabeled samples for each incoming query in mixed-domain VLM streams (Bao et al., 23 Apr 2026). This broader usage is well established in the literature, but it should not be conflated with annotation-based ATTA.

2. Theoretical rationale and the role of limited supervision

ATTA was motivated by the observation that unsupervised TTA objectives, especially entropy minimization, are often adequate only for relatively mild shifts. The original ATTA paper formalizes this with domain-adaptation-style bounds based on $\mathcal H\Delta\mathcal H$-distance. Its Theorem 1 bounds target error by the best achievable target-domain error, cross-domain discrepancy terms, finite-sample terms, and ideal joint-hypothesis terms; Theorem 2 then shows that once nontrivial labeled target mass exists, there exists a weighting $\bm w$ such that the target-domain upper bound is strictly tighter than the no-label TTA case. In effect, limited labeled test samples can provably improve over pure unsupervised FTTA (Gui et al., 2024).

The same paper also addresses catastrophic forgetting through sample-entropy balancing. Low-entropy samples under the frozen source model are treated as source-like and pseudo-labeled to form

$\theta(0)=\phi$0

while high-entropy samples are candidates for active querying. This yields a practical source–target tradeoff: high-entropy samples are more informative for target adaptation, whereas low-entropy samples stabilize source retention. The associated corollaries show that if the pseudo-source set is closer to the true source than the accumulated target stream is, then the source-domain error upper bound can also improve (Gui et al., 2024).

Later work sharpened the same diagnosis from a different angle. EATA argues that not all test samples contribute equally to model adaptation and introduces explicit reliability and redundancy criteria. A sample is reliable if its entropy is below a threshold $\theta(0)=\phi$1,

$\theta(0)=\phi$2

and non-redundant if its prediction differs sufficiently from an exponential moving average of prior predictions,

$\theta(0)=\phi$3

The final active score is $\theta(0)=\phi$4, and the selective entropy objective is regularized by a Fisher penalty to mitigate forgetting (Niu et al., 2022).

Together, these analyses establish the core ATTA intuition: deployment-time supervision is useful not merely because labels are valuable in the abstract, but because online domain shift creates a fragile optimization regime in which a few carefully chosen target labels, or carefully chosen unlabeled updates, can anchor the model and reduce self-reinforcing error.

3. Acquisition and update strategies

The algorithmic design space of ATTA is largely defined by what is considered the “active” decision variable. Some methods actively choose which current test samples to label; others choose which previously seen unlabeled samples to reuse; still others decide which current samples should trigger any adaptation at all.

Method	Active decision variable	Supervision used
SimATTA	high-entropy target anchors plus low-entropy pseudo-source balance	queried class labels + pseudo-labels
TAPS	immediate query decision for each single test sample	oracle class labels + replay buffer
EATTA	one most valuable sample per batch via feature perturbation	one class label per batch or fewer
CPATTA	least-certain samples to humans, most-certain samples to pseudo-labels	human labels + model labels
Ramen	query-conditioned support retrieval from memory	unlabeled cached samples and gradients
EATA	selective entropy updates on reliable, non-redundant samples	unlabeled only

SimATTA, the first explicit ATTA algorithm, queries high-entropy samples and pseudo-labels low-entropy source-like samples, then uses incremental clustering to avoid redundant queries in streaming data. Its online loop maintains $\theta(0)=\phi$5 for low-entropy pseudo-source samples and $\theta(0)=\phi$6 for oracle-labeled high-entropy anchors, with weights $\theta(0)=\phi$7 derived from their proportions. The update is a weighted cross-entropy over both sets, and cluster capacity $\theta(0)=\phi$8 grows over time to absorb new target regions (Gui et al., 2024).

TAPS shifts the setting to single-sample, real-time VLM deployment. For each incoming sample $\theta(0)=\phi$9, it computes a TPT-style multi-view entropy $t$0, compares it to a dynamic threshold

$t$1

uses a warm-up rule $t$2 for $t$3, and switches $t$4 according to the running query ratio so as to stay near a target annotation budget. Queried samples are stored in a bounded labeled buffer with class-balanced, loss-aware replacement, and prompt parameters are updated with

$t$5

The same paper gives a concentration-style argument that the empirical query ratio stabilizes around the desired budget under an idealized Gaussian uncertainty model (Sarkar et al., 26 Jul 2025).

EATTA targets the opposite extreme of annotation scarcity. It selects at most one sample per batch, motivated by a single-step optimization perspective: samples near the source–target boundary are considered most learnable in one update. Its acquisition score is the change in pseudo-label confidence under feature perturbation,

$t$6

with $t$7. The paper then balances the supervised and unsupervised objectives using gradient-norm-based weights

$t$8

$t$9

with EMA smoothing over time. This is expressly designed for long streams where even “a few labels per batch” become expensive (Wang et al., 18 Mar 2025).

CPATTA replaces heuristic uncertainty with conformal prediction. It defines a smoothed conformal score

$U_{te}(t)$0

sorts labels by this score, and uses the top-$U_{te}(t)$1 certainty

$U_{te}(t)$2

as its acquisition signal. The least-certain samples under the real-time conformal predictor go to humans, while the most-certain samples under the pretrained conformal predictor are pseudo-labeled. CPATTA further uses pseudo coverage,

$U_{te}(t)$3

to drive an online weight-update rule for conformal recalibration under non-exchangeable target streams, and updates the model in two stages: first on human labels, then on pseudo-labels (Shi et al., 30 Sep 2025).

Ramen widens the meaning of ATTA by making the active variable the support set rather than the label query. For each incoming CLIP sample $U_{te}(t)$4, it computes an image embedding $U_{te}(t)$5, prediction $U_{te}(t)$6, pseudo-label $U_{te}(t)$7, and entropy gradient $U_{te}(t)$8, inserts $U_{te}(t)$9 into a class-split FIFO memory, retrieves a support set

$D_{te}(t)=ActAlg(U_{te}(t))$0

and adapts only normalization-layer affine parameters using the cached support gradients

$D_{te}(t)=ActAlg(U_{te}(t))$1

The update is episodic per sample and the model is reset after inference; what persists is the memory, not the adapted weights (Bao et al., 23 Apr 2026).

4. Supervision bandwidth and task-specific ATTA variants

A defining feature of ATTA is that the annotation channel itself is a design variable. Later work broadened the field from full class labels to binary correctness signals, sparse pixel clicks, and promptable point supervision.

BiTTA introduces “test-time adaptation with binary feedback,” in which the oracle does not provide the true class for queried samples, but only whether the model’s current prediction is correct: $D_{te}(t)=ActAlg(U_{te}(t))$2 It treats $D_{te}(t)=ActAlg(U_{te}(t))$3 as a state, the predicted label as an action, and the predictive distribution as a policy estimated via MC-dropout,

$D_{te}(t)=ActAlg(U_{te}(t))$4

The queried set is the $D_{te}(t)=ActAlg(U_{te}(t))$5 least-confident samples in a batch according to $D_{te}(t)=ActAlg(U_{te}(t))$6, while the remaining batch contributes via agreement-based self-adaptation: $D_{te}(t)=ActAlg(U_{te}(t))$7 In the reported main setting, only $D_{te}(t)=ActAlg(U_{te}(t))$8 samples are queried per batch of 64, yet the paper reports $D_{te}(t)=ActAlg(U_{te}(t))$9 points average improvement over state-of-the-art baselines and strong gains on CIFAR10-C, CIFAR100-C, Tiny-ImageNet-C, and PACS (Lee et al., 24 May 2025).

ATASeg transposes ATTA to semantic segmentation. Each incoming image $D_{tr}(t)$0 receives a pixelwise prediction $D_{tr}(t)$1, a label annotator selects the top $D_{tr}(t)$2 pixels, and the model updates once using sparse cross-entropy plus unsupervised regularizers. In ATASeg-B0,

$D_{tr}(t)$3

while ATASeg-B1 adds a horizontally flipped view, a second sparse CE term, and a consistency term. The paper’s signature result is that even one clicked pixel per image surpasses prior SOTA unsupervised TTA on ACDC CTTA by about $D_{tr}(t)$4 average mIoU, and with 16 clicks ATASeg-B1-BvSB reaches $D_{tr}(t)$5 versus $D_{tr}(t)$6 for DAT and ViDA, nearly matching its fully supervised online counterpart at $D_{tr}(t)$7 (Yuan et al., 2023).

EviATTA brings ATTA to medical SAMs. It models per-pixel beliefs with a Dirichlet distribution whose parameters are $D_{tr}(t)$8, then decomposes predictive uncertainty into

$D_{tr}(t)$9

$\mathcal B$0

$\mathcal B$1

Image-wise average distribution uncertainty selects which samples to annotate, while distance-aware data uncertainty selects which pixels to annotate inside each sample. Sparse pixel labels are appended as point prompts, and the adaptation objective combines progressive prompt consistency, replay consistency, and variational feature consistency: $\mathcal B$2 Only LoRA modules in the image encoder are updated. Across six medical segmentation datasets, EviATTA consistently outperforms both TTA and prior ATTA baselines under both batch-wise and instance-wise settings, with the paper reporting an average Dice gain of $\mathcal B$3 over zero-shot and $\mathcal B$4 over the second-best ATTA method in the instance-wise regime (Chen et al., 15 Mar 2026).

These variants show that ATTA is not defined by a single annotation format. The supervision unit can be a class label, a correctness bit, a pixel click, a point prompt, or even, in broader selective-TTA formulations, an unlabeled support set.

5. Efficiency, stability, and auxiliary mechanisms

ATTA is fundamentally a budgeted online learning problem, so annotation efficiency is only one part of the story. Compute, stability, effective sample size, and failure detection are equally central.

A major empirical diagnosis comes from FATA, which is not itself an ATTA method in the narrow sense but is explicitly positioned as a sample-efficiency booster for selective TTA. On ImageNet-C, using the entropy threshold recommended by EATA/SAR selects only 11.85% of samples, and 64.0% of classes are sampled fewer than five times. FATA therefore augments an intermediate feature tensor rather than the image, using a target-adaptive normalization perturbation

$\mathcal B$5

and a pseudo-label consistency loss

$\mathcal B$6

Because it reuses whatever parameters the base TTA method already updates, it is orthogonal to the selection rule. This makes it directly relevant to ATTA when queried or confidence-approved samples are sparse (Cho et al., 2024).

A second supporting line of work concerns monitoring. AETTA does not query labels, but estimates current batchwise error via prediction disagreement with dropout inferences,

$\mathcal B$7

then corrects it with an entropy-based skewness factor

$\mathcal B$8

The method reports an average of $\mathcal B$9 points more accurate estimation than its baselines and uses this estimate to trigger resets, which improve collapse-prone methods such as TENT and EATA. In ATTA systems, this kind of signal can gate when to adapt, when to query, or when to recover (Lee et al., 2024).

A third consideration is compute-aware evaluation. The online-evaluation paper on TTA under computational time constraints introduces relative adaptation speed

$$\theta(t)^* := \operatorname*{argmin}_{\theta(t)} \left( \mathbb{E}_{(x,y,t)\in D_{tr}(t)}[\ell_{CE}(f(x;\theta(t)), y)] + \mathbb{E}_{(x,t)\in U_{te}(t)}[\ell_U(f(x;\theta(t)))] \right),$$0

and permits adaptation only when $$\theta(t)^* := \operatorname*{argmin}_{\theta(t)} \left( \mathbb{E}_{(x,y,t)\in D_{tr}(t)}[\ell_{CE}(f(x;\theta(t)), y)] + \mathbb{E}_{(x,t)\in U_{te}(t)}[\ell_U(f(x;\theta(t)))] \right),$$1. This penalizes slow methods by reducing their adaptation opportunities on a constant-speed stream. The resulting rankings change sharply: methods such as SHOT can overtake more sophisticated but slower approaches, and augmentation-heavy procedures can collapse toward source-model performance. For ATTA, this implies that active querying, selection, and update policies must be evaluated jointly with their latency overhead, because costly decisions consume future adaptation opportunities (Alfarra et al., 2023).

Finally, stability mechanisms matter because ATTA often operates on tiny effective batches. EATA addresses this with entropy- and diversity-based sample selection plus a Fisher regularizer (Niu et al., 2022); LATTA, although non-active, adds a Langevin perturbation and EMA anchor to stabilize entropy-minimization TTA under small batches and challenging corruptions (Vejendla, 7 Oct 2025). This suggests that active selection alone is insufficient; the optimization dynamics of sparse updates must also be controlled.

6. Broader landscape, misconceptions, and open directions

ATTA now spans a spectrum from label-querying methods to unlabeled selective adaptation. A common misconception is that any online TTA method is “active.” The literature itself is more careful. FATA is described as highly relevant to ATTA but “not an ATTA method in the narrow sense” (Cho et al., 2024). Open-world TTA with HLN and AAN is similarly relevant as an OOD-aware front end for filtering harmful samples, but it has no query budget or annotation loop (Liu et al., 16 Nov 2025). AR-TTA studies realistic continual TTA under temporal correlation, source replay, and dynamic BN interpolation, yet remains fully unsupervised at deployment (Sójka et al., 2023). AcTTA, despite its acronym, denotes activation-aware rather than active test-time adaptation and focuses on adapting activation functions rather than selecting samples or labels (Kim et al., 27 Mar 2026).

A second misconception is that ATTA is synonymous with full-label querying. BiTTA shows that the supervision channel itself can be weakened to binary correctness while retaining strong gains (Lee et al., 24 May 2025). ATASeg and EviATTA show that in dense prediction, the annotation unit can be a few pixels or point prompts rather than a full mask (Yuan et al., 2023). TAPS and EATTA show that one query per sample or one label per batch can already be effective when the acquisition policy is matched to the online optimization regime (Sarkar et al., 26 Jul 2025).

Across this literature, several recurring constraints emerge. Annotation remains costly or delayed, even when reduced to binary or sparse-point feedback. Pseudo-labels are still used pervasively, so source-model quality and calibration remain bottlenecks. Memory and compute constraints are not secondary details but part of the problem definition: TAPS relies on bounded replay memory (Sarkar et al., 26 Jul 2025), Ramen trades GPU memory for retrieval-time efficiency via an embedding-gradient cache (Bao et al., 23 Apr 2026), and CPATTA depends on a source-domain calibration set and adaptive conformal weighting rather than exact exchangeability (Shi et al., 30 Sep 2025). Several papers also leave class-incremental or open-world label-space expansion largely unresolved.

The field’s current trajectory suggests two converging interpretations of ATTA. In the narrow formulation, ATTA is source-free online adaptation with a limited test-time annotation budget, as formalized by SimATTA and extended by BiTTA, TAPS, EATTA, ATASeg, EviATTA, and CPATTA (Gui et al., 2024). In the broader selective-TTA formulation, ATTA also includes methods that actively decide which unlabeled test samples, supports, or updates are worth trusting, as in EATA and Ramen (Niu et al., 2022). A plausible implication is that future systems will combine both: active label acquisition, active support retrieval, explicit OOD filtering, sample-efficiency boosters such as feature augmentation, and batchwise reliability monitors, all under realistic compute-aware online evaluation.