Composed Image Retrieval with Text Feedback via Multi-grained Uncertainty Regularization
Yiyang Chen, Zhedong Zheng, Wei Ji, Leigang Qu, Tat-Seng Chua
TL;DR
This work addresses text-guided image retrieval where users transition from coarse to fine feedback, identifying a misalignment between traditional one-to-one metric learning and multi-grained retrieval. It proposes a unified learning framework with two modules: uncertainty modeling, which introduces Gaussian fluctuation to simulate intra-class jitter, and uncertainty regularization, which adaptively scales the learning objective to handle one-to-many matching during training. The method combines a coarse-grained loss with a dynamically weighted fine-grained loss, yielding improved Recall@K across FashionIQ, Fashion200k, and Shoes, and demonstrates robustness through ablations and comparisons with strong baselines. The approach offers practical benefits for real-world retrieval by preserving potential candidates early in retrieval and integrating multi-grained supervision into a single optimization objective.
Abstract
We investigate composed image retrieval with text feedback. Users gradually look for the target of interest by moving from coarse to fine-grained feedback. However, existing methods merely focus on the latter, i.e., fine-grained search, by harnessing positive and negative pairs during training. This pair-based paradigm only considers the one-to-one distance between a pair of specific points, which is not aligned with the one-to-many coarse-grained retrieval process and compromises the recall rate. In an attempt to fill this gap, we introduce a unified learning approach to simultaneously modeling the coarse- and fine-grained retrieval by considering the multi-grained uncertainty. The key idea underpinning the proposed method is to integrate fine- and coarse-grained retrieval as matching data points with small and large fluctuations, respectively. Specifically, our method contains two modules: uncertainty modeling and uncertainty regularization. (1) The uncertainty modeling simulates the multi-grained queries by introducing identically distributed fluctuations in the feature space. (2) Based on the uncertainty modeling, we further introduce uncertainty regularization to adapt the matching objective according to the fluctuation range. Compared with existing methods, the proposed strategy explicitly prevents the model from pushing away potential candidates in the early stage, and thus improves the recall rate. On the three public datasets, i.e., FashionIQ, Fashion200k, and Shoes, the proposed method has achieved +4.03%, +3.38%, and +2.40% Recall@50 accuracy over a strong baseline, respectively.
