1. The trajectory-prediction method is incompletely specified, and its empirical advantage is not convincing.
The connection between flow matching and GRPO is insufficiently explained. Section 3.2 and Eq. (4) define a conditional flow-matching objective, but Eq. (6) subsequently requires policy likelihood ratios and KL regularization. The submission does not explain how these quantities are computed for its flow-based trajectory distribution. In particular, the decoder is described as modeling the joint future trajectories of all agents, whereas the GRPO ratio uses the probability of an individual agent's position at a particular future timestep. The relationship between the joint distribution and these position-level probabilities, any factorization or likelihood approximation, and the implementation of the KL term need to be specified. These are essential details for reproducing and assessing the proposed refinement procedure.
The foundation-model comparison is also relatively narrow. Several entries in Table 1 are zero-shot or supervised variants from the LMTraj/VLMTraj research line, with limited coverage of alternative foundation-model approaches. The broader positioning relative to predictive world models is not sufficiently developed. Although DIMA is included in the control comparison, the paper does not sufficiently discuss how its forecasting component relates to other applicable state-conditioned predictive or world-model approaches. The authors should clarify which world-model approaches are applicable to their setting and provide appropriate comparisons, or explain the boundary of the claimed scope.
Finally, the trajectory results do not establish a clear overall improvement. Table 1 reports average ADE20/FDE20 of 0.20/0.33 for TrajVLM, compared with 0.20/0.32 for MoFlow, 0.18/0.27 for VLMTraj-SUP, and 0.13/0.18 for SocialMOIF. Improvements on selected scenes do not establish a compelling overall benefit from adding a large VLM and a further RL stage. A controlled comparison of the same state encoder and flow decoder with and without the VLM, together with SFT-only versus SFT-plus-GRPO results, is needed to identify the contribution of these components.
2. The theoretical analysis is largely disconnected from the forecasting and control contributions.
The results in Section 4 provide conditional complexity and uniform-convergence bounds for the composed hypothesis class. However, they do not explain when the proposed dual-transformer coupling should improve trajectory prediction or control, or why cross-attention should be preferred over simpler fusion mechanisms. The analysis does not provide a comparative guarantee against relevant alternatives or actionable guidance for choosing the architecture, adaptation strategy, or training objective.
The assumptions also remain insufficiently connected to the actual learning procedures. In particular, bounded Lipschitz losses and i.i.d. sampling do not automatically describe the flow-matching loss or the changing data distributions encountered during on-policy control. The paper does not establish how the stated bounds apply to these objectives or translate into a guarantee for policy return.
As presented, the theory reads as a largely standalone addition to the empirical framework. My concern is its relevance to the main contribution: the paper would be stronger if the analysis explained a concrete property of the proposed coupling, predicted an experimentally testable effect, or directly justified part of the training procedure.
3. The MARL evaluation does not establish a fair or practically compelling advantage over lightweight alternatives.
The comparison combines several substantial advantages for CMAVLA that are not adequately controlled. Its VLM backbone benefits from extensive external pretraining, while the conventional MARL policies are trained without a comparable pretrained backbone. In addition, Section 5.1 states that CMAVLA initializes its state encoder from a trained Trans-CMAGRPO checkpoint. Consequently, the current experiments do not separate the contribution of the proposed architecture from those of pretrained representations, additional task-specific initialization, and much greater model capacity. The cost of this initialization and the benefit of each source of prior training should be accounted for explicitly.
The training horizon further limits the interpretation. The submission reports conventional MARL results at 1M environment steps, whereas the official HASAC experiments, including the matching tasks in Figure 8, evaluate learning over 10M steps. A short-budget evaluation can assess early learning, but it does not establish superiority after fuller training. More seriously, the submission explicitly counts only primary trajectories toward CMAGRPO's nominal 1M budget and excludes additional grouped rollouts. Thus, the reported comparison does not establish equal environment-interaction budgets. Matching the number of reported updates is not sufficient without defining the underlying sampling and optimization work. Results at both 1M and 10M actual interactions would provide a much more informative comparison.
The statistical reporting also favors the proposed method: Table 2 compares single-seed maximum returns for the centralized methods against multi-seed means and standard deviations for the reproduced conventional baselines. This does not establish an improvement in expected performance or training reliability.
Finally, the large backbone introduces substantial model-size and computational overhead. The paper acknowledges increased memory usage and training time, but does not quantify the trade-off through GPU-hours, memory requirements, inference latency, or achievable control frequency. For a method requiring centralized execution, the practical value of retaining a large VLM in the control loop needs to be established against strong lightweight centralized policies. Without comparable training budgets and measured deployment costs, I do not find the proposed CTCE design a sufficiently convincing choice for multi-agent decision making.
Thanks for the comments!
The proof of theorems has been uploaded and submitted that can be found in the Appendix.
I mainly leveraged existing theoretical technologies to introduce proposed FMDT framework. Additionally, the theory to algorithm experiemnts also have been conducted.