Active Test-Time Sample Query

Updated 11 July 2026

Active test-time sample query is a paradigm where each input triggers a targeted optimization loop, such as latent vector updates or label verification.
It encompasses techniques like SLOT, QueST, and AdaRewriter that refine queries and embeddings via sample-specific adjustments during inference.
These methods enhance deployment by efficiently allocating compute and human feedback to improve prediction accuracy under resource constraints.

Searching arXiv for the cited works to ground the article in papers. Active test-time sample query denotes a family of inference-time procedures in which an incoming sample, query, or test batch is not treated as a passive input to a fixed model. Instead, the system actively spends additional computation, requests labels or verifier feedback, or optimizes sample-specific variables before producing the final output. In recent work, this pattern appears as sample-specific hidden-state optimization in LLMs, query-embedding refinement in multimodal retrieval, verifier-gated self-training, active labeling in streaming test-time adaptation, and pool-level adaptive allocation of compute across unresolved test queries (Hu et al., 18 May 2025, Moradi et al., 26 May 2025, Sarkar et al., 26 Jul 2025, Zuo et al., 22 Apr 2026).

1. Conceptual scope and taxonomy

Recent papers use closely related mechanisms under different names, but they share a common operational structure: a test input triggers an auxiliary decision or optimization loop that is specific to that input or to the current test stream. The “query” can therefore mean a natural-language prompt, a retrieval query, an image in a streaming domain-shift setting, a small set of unresolved test questions, or even a pixel subset within a segmentation map. The adaptation variable can be a temporary vector, a LoRA adapter update, a refined embedding, a selected support set, or a queried human label.

Mode	Core action at test time	Representative papers
Sample-specific optimization	Optimize temporary latent or PEFT parameters for one query	SLOT (Hu et al., 18 May 2025), QueST (Song et al., 13 May 2026)
Guided query refinement	Update a query embedding using another retriever’s scores	GQR (Uzan et al., 6 Oct 2025)
Verifier-driven selection	Generate multiple candidates, score them, then train or select	VDS-TTT (Moradi et al., 26 May 2025), AdaRewriter (2506.01381)
Human-in-the-loop adaptation	Query an oracle for selected test samples under a budget	HILTTA (Li et al., 2024), TAPS (Sarkar et al., 26 Jul 2025), CPATTA (Shi et al., 30 Sep 2025)
Open-world / dense prediction querying	Select images or pixels for annotation during deployment	SegAssist (Sreenivas et al., 27 Aug 2025), ATASeg (Yuan et al., 2023), EATTA (Wang et al., 18 Mar 2025)
Pool-level compute allocation	Reallocate inference compute across unresolved queries	Adaptive Test-Time Compute Allocation (Zuo et al., 22 Apr 2026)

Taken together, these works suggest that active test-time sample query is not a single algorithmic family but a deployment-time design principle: use the current sample, or the current test pool, to decide where adaptation effort should be spent.

2. Sample-specific optimization in LLMs

A central line of work performs explicit optimization for each query. SLOT introduces a sample-specific additive vector $\delta \in \mathbb{R}^{1 \times d}$ that is added to the final hidden layer before the LM head, $H' = H + \delta$ , and optimizes $\delta$ at inference time by minimizing next-token cross-entropy on the prompt itself while keeping model weights frozen (Hu et al., 18 May 2025). Because $\delta$ is inserted only at the final hidden layer, SLOT caches the final hidden features and performs per-step forward/backward only through the LM head. The method is therefore parameter-efficient, with only $O(d)$ temporary parameters per prompt, and ephemeral: $\delta$ is discarded after the response is generated.

The empirical motivation is instruction underfitting at the per-prompt level. The paper reports that Qwen2.5-7B with SLOT improves GSM8K accuracy from 57.54% to 66.19%, and that DeepSeek-R1-Distill-Llama-70B with SLOT reaches 68.69% on GPQA among open-source ~70B models (Hu et al., 18 May 2025). The same paper also reports modest overhead on Qwen2.5-7B over GSM8K, from 161.49 s without SLOT to 174.32 s with 5 optimization iterations on a V100. This establishes a concrete form of active test-time sample query in which the query itself induces a temporary optimization problem.

QueST generalizes the same idea from latent optimization to query-conditioned self-training. For each test query $q$ , it generates a query-conditioned synthetic dataset $\mathcal{D}(q) = \{(x_i,y_i)\}_{i=1}^N$ of structurally related problem–solution pairs and then performs LoRA-based test-time optimization on that synthetic supervision before answering the original query (Song et al., 13 May 2026). The adaptation is therefore still per-query and reset between queries, but the supervision is no longer generic input perplexity; it is derived from the query’s latent structure. The paper reports consistent gains over TENT and TLM across seven mathematical reasoning benchmarks and GPQA-Diamond, including Qwen3-4B rising from 32.32 to 51.01 on GPQA-Diamond (Song et al., 13 May 2026). A notable ablation shows that query-conditioning itself is the main driver: on MATH500 with Qwen3-4B-Base, self-QA without query conditioning yields 58.00, adding LoRA gives 58.80, query-conditioning without LoRA gives 66.60, and full QueST reaches 68.60 (Song et al., 13 May 2026).

VDS-TTT occupies a related but distinct point in the design space. For each incoming query, the model generates $N$ candidate responses, scores them with a verifier, selects the highest-confidence response above threshold $\tau$ , and performs LoRA-based test-time training on that selected pseudo-labeled example (Moradi et al., 26 May 2025). Unlike SLOT and QueST, the learned LoRA state accumulates across future queries rather than being discarded immediately, so the method combines per-query active selection with continuous self-improvement. The paper reports “up to a 32.29% relative improvement over the base model” and a “6.66% gain compared to verifier-based methods without test-time training,” with thresholds such as $H' = H + \delta$ 0 on GSM8K and Math-500 and $H' = H + \delta$ 1 on AIME (Moradi et al., 26 May 2025). This suggests a second major template for active test-time sample query: select only those self-generated test-time samples that are trustworthy enough to update on.

In retrieval, the “query” is often optimized directly rather than through model parameters. GQR treats each visual-document retrieval query as a test-time optimization variable. It takes a primary retriever $H' = H + \delta$ 2 and a complementary retriever $H' = H + \delta$ 3, forms a candidate pool $H' = H + \delta$ 4 from the union of both top- $H' = H + \delta$ 5 lists, converts both scorers into distributions over $H' = H + \delta$ 6, and iteratively updates the primary query embedding $H' = H + \delta$ 7 by minimizing a KL divergence between the primary distribution and the average consensus distribution (Uzan et al., 6 Oct 2025). The update is

$H' = H + \delta$ 8

Model parameters remain frozen; only the query representation moves.

The paper evaluates this on ViDoRe 1 and ViDoRe 2, with $H' = H + \delta$ 9 and $\delta$ 0, and reports that Colnomic-7B with GQR plus Linq reaches NDCG@5 $\delta$ 1 at $\delta$ 2 ms per query, compared with Llama-Nemo base at $\delta$ 3 and $\delta$ 4 ms per query; it also reports memory per document page of $\delta$ 5 MB for Colnomic + Linq versus $\delta$ 6 MB for Llama-Nemo (Uzan et al., 6 Oct 2025). The substantive point is that a test-time query update can substitute for a much larger fixed retriever.

AdaRewriter applies the same principle to conversational query reformulation rather than visual retrieval. It samples $\delta$ 7 reformulation candidates for a conversational search turn, scores each candidate with a lightweight reward model trained from retrieval outcomes, and selects the argmax candidate at inference time (2506.01381). The reward model is trained with a contrastive ranking loss over a fusion score

$\delta$ 8

where $\delta$ 9 and $\delta$ 0 are the gold-passage ranks under BM25 and ANCE. This yields an active test-time Best-of- $\delta$ 1 reformulation pipeline that is explicitly black-box compatible. On TopiOCQA with Llama3.1-8B and $\delta$ 2, the paper reports BM25 MRR 30.7 and NDCG@3 28.8 for AdaRewriter, compared with 24.5 and 22.6 for LLM4CS; on dense retrieval it reports MRR 40.3 and NDCG@3 39.7 on the same dataset (2506.01381).

These retrieval papers clarify that active test-time sample query need not involve gradient updates on model weights. It may instead optimize or select among query representations, retrieval candidates, or reformulations in a way that is still per-query, online, and outcome-driven.

4. Human-in-the-loop active labeling for streaming adaptation

A second major branch uses explicit oracle labels during deployment. SimATTA formalizes Active Test-Time Adaptation (ATTA) as a setting in which a source-pretrained model receives streaming target batches, actively queries some test samples for labels under a budget, and combines supervised cross-entropy on the queried samples with unsupervised loss on the unlabeled remainder (Gui et al., 2024). Its sample entropy balancing uses high-entropy samples as informative target examples and low-entropy samples as source-like anchors to mitigate catastrophic forgetting. The same paper provides a learning-theoretic analysis based on $\delta$ 3-distance and motivates the use of limited labeled test instances as a principled extension of fully unsupervised TTA.

HILTTA sharpens this human-in-the-loop picture by observing that labeled test samples serve a dual role: they are both supervised training data and a validation set for hyper-parameter or model selection (Li et al., 2024). It therefore combines active sample selection with model selection. The paper introduces K-Margin, which uses uncertainty-weighted features

$\delta$ 4

and runs greedy K-center selection in that space. It then uses labeled samples to select among TTA hyper-parameters with normalized cross-entropy, anchor deviation, and EMA smoothing. On TENT, with about 3% labels, it reports 58.35% error on ImageNet-C versus a best fixed TENT hyper-parameter at 62.96%, and 15.87% on CIFAR10-C versus 18.14% for best fixed TENT (Li et al., 2024). The paper therefore reframes active test-time sample query as a bi-objective problem: informative labeling plus robust deployment-time model selection.

TAPS pushes this scenario into a strict streaming regime in which only one test sample arrives at a time, the query decision must be made immediately, and prompt parameters must be updated with a single gradient step per sample (Sarkar et al., 26 Jul 2025). It uses augmentation-based entropy to score uncertainty, a dynamic entropy threshold

$\delta$ 5

with budget-aware switching between $\delta$ 6 and $\delta$ 7, a class-balanced replacement strategy for the finite labeled buffer, and class-aware distribution alignment. The paper reports consistent gains over prompt-based TTA baselines while maintaining average latency of about 0.63 s per sample at maximum buffer size, compared with about 0.41 s for PromptAlign (Sarkar et al., 26 Jul 2025). Here the active query is a binary real-time decision on each sample, constrained jointly by latency, memory, and a long-run query-rate target.

CPATTA replaces heuristic uncertainty with conformal prediction under domain shift. It defines smoothed conformal inclusion scores

$\delta$ 8

and a top- $\delta$ 9 certainty

$O(d)$ 0

then uses the real-time conformal predictor to choose samples for human labeling and the pretrained conformal predictor to choose safe pseudo-labeled samples (Shi et al., 30 Sep 2025). It also introduces pseudo coverage, adaptive weight updates, a domain-shift detector, and a staged update scheme that separates human-labeled and model-labeled losses. On PACS with $O(d)$ 1, the paper reports 75.26% real-time accuracy and 87.13% post-adaptation accuracy, compared with 65.99% and 77.85% for SimATTA; on VLCS with $O(d)$ 2, it reports 64.96% real-time and 77.72% post-adaptation accuracy (Shi et al., 30 Sep 2025).

Open-world and dense-prediction settings extend the same logic. SegAssist addresses Incremental Test Time Adaptation for VLMs when unseen classes appear during deployment (Sreenivas et al., 27 Aug 2025). It first finds uncertain samples using MSP or entropy, then computes CLIP-based patch segmentation over top- $O(d)$ 3 predicted labels plus an explicit background class, and queries only those uncertain samples with background ratio

$O(d)$ 4

above a high threshold. This uses local evidence, rather than global uncertainty alone, to prioritize unseen-class discovery.

ATASeg applies active querying to semantic segmentation by selecting up to $O(d)$ 5 pixels per test image, querying their labels, and updating the model online with supervised and unsupervised losses (Yuan et al., 2023). Its best variant, ATASeg-B1-BvSB, reaches 67.0% average mIoU on ACDC CTTA, versus 61.1% for DAT or ViDA and 68.0% for its supervised counterpart; the paper also states that even one click for labeling surpasses known SOTA TTA methods by 2.6% average mIoU on ACDC (Yuan et al., 2023).

EATTA studies the extreme-budget regime of at most one annotated sample per batch (Wang et al., 18 Mar 2025). It scores samples by the perturbation-induced change in confidence on the current pseudo-label,

$O(d)$ 6

interpreting large changes as evidence that the sample lies near the border between source and target distributions. It then balances supervised and unsupervised gradients using dynamic weights

$O(d)$ 7

On ImageNet-C CTTA with ResNet-50 BN and one label per batch, EATTA reports 53.8% error versus 60.6% for the random-label baseline and 54.8% for SimATTA with three labels per batch and buffer 300 (Wang et al., 18 Mar 2025).

5. Pool-level allocation, theory, and statistical formulations

Some papers treat the active object not as a single sample but as a set of unresolved test queries. “Adaptive Test-Time Compute Allocation with Evolving In-Context Demonstrations” begins with a warm-up stage that identifies easy questions and stores solved question–answer pairs from the test set itself, then concentrates later rounds on unresolved questions while conditioning each generation on semantically related solved examples (Zuo et al., 22 Apr 2026). The active set shrinks as questions are solved, and the effective generation distribution changes from $O(d)$ 8 to $O(d)$ 9. The paper reports that, on GPQA-Diamond with Gemini-2.5-flash-lite thinking, Elim uses 6,263,081 total tokens whereas the adaptive method uses 4,771,551 while achieving higher coverage (Zuo et al., 22 Apr 2026). This is a pool-level version of active test-time sample query: allocate more inference budget only where it still matters.

The theoretical paper on test-time scaling sharpens the distinction between passive repeated sampling and genuinely active feedback-driven strategies. It proves that self-consistency needs $\delta$ 0 samples, whereas best-of- $\delta$ 1 needs only $\delta$ 2 when $\delta$ 3 is the probability gap between the correct and second-most-likely answers (Huang et al., 5 Jun 2025). It then shows that self-correction with verifier feedback allows Transformers to simulate online learning over a pool of experts at test time, with a regret bound

$\delta$ 4

This provides a representation-theoretic account of why active feedback loops are strictly more expressive than i.i.d. repeated sampling.

A statistical analogue appears in “Active Sequential Two-Sample Testing,” which studies a setting where features are cheap but group labels are expensive (Li et al., 2023). The method sequentially chooses which unlabeled features to query, updates a probabilistic classifier only with uniformly queried labels, and constructs a likelihood-ratio statistic

$\delta$ 5

The paper proves an anytime-valid $\delta$ 6-value under $\delta$ 7 and shows that labeling “high-dependency” features improves testing power by increasing the effective mutual information between feature and label variables (Li et al., 2023). This is a particularly clean formalization of active test-time sample query as budgeted, sequential information acquisition.

6. Empirical patterns, limitations, and outlook

Across these papers, several empirical regularities recur. First, active test-time procedures are most beneficial when the base model is strong globally but underfit locally: strict reasoning templates, structurally novel math problems, mixed-domain streams, text-heavy visual retrieval, or open-world class discovery all create settings in which fixed parameters or fixed prompts leave exploitable slack (Hu et al., 18 May 2025, Sreenivas et al., 27 Aug 2025). Second, the extra signal used at test time matters more than raw compute alone. Verifier-guided or reward-guided selection in VDS-TTT and AdaRewriter improves over naïve Best-of- $\delta$ 8; similarity-based evolving ICL improves over random demonstrations; conformal uncertainty improves over heuristic entropy; perturbation-sensitive sample choice improves over random or margin-based ATTA (Moradi et al., 26 May 2025, 2506.01381, Zuo et al., 22 Apr 2026, Shi et al., 30 Sep 2025, Wang et al., 18 Mar 2025).

The same literature also delineates the main failure modes. Prompt-likelihood optimization may overfit stylistic quirks or degrade on some tasks, as SLOT’s occasional benchmark regressions indicate (Hu et al., 18 May 2025). Verifier-driven methods depend on verifier calibration and may not transfer outside domains such as mathematics (Moradi et al., 26 May 2025). Retrieval refinement can underperform when the complementary retriever is noisy or when the candidate pool already contains nearly all relevant documents (Uzan et al., 6 Oct 2025). Human-in-the-loop methods remain constrained by annotation cost, latency, and small-batch instability; CPATTA explicitly addresses calibration drift, while TAPS, HILTTA, and EATTA each address different aspects of budget efficiency and stability (Sarkar et al., 26 Jul 2025, Li et al., 2024, Wang et al., 18 Mar 2025, Shi et al., 30 Sep 2025). Open-world methods such as SegAssist can miss unseen classes that are semantically too close to seen classes, because local evidence may no longer appear “background-dominant” (Sreenivas et al., 27 Aug 2025).

A plausible implication is that active test-time sample query is emerging as a unifying deployment paradigm rather than a niche technique. The core question is always the same: given limited inference-time resources—gradient steps, human labels, verifier calls, retrieved supports, or extra generations—which test instances should receive them, and how should the resulting information be integrated? The recent arXiv record suggests that the strongest answers couple a sample-specific acquisition policy with a tightly matched update rule: optimize a temporary vector for the current prompt, refine a query embedding against a complementary score distribution, request labels only for the least conformal or most border-sensitive samples, or devote additional rounds only to unresolved queries. In that sense, active test-time sample query marks a shift from static inference toward deployment-time decision-making as a first-class algorithmic object.