Hierarchical Transformers for Unsupervised 3D Shape Abstraction

Aditya Vora, Lily Goli, Andrea Tagliasacchi, Hao Zhang
10/31/2025
cs.CV

No official code found. Best implementation: aditya-vora/HiT (7 stars, last commit 2026-01-28).

Abstract

We introduce HiT, a novel hierarchical neural field representation for 3D shapes that learns general hierarchies in a coarse-to-fine manner across different shape categories in an unsupervised setting. Our key contribution is a hierarchical transformer (HiT), where each level learns parent-child relationships of the tree hierarchy using a compressed codebook. This codebook enables the network to automatically identify common substructures across potentially diverse shape categories. Unlike previous works that constrain the task to a fixed hierarchical structure (e.g., binary), we impose no such restriction, except for limiting the total number of nodes at each tree level. This flexibility allows our method to infer the hierarchical structure directly from data, over multiple shape categories, and representing more general and complex hierarchies than prior approaches. When trained at scale with a reconstruction loss, our model captures meaningful containment relationships between parent and child nodes. We demonstrate its effectiveness through an unsupervised shape segmentation task over all 55 ShapeNet categories, where our method successfully segments shapes into multiple levels of granularity.

View on arXivView PDF

Code Implementations(1)

aditya-vora/HiTCommunity62%

HiT: Hierarchical Transformers for Unsupervised 3D Shape Abstraction

75C, C++Oct 30, 20258 months ago

Similar Papers

Cite this paper

@article{vora2025hierarchical,
  title  = {Hierarchical Transformers for Unsupervised 3D Shape Abstraction},
  author = {Aditya Vora and Lily Goli and Andrea Tagliasacchi and Hao Zhang},
  year   = {2025},
  eprint = {2510.27088},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2510.27088v2}
}

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/2510.27088.svg)](https://codeofpaper.com/paper/2510.27088)

Discussion