用轻量级结构恢复点云细粒度局部信息,实现高效微调。
Point Ladder Tuning: Parameter-Efficient Hierarchical Adaptation for 3D Point Cloud Understanding

- 构建多分辨率局部特征金字塔,从原始点直接恢复细节
- 仅用2.71%参数实现分类任务顶尖性能,密集预测仅需7.69%
- 适合资源受限场景下的3D点云模型快速适配
微调预训练点云骨干网络通常需更新全部参数,带来巨大计算与内存开销。更重要的是,现代点云骨干依赖激进的分块与下采样,虽生成紧凑全局特征,却不可逆地丢失细粒度局部几何,成为参数高效微调的固有瓶颈。现有方法仅作用于粗化特征,能调节全局语义但难以恢复多尺度局部性。本文提出点梯度微调(PLT),一种感知局部性的参数高效微调框架,通过冻结主干实现层次化、实例相关的自适应。PLT形成轻量闭环:(i) 层次化梯度网络(HLN)直接从原始点构建多分辨率局部特征金字塔;(ii) 局部-全局融合(LGF)对齐并融合局部金字塔与中间骨干语义;(iii) 动态提示生成器生成实例感知的多尺度提示,有效调控冻结主干。针对密集预测,进一步引入轻量分割头,逐步上采样融合特征,并利用主干先验优化精细结构。大量实验表明,PLT在分类与密集预测任务中持续优于现有基线,仅需极少量可训练参数:分类任务2.71%,密集预测7.69%,且在更大模型如PointGPT-L上仅需0.36%参数。代码已开源。
原文摘要 · Abstract (English)
Fine-tuning pre-trained point-cloud backbones typically updates all parameters, resulting in substantial computation and memory overhead. More importantly, modern point backbones rely on aggressive tokenization and downsampling, which yields compact global tokens but irreversibly discards fine-grained local geometry, an inherent bottleneck for parameter-efficient adaptation. Consequently, existing PEFT methods that operate only on these coarsened tokens can modulate global semantics but struggle to recover the missing multi-scale locality. We present Point Ladder Tuning (PLT), a locality-aware PEFT framework that performs hierarchical, instance-conditioned adaptation while keeping the backbone frozen. PLT forms a lightweight closed loop: (i) a Hierarchical Ladder Network (HLN) constructs a multi-resolution local feature pyramid directly from raw points; (ii) a Local-Global Fusion (LGF) aligns and fuses local pyramids with intermediate backbone semantics; and (iii) a Dynamic Prompt Generator produces instance-aware multi-scale prompts to modulate the frozen backbone effectively. For dense prediction, we further introduce a lightweight segmentation head that progressively upsamples fused features and leverages backbone priors to refine fine structures. Extensive experiments on classification and dense prediction show that PLT consistently surpasses prior PEFT baselines with minimal tunable parameters. PLT achieves state-of-the-art performance using only 2.71% trainable parameters for classification and 7.69% for dense prediction, and scales favorably to larger backbones, requiring merely 0.36% parameters on PointGPT-L. The code is released at https://github.com/JunLinChang/ECCV2026-PLT.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。