Source-linked AI summary

LoopTrack: A Simple Baseline for Parameter-Efficient Transformer Tracking

Liang Peng, Chenxiao Li, Libo Zhang, Xingping Dong, Heng Fan

arXiv:2609.33306v1cs.CV

TL;DR

Stacked, independently parameterized Transformer blocks make tracking models parameter-heavy and difficult to deploy on resource-limited devices. LoopTrack reuses shared blocks in a loop and adds target-aware and cross-frame cues; it reports a favorable accuracy-parameter trade-off, including 69.3% SUC on LaSOT with 6.4M parameters.

  • Problem

    Stacked Transformer blocks with separate parameters create substantial model overhead, making deployment on resource-limited devices difficult.

    Source: §1 · p. 2
  • Method

    LoopTrack repeatedly applies shared Transformer blocks in a loop, with TAL using intermediate localization cues and GTM adding compact cross-frame target memory.

    Source: §1 · p. 2
  • Results

    69.3% SUC on LaSOT with 6.4M parameters for LoopTrackThree, while LoopTrackOne achieves 66.2% SUC with 3.4M parameters.

    Source: §1 · p. 2
  • Takeaways & Limitations

    LoopTrack offers a favorable accuracy-parameter trade-off across four benchmarks without additional teacher-based distillation.

    Source: §5 · p. 9

    Parameter reduction does not necessarily produce a proportional computation reduction because recurrent feature refinement still requires repeated block execution.

    Source: D LIMITATION · p. 18

Abstract

from arXiv · show

Current Transformer-based tracking methods typically stack multiple Transformer blocks with separate parameters to model interactions between the target template and the search region for target localization. These trackers often incur substantial parameter overhead from stacked blocks, making their deployment on resource-limited devices difficult. To address this, we propose a parameter-efficient Transformer tracking framework, dubbed LoopTrack, which repeatedly applies a set of Transformer blocks with shared parameters to interact features in a looped architecture for tracking, significantly reducing the number of parameters. To further exploit target cues, we present two lightweight designs, including target-aware looping (TAL) and gated target memory (GTM). The former applies intermediate target information generated by one loop to guide feature interaction in the subsequent loop, enabling progressive feature refinement, while the latter maintains a compact memory across frames, which is incorporated into the loop process to provide long-term information to the tracker, mitigating temporal drift in tracking. Compared to existing Transformer trackers, LoopTrack enables multiple rounds of feature interaction with fewer model parameters, making it resource-friendly for deployment. In extensive experiments on multiple datasets, LoopTrack shows a favorable accuracy-parameter trade-off. In particular, our LoopTrack$_{\rm One}$, with a single shared Transformer block, achieves 66.2\% SUC score on LaSOT with only 3.4M parameters, while LoopTrack$_{\rm Three}$, using three shared blocks, achieves 69.3\% SUC score with 6.4M parameters, surpassing existing parameter-efficient tracking methods with comparable or larger model size. With LoopTrack, we aim to establish a simple yet strong baseline for parameter-efficient Transformer tracking. Our code and models will be released.

1 INTRODUCTION

Transformer trackers often stack independently parameterized blocks, creating parameter overhead that complicates deployment on resource-constrained devices. LoopTrack reuses shared blocks in a loop and adds target-aware and cross-frame cues; reported results show a favorable accuracy-parameter trade-off.

1 INTRODUCTION

  • Stacking independently parameterized Transformer blocks creates substantial parameter overhead and makes deployment on resource-constrained devices challenging.The introduction notes conventional trackers may use 18, 24, or 40 blocks, depending on the backbone.Source: §1 · pp. 1–2
  • Existing compact-tracker approaches use compression, pruning, or architectural reduction followed by distillation, which requires a strong teacher and supervision.Under a small parameter budget, reducing block number or capacity also decreases feature interaction, making strong tracking performance harder to preserve.Source: §1 · p. 2
  • LoopTrack repeatedly reuses a small set of shared Transformer blocks to interact template and search features across loops with fewer model parameters.Outputs from one loop feed the same blocks in the next, retaining multiple rounds of feature interaction.Source: §1 · p. 2
  • TAL uses intermediate localization responses to guide later-loop feature interaction, while GTM incorporates compact cross-frame target memory to mitigate tracking drift.The memory is updated using reliable prediction results; both designs add negligible parameters and computational overhead.Source: §1 · p. 2
  • 69.3% SUC on LaSOT with 6.4M parameters for LoopTrackThree; LoopTrackOne reaches 66.2% SUC with 3.4M parameters and exceeds UETrack-T by 2.8 percentage points.The authors report the three-block model has accuracy comparable to UETrack-B at approximately half its parameter count, and that LoopTrackOne uses 43% fewer parameters than UETrack-T.Source: §1 · p. 2

2 RELATED WORK

Transformer tracking progressed from attention modules over backbone features to one-stream architectures that combine feature extraction and template-search interaction. Efficiency work reduces model overhead through compact designs or compression, while LoopTrack relates to recurrent vision Transformers that reuse blocks for iterative refinement.

Transformer-based Tracking

  • One-stream trackers such as MixFormer and OSTrack unify feature extraction and template-search interaction, but typically allocate separate parameters to blocks at different depths.Earlier TransT and STARK use attention modules to relate template and search features extracted by a backbone.Source: §2 · p. 3

Efficient Visual Tracking

  • Efficient tracking methods use compact architecture design, pruning, or compression; distillation-based approaches improve compact trackers but require an additional teacher and training supervision.Depth reduction leaves fewer stages for feature refinement.Source: §2 · p. 3

Looped Vision Transformers

  • Looped vision Transformers reuse parameters across computation steps for iterative refinement, with prior applications in recognition and multi-view 3D reconstruction.Some related work distills pretrained vision encoders into a few recurrently applied blocks.Source: §2 · p. 3

3 ADAPTING TRANSFORMERS FOR RECURRENT TRACKING

LoopTrack adapts one-stream Transformer tracking by reusing shared blocks across recurrent interactions, with target-aware feedback and cross-frame memory to refine localization. Its learning objective supervises final predictions and auxiliary TAL and GTM signals.

3.1 PRELIMINARIES

  • Separate parameters for successive template-search interactions couple interaction depth to model size in conventional one-stream trackers.The section adopts a one-stream framework in which template and search features are jointly refined before the final search features go to a prediction head.Source: §3.1 · pp. 3–4

3.2 LOOPTRACK

  • LoopTrack repeatedly applies shared Transformer blocks to template and search features, separating interaction rounds from independently parameterized blocks.The visual encoder operates outside the loop, while the recurrent cell shares parameters across loops; variants use one, two, or three retained Transformer blocks.Source: §3.2 · p. 4
  • Target-Aware Looping (TAL) uses intermediate localization responses to guide subsequent template-search interaction and progressively refine features.TAL provides spatial response feedback and appearance feedback at selected loops; target appearance updates occur at loops 2, 4, and 6 when k < K.Source: §3.2 · p. 5
  • Gated Target Memory (GTM) carries target appearance across frames and regulates memory updates using localization reliability cues.Appearance pooling forms a candidate from likely target positions, while the gated update uses peak response and spatial concentration to balance current appearance against retained memory.Source: §3.2 · pp. 5–6

3.3 LEARNING OBJECTIVE

  • The learning objective supervises final responses and boxes, TAL intermediate predictions, and the GTM memory-writing coefficient.TAL auxiliary predictions are disabled at inference; GTM's writing coefficient is trained against detached IoU with SmoothL1 loss.Source: §3.3 · p. 6

4 EXPERIMENTS

LoopTrack reuses recurrent Transformer blocks to reduce parameter costs while retaining repeated feature interaction, and it performs competitively against parameter-efficient trackers. Ablations examine its target-guidance and memory designs, inference depth, memory use, and transfer across tracker architectures.

4.1 IMPLEMENTATION DETAILS

  • LoopTrack uses Fast-iTPN-T and recurrently applies shared cells; training samples 6–12 loops, while main comparisons use K = 8.The three variants use one, two, or three Transformer blocks per cell; auxiliary box and localization-quality branches are training-only.Source: §4.1 · p. 7, Table 1 · p. 7

4.3 ABLATION AND ANALYSIS

  • TAL raises SUC from 65.8% to 68.8%, and adding GTM reaches 69.3%, a 3.5-point gain over the looped baseline.TAL uses target estimates to guide later interactions; GTM adds historical target appearance.Source: §4.3 · pp. 7–8, Table 3 · p. 7

4.2 COMPARISON WITH STATE-OF-THE-ART TRACKERS

  • LoopTrackThree matches or exceeds UETrack-B across tracking metrics with 50.8% fewer parameters, beats LiteTrack-B9 by 2.3 LaSOT SUC points, and exceeds FARTrack-Tiny by 6.1 points at comparable size.LoopTrackOne reaches 66.2 SUC on LaSOT with 3.4M parameters; LoopTrackTwo reaches 68.4 SUC with 4.9M parameters.Source: §4.2 · p. 7, Table 2 · p. 8

4.3 ABLATION AND ANALYSIS

  • SR raises SUC from 68.5% to 68.8% with GTM enabled, while the complete TAL configuration reaches 69.3% SUC.The study holds recurrent configuration and intermediate supervision fixed; TU uses target appearance to guide search-feature updates.Source: §4.3 · p. 8, Table 4 · p. 8
  • With TAL enabled, recent appearance pooling raises SUC to 69.1%, and gated memory updates raise it to 69.3%.A static initial-template memory yields only a 0.1-point SUC gain; the gate uses localization reliability to control updates.Source: §4.3 · p. 8, Table 5 · p. 8
  • Combining auxiliary box and localization-quality losses raises SUC from 68.8% to 69.3%, while the auxiliary branches add no inference computation.The ablation varies only the use of Lbox and Lqual while keeping TAL prediction branches and feedback fixed during training.Source: §4.3 · p. 9, Table 6 · p. 9
  • On UTPTrack-O-256 and OSTrack-256, LoopTrack cuts parameters by 74.1% and 74.0%, with LaSOT SUC decreases of only 0.36 and 0.44 points.The same three-block recurrent configuration is used without tracker-specific architectural modification or hyperparameter tuning.Source: §4.3 · p. 9, Table 7 · p. 9
  • At K = 8, peak GPU memory ranges from 46.09–61.38 MiB at batch size 1 and stays below 384 MiB at batch size 32.Performance peaks at K = 8 with 69.3 SUC; K = 4, outside the training range, achieves 67.8 SUC at 151 FPS without retraining.Source: §4.3 · p. 9, Figure 2 · p. 9

5 CONCLUSION

LoopTrack reuses shared Transformer blocks for iterative template–search interaction, with TAL and GTM adding within-frame and cross-frame target cues. Experiments across four benchmarks show a favorable accuracy–parameter trade-off without teacher-based distillation.

5 CONCLUSION

  • LoopTrack repeatedly applies a small set of shared Transformer blocks for iterative template–search interaction with fewer parameters.This decouples the number of feature-interaction rounds from the number of independently parameterized blocks.Source: §5 · p. 9
  • TAL uses intermediate localization responses for progressive refinement, while GTM adds compact cross-frame target cues to mitigate tracking drift.Source: §5 · p. 9
  • Experiments on four benchmarks show a favorable accuracy–parameter trade-off without additional teacher-based distillation.The paper presents LoopTrack as a simple yet strong baseline for parameter-efficient Transformer tracking.Source: §5 · p. 9

SUPPLEMENTAL MATERIAL

The supplemental material provides implementation details, additional ablations, qualitative comparisons, and a discussion of LoopTrack’s limitation.

SUPPLEMENTAL MATERIAL

  • Implementation details cover target appearance updates, gated-memory operations, and auxiliary prediction supervision.Source: SUPPLEMENTAL MATERIAL · p. 13
  • Additional ablations examine loop-count sampling, memory confidence supervision, appearance-update schedules, memory construction, and model costs.Source: SUPPLEMENTAL MATERIAL · p. 13
  • Qualitative comparisons examine recurrent depths and design configurations, including their effects on localization.Source: SUPPLEMENTAL MATERIAL · p. 13
  • The supplemental material also includes a discussion of LoopTrack’s limitation.Source: SUPPLEMENTAL MATERIAL · p. 13

A IMPLEMENTATION DETAILS

The implementation details describe target appearance feedback in TAL, appearance pooling and gated updates in GTM, and auxiliary supervision used during training.

A.1 TARGET-AWARE LOOPING

  • TAL’s target appearance update keeps an internal appearance state, initialized to zero each frame and retained between updates, using response-weighted normalized search features.A confidence gate controls the contributions of the current appearance observation and retained state; the resulting feedback contributes to the next search input.Source: §A.1 · p. 13

A.2 GATED TARGET MEMORY

  • GTM’s appearance pooling selects positions until their normalized response mass reaches 0.75, then response-weights cached pre-loop features into one appearance candidate.The gated update blends this candidate with persistent memory according to a writing coefficient; the updated memory remains a single token for the next frame.Source: §A.2 · pp. 13–14
  • During inference, AP and GU use the final CENTER response before windowing for position selection and reliability estimation.A Hann window is applied separately to select the location for box decoding.Source: §A.2 · p. 14

A.3 AUXILIARY SUPERVISION

  • Auxiliary prediction branches provide intermediate box, localization-quality, and response supervision during training, then are removed at inference.Intermediate responses at loops 4 and 6 receive focal loss; auxiliary boxes use weighted regression, and quality is supervised against detached IoU.Source: §A.3 · p. 14

B MORE ABLATION STUDIES

The ablations test loop-count sampling, memory-confidence supervision, and target-appearance update timing in LoopTrackThree on LaSOT. Results support varying loop counts, reliability-aware memory updates, and a spaced appearance-refresh schedule.

B MORE ABLATION STUDIES

  • The ablations examine loop-count sampling, appearance-feedback timing, cross-frame memory construction and reliability, and parameter and inference costs.Unless otherwise specified, they use LoopTrackThree on LaSOT with M = 3, K = 8, TAL, and GTM.Source: B MORE ABLATION STUDIES · pp. 14–15

B.1 LOOP-COUNT SAMPLING

  • Varying training loop counts consistently improved over fixed-K training, and Beta(1, 2) performed best at the default K = 8 while tying the best result at K = 6.The adopted distribution covers K ∈ {6, …, 12}; Beta(2, 1) favors larger loop counts and performs best at K = 12.Source: Table 9 · p. 15, §B.1 · p. 15

B.2 MEMORY CONFIDENCE SUPERVISION

  • SUC rose from 69.0 to 69.3, PN from 77.8 to 79.2, and P from 73.7 to 74.7 with memory-confidence supervision.The comparison keeps other settings unchanged and supports explicitly supervising the memory writing coefficient using final-prediction IoU.Source: Table 10 · p. 15, §B.2 · p. 15

B.3 APPEARANCE UPDATE SCHEDULE

  • The spaced TU schedule {2, 4, 6} performed best; updating at every intermediate loop reduced performance, while delaying updates to {4, 6} was less effective.The authors attribute the latter results to the redundancy of adjacent appearance estimates and use sparse appearance refreshes.Source: Table 11 · p. 15, §B.3 · p. 15

B.4 MEMORY CANDIDATE CONSTRUCTION

GTM constructs a single appearance candidate by combining response-guided localization with selected search features, then writes it to persistent memory. The ablations examine the feature source and response-mass threshold used in that process.

Candidate construction

  • AP selects positions in descending response order until their cumulative normalized response reaches µ, then aggregates their appearance into candidate ct for the GU memory update.The examined choices are the appearance feature source and the response-mass threshold.Source: §B.4 · p. 16

Feature source

  • 69.3 SUC is achieved using selected pre-loop search features, versus 69.0 with final search features and 68.9 with the final memory token.The comparison varies the feature source while keeping position selection, response weights, candidate normalization, and GU unchanged.Source: §B.4 · p. 16, Table 12 · p. 16
  • Using final search features or the final memory token carries forward information already mixed during within-frame interaction, whereas pre-loop features provide appearance before recurrent mixing.The final response still supplies refined localization guidance for the update.Source: §B.4 · p. 16

Response-mass threshold

  • At µ = 0.75, the candidate reaches 69.3 SUC; smaller thresholds may omit complementary target regions, while larger ones add low-response background or distractors.Because µ sets cumulative response mass rather than a fixed position count, AP adapts spatial support to the current response while producing one compact candidate.Source: §B.4 · p. 16

B.5 MODEL COMPLEXITY AND EFFICIENCY

TAL and GTM add target guidance while preserving LoopTrack's compact shared-loop design, but their runtime cost is not proportional to their small parameter and MAC increases. Varying loop count also offers different accuracy-speed operating points with the same trained model and parameter count.

TAL and GTM overhead

  • 69.3 SUC versus 65.8 is reported with TAL and GTM, as parameters rise from 6.373M to 6.379M and MACs from 9.609G to 9.620G.The added designs introduce approximately 0.09% parameter and 0.11% MAC overhead without increasing the number or capacity of Transformer blocks.Source: §B.5 · pp. 16–17, Table 14 · p. 16
  • Throughput falls from 108 to 98 FPS with additional target guidance, despite the model remaining at 6.379M parameters.Small parameter and MAC increases therefore do not imply an equally small runtime cost.Source: §B.5 · pp. 16–17

Flexible inference depth

  • At K = 8, the same checkpoint reaches 69.3 SUC at 98 FPS, while K = 4† reaches 67.8 SUC at 151 FPS outside the training-depth range [6, 12].The parameter count remains fixed at 6.4M across inference depths; K = 4 halves recurrent cell executions relative to K = 8 without retraining.Source: §B.5 · p. 17, Table 15 · p. 17
  • Increasing K from 8 to 10 or 12 does not improve accuracy, yielding 69.2 and 68.9 SUC, respectively.Under this configuration, K = 8 has the highest accuracy, while smaller K offers faster inference with the same parameters.Source: §B.5 · p. 17, Table 15 · p. 17

C QUALITATIVE ANALYSIS

The qualitative examples show recurrent refinement correcting localization and target-extent errors, while also illustrating that more loops do not always help. TAL guides within-frame updates and GTM supplies recent appearance across frames, addressing different sources of competing evidence.

C.1 ITERATIVE REFINEMENT ACROSS LOOPS

  • Later recurrent loops recover the designated target from a distractor in basketball-11 and refine target extent in yoyo-17, drone-2, bottle-1, and pool-15.The changes come from repeatedly applying the same shared recurrent cell, not additional independently parameterized blocks.Source: §C.1 · p. 17
  • At bottle-1 frame 761, IoU falls from 0.83 at loop 8 to 0.73 at loop 12, illustrating that additional recurrent refinement can lower overlap.Further interaction can revise an accurate estimate without improving alignment.Source: §C.1 · p. 17

C.2 TARGET GUIDANCE WITHIN THE RECURRENT LOOP

  • Without TAL, examples show distractor attraction, confusion with similar instances, and inaccurate target extent; TAL uses intermediate spatial and appearance cues to guide subsequent loops.The examples include microphone-2, zebra-10, airplane-15, gametarget-13, and helmet-13.Source: §C.2 · p. 18

C.3 TARGET APPEARANCE ACROSS FRAMES

  • With a fixed initial template, appearance changes and similar-instance distractors challenge tracking; GTM supplies recent target appearance through cross-frame memory.AP selects evidence from pre-loop search features using the final localization response, while GU regulates updates according to prediction reliability.Source: §C.3 · p. 18
  • TAL guides recurrent refinement within a frame, whereas GTM carries target appearance across frames; both feed target information to the same compact shared recurrent structure.The two designs provide complementary target cues at different temporal scales.Source: §C.3 · p. 18

D LIMITATION

LoopTrack reduces stored parameters through recurrent sharing, but repeated block execution means computation need not fall proportionally. A single trained model can vary inference depth for different accuracy-speed operating points, and adaptive depth remains a future direction.

D LIMITATION

  • Recurrent parameter sharing reduces stored model parameters, but repeated block execution does not necessarily reduce computation proportionally.LoopTrack primarily focuses on parameter-efficient Transformer tracking.Source: D LIMITATION · p. 18
  • Varying the number of loops lets the same trained model operate at multiple accuracy-speed trade-offs without changing its parameters.The passage identifies adaptive recurrent depth as a possible future way to allocate computation more selectively.Source: D LIMITATION · p. 18
  • Figure 3 compares localization across loops 2, 4, 6, 8, and 12, with IoU values accompanying the predictions and ground truth.The examples use the same trained checkpoint.Source: Figure 3 · p. 19
Loading 2609.33306v1…