Pith. sign in

HyperCLIP: Adapting Vision-Language models with Hypernetworks

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Self-supervised vision-language models trained with contrastive objectives form the basis of current state-of-the-art methods in AI vision tasks. The success of these models is a direct consequence of the huge web-scale datasets used to train them, but they require correspondingly large vision components to properly learn powerful and general representations from such a broad data domain. This poses a challenge for deploying large vision-language models, especially in resource-constrained environments. To address this, we propose an alternate vision-language architecture, called HyperCLIP, that uses a small image encoder along with a hypernetwork that dynamically adapts image encoder weights to each new set of text inputs. All three components of the model (hypernetwork, image encoder, and text encoder) are pre-trained jointly end-to-end, and with a trained HyperCLIP model, we can generate new zero-shot deployment-friendly image classifiers for any task with a single forward pass through the text encoder and hypernetwork. HyperCLIP increases the zero-shot accuracy of SigLIP trained models with small image encoders by up to 3% on ImageNet and 5% on CIFAR-100 with minimal training throughput overhead.

fields

cs.CV 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

(Almost) Free Modality Stitching of Foundation Models

cs.CV · 2025-07-14 · conditional · novelty 5.0

A hypernetwork that generates connector weights for all image-text model pairs can rank pairs like grid search at about 10x lower training cost, but the best connector lags grid search by a few points.

citing papers explorer

Showing 1 of 1 citing paper.

  • (Almost) Free Modality Stitching of Foundation Models cs.CV · 2025-07-14 · conditional · none · ref 3 · internal anchor

    A hypernetwork that generates connector weights for all image-text model pairs can rank pairs like grid search at about 10x lower training cost, but the best connector lags grid search by a few points.