KPConvX: Modernizing Kernel Point Convolution with Kernel Attention

Hugues Thomas, Yao-Hung Tsai, Tim D. Barfoot, Jian Zhang
2/9/2026

No official code found. Best implementation: apple/ml-kpconvx (81 stars, last commit 2024-12-24).

Abstract

In the field of deep point cloud understanding, KP-Conv is a unique architecture that uses kernel points to locate convolutional weights in space, instead of relying on Multi-Layer Perceptron (MLP) encodings. While it initially achieved success, it has since been surpassed by recent MLP networks that employ updated designs and training strategies. Building upon the kernel point principle, we present two novel designs: KPConvD (depthwise KP-Conv), a lighter design that enables the use of deeper architectures, and KPConvX, an innovative design that scales the depthwise convolutional weights of KPConvD with kernel attention values. Using KPConvX with a modern architecture and training strategy, we are able to outperform current state-of-the-art approaches on the ScanObjectNN, Scannetv2, and S3DIS datasets. We validate our design choices through ablation studies and release our code and models.

View on arXivView PDF

Code Implementations(1)

apple/ml-kpconvxCommunity100%
8116C, C++Nov 14, 20241 years agoNOASSERTION

Similar Papers

Cite this paper

@article{thomas2026kpconvx,
  title  = {KPConvX: Modernizing Kernel Point Convolution with Kernel Attention},
  author = {Hugues Thomas and Yao-Hung Tsai and Tim D. Barfoot and Jian Zhang},
  year   = {2026},
  eprint = {2405.13194},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/pdf/2405.13194},
  journal = {CVPR 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2405.13194.svg)](https://codeofpaper.com/paper/2405.13194)

Discussion