A Metacognitive Framework for Test-Time Adaptation: Taxonomy and Research Challenges
- 1 Northeastern University
- 2 Pathfinder Applied Research, LLC
AAAI 2026 Fall Symposium on Artificial Metacognition (METACOG-26), Top 3 paper

In short Test-time adaptation loses accuracy when the model updates on images from classes it never saw in training, which entropy cannot detect. Treating adaptation as metacognition, we classify twenty methods and show that a gate built on the model's internal concepts keeps accuracy stable.
Abstract
In Test-Time Adaptation, when out-of-distribution samples interleave unpredictably with corrupted in-distribution samples, adaptation without corrective measures is prone to significant performance decrease. Existing protocols rely on unreliable cues (e.g., predictive entropy) which are unable to distinguish corrupted in-distribution data from semantically novel open-set samples. To address this issue, we formalize Test-Time Adaptation through a two-level metacognitive framework that decouples task execution from control, facilitating a unified taxonomy that categorizes existing Test-Time Adaptation protocols across three core axes, i.e., which knowledge is monitored, which part of the models are targeted for adaptation, and how adaptation occurs. We provide evidence that robust corrective measures in Test-Time Adaptation require monitoring grounded in structured internal representations to reliably estimate model competence. Lastly, we frame monitoring as a resource-allocation problem, examine neuromorphic substrates for bounded self-regulation, and outline key open challenges.
Consider a classifier deployed on a camera recording a street. The model was trained on images captured in summer; by December, lighting, foliage and road surfaces have all changed, yet the street contains the same objects it did in July. The distribution of inputs has shifted with the environment, so the model may be less accurate than it was in the summer. This is covariate shift. The model should adapt to it by re-learning to be confident on its predictions in this new environment. Other inputs should never drive adaptation. Objects that belong to none of the model's classes, a cracked lens, a tampered feed, and an adversarial patch placed in the scene are all signals the update should ignore.
Test-Time Adaptation (TTA) addresses the first case by updating the model on the unlabeled samples it observes after deployment, most commonly by minimizing the entropy of its own predictions. This works as long as the test stream only contains covariate-shifted in-distribution (ID) data. Once out-of-distribution (OOD) samples are interleaved with it,1Wild TTA, in the terms of Niu et al. (2023): OOD samples arrive at an unknown, changing rate. unconditional adaptation trains the model on inputs it has no correct answer for, degrading performance. In our view, successful TTA needs a good monitoring signal, i.e., one able to tell apart the "good" samples, which the update should use, and the "bad" ones, which it should skip. Unconditional adaptation is brittle, whereas a more elaborate monitor allows the model to update itself selectively. We found the framework to build such a monitor in cognitive psychology.
Feeling of Rightness in adaptation

Cognitive psychology uses the term metacognition (Flavell, 1979) for supervising a cognitive process, i.e., watching and steering it without carrying it out. Nelson and Narens (1990) formalize it as a two-level architecture: (i) an object level performs the task and (ii) a meta level keeps a model of the object level, observes its state, and sends it control signals that change its behavior. TTA fits this lens naturally. Specifically, the network is the object level. The adaptation procedure is the meta level, deciding at each step whether and how the network should be updated. By looking at TTA through this framing, we can take inspiration from cognitive psychology to improve the meta level, and thus the overall performance of the system.
Most current protocols monitor the object level through its outputs, using cues such as predictive entropy, confidence margins or free energy, where a low-entropy prediction is taken to be a correct one. These cues estimate what psychologists call the Feeling of Rightness (Thompson, 2009), the sense of correctness induced by the fluent completion of a task, and are comparable to the experience-based cues described by Koriat (1997), which take effortless processing as a proxy for accuracy. As in humans, fluency can be high even when the answer is wrong. Under distribution shift, networks become overconfident (Guo et al., 2017), so an image of something never seen during training can still receive a confident prediction. Most adaptation protocols strengthen this confidence to adapt without true labels, which is the case in any realistic deployment. The model's overconfidence can therefore start a feedback loop of self-reinforcement, in which the model adapts to its own mistakes.
The same literature further separates automatic monitoring, which relies on fast, experience-based cues such as fluency, from deliberate monitoring, which relies on a deeper inspection of the object level (Shea et al., 2014). Entropy, which can be thought of as the scalar measure of a predictive distribution's "confidence" is an automatic cue. TTA protocols that rely only on automatic cues are therefore brittle, like a person who judges mostly by instinct. Our position is that the next generation of TTA protocols should add deliberate cues, which are more reliable and less prone to overconfidence, to the automatic ones. The next sections describe a deliberate cue based on concept-based interpretability and show how it can be used to improve TTA.
Correctness and competence
We split metacognitive monitoring in two. Correctness monitoring asks whether a given prediction is wrong, whereas competence monitoring asks whether the input lies inside what the model was built to handle. A familiar scene in fog is within the model's competence, even if the prediction turns out to be wrong. An object from a class the model never learned is outside of it, however confident the prediction is.
What each monitor measures
AUROC from 0.5 (chance) to 1. Ring: correctness. Ball: competence.
Data table
| Monitor | Correctness | Competence |
|---|---|---|
| Entropy | 0.85 | 0.61 |
| Class prototypes (OWTTT) | 0.86 | 0.94 |
| Concept residual (FACE) | 0.82 | 0.91 |
Table 3 of the paper, mean of 15 seeds.
Entropy is a good correctness signal, but a poor competence signal. To measure this, we employ a ResNet-34 pretrained on ImageNet, using Imagenette, a 10-class subsample of ImageNet, as ID data, and NINCO, a dataset curated to share no classes with ImageNet, as OOD data. We degrade both with the same corruptions (Gaussian noise, defocus blur, fog and contrast), so that a monitor cannot reach a high AUROC merely by spotting the corruption. Measured by AUROC, where 1.0 is perfect monitoring and 0.5 is chance, entropy reaches 0.85 as a correctness monitor but only 0.61 as a competence monitor.
This was expected, since the two notions are similar. Entropy remains a good baseline adaptation loss. Competence is what OOD gating requires, so entropy must be supplemented to work as a gate.
Measuring the monitor in this way is itself one of the proposals of the paper. TTA protocols are evaluated by the accuracy of the adapted model, which conflates the quality of the monitor with that of the network and of the update rule. As such, we propose evaluating the meta level separately, through metrics derived from Signal Detection Theory as used in metacognition research (Fleming and Lau, 2014): metacognitive sensitivity, i.e., how well the monitor's confidence tracks correct predictions; semantic discrimination, i.e., how well it separates ID from OOD data; and corruption sensitivity, i.e., how strongly it responds to covariate shift.
A taxonomy of twenty methods
To compare protocols, we write the metacognitive loop as one update rule, with a variable for each decision a TTA protocol makes: which samples enter the update and with what weight, which parameters are adapted, how large the step is, when to roll the weights back toward the source model, and when to abstain. Each protocol then corresponds to one instantiation of this rule. We categorize twenty protocols2BN-Adapt, Tent, MEMO, CoTTA, RDumb, EATA, SAR, SoTTA, NOTE, RoTTA, DeYO, OWTTT, PeTTA, ROID, LAME, REM, MECTA, GALA, PALM, and LAW. along three axes, i.e., which knowledge is monitored, what part of the model is adapted, and how adaptation is regulated.
The taxonomy shows a few patterns. Deliberate knowledge, e.g., teacher networks or consistency across augmented views, is mostly allocated to loss construction and seldom to the decision of which samples to update on. That decision still relies on single-pass forward scores, or on state summaries that drift together with the model, resulting in a circular self-reinforcement of the model's biases. Adaptation loci remain largely static, and the few protocols that select them at run time do so through heuristics such as gradient statistics, which ignore what the representations encode. Lastly, abstention is rarely exercised.3Answering "none of the above" instead of naming a class.
A deliberate cue from concepts
To build a deliberate cue, we turn to concept-based interpretability. Concept extraction techniques such as CRAFT (Fel et al., 2023) and FACE (Bhusal et al., 2025) learn a compact dictionary of concepts from the model's internal activations on ID data, such that the features of a familiar image can be approximated as a nonnegative combination of those concepts. We fit the dictionary on the last-layer features of 2,000 Imagenette images. At test time, we reconstruct the features of each incoming sample through the dictionary, and use the normalized reconstruction residual, i.e., the fraction of the features left unexplained, as our cue. A corrupted ID image leaves some residual. An OOD image under the same corruption leaves more, as the concepts required to explain it are missing from the dictionary.
Two properties make the residual a suitable competence cue. First, it is independent of the labels predicted by the model. Second, it is computed on the frozen source network against a dictionary fixed before deployment, so that its reference does not drift as the model adapts.
On semantic discrimination, the concept residual reaches 0.91 with either dictionary, against 0.61 for entropy. It is a weaker correctness monitor than entropy (0.82 against 0.85), consistent with the distinction between the two kinds of monitoring.

Deliberate cues as test-time gates
We then use each cue as a gate. The network is adapted with Tent (Wang et al., 2021), which minimizes entropy over the affine normalization parameters, and only the samples whose score passes the gate's threshold enter the update. The threshold is estimated online from the scores observed in previous batches.4As in Li et al. (2023): the split that minimizes the variance within each group. We compare no gate, an entropy gate, our concept-residual gate, and the class-prototype distance of OWTTT (Li et al., 2023), an existing open-world TTA protocol, together with a perfect filter that uses the true ID/OOD label of every sample as an upper bound.
OOD samples let into the update
Share admitted by each gate when 80% of the stream is OOD.
- Entropy gate
- Concept residual gate
Data table
| Corruption | Entropy | Residual |
|---|---|---|
| Gaussian noise | 51% | 23% |
| Defocus blur | 55% | 35% |
| Fog | 54% | 4% |
| Contrast | 57% | 3% |
Table 7 of the paper, mean of 15 seeds.
With 80% of the stream made of OOD samples, the entropy gate admits between 51% and 57% of them for adaptation, depending on the corruption. The residual gate admits 23% under Gaussian noise and 35% under defocus blur, and less than 4% under fog and contrast. After 200 adaptation steps under Gaussian noise at this contamination rate, ID accuracy is 0.52 without a gate, 0.57 with entropy, 0.68 with the concept residual, 0.72 with prototypes and 0.80 with the perfect filter, against 0.39 for the unadapted model.
Accuracy over a long run
ID accuracy over 2,000 steps, Gaussian noise, 60% of the stream OOD.
- Concept residual
- Entropy
- Class prototypes
Data table
| Step | Concept residual | Entropy | Class prototypes | Perfect filter |
|---|---|---|---|---|
| 200 | 0.755 | 0.730 | 0.779 | 0.823 |
| 400 | 0.774 | 0.690 | 0.794 | 0.851 |
| 600 | 0.765 | 0.608 | 0.795 | 0.857 |
| 800 | 0.755 | 0.530 | 0.788 | 0.860 |
| 1,000 | 0.751 | 0.488 | 0.789 | 0.860 |
| 1,200 | 0.749 | 0.471 | 0.791 | 0.860 |
| 1,400 | 0.745 | 0.461 | 0.790 | 0.861 |
| 1,600 | 0.740 | 0.439 | 0.789 | 0.862 |
| 1,800 | 0.741 | 0.433 | 0.790 | 0.861 |
| 2,000 | 0.739 | 0.412 | 0.789 | 0.861 |
Table 5 of the paper, mean of 10 seeds.
The gap widens over longer horizons. The table below reports ID accuracy over 2,000 steps under Gaussian noise, with 60% of the stream contaminated (mean over 10 seeds).
| Gate | Step 200 | Step 1,000 | Step 2,000 |
|---|---|---|---|
| None | 0.671 | 0.474 | 0.369 |
| Entropy | 0.730 | 0.488 | 0.412 |
| Concept residual (ours) | 0.755 | 0.751 | 0.739 |
| Class prototypes (OWTTT) | 0.779 | 0.789 | 0.789 |
| Perfect filter | 0.823 | 0.860 | 0.861 |
Ungated and entropy-gated adaptation decay monotonically. By step 2,000 they have fallen back to around 0.39, the accuracy of the unadapted model. Both deliberate gates hold steady across the full horizon.
Why self-monitoring matters for safe online adaptation
A model that updates itself after deployment runs without a supervisor to check the updates. In Wild TTA, a practical question is therefore when the model's own predictions are reliable enough to adapt on, as well as how to adapt. This is a question about self-monitoring in neural networks, i.e., about a model's estimate of its own competence, and it is where out-of-distribution detection, open-world test-time adaptation and selective prediction (abstaining on inputs the model cannot answer) meet. Our measurements show why a confidence-based monitor is a weak place to start: with 80% of the stream made of OOD samples, the entropy gate still lets roughly half of them through, whereas the concept-based competence check lets through between under 4% and 35%, depending on the corruption.
Any perception system that runs on a long, unlabeled stream could face this problem, for instance roadside cameras, inspection lines, or the perception stack of a vehicle. For such systems, we see safe online adaptation as depending on two things: a monitor that separates "a familiar scene seen through fog" from "something the model has never learned", and a record of why each update was accepted. The concept residual is a first step in that direction. The interpretability argument above explains why we think the second requirement is as important as the first.
The taxonomy also points to open questions. Deliberate cues are mostly used to build the loss and seldom to choose which samples to adapt on, the loci of adaptation are rarely chosen from semantic content, and abstention is seldom used. Combining a competence signal with those decisions, i.e., which samples, which parameters, when to roll back and when to abstain, is a natural next step for self-monitoring adaptation. Deliberate inspection also costs latency, memory and energy at every step, so deciding when to use it is itself a design problem that the framework makes explicit.
Limitations
The concept-based component of this work is preliminary. OWTTT's prototypes outperform our residual throughout the long-horizon run (0.79 against 0.74 at step 2,000), as well as in semantic discrimination (0.94 against 0.91). Both deliberate gates also cost accuracy when there is nothing to filter. On uncontaminated streams they end two to five points below ungated adaptation under each of the four corruptions, as they reject part of the corrupted ID samples. Lastly, our experiments cover one failure case of the street camera example, semantically novel objects. Physical damage or tampering with the camera is a separate problem that the paper does not evaluate.
However, unlike a prototype distance, the concept residual is interpretable. Since it derives from a decomposition over concepts that can be visualized as image crops, it allows us to quantify which concepts explain a given sample and how much of it remains unexplained, and thus why the gate admitted or rejected it. As shown in Figure 3, and further in the appendix of the paper, OOD images tend to retrieve semantically unrelated concepts that share structural qualities, such as texture or material.
Gating adaptation on an interpretable signal makes each adaptation decision explainable, so practitioners can verify the semantic rationale behind each update. Interpretability of a monitoring signal is particularly important in safety-critical applications and applies beyond Test-Time Adaptation. For instance, being able to tell a human operator which part of the input drove the model toward a specific decision is an important requirement for deploying autonomous systems such as self-driving cars. We believe the field should build more algorithms that combine interpretability with adaptation. The metacognitive framing of TTA can give a way to design and evaluate them.
At METACOG-26
We presented this work at METACOG-26, the AAAI 2026 Fall Symposium on Artificial Metacognition, where it received a Top 3 Paper award. At the same symposium we also presented a metacognitive perspective on anomaly detection, which reads anomaly detection through the same two levels. The code for our experiments is available on GitHub. Read the full paper at the top of this page for the full taxonomy of adaptation algorithms and the remaining results.
References
- Dipkamal Bhusal, Michael Clifford, Sara Rampazzi, and Nidhi Rastogi (2025). FACE: Faithful Automatic Concept Extraction. The Thirty-ninth Annual Conference on Neural Information Processing Systems (NeurIPS 2025).
- Julian Bitterwolf, Maximilian Müller, and Matthias Hein (2023). In or Out? Fixing ImageNet Out-of-Distribution Detection Evaluation. Proceedings of the 40th International Conference on Machine Learning (PMLR 202).
- Thomas Fel, Agustin Picard, Louis Béthune, Thibaut Boissin, David Vigouroux, Julien Colin, et al. (2023). CRAFT: Concept Recursive Activation FacTorization for Explainability. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2023.
- John H. Flavell (1979). Metacognition and cognitive monitoring: A new area of cognitive-developmental inquiry. American Psychologist 34(10).
- Stephen M. Fleming and Hakwan C. Lau (2014). How to measure metacognition. Frontiers in Human Neuroscience 8.
- Chuan Guo, Geoff Pleiss, Yu Sun, and Kilian Q. Weinberger (2017). On Calibration of Modern Neural Networks. Proceedings of the 34th International Conference on Machine Learning (PMLR 70).
- Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun (2016). Deep Residual Learning for Image Recognition. 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).
- Asher Koriat (1997). Monitoring one's own knowledge during study: A cue-utilization approach to judgments of learning. Journal of Experimental Psychology: General 126(4).
- Yushu Li, Xun Xu, Yongyi Su, and Kui Jia (2023). On the Robustness of Open-World Test-Time Training: Self-Training with Dynamic Prototype Expansion. 2023 IEEE/CVF International Conference on Computer Vision (ICCV).
- Thomas O. Nelson and Louis Narens (1990). Metamemory: A Theoretical Framework and New Findings. Psychology of Learning and Motivation, vol. 26.
- Shuaicheng Niu, Jiaxiang Wu, Yifan Zhang, Zhiquan Wen, Yaofo Chen, Peilin Zhao, et al. (2023). Towards Stable Test-time Adaptation in Dynamic Wild World. The Eleventh International Conference on Learning Representations (ICLR 2023). arXiv
- Nicholas Shea, Annika Boldt, Dan Bang, Nick Yeung, Cecilia Heyes, and Chris D. Frith (2014). Supra-personal cognitive control and metacognition. Trends in Cognitive Sciences 18(4).
- Valerie A. Thompson (2009). Dual-process theories: A metacognitive perspective. In Two Minds: Dual Processes and Beyond (Oxford University Press).
- Dequan Wang, Evan Shelhamer, Shaoteng Liu, Bruno Olshausen, and Trevor Darrell (2021). Tent: Fully Test-Time Adaptation by Entropy Minimization. International Conference on Learning Representations (ICLR 2021). arXiv
Cite
@article{Loi_2026, title={A Metacognitive Framework for Test-Time Adaptation: Taxonomy and Research Challenges}, volume={10}, ISSN={2994-4317}, url={http://dx.doi.org/10.1609/aaaiss.v10i1.43402}, DOI={10.1609/aaaiss.v10i1.43402}, number={1}, journal={Proceedings of the AAAI Symposium Series}, publisher={Association for the Advancement of Artificial Intelligence (AAAI)}, author={Loi, Dario and Onorato, Gabriele and Coviello, Antonella and Rifat, Shahriar and Bastian, Nathaniel D. and Restuccia, Francesco}, year={2026}, month=Nov, pages={147--162} }