English

HAC: Parameter-Efficient Hyperbolic Adaptation of CLIP for Zero-Shot VQA

Computer Vision and Pattern Recognition 2026-04-28 v1

Abstract

Recent advances in representation learning have shown that hyperbolic geometry can offer a more expressive alternative to the Euclidean embeddings used in CLIP models, capturing hierarchical structures and leading to better-organized representations. However, current hyperbolic CLIP variants are trained entirely from scratch, which is computationally expensive and resource-intensive. In this work, we propose HAC (Hyperbolic Adaptation of CLIP), a parameter-efficient framework that enables pretrained CLIP models to transition into hyperbolic space via lightweight fine-tuning. We apply HAC to Visual Question Answering (VQA), where models must interpret visual elements and align them with textual queries. Notably, HAC's training is performed on a dataset with no overlap with any VQA benchmark, resulting in a strict zero-shot evaluation paradigm that underscores HAC's task-agnostic adaptability. We evaluate HAC across a diverse suite of VQA benchmarks spanning General, Reasoning, and OCR categories. Both HAC-S (small) and HAC-B (medium) consistently surpass Euclidean baselines and prior hyperbolic approaches, with HAC-B delivering up to a +1.9 point average improvement over CLIP-B on reasoning-intensive tasks. Our code is available at https://github.com/fdibiton/HAC

Keywords

Cite

@article{arxiv.2604.23665,
  title  = {HAC: Parameter-Efficient Hyperbolic Adaptation of CLIP for Zero-Shot VQA},
  author = {Francesco Dibitonto and Cigdem Beyan and Vittorio Murino},
  journal= {arXiv preprint arXiv:2604.23665},
  year   = {2026}
}

Comments

This is the preprint version of the paper. The final version has been accepted for publication in the Proceedings of the 28th International Conference on Pattern Recognition (ICPR 2026)

R2 v1 2026-07-01T12:35:42.631Z