From Logits to Hierarchies: Hierarchical Clustering made Simple
Emanuele Palumbo, Moritz Vandenhirtz, Alain Ryser, Imant Daunhawer, Julia E. Vogt
Abstract
The hierarchical structure inherent in many realworld datasets makes the modeling of such hierarchies a crucial objective in both unsupervised and supervised machine learning. While recent advancements have introduced deep architectures specifically designed for hierarchical clustering, we adopt a critical perspective on this line of research. Our findings reveal that these methods face significant limitations in scalability and performance when applied to realistic datasets. Given these findings, we present an alternative approach and introduce a lightweight method that builds on pre-trained non-hierarchical clustering models. Remarkably, our approach outperforms specialized deep models for hierarchical clustering, and it is broadly applicable to any pre-trained clustering model that outputs logits, without requiring any fine-tuning. To highlight the generality of our approach, we extend its application to a supervised setting, demonstrating its ability to recover meaningful hierarchies from a pre-trained Ima-geNet classifier. Our results establish a practical and effective alternative to existing deep hierarchical clustering methods, with significant advantages in efficiency, scalability and performance.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 78c8c38d-c5c6-462d-8477-22e9fabcd5e8Cited by top-tier papers3
- Emergence of Hierarchical Emotion Organization in Large Language ModelsMaya Okawa, Bo Zhao, Eric Bigelow, Rose Yu et al.ICML 2026 · 4 citations
- Deep Taxonomic Networks for Unsupervised Hierarchical Prototype DiscoveryZekun Wang, Ethan L. Haarer, Tianyi Zhu, Zhiyi Dai et al.NeurIPS 2025 · 4 citations
- Tree-Structured Orthonormal Decomposition of the Aitchison SimplexDaisuke Yamada, Qijun Zhang, Travis Pence, Barbara Bendlin et al.ICML 2026
Builds on12
- From Trees to Continuous Embeddings and Back: Hyperbolic Hierarchical ClusteringInes Chami, Albert Gu, Vaggos Chatziafratis, Christopher RéNeurIPS 2020 · 125 citations
- No Cost Likelihood Manipulation at Test Time for Making Better Mistakes in Deep NetworksShyamgopal Karthik, Ameya Prabhu, Puneet K. Dokania, Vineet GandhiICLR 2021 · 26 citations
- Learning Structured Representations with Hyperbolic EmbeddingsAditya Sinha, Siqi Zeng, Makoto Yamada, Han ZhaoNeurIPS 2024 · 24 citations
- Hierarchically Clustered Representation LearningSu-Jin Shin, Kyungwoo Song, Il-Chul MoonAAAI 2020 · 18 citations
- Tree Variational AutoencodersLaura Manduchi, Moritz Vandenhirtz, Alain Ryser, Julia E. VogtNeurIPS 2023 · 17 citations
Related papers
- Top-Down Deep Clustering with Multi-Generator GANsDaniel P. M. de Mello, Renato M. Assunção, Fabricio MuraiAAAI 2022 · 22 citations
- Mini-cluster Guided Long-tailed Deep ClusteringZhixin Li, Yuheng Jia, Guanliang Chen, Hui Liu et al.ICLR 2026 · 11 citations
- P2OT: Progressive Partial Optimal Transport for Deep Imbalanced ClusteringChuyu Zhang, Hui Ren, Xuming HeICLR 2024 · 12 citations
- High-Performance Large-Scale Image Recognition Without NormalizationAndy Brock, Soham De, Samuel L. Smith, Karen SimonyanICML 2021 · 613 citations
- Unsupervised Hyperbolic Metric LearningJiexi Yan, Lei Luo, Cheng Deng, Heng HuangCVPR 2021
