- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
MixPT reuses a fixed serialization order within a single attention stage and interleaves window and global attention, for example with a WWGWWGWW schedule. For large scenes, the global branch pools spatial tokens and broadcasts residual updates back to the original resolution. Evaluation covers four semantic segmentation datasets and two instance segmentation datasets. Its main contribution is a practical trade-off between accuracy and single-forward latency.
Critical strengths
-
The design is simple and addresses a concrete computational bottleneck. Fixed serialization and occasional global blocks reduce repeated token reordering. Serialization-related latency on nuScenes decreases from 10.61 ms for LitePT-S to 1.01 ms.
-
MixPT-S offers a useful accuracy–latency trade-off across four semantic segmentation datasets, reducing single-forward latency by approximately 19%–32% over LitePT-S while improving no-TTA mIoU by 0.2–0.5 percentage points.
-
Controlled ablations support combining fixed windows with global attention. Adding two global blocks increases ScanNet mIoU from 73.7 to 76.0, with latency increasing only from 17.16 to 17.48 ms.
Critical weaknesses
-
Conceptual novelty is limited, and the contributions of individual changes are not fully isolated. The paper acknowledges prior local/global attention designs, while also changing stage structure, pooling/upsampling, and normalization relative to LitePT without a complete step-by-step ablation
-
Accuracy gains are small and not consistent across tasks. Semantic segmentation improvements over LitePT-S are only 0.2–0.5 points without multiseed variability, while ScanNet instance segmentation mAP is lower than LitePT-S* (41.1 versus 41.7).
Questions for authors
see Weaknesses
============================================
Thanks for authors' responses. After reading other reviewers' comments, I am willing to keep my initial score.
3 comments
Response to Weakness 2
Regarding accuracy improvements. Our main focus was to improve efficiency while keeping accuracy competitive. We can then use the time saved to run larger models for higher accuracy. For example, MixPT-L achieves higher accuracy on ScanNet than PTv3 (76.7 vs. 76.5 mIoU) with lower latency (33.4 vs. 48.1 ms) as shown in Table R3-2.
Table R3-2: Accuracy-latency comparison (w/o TTA)
| Method | SemanticKITTI mIoU (%) | SemanticKITTI Latency (ms) | ScanNet mIoU (%) | ScanNet Latency (ms) |
|---|---|---|---|---|
| PTv3 | 69.6 | 63.6 | 76.5 | 48.1 |
| LitePT-S | 69.8 | 36.4 | 75.5 | 25.7 |
| Volt-S | 69.4 | 140.3 | 76.4 | 23.0 |
| MixPT-S (Ours) | 70.0 | 28.2 | 76.0 | 17.5 |
| MixPT-B (Ours) | 70.4 | 56.4 | 76.4 | 30.2 |
| MixPT-L (Ours) | 70.6 | 72.4 | 76.7 | 33.4 |
Dear Reviewer,
Thank you for your helpful feedback. We appreciate your careful consideration of our responses. We have also added a step-by-step ablation from LitePT-S to MixPT-S to the revised manuscript (Table A9, p. 21).
We would be happy to answer any remaining questions during the discussion period. Thank you for your time.
Response to Weakness 1
Thank you for your valuable feedback. It gave us a chance to think more carefully about our contributions.
Regarding conceptual novelty. We agree that prior work has explored using both local and global attention. We think our contribution is a different way to address the computational challenges of attention in scene-level point clouds. Our analysis examines how effectively changing window layouts enables information exchange and whether global attention is needed at every block. This led us to improve computational efficiency in point transformers.
Regarding the contributions of individual changes. We also evaluated the intermediate steps from LitePT-S to MixPT-S using three random seeds to see how the changes affect accuracy and latency (Table R3-1).
TZ), with layout reuse across all eight blocks.WWGWWGWW(MixPT-S).