- Rating
- 1(−1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
In this paper, the authors present AdaLoMamba3D, a locality-adaptive state-space framework for 3D point cloud representation learning. By introducing adaptive mechanisms into local feature aggregation and state-space interaction, the approach enables point cloud models to better accommodate diverse geometric structures and feature representations while maintaining the efficiency of the Mamba-based backbone.
Critical strengths
The paper inspires readers to propose locality-adaptive state-space frameworks for 3D point cloud learning.
Critical weaknesses
-
In the introduction, the authors claim that AdaLoMamba3D possesses adaptive locality for representation hierarchy, local feature distributions, and token states, which is highly appealing. However, PLE only sets different fixed neighborhood sizes across different layers, identical to those in other methods that the authors criticize, making it difficult to support the authors’ claim of flexibility in capturing diverse geometric patterns.
-
In SAF, the channel-wise modulation is predicted only for the reverse scan. What is the rationale behind this technical choice? Isn’t the forward scan on the same level as the reverse scan?
-
The experiment lacks quantitative comparison with recent works. Furthermore, to demonstrate the effectiveness of AdaLoMamba3D, additional experiments on more challenging point cloud tasks are necessary, such as point cloud semantic segmentation on S3DIS.
-
There have been many outstanding works on point cloud learning recently, such as [2] and [3], but the authors do not review these efforts. Therefore, as a submission to ICLR 2027, Section 2 is clearly inadequate. Furthermore, the last sentence in Section 2.2 is redundant with the previous sentence; the statement “Unlike prior methods, our approach focuses on the adaptivity of locality itself” is clear on its own.
-
In the third paragraph of the introduction, the author should draw a definitive conclusion based on the above, i.e., that locality should be adapted according to geometry, representation hierarchy, and feature states; then, in the fourth paragraph, AdaLoMamba3D is introduced.
-
In the second paragraph of the introduction, the authors present a misconception regarding Mamba3D [1]. Mamba3D does not include a bidirectional SSM for enhancing global modeling. The method focuses solely on locality perception, and its bidirectional SSM serves as a linear-complexity operator for channel modeling, as shown in Figure 2 of Mamba3D.
[1] X. Han, Y. Tang, Z. X. Wang, and X. Z. Li, ”Mamba3D: Enhancing Local Features for 3D Point Cloud Analysis via State Space Model,” in Proc. ACM International Conference on Multimedia (MM), Melbourne, VIC, Australia, Nov. 2024, pp. 4995--5004.
[2] D. K. Liang, T. R. Feng, X. Zhou, Y. M. Zhang, Z. K. Zou, and X. Bai, ”Parameter-Efficient Fine-Tuning in Spectral Domain for Point Cloud Learning,” IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI), vol. 47, no. 12, pp. 10949--10966, Dec. 2025.
[3] K. L. Qu, P. Gao, Q. Dai, and Y. H. Sun, ”Point-Focused Attention Meets Context-Scan State Space: Robust Biological Visual Perception for Point Cloud Representation,” in Proc. International Conference on Learning Representations (ICLR), Rio de Janeiro, Brazil, Apr. 2026, pp. 1--17.
Questions for authors
Please see the Critical Weaknesses section.
6 comments
Response to Weakness 2: Rationale for SAF Gate Placement
We are grateful to the reviewer for the constructive comments regarding the gate placement in SAF. We further clarify the rationale for adopting a single-branch dynamic gating mechanism and specifically applying it to C-SSM, supported by additional ablation experiments.
1. Rationale for Single-Branch Dynamic Gating and Gate Placement
The objective of SAF is to dynamically adjust the relative contributions of the two state-space branches based on the current input features, which can be achieved by modulating the fusion weight of a single branch. Accordingly, we retain L+SSM as the direct fusion pathway and generate channel-wise gating weights from the current token representations to dynamically modulate the complementary information provided by C-SSM.
When the gating weights equal 1, the outputs of the two branches are directly summed. When the gating weights are below or above 1, the relative contribution of C-SSM with respect to L+SSM decreases or increases accordingly. Therefore, even without applying an additional gate to L+SSM, the model can achieve input-dependent modulation of the relative contributions of the two branches. Compared with independently gating both branches, this design avoids additional gating parameters while preserving the original additive fusion as a special case. This choice does not imply any difference in the importance of the two branches for feature modeling. Rather, it enables dynamic feature fusion through a simpler architecture by retaining the direct output of L+SSM and selectively integrating the complementary information from C-SSM.
2. Ablation Study of Dynamic Gate Placement
To further evaluate the effectiveness of this gate placement, we conducted additional ablation experiments with different gating configurations. On ScanObjectNN OBJ_ONLY, we evaluated three strategies: applying dynamic gating only to L+SSM, applying independent gates to both branches, and applying dynamic gating only to C-SSM (SAF).
All experiments used the same pretrained initialization and identical downstream experimental settings. We report the mean overall accuracy (OA) and standard deviation across three independent random seeds (0, 1, and 42):
| Dynamic Gate Placement | OA (%) |
|---|---|
| L+SSM Only | 94.15±0.17 |
| Both Branches (Independent Gates) | 94.49±0.29 |
| C-SSM Only (SAF) | 94.61±0.26 |
The results show that SAF, which applies dynamic gating only to C-SSM, achieves the highest mean accuracy (94.61±0.26%) among all evaluated configurations. These findings further support our choice of gate placement, demonstrating that single-branch dynamic gating enables effective input-dependent feature fusion while maintaining a simple architecture.
Following the reviewer's suggestion, we have further clarified the rationale for SAF's single-branch gating mechanism and gate placement in the revised manuscript and included the additional three-seed ablation results in Table 10 (Dynamic Gate Placement) of Section 4.3.
Response to Weakness 3: Recent Method Comparisons and S3DIS Semantic Segmentation
We are grateful to the reviewer for the constructive suggestions regarding the completeness of our experimental evaluation. We agree that comparisons with recent methods and validation on more challenging downstream tasks are important for comprehensively evaluating AdaLoMamba3D. In response, we have expanded the quantitative comparisons with recent studies and conducted additional semantic segmentation experiments on S3DIS.
1. Quantitative Comparisons with Recent Methods
We have expanded Tables 1–3 of the revised manuscript to include representative recent methods, such as RI-MAE (AAAI 2025), Point-MaDi (NeurIPS 2025), PointGST-M (TPAMI 2025), PointMSMamba (TVC 2025), and PointMamba++ (IET CV 2026). Together with existing comparisons involving Point-PQAE and StruMamba3D, these additions provide a more comprehensive evaluation of classification performance on ScanObjectNN and ModelNet40, as well as part segmentation performance on ShapeNetPart. ModelNet40 classification results are reported without voting.
The following table summarizes selected published results of recent methods on these benchmarks:
| Method | PB_T50_RS (%) | ModelNet40 (%) | ShapeNetPart Ins. mIoU (%) |
|---|---|---|---|
| RI-MAE (AAAI 2025) | 85.80 | – | 84.3 |
| Point-MaDi (NeurIPS 2025) | 89.52 | 93.8 | 86.3 |
| PointGST-M (TPAMI 2025) | 85.29 | 93.5 | 85.8 |
| PointMSMamba (TVC 2025) | 88.72 | 93.6 | 86.4 |
| PointMamba++ (IET CV 2026) | 87.96 | 93.7 | 86.1 |
| AdaLoMamba3D (Ours) | 94.55 | 95.7 | 86.5 |
2. Additional S3DIS Semantic Segmentation Experiments
To further evaluate the effectiveness of AdaLoMamba3D on more challenging scene-level point cloud understanding tasks, we conducted additional semantic segmentation experiments on S3DIS Area 5. We evaluated AdaLoMamba3D and compared its performance with representative existing methods. The results are presented below:
| Method | mAcc (%) | mIoU (%) |
|---|---|---|
| PointNet++ (NeurIPS 2017) | 67.1 | 53.5 |
| Point-BERT (CVPR 2022) | 70.3 | 60.8 |
| Point-MAE (ECCV 2022) | 69.9 | 60.8 |
| PointGPT-L (NeurIPS 2023) | 70.6 | 62.2 |
| Point-PQAE (ICCV 2025) | 70.6 | 61.4 |
| PCM (AAAI 2025) | – | 63.4 |
| Point-MaDi (NeurIPS 2025) | 71.0 | 61.2 |
| PointGST (TPAMI 2025) | 68.4 | 58.6 |
| RI-MAE (AAAI 2025) | 68.4 | 60.3 |
| AdaLoMamba3D (Ours) | 71.0 | 63.4 |
AdaLoMamba3D achieves 71.0% mAcc and 63.4% mIoU on S3DIS Area 5, matching the highest reported values among the compared methods on both metrics. These results provide further evidence that our approach is effective not only for object-level classification and part segmentation but also for more challenging scene-level semantic segmentation, offering additional support for its point cloud representation learning capabilities.
Following the reviewer's suggestion, we have expanded the quantitative comparisons with recent methods in Tables 1–3 and added the S3DIS Area 5 semantic segmentation results in Table 4 of the revised manuscript, providing a more comprehensive evaluation across different downstream tasks.
Response to Weakness 1: Depth-Dependent Scheduling and Input-Dependent Adaptation
We appreciate the reviewer's insightful comments on the adaptive locality modeling in our framework. We acknowledge that the original manuscript did not sufficiently distinguish the adaptation mechanisms of the three components, particularly giving the impression that PLE dynamically selects neighborhood sizes based on input geometry. We apologize for this lack of clarity and provide the following clarification.
1. Clarification of PLE and Framework-Level Adaptation
PLE employs a predefined depth-dependent neighborhood schedule [4, 8, 12]. Its primary objective is to align the spatial range of local feature interactions with the progressive development of feature representations across network depths. In earlier layers, smaller neighborhoods allow the model to focus on fine-grained geometric information near each patch center, whereas progressively larger neighborhoods provide broader spatial context for higher-level feature representations.
Furthermore, PLE maintains the same patch centers across network depths, ensuring consistent spatial references for local feature aggregation. When patch centers and distance metrics remain unchanged, progressively increasing KNN neighborhood sizes produces nested neighborhood sets, allowing the model to incorporate more distant neighbors while retaining the coverage of nearby ones. Thus, PLE introduces a depth-dependent structural inductive bias by aligning neighborhood expansion with representation hierarchy.
2. Comparison with Geometry-Based Adaptive Neighborhood Selection
To further evaluate progressive neighborhood scheduling, we additionally tested four adaptive neighborhood selection strategies based on local geometric statistics. Experiments were conducted on ScanObjectNN OBJ_ONLY using three independent random seeds (0, 1, and 42). The results are presented below:
PLE achieves the highest mean accuracy (94.61±0.26%) among the evaluated neighborhood selection strategies, outperforming the best-performing geometry-based adaptive strategy by 0.46 percentage points. These results provide further empirical support for the effectiveness of depth-dependent progressive scheduling within our current architecture.
3. Design Rationale
The key distinction lies in how neighborhood selection accounts for representation hierarchy. The evaluated geometry-based adaptive strategies primarily determine neighborhood sizes from local geometric statistics of the input point cloud, without explicitly considering the changing feature aggregation requirements across network depths. In contrast, PLE coordinates neighborhood expansion with progressive feature abstraction, allowing shallow layers to focus on nearby geometric structures while deeper layers integrate broader spatial context. Combined with the nested structure of KNN neighborhoods and consistent patch centers, this design aligns local information aggregation with representation depth.
Meanwhile, geometry-based adaptive neighborhood selection and depth-dependent scheduling are complementary rather than mutually exclusive. In future work, we intend to investigate dynamic neighborhood selection mechanisms that jointly consider local geometry, representation hierarchy, and task-specific requirements to further improve the modeling of diverse geometric patterns.
Following the reviewer's suggestion, we have refined the relevant descriptions in the Abstract, Introduction, and Method sections to clarify the respective roles of PLE, LSA, and SAF. We have also added three-seed comparisons between PLE and four geometry-based adaptive strategies in Table 9 of Section 4.3.