PowerCLIP: Powerset Alignment for Contrastive Pre-Training
Masaki Kawamura, Nakamasa Inoue, Rintaro Yanagi, Hirokatsu Kataoka, Rio Yokota
TL;DR
PowerCLIP addresses the challenge of modeling compositionality in vision-language pre-training by exhaustively aligning powersets of image regions with textual parse-tree phrases. It introduces Non-Linear Aggregators to approximate the exponential powerset computations with linear-time complexity, backed by theoretical guarantees. Empirical results show PowerCLIP achieves state-of-the-art performance across 28 benchmarks, including zero-shot classification, retrieval, robustness, and compositionality, outperforming strong global and local alignment baselines. The approach demonstrates robust, fine-grained text-to-image grounding and grounding-to-text reasoning, with practical implications for more compositional multimodal understanding.
Abstract
Contrastive vision-language pre-training frameworks such as CLIP have demonstrated impressive zero-shot performance across a range of vision-language tasks. Recent studies have shown that aligning individual text tokens with specific image patches or regions enhances fine-grained compositional understanding. However, it remains challenging to capture compositional semantics that span multiple image regions. To address this limitation, we propose PowerCLIP, a novel contrastive pre-training framework enhanced by powerset alignment, which exhaustively optimizes region-to-phrase alignments by minimizing the loss defined between powersets of image regions and textual parse trees. Since the naive powerset construction incurs exponential computational cost due to the combinatorial explosion in the number of region subsets, we introduce efficient non-linear aggregators (NLAs) that reduce complexity from O(2^M) to O(M) with respect to the number of regions M, while approximating the exact loss value with arbitrary precision. Our extensive experiments demonstrate that PowerCLIP outperforms state-of-the-art methods in zero-shot classification and retrieval tasks, underscoring the compositionality and robustness of our approach. Our code will be made publicly available.
