- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes TCMA, a training-free output-level adapter for frozen K-candidate pedestrian trajectory predictors. TCMA stores trajectories only after their full future horizon has elapsed, retrieves causally eligible candidates through an ego-centric channel and a world-frame channel, and replaces candidate slots with low historical winning frequencies under a fixed output budget. It further introduces a causal self-tuning procedure that selects retrieval and gating configurations from elapsed labels split into fitting and checking sets.
Critical strengths
1.Practical black-box deployment setting. Improving a frozen K-candidate predictor without retraining, internal access, or increasing the number of guesses is a meaningful and timely problem. The causal eligibility rule is simple and appropriate for deployment time memory.
2.Broad predictor evaluation with low measured overhead. The paper evaluates seven heterogeneous predictors on ETH-UCY and reports sub-millisecond retrieval/injection latency.
Critical weaknesses
1.The empirical comparison is insufficient to support the claimed adapter-level contribution. The paper does not directly compare TCMA with existing online adaptation methods such as TrajICL, T4P, OAT-Mem, or AOL under a comparable black-box and fixed-K budget.
2.The theoretical safety guarantee is not operational at inference time and does not support the claimed non-degradation property. While the causal rule is sound, Lemma 1 conditions on the current query's unobserved winning slot W(P,x), which is unknowable at inference time. Additionally, the finite-sample bound is marginal, assumes IID sampling, and ignores slot-selection bias and temporal dependence. Thus, the theory offers no operational per-query non-degradation guarantee.
Questions for authors
1.Please compare TCMA directly against at least one existing online adaptation method, such as TrajICL, T4P, OAT-Mem, or AOL, under the same frozen-predictor and fixed-K setting. If a direct comparison is impossible, please provide a controlled surrogate comparison and explain the mismatch.
2.Lemma 1 conditions on W(P,x), the winning slot under the current query's unobserved future. Since only past queries' futures have elapsed, this condition cannot be checked at inference time. Can the authors provide an operational deployment time condition, or explicitly clarify that the guarantee is post-hoc and marginal rather than per-query? Please also clarify whether the finite-sample bound requires multiple-comparison correction over K slots and whether it holds under temporal dependence.
2 comments
Response 2
W2/Q2. Operational Interpretation and Statistical Assumptions of the Theoretical Bounds
We appreciate this observation and agree that the original presentation required a clearer distinction between the theoretical condition and the operational activation procedure.
1. Interpretation of Lemma 1
Lemma 1 provides a conditional non-degradation result: replacing candidate slots cannot increase minADE@K if the original winning candidate remains in the candidate set.
The reviewer correctly points out that the current query's winning slot depends on its unobserved future. Consequently, this condition cannot be verified at inference time.
We have clarified this explicitly in the revised manuscript. Lemma 1 characterizes the condition under which replacement is harmless, rather than providing an operational per-query guarantee.
2. Operational activation conditions
Although TCMA cannot identify the current query's winning candidate before its future is observed, it controls replacement through observable deployment-time conditions:
- A memory entry becomes eligible only after its complete future horizon has elapsed.
- The query must satisfy the retrieval-density and admission requirements.
- The selected retrieval and gating configuration must improve performance on both chronological fitting and checking subsets of elapsed labels.
The configuration is applied only to subsequent queries. If sufficient completed trajectories are unavailable or no configuration satisfies the acceptance conditions, TCMA retains the base prediction.
These conditions determine when TCMA is permitted to use retrieved candidates. They do not imply that every activated replacement is guaranteed to improve the current prediction.
3. Multiple-comparison correction
We have clarified the statistical corrections used in Proposition 1.
For the main last-q policy, q is selected from {1, 2, 3} using reference data. We therefore apply Bonferroni correction at α/3 to account for selecting among the three candidate sets under the independent-sample assumptions.
For data-dependent historical win-frequency selection, simultaneous bounds over the K candidate slots are required. The revised analysis explicitly includes this correction.
4. Temporal dependence
We agree that the independent-sample assumption is important. The Clopper–Pearson bound does not automatically establish coverage under arbitrary temporal dependence.
We have therefore separated the theoretical independent-sample result from the empirical temporal-dependence assessment.
In Experiment R5, the corrected last-q bound holds in 23 of 26 active predictor-scene cases. The mean upper bound is 0.102, compared with an observed displacement frequency of 0.077. For historical win-frequency selection, the Bonferroni-corrected bound holds in all 26 cases.
We additionally evaluate temporally contiguous block-bootstrap confidence intervals. The 95% gain intervals have positive lower endpoints in 24 of 26 cases using 8-second blocks and 23 of 26 cases using 16-second blocks.
Experiment R6 further shows that 5.9% of activated predictions experience individual degradation, with every degraded case involving displacement of the original winning candidate. Abstention reduces negative predictor-scene outcomes from four under forced activation to one under the standard activation policy.
These results provide empirical evidence regarding the practical behaviour of TCMA under prospective evaluation and temporal dependence. We do not interpret them as establishing a formal dependence-aware guarantee or universal per-query non-degradation.
We have revised the theoretical discussion to make these distinctions explicit.
Changes in manuscript:
- Section 3.3, page 6, including Lemma 1 and Proposition 1.
- Appendix C, theoretical derivation and finite-sample analysis.
- Appendix N.5, page 27, Experiment R5 and Table 16.
- Appendix N.6, pages 27–28, Experiment R6 and Tables 17–18.
Response 1
We sincerely thank Reviewer for the careful assessment of the experimental comparisons and theoretical analysis. We particularly appreciate the comments concerning the compatibility of existing online adaptation methods with TCMA's deployment setting and the statistical interpretation of the proposed guarantees.
W1/Q1. Comparability with Existing Online Adaptation Methods
We agree that comparisons under a shared deployment setting are valuable for understanding the contribution of TCMA. We therefore added two controlled experiments that examine complementary alternatives to our approach.
A faithful direct comparison with the original methods under TCMA's frozen black-box, no-training constraint is not possible because their adaptation mechanisms require different forms of model access or separately trained components.
Specifically:
OAT-Mem and AOL therefore require training auxiliary components outside TCMA's training-free constraint. We have clarified these differences in the revised Related Work and experimental discussion.
Instead of presenting unmatched implementations as direct comparisons, we added two controlled surrogates.
R2: Causal online fine-tuning surrogate
We compare TCMA against causal online fine-tuning of TUTR using the same completed labels, chronological fitting/checking procedure, evaluation windows, and K=20 candidate budget.
The fine-tuning surrogate additionally has access to TUTR's parameters and gradients, whereas TCMA operates using only the exported candidate predictions.
The fine-tuning configuration searches learning rates from 10⁻⁵ to 3 × 10⁻⁴ and epoch counts from {1, 3, 10}, using the elapsed fitting and checking sets. If no configuration is accepted, the original predictor is retained.
The results are:
Fine-tuning improves TUTR on UNIV, achieving +6.75% minADE improvement compared with +4.13% for TCMA. However, it reduces performance on the other four scenes, resulting in negative overall averages.
This experiment provides a controlled comparison between parameter-level adaptation and black-box output-level augmentation using the same causally available supervision.
R3: Similarity-based and recency-based output-level proxies
We additionally compare TCMA with two output-level proxies inspired by example-based adaptation.
Both proxies use causally completed same-scene examples and replace the last q=2 candidate slots under the same frozen-predictor and fixed-K setting.
The two alternatives are:
Unlike TCMA, these proxies do not use its joint position/heading/speed matching, self-tuned gates, or abstention mechanism.
The results are:
The per-query degradation rates are 5.9%, 9.0%, and 9.3%, respectively. The corresponding numbers of negative predictor-scene outcomes are one for TCMA, 11 for the similarity proxy, and 17 for the recency proxy.
These controlled comparisons help isolate the contribution of TCMA's retrieval, gating, and replacement decisions under a common output-level evaluation setting.
We emphasize that these experiments are controlled surrogates rather than faithful reproductions of the original T4P, OAT-Mem, AOL, or TrajICL systems. We have made this distinction explicit in the manuscript.
Changes in manuscript: