SCATR: Calibrated Ranking & Tracking

• SCATR is an acronym for two distinct methods: one boosting LLM test-time ranking and another improving LiDAR tracking via corrective assignment strategies.
• The LLM variant uses hidden state features and a small MLP scorer trained on a calibration set to replace weak token-probability heuristics.
• The LiDAR variant employs Second Chance Assignment and Track Query Dropout to mitigate new instance suppression and reduce tracking errors.

Searching arXiv for SCATR to ground the article in the current literature. {} SCATR is an acronym used by two unrelated 2026 arXiv papers. In LLM inference, SCaTR denotes “Simple Calibrated Test-Time Ranking”, a lightweight Best-of-$N$ ranking method for test-time scaling that learns a small scorer from hidden representations on a calibration set (Shyamal et al., 16 Apr 2026). In LiDAR multi-object tracking, SCATR denotes “Mitigating New Instance Suppression in LiDAR-based Tracking-by-Attention via Second Chance Assignment and Track Query Dropout”, a tracking-by-attention framework whose central contributions are the training-time mechanisms Second Chance Assignment and Track Query Dropout (Cheong et al., 2 Mar 2026). The shared acronym masks substantial differences in problem setting, architecture, and evaluation, but in both cases the name refers to methods designed to improve selection under constrained supervision rather than to introduce wholly new foundation architectures.

1. Disambiguation and nomenclature

The two SCATR papers address distinct domains.

SCATR variant	Expansion	Domain
SCaTR	Simple Calibrated Test-Time Ranking	LLM test-time scaling and Best-of-$N$ selection
SCATR	Mitigating New Instance Suppression in LiDAR-based Tracking-by-Attention via Second Chance Assignment and Track Query Dropout	LiDAR-based tracking-by-attention

The first paper studies parallel test-time scaling for LLMs, where multiple candidate responses $y_1,\dots,y_N \sim M(\cdot \mid x)$ are generated and a scoring function selects the final output via $y^\star = \arg\max_{j=1,\dots,N} f(y_j)$ (Shyamal et al., 16 Apr 2026). Its premise is that learned scorers such as process reward models can be strong but are expensive, whereas token-log-probability heuristics are cheap but often substantially worse.

The second paper studies LiDAR-based tracking-by-attention (TBA) for 3D multi-object tracking, contrasting it with tracking-by-detection pipelines. Its diagnosis is that LiDAR TBA methods suffer from new instance suppression, in which proposal queries become under-confident at detecting newly appearing objects after the first frame because supervision becomes dominated by track continuation (Cheong et al., 2 Mar 2026).

A plausible implication is that the two works share only a high-level design philosophy: both attempt to correct a specific failure mode by introducing lightweight, targeted mechanisms into an existing inference or training pipeline rather than replacing the underlying model class.

2. SCaTR for Best-of-$N$ ranking in LLMs

SCaTR for LLMs is a BoN ranking method that uses the base model’s hidden representations, specifically the penultimate layer’s hidden state at the final non-padding token, as features for a tiny MLP scorer trained on a small calibration set of model-generated responses labeled as correct or incorrect (Shyamal et al., 16 Apr 2026). For each candidate $y_j$, the method extracts an embedding $\mathbf{e}_{ij}$, computes a score $s_{ij} = f_\theta(\mathbf{e}_{ij}) \in [0,1]$, and selects the candidate with the highest score.

The construction is explicitly tied to a domain-specific automatic evaluator $\mathcal{E}:\mathcal{X}\times\mathcal{Y}\to\{0,1\}$, with correctness labels

$r_{ij} = \mathcal{E}(x_i, y_{ij}) \in \{0,1\}.$

For coding, $N$0 if the program passes all test cases; for math, $N$1 if the final answer is correct. The calibration set is

$N$2

The scoring function is a small $N$3-layer MLP

$N$4

with

$N$5

where $N$6 is ReLU and $N$7 is sigmoid. Typical hidden layer sizes are $N$8, $N$9, $y_1,\dots,y_N \sim M(\cdot \mid x)$0, and $y_1,\dots,y_N \sim M(\cdot \mid x)$1. The paper characterizes this as effectively a logistic regression / binary classifier on hidden states with a small non-linear head.

Training uses weighted binary cross-entropy

$y_1,\dots,y_N \sim M(\cdot \mid x)$2

with $y_1,\dots,y_N \sim M(\cdot \mid x)$3, the ratio of negative to positive training examples. The paper states that there is no separate calibration technique like Platt scaling or isotonic regression; the MLP itself is the calibrated classifier.

At inference time, the method is a drop-in replacement for confidence heuristics in BoN. For free-form tasks such as code, selection is standard BoN. For single-answer math tasks, SCaTR can be combined with weighted majority voting over distinct final answers: $y_1,\dots,y_N \sim M(\cdot \mid x)$4

This design is motivated by the claim that the internal states of LLMs carry rich information beyond logits, while avoiding the cost structure of large process reward models.

3. Calibration protocol, baselines, and empirical profile of SCaTR

For each model–domain pair, SCaTR uses a small calibration set drawn from the target domain, with multiple sampled rollouts per prompt and automatic labels. In the reported experiments, coding calibration datasets are HumanEval (164 problems) and a 1k subset of KodCode; math calibration datasets are MATH‑500 (500 problems) and AIME 2024 and 2025 (30 problems each) (Shyamal et al., 16 Apr 2026). The protocol uses a 75/25 split at the problem level into training and validation, random search over ~100 configurations, Adam with gradient clipping, ReduceLROnPlateau (factor 0.5, patience 3), and early stopping with patience 10, max 100 epochs. One scorer is trained per base model and domain.

The baselines comprise four classes: random selection; confidence-based heuristics from token probabilities and logits; LoRA fine-tuning of a “yes/no” correctness classifier on the same calibration data; and process reward models, specifically ReasonFlux‑PRM‑1.5B and ReasonFlux‑7B, trained on OpenThoughts (114k examples of math and code CoT). The token-level metrics include full-sequence confidence $y_1,\dots,y_N \sim M(\cdot \mid x)$5, tail confidence $y_1,\dots,y_N \sim M(\cdot \mid x)$6, group-based bottom-10% confidence $y_1,\dots,y_N \sim M(\cdot \mid x)$7, lowest group confidence $y_1,\dots,y_N \sim M(\cdot \mid x)$8, median log-prob, variance of log-probs, probability gap, and Shannon entropy.

The reported results emphasize both accuracy and efficiency. Across coding and math benchmarks, SCaTR improves over the strongest confidence-based baseline by up to ~9% accuracy. On code, gains of up to 6.1 points over the best confidence heuristic are reported, and SCaTR often matches or exceeds LoRA; for GPT‑OSS‑20B, the paper reports HumanEval: SCaTR 93.2 vs LoRA 92.3 and KodCode: SCaTR 86.8 vs LoRA 85.2. On math with Qwen‑30B-A3B, SCaTR reports AIME: 42.4 vs best confidence 33.3 (+9.1) and MATH‑500: 91.3 vs best confidence 85.0 (+6.3). Against ReasonFlux‑1.5B with Qwen‑2.5‑14B rollouts, the paper reports AIME24: 18.5 vs 17.8, AIME25: 21.6 vs 14.4, and MATH‑500: 80.4 vs 79.2.

The efficiency claims are equally central. The SCaTR scorer is reported to have $y_1,\dots,y_N \sim M(\cdot \mid x)$9M parameters or, elsewhere in the paper’s summary, 2–7 million typical total parameters, versus 1.5B–7B for PRMs and LoRA adaptation on 1.7B–20B base models. The paper reports up to 700–8000× fewer trainable parameters than LoRA or PRMs, training up to 150× faster than LoRA fine-tuning, and inference up to 1000× faster than PRMs and several hundred times faster than LoRA selectors. One concrete example is GPT‑OSS‑20B on MATH‑500, where LoRA requires ~616 ms per inference call for selection and SCaTR requires ~0.2 ms per call, described as ≈3500× speedup, with similar or slightly better accuracy.

The evaluation spans Qwen3‑1.7B, OLMo‑2‑7B, Qwen2.5‑14B‑Instruct, GPT‑OSS‑20B, and Qwen3‑30B‑A3B. Default BoN uses $y^\star = \arg\max_{j=1,\dots,N} f(y_j)$0 rollouts per prompt, with additional experiments at $y^\star = \arg\max_{j=1,\dots,N} f(y_j)$1. The paper states that SCaTR’s accuracy generally increases with more rollouts and consistently surpasses confidence heuristics, LoRA, and PRMs on code; in some math settings performance can plateau or slightly degrade for weaker base models.

The paper’s stated limitations are that the method requires access to hidden states, is evaluated only in a single-turn setting, and is calibrated per model and per domain, so domain shift may hurt performance. It also states that ReasonFlux‑7B still outperforms SCaTR on some math datasets when absolute peak performance is prioritized over compute.

4. SCATR for LiDAR-based tracking-by-attention

The LiDAR SCATR paper studies 3D multi-object tracking from LiDAR streams within the tracking-by-attention paradigm, where track queries are propagated across frames and proposal queries detect new instances (Cheong et al., 2 Mar 2026). Its central diagnosis is that LiDAR TBA frameworks inherently suffer from high false negative errors because proposal queries receive very few positive assignments after the first frame, producing new instance suppression.

The framework follows a standard LiDAR TBA pipeline with a voxel-based LiDAR backbone and BEV head (SECOND-based, following FocalFormer3D) frozen during SCATR training, 900 anchor boxes in BEV from k-means clustering on training boxes, and a two-stage temporal transformer decoder. The detection decoder has one transformer-decoder layer and operates on proposal queries only; the track decoder has 5 layers and consumes the concatenation of top‑$y^\star = \arg\max_{j=1,\dots,N} f(y_j)$2 proposal queries and propagated track queries. After decoding, the top‑$y^\star = \arg\max_{j=1,\dots,N} f(y_j)$3 queries by classification score are propagated as track queries to the next frame.

The method’s two stated core innovations are Second Chance Assignment (SCA) and Track Query Dropout (TQD). Both are described as architecture-agnostic training strategies. SCA modifies assignment; TQD modifies the composition of propagated track query sets during training.

In standard DETR-like TBA, Hungarian assignment first aligns track queries to ground-truth objects that were present in previous frames, and remaining ground truths are then matched only to proposal queries. Unassigned track queries are typically supervised as “no object.” SCATR changes the newborn assignment step. After continuation matching, if $y^\star = \arg\max_{j=1,\dots,N} f(y_j)$4 denotes unassigned track queries and $y^\star = \arg\max_{j=1,\dots,N} f(y_j)$5 denotes remaining ground-truth objects, SCATR forms the augmented candidate pool

$y^\star = \arg\max_{j=1,\dots,N} f(y_j)$6

and runs Hungarian matching between $y^\star = \arg\max_{j=1,\dots,N} f(y_j)$7 and $y^\star = \arg\max_{j=1,\dots,N} f(y_j)$8 using the same matching cost. This allows either a proposal query or an unassigned track query to initialize a newborn track.

The matching cost is defined as

$y^\star = \arg\max_{j=1,\dots,N} f(y_j)$9

The overall loss is DETR-style,

$N$0

or, when multiple groups are present,

$N$1

Track Query Dropout is a training-only augmentation over track queries. The default configuration uses 2 groups during most of training: a default group formed by the top $N$2 track queries by confidence, and an auxiliary group formed by randomly sampling $N$3 queries from the entire track query set before top-$N$4 selection. These groups are stacked along batch dimension during self-attention so they do not interact and can be processed in parallel. The paper states that TQD is inspired by Group-DETR but tailored for temporal tracking, and that it is disabled in the last 17.5k iterations of a 70k-iteration training run.

The implementation is built on MMDetection3D and Sparse4Dv3, uses AdamW, cyclic LR and momentum, and trains on 4 × V100 GPUs with batch size 24. Each training scene is split into clips of up to 10 annotated frames. At inference, there is no Track Query Dropout, only a single track query group is used, and the paper describes a standard two-stage TBA forward path without the training-time SCA borrowing mechanism.

5. Benchmarks, quantitative results, and ablations in LiDAR SCATR

The LiDAR experiments are conducted on nuScenes, with train 700, val 150, test 150 scenes, 2 Hz, evaluating mAP for detection and AMOTA, AMOTP, FP, FN, and IDS for tracking (Cheong et al., 2 Mar 2026).

On nuScenes test, the reported baselines include CenterPoint+SimpleTrack: AMOTA 0.668, mAP 0.580, FocalFormer-L+SimpleTrack: AMOTA 0.715, AMOTP 0.549, FN 21142, FP 16760, IDS 888, mAP 0.687, MotionTrack-L: AMOTA 0.51, and JDT3D: AMOTA 0.574, AMOTP 0.837, FP 11152, FN 29919, IDS 254. SCATR reports AMOTA 0.650, AMOTP 0.622, FP 14035, FN 22073, IDS 253, mAP 0.641, corresponding to +7.6% AMOTA vs JDT3D and a large reduction in false negatives.

On nuScenes val, CenterPoint+SimpleTrack reports AMOTA 0.687, mAP 0.564, FN 19941, IDS 519; JDT3D reports AMOTA 0.622, mAP 0.399, IDS 203. SCATR reports AMOTA 0.688, AMOTP 0.609, FP 10850, FN 17556, IDS 163, and mAP 0.645. The paper emphasizes +6.6% AMOTA and +24.6% mAP relative to JDT3D, as well as 26% fewer FNs. It also notes that SCATR has the lowest FP, lowest FN, and lowest IDS among the compared validation results in that table.

The ablation study isolates the roles of SCA and TQD. With no SCA and no TQD, the reported values are mAP 0.587, AMOTA 0.575, AMOTP 0.696, FP 11403, FN 26490, IDS 1448, NB Conf 0.214, Trk Conf 0.425. With SCA only, the paper reports mAP 0.641, AMOTA 0.677, AMOTP 0.609, FP ~11348, FN 17331, IDS 165, NB Conf 0.291, Trk Conf 0.549. With TQD only, the results are mAP 0.585, AMOTA 0.570, AMOTP 0.717, FP 12135, FN 26403, IDS 1395, NB Conf 0.214, Trk Conf 0.420. With SCA + TQD (one dropout group), the paper reports mAP 0.645, AMOTA 0.688, AMOTP 0.609, FP 10850, FN 17556, IDS 163, NB Conf 0.305, Trk Conf 0.560. With SCA + 2 dropout groups, it reports mAP 0.648, AMOTA 0.703, AMOTP 0.607, FP 11534, FN 17579, IDS 241.

These ablations support the paper’s interpretation that SCA is the core contributor, while TQD is only beneficial when SCA is used. The reported increases in NB Conf and Trk Conf are presented as evidence that new instance suppression is alleviated. The paper also reports a camera-only port, SCATR-C, where SCA and TQD similarly improve mAP and AMOTA and reduce FP, FN, and IDS, suggesting the training strategies generalize beyond LiDAR.

A further comparison between SCATR trained as a pure detector + SimpleTrack and full SCATR TBA yields a nuanced result. The pure detector configuration reports mAP 0.652, AMOTA 0.702, and track-query recall 0.177, whereas the full TBA configuration reports mAP 0.645, AMOTA 0.688, and track-query recall 0.996. The paper interprets this as evidence that the TBA version sacrifices some detection-only performance while substantially improving identity consistency, particularly through a large reduction in IDS.

The reported runtime is 2.9 Hz on a single Tesla V100 on nuScenes, described as near-real-time but slower than many tracking-by-detection pipelines.

6. Comparative perspective, misconceptions, and significance

The two SCATR papers are unrelated in application area, but both are examples of targeted corrective mechanisms embedded into existing pipelines rather than wholesale architectural replacement. In the LLM paper, the correction is to replace weak token-level confidence heuristics with a lightweight scorer on hidden states; in the LiDAR paper, the correction is to alter assignment and propagated query supervision to counteract a structural training failure mode (Shyamal et al., 16 Apr 2026, Cheong et al., 2 Mar 2026).

A common misconception would be to interpret the LLM SCaTR as a generic reward model. The paper is more specific: it trains one scorer per base model and domain, uses a small calibration set, and relies on penultimate-layer final-token embeddings rather than chain-of-thought step supervision. The paper itself contrasts this with large PRMs and presents the method as a strong accuracy–efficiency trade-off, not as a replacement for all reward modeling regimes.

A corresponding misconception in the LiDAR setting would be to view SCATR primarily as a new backbone or decoder architecture. The paper explicitly frames Second Chance Assignment and Track Query Dropout as architecture-agnostic training strategies. The backbone is frozen, and the main claim is that the longstanding LiDAR TBA deficit relative to TBD is driven substantially by training-time supervision imbalance and assignment design rather than solely by representational weakness.

Another plausible implication is that both papers reflect a broader methodological pattern: when a baseline pipeline already computes a rich latent state, substantial gains may be obtainable by modifying selection, assignment, or calibration on top of those states. In the LLM case, the latent state is the penultimate hidden representation; in the LiDAR case, it is the evolving set of track and proposal queries within a DETR-like decoder. That implication is consistent with the reported results, but the two papers do not propose a shared general theory.

In summary, “SCATR” is not a single method family. It names two separate 2026 contributions: one on simple calibrated test-time ranking for Best-of-$N$5 LLM selection, and one on mitigating new instance suppression in LiDAR tracking-by-attention through Second Chance Assignment and Track Query Dropout. Both are notable for showing that carefully targeted calibration or assignment changes can close a substantial portion of the gap between cheap heuristics and heavier learned systems.