- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
VLALight builds on Qwen3.5-4B for video-based traffic signal control. It converts roadside videos into structured traffic descriptions, combines them with neighboring-intersection information, and selects signal phases. Supervised initialization is followed by cooperative reinforcement learning, with Fast/Slow reasoning intended to balance control quality and inference cost. Evaluation covers seven traffic traces across three simulated urban networks.
Critical strengths
- The approach addresses a relevant perception-to-control problem. Combining roadside video observations with neighboring traffic information is well motivated, since local camera views alone may miss traffic approaching from connected intersections.
- The reported network-level results are promising. Experiments include a 196-intersection network, and the ablations support the usefulness of cooperative information and reinforcement learning beyond supervised initialization. The inference-time breakdown also provides a useful account of the cost of explicit reasoning.
Critical weaknesses
- The additional benefits of VLA decision-making and adaptive reasoning are not sufficiently established. The illustrated decisions prioritize demand, waiting duration, and approaching traffic, but the paper does not establish how the VLA improves on rules or a small policy network using these same factors. Its advantage over existing MARL controllers is similarly unclear: VLALight also relies on a shared policy, neighboring traffic information, and cooperative rewards, while the comparisons do not isolate language-based reasoning from differences in perception, supervised initialization, and training configuration. Furthermore, always-Fast and always-Slow experiments demonstrate differences in control quality and latency, but do not establish that learned switching outperforms simple rules or random routing. Its additional benefit at comparable measured inference cost remains unclear.
- The core RL mechanism is incompletely specified, and experimental stability is insufficiently documented. Fast/Slow prefixes are externally assigned during rollouts, but the loss and target construction used to update mode selection are not explicitly defined. Because candidates change actions at multiple intersections, an intersection’s Fast/Slow utility comparison is affected by decisions elsewhere. The paper does not explain how this dependence is accounted for when constructing mode-selection targets. Moreover, SFT dataset sizes and network splits, quality checks for teacher-generated Slow-mode demonstrations, and independent training and evaluation repeats are also inadequately reported.
Questions for authors
- With perception and cooperative inputs held fixed, how much does the VLA decision stage improve over a lightweight controller?
- What are the exact mode-selection loss and targets? How are local and network rewards used when other intersections’ actions also vary across candidates?
- Which networks and traces enter each SFT stage, how are teacher demonstrations screened, and how many independent training and evaluation runs underlie the main results?
4 comments
Part 2
[W2, Q2] How is mode selection learned when rollout prefixes are externally assigned?
The original submission described balanced rollouts and mode comparison in Section 3.2 and Appendix A.6, but omitted some optimization details for brevity. We now make these details explicit, including the mode utility and soft target in Appendix A.6, Eqs. (11)–(12) of the revised manuscript, the weighted mode loss in Eq. (13) of the revised manuscript, and the combined objective in Eq. (14) of the revised manuscript. The same appendix gives sample-eligibility rules. Appendix A.7 of the revised manuscript expands the rollout procedure. Assigned prefixes balance exploration. The mode-selection objective trains the model's own selection probabilities.
Six network-level candidates start from the same snapshot, sharing observations, traffic perception outputs, and cooperative contexts. Two complementary assignment maps each generate three candidates, giving every intersection three Fast and three Slow trials. After joint execution, local reward, network reward, and reasoning cost are normalized separately within each intersection's candidate group, as specified in Appendix A.6, Eq. (10) of the revised manuscript. The utility and soft-target definitions are given in Appendix A.6, Eqs. (11)–(12) of the revised manuscript: higher net benefit from Slow increases its target probability, while insufficient benefit relative to cost favors Fast.
At the mode-token prediction position, the existing language-model logits for Fast and Slow are converted to a two-class probability distribution. The weighted soft-target cross-entropy in Appendix A.6, Eq. (13) of the revised manuscript directly optimizes these probabilities without adding a classification head. The subsequent reasoning and signal tokens use the clipped decision objective described in Section 3.2, Eq. (9) of both the original submission and revised manuscript. traffic perception supervision maintains traffic perception, and Appendix A.6, Eq. (14) of the revised manuscript specifies the combined optimization. Thus, mode learning has its own optimization path. At deployment, the model generates its mode autonomously from traffic context. Complete targets, sample weighting, eligibility rules, and losses are provided in Appendix A.6, Eqs. (10)–(14) of the revised manuscript.
[W2, Q2] How are local and network utility defined when other intersections' actions also change?
Our training environment contains multiple connected intersections. A signal action changes outgoing traffic and therefore affects queues and arrivals at other intersections. Candidates consequently evaluate jointly executed signal actions from a common network snapshot, as described in original Appendix A.6 and Algorithm 1.
The reward explicitly includes both local and network-level traffic objectives. Local reward compares the target intersection's queue before and after the first control transition. Network reward compares the total network queue at the initial snapshot and after three transitions. Each candidate's network reward is shared across its intersections. This encourages the shared policy to coordinate signal decisions for network-wide improvement, rather than optimizing each intersection independently. The definitions and time horizons are clarified in revised Appendices A.6–A.7.
Part 3
[W2, Q3] What data, demonstration checks, and repetitions support reproducibility?
We have added Appendix A.5, Table 7 in the revised manuscript to report the two-stage data distribution:
| Network | traffic perception train | traffic perception validation | Decision train | Decision validation |
|---|---|---|---|---|
| Hangzhou | 1700 | 188 | 1696 | 192 |
| Jinan | 1260 | 148 | 1261 | 144 |
| New York | 2440 | 264 | 1 | 1 |
| Total | 5400 | 600 | 2958 | 337 |
The stages are sequential: the traffic perception adapter is merged before cooperative decision training. Traffic perception samples cover Jinan, Hangzhou, and New York. Decision supervision primarily covers Jinan and Hangzhou. Initial sampling preserves each city's Fast/Slow mode proportions and retains four-direction videos and available coordination views.
Decision examples require same-step records for the target and all actual topological neighbours. Splitting by city–time-step prevents shared cooperative context crossing the split. Initial sampling selects individual intersection–timestep records, so complete same-step neighbourhoods are sparse in the larger New York network. This criterion leaves two New York decision targets. We have added teacher-generation parameters, screening criteria, and dataset-splitting details in revised Appendix A.5. Empty responses are filtered. Signal tags must be unique and valid. Slow demonstrations require a nonempty reasoning block. Failed requests are retried. The queue-gap rule constructs Fast demonstrations with direct signal targets and Slow demonstrations with teacher reasoning and actions. These checks retain structurally usable demonstrations with legal signal actions.
Online RL uses only Jinan 1 and Hangzhou 1, with two differently seeded instances per network at each step and 50 training steps (Appendix A.5 of our original submission). These settings are retained in Appendix A.6 of the revised manuscript. The appendix distinguishes training steps, parallel environment instances, rollout seeds, and repeated evaluations.
Part 4
[W2, Q3] What do the training curves and repeated evaluations show?
VLALight (Qwen3.5-4B) reaches a relatively stable reward level during training. We have added its 50-step training curve with a five-step moving average in Appendix A.13, Figure 9 of the revised manuscript. The improvement over its initial reward level supports the effectiveness of our training procedure.
To address your specific concern about dependence on a single backbone, we additionally trained VLALight with Qwen3.5-2B and Gemma 4 E2B. Figure 9 also presents their training curves, which show reward improvements across the evaluated backbones. Their control results are reported in Appendix A.13, Table 11 of the revised manuscript and reproduced below. All three variants are compared on Jinan 1 and Hangzhou 1 after the same number of training steps.
| Scenario | VLALight variant | ATT (s) | AQL | AWT (s) |
|---|---|---|---|---|
| Jinan 1 | VLALight (Qwen3.5-4B) | 267.05 | 154.74 | 73.31 |
| Jinan 1 | Qwen3.5-2B | 264.44 | 156.96 | 74.01 |
| Jinan 1 | Gemma 4 E2B | 265.14 | 158.91 | 75.13 |
| Hangzhou 1 | VLALight (Qwen3.5-4B) | 294.90 | 55.94 | 52.05 |
| Hangzhou 1 | Qwen3.5-2B | 298.18 | 58.18 | 54.76 |
| Hangzhou 1 | Gemma 4 E2B | 300.89 | 60.02 | 56.81 |
VLALight (Qwen3.5-4B) achieves the lowest AQL and AWT on both scenarios, while the policy trained with the Qwen3.5-2B backbone achieves the lowest ATT on Jinan 1. Together, Figure 9 and Table 11 in the revised manuscript document training progress and control performance across the evaluated backbones. The repeated evaluations below assess the stability of the same trained policy under different evaluation seeds.
To assess evaluation stability, we conducted three-seed evaluations of the same trained checkpoint on Jinan 1, Hangzhou 1, and New York 1. We have added these results to Appendix A.14, Table 12 of the revised manuscript (mean ± sample standard deviation):
| Scenario | ATT (s) | AQL | AWT (s) |
|---|---|---|---|
| Jinan 1 | 267.34 ± 0.42 | 155.41 ± 0.76 | 73.63 ± 0.28 |
| Hangzhou 1 | 294.64 ± 0.85 | 55.58 ± 0.57 | 51.58 ± 0.60 |
| New York 1 | 978.44 ± 9.97 | 1580.81 ± 27.76 | 570.90 ± 10.79 |
The ATT standard deviation is approximately 1% of its mean or less across the three scenarios. AQL and AWT also show relatively small variation. These are repeated evaluations of the same policy, while Figure 9 documents the separate backbone training runs.
Part 1
We thank the reviewer for recognizing the motivation for video-based cooperative control, the network-scale evaluation, and the inference-time analysis. Below, we clarify the evidence in our original submission and provide additional results addressing the remaining concerns.
The research gap described in our original Introduction concerns both traffic perception and decision-making. Conventional rules use predefined priorities. Lightweight RL and MARL controllers learn task-specific mappings from structured states to signal actions. Language-based controllers introduce pretrained semantic and relational reasoning, but generally still assume that structured traffic states are available.
VLALight extends this approach by learning traffic perception directly from four-direction videos and generating coordinated signal actions with the same VLA backbone. The policy compares local queues, queue changes, service history, and upstream traffic when selecting a phase. Cooperative RL adapts these comparisons using actual local and network traffic outcomes. Adaptive Fast/Slow mode selection further controls when explicit reasoning is used.
Related work supports this motivation. LLMLight [1] studies language-based signal decisions and cross-network transfer. CoLLMLight [2] incorporates relations between connected intersections and trains with environmental feedback. Traffic-R1 [3] reports improved zero-shot control after RL adaptation of the same Qwen2.5 backbone. RT-2 [4] demonstrates the value of vision-language pretraining for action generalization. VLALight brings traffic perception, cooperative signal learning, and adaptive reasoning together for multi-intersection control.
We have added Random and Rule-based mode selection to Table 4 of the revised manuscript. Random selects Fast or Slow randomly, while Rule-based selects the mode using predefined thresholds on the gap between the two largest candidate-phase queues. For a fair comparison, both baselines use the same VLALight signal decision policy and approximately match its Fast/Slow mode proportions. This holds the policy fixed and keeps the overall allocation of reasoning modes comparable, allowing us to evaluate how modes are assigned to traffic states. VLALight's adaptive mode selection improves all six metrics over both baselines. The table below combines the Pure Slow and VLALight results from our original submission with the Random and Rule-based results added in the revised manuscript:
This supports state-dependent allocation beyond matching mode proportions, while retaining control quality close to Pure Slow. Table 5 in our original submission reports Fast-mode and Slow-mode latency of 2.866/4.507 s and an overall sampled mean of 3.936 s, 12.7% below the Slow-mode latency.
References:
[1] Lai, S., Xu, Z., Zhang, W., Liu, H., and Xiong, H. LLMLight: Large Language Models as Traffic Signal Control Agents. Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 2335–2346, 2025.
[2] Yuan, Z., Lai, S., and Liu, H. CoLLMLight: Cooperative Large Language Model Agents for Network-Wide Traffic Signal Control. International Conference on Learning Representations, 2026.
[3] Zou, X., Yang, Y., Chen, Z., Hao, X., Chen, Y., Huang, C., and Liang, Y. Traffic-R1: Reinforced LLMs Bring Human-Like Reasoning to Traffic Signal Control Systems. Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics, pp. 21823–21838, 2026.
[4] Brohan, A., et al. RT-2: Vision-Language-Action Models Transfer Web Knowledge to Robotic Control. Proceedings of the Conference on Robot Learning, PMLR 229:2165–2183, 2023.