Dynamic Anchor Selection (DAS)

• DAS is an adaptive framework that selects anchors based on local geometry, data distribution, and task context to optimize performance.
• It spans diverse domains including localization, object detection, video segmentation, and generative models, where anchors are treated as optimization variables.
• DAS employs methodologies like empirical error minimization, adaptive thresholding, regression-aware scoring, and policy optimization to meet specific task constraints.

Dynamic Anchor Selection (DAS) denotes a family of adaptive mechanisms that replace fixed anchors with anchors chosen, generated, or weighted as a function of local geometry, data distribution, temporal state, or task context. Across recent work, the anchor object varies widely: it can be a subset of UWB anchor pairs in TDOA localization, a set of positive training anchors in object detection, a query vector in video segmentation, an anchor line in rail detection, a prompt token in CLIP adaptation, a structural delimiter in diffusion LLM infilling, a cluster exemplar in generalized category discovery, or a subset of Gaussians in streaming reconstruction. The unifying principle is that anchor choice is treated as an optimization variable rather than a static heuristic, typically with the goal of reducing localization error, improving assignment quality, stabilizing training, or satisfying compute and format constraints (Kolakowski, 2024, Zhang et al., 2019, Zhou et al., 2024, Dahal et al., 18 Mar 2026).

1. Scope of the concept across research domains

In the cited literature, DAS does not refer to one canonical algorithm. It is instead a recurring design pattern in which a downstream estimator or learner is conditioned on anchors that are selected adaptively rather than prescribed a priori. The adaptive signal may come from calibration error, confidence statistics, density, clustering structure, contextual activation, reinforcement-learning reward, or a model’s own generation confidence (Kolakowski et al., 2024, 2012.04150, Zhang et al., 18 Oct 2025, Peng et al., 15 Dec 2025).

Domain	Anchor object	Selection target
UWB TDOA localization	Anchor pairs or anchor subsets	RMSE, doorway transition cost, LOS/NLOS-aware feasibility
Object detection and tracking	Training anchors, sparse anchors, query anchors	Positive/negative assignment, localization potential, emergence/disappearance handling
Structured generation and prompt learning	Prompt anchors, end anchors, anchor tokens	Stability–plasticity balance, format compliance, task adaptation
Open-world learning and erasure	Cluster exemplars, semantic anchors	Hard pseudo-label purity, erasure robustness, boundary preservation
4D Gaussian streaming	Anchor budget and Gaussian subset	PSNR–runtime trade-off

This breadth matters because it prevents an overly narrow reading of the term. In some papers, “dynamic” means per-image or per-object training-time assignment; in others it means per-zone runtime switching, per-epoch exemplar refresh, or sequential policy selection under a budget. A plausible implication is that DAS is best understood as an optimization schema over anchor choice rather than as a specific architectural primitive.

2. Core mathematical patterns

Although the domains differ, the mathematical structure of DAS is usually one of a few recurring forms. One common form is empirical error minimization over a candidate pool. In the UWB RMSE-based formulation, for each zone $z$ and candidate anchor-pair set $S$, the calibration objective is

$$\mathrm{RMSE}_{z}(S) = \sqrt{\frac{1}{K_z}\sum_{k\in \mathrm{zone}\ z} \|\hat p_{S,k} - p_{\mathrm{ref},k}\|^2},$$

followed by the selection rule $S^\star_z=\arg\min_S \mathrm{RMSE}_z(S)$ (Kolakowski, 2024). The doorway-based UWB variant uses a different calibration objective, the “door transition” cost,

$$\mathrm{Cost}(\mathrm{TDOA\;set})=\sum_{i=1}^n (h_i+v_i),$$

with separate minimizers for entering and exiting a zone (Kolakowski et al., 2024).

A second form is adaptive thresholding from local statistics. ATSS computes per-ground-truth IoU statistics on nearby anchors and defines a dynamic threshold

$t_i^k = \mu_i^k + \sigma_i^k,$

then marks as positive the candidate anchors whose IoU exceeds $t_i^k$ and whose centers fall inside the ground-truth box (Zhang et al., 2019). The anchor criterion is therefore not fixed globally, but estimated from the sample distribution induced by each object and feature-pyramid level.

A third form is regression-aware anchor quality scoring. Dynamic Anchor Learning defines the matching degree

$$\mathrm{md}(A)=\alpha\cdot sa + (1-\alpha)\cdot fa - u^\gamma,$$

where $sa$ is pre-regression IoU, $fa$ is post-regression IoU, and $S$0 is a regression-uncertainty penalty (2012.04150). Here DAS is neither pure geometry nor pure confidence; it is a composite quality functional designed to reduce the divergence between classification confidence and localization accuracy.

A fourth form is policy optimization over subsets and budgets. Efficient Gaussian Streaming models anchor choice as an action $S$1, where $S$2 is the anchor budget and $S$3 is the selected subset, and optimizes expected reward with REINFORCE under a quality–runtime trade-off (Dahal et al., 18 Mar 2026).

These formulations show that “anchor” is a role, not a datatype. The anchor may be a measurement pair, a box prior, a query, a prompt token, or a sampled primitive; what makes the method a DAS method is the adaptive selection mechanism tied to a downstream loss or utility.

3. UWB TDOA localization and zone-conditioned selection

The most literal use of DAS in the supplied literature appears in UWB TDOA indoor localization. In "Adaptive Anchor Pairs Selection in a TDOA-based System Through Robot Localization Error Minimization" (Kolakowski, 2024), the method is explicitly split into an off-line calibration phase and an on-line positioning phase. The coverage area is partitioned into non-overlapping zones, typically along natural room boundaries or corridors. During calibration, a six-wheeled robotic chassis (Dagu Wild Thumper 6WD) carrying a UWB tag on a 1.4 m pole and a Scanse Sweep LiDAR is driven through all zones. LiDAR scans are matched via GraphSLAM + ICP to produce a smooth reference trajectory with subdecimeter accuracy $S$4. For each timestamp and each candidate anchor-pair set, a Levenberg–Marquardt nonlinear least-squares solver estimates position from TDOA residuals, and the per-zone RMSE is computed against the LiDAR reference. With $S$5 anchors, there are $S$6 possible pairs, and the reported real experiment tested all combinations of $S$7 up to $S$8 pairs, with no anchor appearing in more than three pairs per set, yielding $S$9 candidate sets in the real experiment and $$\mathrm{RMSE}_{z}(S) = \sqrt{\frac{1}{K_z}\sum_{k\in \mathrm{zone}\ z} \|\hat p_{S,k} - p_{\mathrm{ref},k}\|^2},$$0 in simulation. Online, the latest position estimate identifies the current zone, the system switches to the corresponding preselected pair set, and an Unscented Kalman Filter fuses the LS pose, velocity models, and prior state. In a 5-zone simulated apartment with $$\mathrm{RMSE}_{z}(S) = \sqrt{\frac{1}{K_z}\sum_{k\in \mathrm{zone}\ z} \|\hat p_{S,k} - p_{\mathrm{ref},k}\|^2},$$1 anchors and $$\mathrm{RMSE}_{z}(S) = \sqrt{\frac{1}{K_z}\sum_{k\in \mathrm{zone}\ z} \|\hat p_{S,k} - p_{\mathrm{ref},k}\|^2},$$2, using a fixed set of 4 TDOA pairs across all zones yielded an 80th-percentile error of approximately $$\mathrm{RMSE}_{z}(S) = \sqrt{\frac{1}{K_z}\sum_{k\in \mathrm{zone}\ z} \|\hat p_{S,k} - p_{\mathrm{ref},k}\|^2},$$3 and maximum approximately $$\mathrm{RMSE}_{z}(S) = \sqrt{\frac{1}{K_z}\sum_{k\in \mathrm{zone}\ z} \|\hat p_{S,k} - p_{\mathrm{ref},k}\|^2},$$4, whereas DAS reduced these to approximately $$\mathrm{RMSE}_{z}(S) = \sqrt{\frac{1}{K_z}\sum_{k\in \mathrm{zone}\ z} \|\hat p_{S,k} - p_{\mathrm{ref},k}\|^2},$$5 and approximately $$\mathrm{RMSE}_{z}(S) = \sqrt{\frac{1}{K_z}\sum_{k\in \mathrm{zone}\ z} \|\hat p_{S,k} - p_{\mathrm{ref},k}\|^2},$$6. In the dynamic person-tracking experiment, DAS yielded a median trajectory error of approximately $$\mathrm{RMSE}_{z}(S) = \sqrt{\frac{1}{K_z}\sum_{k\in \mathrm{zone}\ z} \|\hat p_{S,k} - p_{\mathrm{ref},k}\|^2},$$7 and a 90th-percentile of approximately $$\mathrm{RMSE}_{z}(S) = \sqrt{\frac{1}{K_z}\sum_{k\in \mathrm{zone}\ z} \|\hat p_{S,k} - p_{\mathrm{ref},k}\|^2},$$8 (Kolakowski, 2024).

"Anchor Pair Selection in TDOA Positioning Systems by Door Transition Error Minimization" (Kolakowski et al., 2024) reframes the selection problem around doorway geometry rather than global zone RMSE. The floor-plan is overlaid with an occupancy-grid map with resolution around $$\mathrm{RMSE}_{z}(S) = \sqrt{\frac{1}{K_z}\sum_{k\in \mathrm{zone}\ z} \|\hat p_{S,k} - p_{\mathrm{ref},k}\|^2},$$9, and detected doors partition the free space into disjoint zones. A Single Shot Detector with RetinaNet backbone (ResNet-50 v1 FPN) is run on a $S^\star_z=\arg\min_S \mathrm{RMSE}_z(S)$0 occupancy-grid image to regress doorway bounding boxes, from which the midpoint $S^\star_z=\arg\min_S \mathrm{RMSE}_z(S)$1, orientation $S^\star_z=\arg\min_S \mathrm{RMSE}_z(S)$2, and half-width $S^\star_z=\arg\min_S \mathrm{RMSE}_z(S)$3 are recorded. The calibration prior is that a user crossing a doorway must lie on the door axis, and the selected anchor-pair set minimizes the accumulated off-axis and along-axis projection error at door crossings. The method determines anchor sets separately for entering and exiting each zone to account for body shadowing. In a $S^\star_z=\arg\min_S \mathrm{RMSE}_z(S)$4 furnished apartment with 6 UWB anchors and 1 body-worn tag, using DAS produced median trajectory error of approximately $S^\star_z=\arg\min_S \mathrm{RMSE}_z(S)$5, compared with approximately $S^\star_z=\arg\min_S \mathrm{RMSE}_z(S)$6 for a single static anchor-set baseline, corresponding to an improvement of approximately $S^\star_z=\arg\min_S \mathrm{RMSE}_z(S)$7 on average and approximately $S^\star_z=\arg\min_S \mathrm{RMSE}_z(S)$8–$S^\star_z=\arg\min_S \mathrm{RMSE}_z(S)$9 reduction in error (Kolakowski et al., 2024).

"Dynamic Anchor Selection and Real-Time Pose Prediction for Ultra-wideband Tagless Gate" (Choi et al., 2024) uses yet another criterion: LOS/NLOS classification from UWB channel impulse response and IMU data. Each anchor produces an eCIR vector of approximately 135 samples instead of the full 1,016-sample CIR, reducing USB latency from $$\mathrm{Cost}(\mathrm{TDOA\;set})=\sum_{i=1}^n (h_i+v_i),$$0 to $$\mathrm{Cost}(\mathrm{TDOA\;set})=\sum_{i=1}^n (h_i+v_i),$$1. A four-block Conv1D network with Instance Normalization, ReLU, Dropout(0.2), MaxPool1D, and an exponentially weighted moving average with $$\mathrm{Cost}(\mathrm{TDOA\;set})=\sum_{i=1}^n (h_i+v_i),$$2 performs binary LOS/NLOS classification, achieving end-to-end accuracy $$\mathrm{Cost}(\mathrm{TDOA\;set})=\sum_{i=1}^n (h_i+v_i),$$3. DAS then greedily searches anchor subsets of size 4, ordered by ascending predicted NLOS cost, subject to a convex-hull constraint that the previous mobile-device estimate lies inside the selected anchors. In a $$\mathrm{Cost}(\mathrm{TDOA\;set})=\sum_{i=1}^n (h_i+v_i),$$4 office with six anchors, the NLOS mean error fell from $$\mathrm{Cost}(\mathrm{TDOA\;set})=\sum_{i=1}^n (h_i+v_i),$$5 to $$\mathrm{Cost}(\mathrm{TDOA\;set})=\sum_{i=1}^n (h_i+v_i),$$6, reported as $$\mathrm{Cost}(\mathrm{TDOA\;set})=\sum_{i=1}^n (h_i+v_i),$$7 improvement, while LOS mean error improved from $$\mathrm{Cost}(\mathrm{TDOA\;set})=\sum_{i=1}^n (h_i+v_i),$$8 to $$\mathrm{Cost}(\mathrm{TDOA\;set})=\sum_{i=1}^n (h_i+v_i),$$9; the same system reports four-pose classification accuracy $t_i^k = \mu_i^k + \sigma_i^k,$0 on a Samsung Galaxy Note20 Ultra and Qorvo UWB board (Choi et al., 2024).

Taken together, these localization papers illustrate three distinct DAS logics: empirical per-zone calibration, geometry-constrained doorway calibration, and per-epoch channel-aware subset selection. The common outcome is that fixed anchor-pair sets are replaced by situationally preferable subsets.

4. Detection, segmentation, and geometry-aware vision anchors

In object detection, DAS often appears as adaptive sample assignment rather than explicit runtime subset switching. "Bridging the Gap Between Anchor-based and Anchor-free Detection via Adaptive Training Sample Selection" (Zhang et al., 2019) argues that the essential difference between anchor-based and anchor-free detectors is how positive and negative training samples are defined. ATSS selects the $t_i^k = \mu_i^k + \sigma_i^k,$1 anchors closest to each ground-truth center on each FPN level, computes the mean and standard deviation of their IoUs, and uses $t_i^k = \mu_i^k + \sigma_i^k,$2 as a dynamic threshold. On MS COCO, the reported RetinaNet baseline with GroupNorm, GIoU loss, and centerness improves from $t_i^k = \mu_i^k + \sigma_i^k,$3 AP to $t_i^k = \mu_i^k + \sigma_i^k,$4 AP with ATSS; the paper further reports test-dev results up to $t_i^k = \mu_i^k + \sigma_i^k,$5 AP with multi-scale test and no introduced overhead (Zhang et al., 2019). This formulation is historically important because it casts anchor adaptation as a label-assignment problem rather than a box-design problem.

For arbitrary-oriented detection, "Dynamic Anchor Learning for Arbitrary-Oriented Object Detection" (2012.04150) replaces IoU-only assignment with the matching degree that combines input IoU, output IoU, and a regression-uncertainty penalty. Positive anchors satisfy $t_i^k = \mu_i^k + \sigma_i^k,$6, with $t_i^k = \mu_i^k + \sigma_i^k,$7 in the paper, and the same matching degree also produces compensation weights in classification and regression losses. Reported gains include HRSC2016 AP$t_i^k = \mu_i^k + \sigma_i^k,$8 from $t_i^k = \mu_i^k + \sigma_i^k,$9 to $t_i^k$0, DOTA mAP from approximately $t_i^k$1 to approximately $t_i^k$2 on the R50 baseline, and Pascal VOC 2007 mAP from $t_i^k$3 to $t_i^k$4; the paper emphasizes that this occurs without extra inference cost and with only a few horizontal preset anchors (2012.04150).

In video segmentation, "DVIS-DAQ: Improving Video Segmentation via Dynamic Anchor Queries" (Zhou et al., 2024) generalizes the anchor notion from boxes to query states. A single static background query is replaced by dynamic anchor queries generated per candidate object, with separate mechanisms for emergence and disappearance. Emergence anchors use current-frame proposal features, while disappearance anchors use momentum-weighted historical appearance features and the closest initial segmenter query in cosine similarity. The method also introduces query-level object Emergence and Disappearance Simulation so that rare appearance events are synthesized without extra forward cost. The reported overhead is 2%, while OVIS val AP increases from $t_i^k$5 for the DVIS baseline to $t_i^k$6 with DAQ + ES + DS, and YouTube-VIS ’19 AP rises from $t_i^k$7 to $t_i^k$8 (Zhou et al., 2024).

Rail and lane detection provide a geometric reinterpretation. "DALNet: A Rail Detection Network Based on Dynamic Anchor Line" (Yu et al., 2023) uses an anchor line parameterized by $t_i^k$9 rather than a bounding box. A dynamic anchor line generator predicts a heatmap, offset map, and slope map from FPN level $$\mathrm{md}(A)=\alpha\cdot sa + (1-\alpha)\cdot fa - u^\gamma,$$0 to generate image-adaptive anchor lines for each rail instance. On the DL-Rail dataset, which contains 7000 pairs of images and annotations, the full system with PPM global context reports F1@50 $$\mathrm{md}(A)=\alpha\cdot sa + (1-\alpha)\cdot fa - u^\gamma,$$1, F1@75 $$\mathrm{md}(A)=\alpha\cdot sa + (1-\alpha)\cdot fa - u^\gamma,$$2, mF1 $$\mathrm{md}(A)=\alpha\cdot sa + (1-\alpha)\cdot fa - u^\gamma,$$3, and $$\mathrm{md}(A)=\alpha\cdot sa + (1-\alpha)\cdot fa - u^\gamma,$$4 FPS; on TuSimple it reports $$\mathrm{md}(A)=\alpha\cdot sa + (1-\alpha)\cdot fa - u^\gamma,$$5 accuracy, and on LLAMAS it reports F1 $$\mathrm{md}(A)=\alpha\cdot sa + (1-\alpha)\cdot fa - u^\gamma,$$6 (Yu et al., 2023).

Sparse transformer detection offers yet another anchor interpretation. "ASAG: Building Strong One-Decoder-Layer Sparse Detectors via Adaptive Sparse Anchor Generation" (Fu et al., 2023) predicts dynamic anchors on patches rather than grids, adaptively selecting which feature maps and which locations to probe. It couples this with Query Weighting to mitigate training instability under adaptive sampling. On COCO val with a ResNet-50 backbone, ASAG-S with approximately 100 anchors reports AP $$\mathrm{md}(A)=\alpha\cdot sa + (1-\alpha)\cdot fa - u^\gamma,$$7 at $$\mathrm{md}(A)=\alpha\cdot sa + (1-\alpha)\cdot fa - u^\gamma,$$8 FPS, and with approximately 300 anchors reports AP $$\mathrm{md}(A)=\alpha\cdot sa + (1-\alpha)\cdot fa - u^\gamma,$$9 at $sa$0 FPS, outperforming dense-initialized one-layer variants in the reported speed–accuracy trade-off (Fu et al., 2023).

These vision papers collectively show that DAS can modify at least four distinct loci in a perception stack: target assignment, query initialization, geometric priors, and sparse proposal generation. The anchor is dynamic not because it moves physically, but because the system estimates which reference structure is appropriate for the current sample.

5. Prompt anchors, structural anchors, and continual adaptation

In prompt-based and generative systems, DAS is applied to symbolic or embedding-level anchors. "Dynamically Anchored Prompting for Task-Imbalanced Continual Learning" (Hong et al., 2024) maintains a single general prompt $sa$1 across the task stream and regularizes it with two task-dependent prompt anchors: a boosting anchor $sa$2, learned by fitting a task-specific prompt on the current task, and a stabilizing anchor $sa$3, defined as an online centroid of previous boosting anchors weighted by task size. The alignment term is cosine-based, $sa$4, and the interpolation coefficient $sa$5 depends on task size so that smaller tasks emphasize plasticity and larger tasks emphasize stability. The paper reports absolute improvements of roughly $sa$6 to $sa$7 over prior rehearsal-free prompt methods under task-imbalanced settings; on shuffled TICL-CIFAR100, DualPrompt achieves $sa$8 average accuracy, CODA-Prompt $sa$9, and DAP $fa$0 (Hong et al., 2024).

"Dynamic Infilling Anchors for Format-Constrained Generation in Diffusion LLMs" (Han et al., 3 Jun 2026) treats begin- and end-anchor tokens as structural delimiters for reasoning or JSON generation. The method is training-free: for each masked block, it prepends a begin anchor, runs one diffusion infer step, scans the predictions for an end anchor or its prefix above confidence threshold $fa$1, and either truncates or extends the masked block by $fa$2 until an end anchor is found or the hard limit $fa$3 is reached. Stage I therefore localizes the proper span endpoint, and Stage II performs iterative infilling inside the chosen boundaries. On zero-shot GSM8K, the reported format score increases from $fa$4 to $fa$5 and accuracy from $fa$6 to $fa$7; on MATH, format score rises from $fa$8 to $fa$9; on WikiBio JSON generation, valid JSON reaches $S$00 with hallucination score $S$01 (Han et al., 3 Jun 2026). The paper explicitly presents DIA as an instance of DAS in diffusion LLMs.

"AnchorOPT: Towards Optimizing Dynamic Anchors for Adaptive Prompt Learning" (Li et al., 26 Nov 2025) extends prompt anchors further by making both anchor values and anchor positions learnable. Instead of handcrafted explicit textual tokens such as “shape” or “color,” it introduces continuous anchor embeddings and a learnable position matrix optimized with Gumbel-Softmax. Training is two-stage: Stage I learns anchor embeddings by MSE alignment to LLM-generated class descriptions; Stage II freezes the anchors and optimizes soft tokens plus the position matrix under a cross-entropy plus KL objective. Reported gains on 11 base-to-novel tasks include raising the harmonic mean of CoOp from approximately $S$02 to approximately $S$03, with similar gains for CoCoOp, MaPLe, and DePT (Li et al., 26 Nov 2025).

These works broaden the anchor concept from geometric reference to semantic constraint. The anchor may delimit where content should end, indicate how prompts should remain stable across skewed task streams, or provide a data-learned prompt token whose value and position are themselves adaptive variables.

6. Cluster exemplars, semantic erasure anchors, and budget-aware streaming

In open-world recognition, DAS becomes exemplar mining. "Sharpness-aware Dynamic Anchor Selection for Generalized Category Discovery" (Peng et al., 15 Dec 2025) selects anchor samples for unknown classes at the end of each epoch, using a combination of cluster density and classifier confidence. For each novel cluster, it computes a truncation threshold $S$04 over maximum class probabilities, sets a uniform anchor count by a $S$05-quantile over per-cluster counts, identifies the density peak by inverse average $S$06-NN distance, and then picks the top-$S$07 candidates near that peak by confidence. These anchors are injected into the labeled pool with one-hot labels for the next epoch. With SimGCD as baseline, DAS alone raises ImageNet-100 new-class ACC from $S$08 to $S$09 and CUB new-class ACC from $S$10 to $S$11; combined with Loss Sharpness Penalty, new-class ACC reaches $S$12 on ImageNet-100 and $S$13 on CUB (Peng et al., 15 Dec 2025).

In concept erasure for diffusion models, DAS becomes semantic anchor mining. "Beyond Fixed Anchors: Precisely Erasing Concepts with Sibling Exclusive Counterparts" (Zhang et al., 18 Oct 2025) defines Sibling-Exclusive Concepts as anchors that share the same parent in a semantic hierarchy as the target concept while having disjoint core attributes. SELECT evaluates candidates in two stages: Stage I uses the Contextual Activation Score, via the Context-Raise-Ratio $S$14, to retain anchors with low residual activation under contextual clues; Stage II uses the Semantic Coherence Score, defined as a perplexity ratio $S$15, to pick the most contextually natural anchor. The paper reports average anchor mining time of only 4 seconds for one concept, object-erasure harmonic mean $S$16 for SELECT versus approximately $S$17 for a fixed “general” anchor, and in NSFW erasure a drop in average NudeNet detection sum from approximately $S$18 to $S$19 while maintaining CLIP scores and FID (Zhang et al., 18 Oct 2025).

In dynamic scene reconstruction, DAS becomes policy-based subset selection under a compute budget. "Adaptive Anchor Policies for Efficient 4D Gaussian Streaming" (Dahal et al., 18 Mar 2026) replaces Farthest Point Sampling at fixed $S$20 anchors with a learned policy that jointly chooses the anchor budget and the anchor subset. Candidate Gaussians are encoded by normalized coordinates, opacity, log average scale, and distance from the centroid, then processed by a pointwise MLP and a 2-layer Set Transformer. A budget head predicts over $S$21 and a selection head samples a subset without replacement. On unseen data in fast rendering mode at 256 anchors, EGS improves PSNR by $S$22--$S$23 while running $S$24--$S$25 faster than IGS@8192 on N3DV and MeetingRoom. The same-budget ablation reports EGS–FPS gains of $S$26 at 256 anchors, $S$27 at 512, and $S$28 at 1024 (Dahal et al., 18 Mar 2026).

This cluster of papers shows that DAS can be used to improve supervision quality, preserve semantic boundaries, or allocate rendering resources. The anchor is not merely a support point; it can also be a high-purity pseudo-label carrier, a semantically exclusive counterpart, or a budgeted rendering primitive.

7. Recurring design choices, misconceptions, and limitations

A frequent misconception is that DAS is synonymous with anchor-free design. The ATSS literature explicitly argues otherwise: if anchor-based and anchor-free detectors adopt the same definition of positive and negative samples during training, there is no obvious difference in final performance, and the key factor is how training samples are selected (Zhang et al., 2019). DAS therefore often modifies an anchor-based system rather than replacing anchors altogether.

Another misconception is that “dynamic” always implies runtime switching. The supplied papers show at least four update cadences: off-line calibration with lookup-table deployment in UWB localization, per-image assignment in object detection, per-epoch anchor refresh in generalized category discovery, and one-step policy selection in streaming reconstruction (Kolakowski, 2024, Peng et al., 15 Dec 2025, Dahal et al., 18 Mar 2026). A plausible implication is that the most informative taxonomy of DAS is by update schedule and objective, not by application area alone.

The limitations reported in the literature are also heterogeneous but patterned. Door-transition DAS requires a reasonably accurate occupancy grid and door detection, and open-plan or cluttered layouts may yield spurious zones (Kolakowski et al., 2024). DynaPose depends on reliable LOS/NLOS classification and uses buffer-based outlier handling to stabilize anchor selection (Choi et al., 2024). ASAG introduces several hyperparameters for probing thresholds and patch sizes (Fu et al., 2023). DIA relies on manual anchors with fixed semantic roles and adds iterative expansion overhead that may not suit ultra-low-latency scenarios (Han et al., 3 Jun 2026). EGS adds a small latency of less than 40 ms due to the Transformer sampler and is trained primarily in fast rendering mode with a frozen backbone (Dahal et al., 18 Mar 2026). SELECT depends on candidate generation and semantic evaluation pipelines, even though the reported wall-clock anchor-mining time is 4 seconds per concept (Zhang et al., 18 Oct 2025).

A broader pattern nevertheless emerges. DAS methods usually combine three ingredients: a candidate pool, an adaptive quality signal, and a fallback or stabilization mechanism. In UWB systems the fallback is zone lookup or convex-hull feasibility; in DAL it is the highest matching-degree anchor when no anchor exceeds threshold; in GCD it is uniform anchor count across novel clusters; in continual learning it is the stabilizing centroid prompt; in ASAG it is Query Weighting. This suggests that successful DAS rarely depends on dynamic scoring alone; it also depends on a mechanism that prevents degenerate anchor choices when the adaptive signal is noisy.

Across the supplied literature, the significance of DAS lies less in any one metric than in the repeated demonstration that fixed anchors are often mismatched to local conditions. Whether the problem is NLOS body shadowing, per-object IoU variation, rare emergence events, task imbalance, semantic leakage in concept erasure, or over-allocation of Gaussian primitives, dynamic anchor choice is used to make the reference structure itself contingent on the instance being processed.