ECCV 2026 · Beyond Euclidean Workshop · Oral

Hyper3-CLIP: Hierarchy-Conditioned Hyperbolic Vision-Language Training

A hyperbolic CLIP that learns from every part of the caption.

Matin Mahmood1 Antonio Rueda-Toicen2 Mohamed ElBassat3 Seifeldin Elkerdany4 Weixing Wang2 Gerard de Melo2
1hyper³labs, Berlin 2Hasso Plattner Institute, University of Potsdam 3Alexandria University 4Alamein International University

One image, several levels of meaning

CLIP-like vision-language models learn strong global image-text representations, but a single pooled image vector can average away relational structure such as part-whole and parent-child relations.

Hyper3-CLIP builds a lightweight hierarchy from each caption: the full caption, sentence fragments, localized descriptions, and extracted phrases. Each query pools a query-specific visual representation, and the resulting text and visual nodes are trained together in hyperbolic space.

At inference time, the extra pooling path disappears. Hyper3-CLIP runs as a plain CLIP dual encoder.

Every query becomes a node

Each textual query attends to its matching image patches and becomes its own node.

Detailed Hyper3-CLIP pipeline showing penguin image patches, constructed queries, cross-attention pooling, and entailment relations in Lorentz space
The training pipeline constructs query-specific image and text nodes in a shared hyperbolic space.
1 Iq ≼ Tq

Query alignment

The visual node lies inside the entailment cone of its query text.

2 I ≼ Iq

Visual hierarchy

The full scene remains more specific than the concept selected by a query.

3 Tπ(q) ≼ Tq

Text hierarchy

Parent links organize caption, sentence, localized text, and phrase nodes.

Intuitions

Hyper3-CLIP uses extra machinery during training and omits it during inference.

During training

Extra supervision shapes the encoders

Text query ─┐
            ├─ cross-attention over image patches
Image ViT ──┘        ↓
              query-specific node
                      ↓
              hierarchy losses

The model builds queries from captions, sentences, localized descriptions, and phrases. Each query attends to image patches that match its meaning. This process produces visual nodes and teaches the shared encoders about parts, context, and hierarchy.

During inference

Two encoders produce one score

Image → image encoder → one global embedding ─┐
                                              ├─ similarity score
Text  → text encoder  → one global embedding ─┘

Inference requires no caption decomposition, query hierarchy, per-query cross-attention, or hierarchy-loss computation. A deployed model bypasses the training branch and may exclude it.

Training creates the hierarchy trace

The training signal remains in the trained model. The hierarchy losses changed the shared encoder and projection weights. It is like using scaffolding while constructing a building: builders remove the scaffold, but the building retains the structure created with its support.

A node is more than an embedding

A node is the represented entity within a hierarchy or graph. It has an embedding, plus an identity and relationships to other nodes.

For Hyper3-CLIP, a query produces:

  • a text node Tq, represented by a text embedding;
  • a visual node Iq, represented by a query-weighted combination of image-patch embeddings;
  • entailment relationships connecting these nodes to image, caption, parent, and child nodes.

Analogy: a node is a city; its embedding is the city’s location on a map.

Entailment cones encode direction

Similarity asks whether two embeddings are close. An entailment cone asks another question: which embedding represents the more specific meaning?

Each node b defines a cone containing the embeddings permitted to be more specific than b. For the relation ab, the more specific node a should lie inside the cone rooted at b. If a falls outside that cone, the training objective applies a penalty.

A useful analogy is a flashlight beam. The node at the flashlight is the broader concept, and the beam marks the region where valid specializations can appear. Two nodes may be close, but their relationship respects the hierarchy only when the more specific node lies inside the broader node’s beam.

For Hyper3-CLIP, the three relations mean:

  • Iq ≼ Tqthe query-conditioned visual node is a specific visual instance of the query text.
  • I ≼ Iqthe complete image is more specific than the visual concept selected by the query.
  • Tπ(q) ≼ Tqthe construction parent, such as a detailed caption, is more specific than the shorter query derived from it.

Here, “parent” describes how the query was constructed; it does not always mean “more general.” Entailment cones encourage a geometric ordering, but they do not constitute a logical proof that one statement entails another.

Inspect the embedding space with HyperView

Explore model embeddings and their geometry on this page. In the Poincaré disk, more specific concepts appear near the boundary, while more general concepts appear near the center. Compare this hierarchy with CLIP’s embedding space under spherical and unbounded Euclidean projections. In the UI, use Shift + left-click and drag to select image samples.

Open full screen

The demo is hosted on Hugging Face Spaces and may take a moment to wake. View the Space page.

Fine-grained supervision improves transfer

Zero-shot evaluation with a ViT-B/16 backbone. Compared with OpenAI CLIP using the same backbone, Hyper3-CLIP improves all eight displayed COCO/Flickr R@5 and R@10 retrieval scores. Its zero-shot multi-label mAP rises from 68.55 to 78.20 on VOC and from 44.89 to 54.28 on COCO.

Zero-shot retrieval

Higher recall on COCO and Flickr

R@5 / R@10
RetrievalCLIPUNCHAHyper3-CLIPΔ vs UNCHA
COCO text71.4 / 81.572.7 / 82.775.7 / 84.3+3.0 / +1.6
Flickr text93.6 / 96.991.4 / 95.995.4 / 97.6+4.0 / +1.7
COCO image57.4 / 68.560.0 / 71.063.0 / 73.2+3.0 / +2.2
Flickr image83.5 / 89.984.9 / 91.286.4 / 91.4+1.5 / +0.2

Zero-shot multi-label

VOC and COCO mAP

78.20VOC
54.28COCO

Hyper3-CLIP leads the compared hyperbolic vision-language models (MERU, HyCoCLIP, UNCHA, and PHyCLIP) on both datasets.

Zero-shot classification

16-dataset average

47.84vs 47.41 for UNCHA

Mean per-class accuracy under the stated prompt protocol.

Caption-hierarchy ablation

Correct parent links drive the gain

Full training improves caption-hierarchy AP by 3.64 points over the no-query baseline.

Citation

BibTeX
@article{mahmood2026hyper3clip,
  title   = {Hyper3-CLIP: Hierarchy-Conditioned Hyperbolic
             Vision-Language Training},
  author  = {Mahmood, Matin and Rueda-Toicen, Antonio and
             ElBassat, Mohamed and Elkerdany, Seifeldin and
             Wang, Weixing and de Melo, Gerard},
  journal = {arXiv preprint arXiv:2608.29313},
  year    = {2026},
  note    = {ECCV 2026 Beyond Euclidean Workshop},
  url     = {https://arxiv.org/abs/2608.29313}
}