English

Efficient Test-Time Optimization for Depth Completion via Low-Rank Decoder Adaptation

Computer Vision and Pattern Recognition 2026-04-06 v4

Abstract

Zero-shot depth completion has gained attention for its ability to generalize across environments without sensor-specific datasets or retraining. However, most existing approaches rely on diffusion-based test-time optimization, which is computationally expensive due to iterative denoising. Recent visual-prompt-based methods reduce training cost but still require repeated forward--backward passes through the full frozen network to optimize input-level prompts, resulting in slow inference. In this work, we show that adapting only the decoder is sufficient for effective test-time optimization, as depth foundation models concentrate depth-relevant information within a low-dimensional decoder subspace. Based on this insight, we propose a lightweight test-time adaptation method that updates only this low-dimensional subspace using sparse depth supervision. Our approach achieves state-of-the-art performance, establishing a new Pareto frontier between accuracy and efficiency for test-time adaptation. Extensive experiments on five indoor and outdoor datasets demonstrate consistent improvements over prior methods, highlighting the practicality of fast zero-shot depth completion.

Keywords

Cite

@article{arxiv.2603.01765,
  title  = {Efficient Test-Time Optimization for Depth Completion via Low-Rank Decoder Adaptation},
  author = {Minseok Seo and Wonjun Lee and Jaehyuk Jang and Changick Kim},
  journal= {arXiv preprint arXiv:2603.01765},
  year   = {2026}
}

Comments

17 pages, 7 figures [We achieved a new Pareto frontier in test-time depth completion.]

R2 v1 2026-07-01T10:59:03.513Z