Polaris: Coupled Orbital Polar Embeddings for Hierarchical Concept Learning

arXiv cs.LG / 5/4/2026

📰 NewsModels & Research

Key Points

  • Polaris is a polar hyperspherical embedding framework designed to learn hierarchical concept representations by decoupling semantic meaning from hierarchical structure using angular geometry and radius.
  • The method maps latent vectors onto a hypersphere via tangent-space projection and an exponential map, then trains unit-norm representations with spherical linear layers.
  • Polaris uses a combination of local constraint learning, global regularization to prevent geometric collapse, and uncertainty-aware asymmetric objectives to encourage directional containment in the hierarchy.
  • For inference, it performs structure-guided retrieval to narrow down candidate parent nodes before final ranking, improving efficiency.
  • Experiments on taxonomy expansion tasks (spanning trees, multi-parent DAGs, and multimodal hierarchies) show consistent gains of up to ~19 points in top-K retrieval and up to ~60% lower mean rank versus 14 strong baselines.

Abstract

Real-world knowledge is often organized as hierarchies such as product taxonomies, medical ontologies, and label trees, yet learning hierarchical representations is challenging due to asymmetric structure and noisy semantics. We introduce Polaris, a polar hyperspherical embedding framework that separates semanticity from hierarchy using angular geometry and radius, enabling the learning of meaning and structure without interference. To map latent representation onto the sphere, we project it to the tangent space at the north pole, apply the exponential map, and learn unit-norm representations using spherical linear layers. Polaris then combines robust local constraints, global regularization that prevents geometric collapse, and uncertainty-aware asymmetric objectives that encourage directional containment. At inference time, Polaris uses structure-guided retrieval to efficiently narrow down candidate parents before final ranking. We evaluate Polaris on different settings of taxonomy expansion - spanning trees, multi-parent DAGs, and multimodal hierarchies, showing consistent improvements of up to ~19 points in top-K retrieval and up to ~60% reduction in mean rank over fourteen strong baselines.