- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper addresses the aggregation of noisy, fragmented local map element detections into coherent vectorized maps. The authors observe that existing methods such as adopting fixed association thresholds either leave fragments unmerged or merge neighboring lanes, while fixed smoothing rules may ignore noise or remove geometric details. The proposed MapMergeLLM learns aggregation as sequence generation, using corrupted clean maps, coordinate tokens, geometric pretraining and a line-level association objective.
Critical strengths
- The motivation of this paper is quite clear in identifying a stubborn difficulty in map construction, and the typical failure patterns are illustrated in Figure 1. The porposed approach of learning context-dependent aggregation is reasonable since lane spacing, curvature and prediction errors vary within a scene. Synthetic corruption training also offers a plausible way to reduce dependence on the output distribution of the upstream detector.
- The main experiments support the usefulness of the proposed pipeline, with higher F1 scores reported than the baselines VMA and MonoLaM aggregators on both the Argoverse2 and nuScenes benchmarks. In the ablation experiments, the authors also show that coordinate representation and pretraining do improve performance.
Critical weaknesses
- While the proposed approach does improve upon baselines, the rationale and benefits for using a large language model to perform aggregation remain unclear. There is no learned non-LLM aggregator model trainined with the same serialization and training data, so the evidence does not clearly establish the benefits of a LLM aggregator against alternative light-weight aggregator models.
- The overall robustness and practicality of the method is also questionable. The benchmarks assume no pose noises which is impractical. Secondly, although an LLM‑aggregator can be highly effective, it often demands a dedicated processing unit, and may therefore be computationally prohibitive.
Questions for authors
- How were the baseline aggregator parameters selected for VMA and MonoLaM? Were they tuned separately for each detector using validation data?
- What are the decoding time and memory requirements of the LLM aggregator compared to the baselines?