Image retrieval has traditionally been formulated as a point-wise matching problem, where each candidate image is scored in isolation. However, this atomic paradigm fails to capture the complexity of human search intent within personal photo collections, where users often seek compact visual stories bound by structural relations rather than isolated snapshots. To address this limitation, we introduce Image Bundle Composition (IBC), a novel paradigm that shifts the objective from ranking individual images to dynamically composing cohesive image bundles from a massive, unstructured photo pool. Since target bundles are not predefined, IBC presents a severe combinatorial explosion challenge and demands modeling non-decomposable joint relevance. To establish this paradigm, we construct IBCBench, the first IBC benchmark dataset containing 109,467 images and 667 verified queries, built via a semi-automated verification pipeline. Furthermore, we propose BundleWeaver, an agentic framework that reformulates IBC as query-conditioned incremental hyperedge discovery. By employing a Large Language Model to adaptively search for missing relational roles and utilizing a Vision-Language Model for whole-bundle verification, BundleWeaver effectively navigates the combinatorial space. Extensive experiments demonstrate that while state-of-the-art embedding models and static decompose-and-rerank paradigms suffer from relational blindness, BundleWeaver achieves substantial performance gains, highlighting the necessity of shifting from atomic scoring to dynamic relational composition. Our dataset and code are available.
Figures & tables
Figure 1: Comparison of different text-to-image retrieval paradigms.
Figure 2: Framework illustration of our proposed BundleWeaver.
Type
Method
Precision
Recall
F1
EM
Multimodal Embedding
CLIP-ViT-B/32
2.21
2.21
2.21
0.00
SigLIP2-giant
9.97
9.97
9.97
0.15
Qwen3-VL-Embed-8B
12.14
12.14
12.14
0.00
RzenEmbed
14.88
14.88
14.88
0.30
Caption + Text Embedding
BM25
3.29
3.29
3.29
0.00
BGE-M3
7.05
7.05
7.05
0.15
Table 1: Performance comparison of different methods on IBCBench. Best result is given in bold, and the second best is underlined. Relative Improvement is computed against the best baseline result.
Method
Precision
Recall
F1
EM
GPT-4o (baseline)
18.50
17.34
17.84
0.60
BundleWeaver (Ours)
30.95
30.46
30.28
7.20
w/o Diverse Seed
27.52
27.66
27.21
6.45
w/o Candidate Pruning
24.57
24.74
24.69
5.85
w/o Beam Search
25.63
25.93
25.35
6.30
w/o VLM Rerank
26.33
26.70
26.13
6.15
Table 2: Ablation study of different components of our proposed BundleWeaver.
Figure 3: Breakdown analysis on bundle size and location type.
Backbone
Method
Precision
Recall
F1
EM
Qwen3-VL-235B
Dec. & Re.
15.78
14.35
14.95
0.90
BundleWeaver
25.99
26.23
25.73
5.25
Gemini-3-Flash
Dec. & Re.
20.89
15.53
17.06
0.60
BundleWeaver
25.52
26.52
25.55
4.35
Claude Sonnet 4.5
Dec. & Re.
24.79
23.01
23.74
1.50
BundleWeaver
31.12
30.39
30.32
6.60
Table 3: Performance w.r.t. different VLM backbones. Dec. & Re. represents the baseline VLM Two-Stage Decompose & Rerank .
Appendix figures & tables10 assets
Supplementary material from the paper’s appendix.
Appendix
Figure 4: The demonstration of dataset construction pipeline for IBCBench.
Figure 5: The web demo for human review and deduplication.
Component
Latency
LLM anchor extraction + seed initialization
3s
Global ANN retrieval + diverse seed selection
1s
Iterative missing-role subquery generation
10s
Local retrieval + beam expansion
3s
Whole-bundle VLM reranking
13s
System overhead
2s
Appendix
Table 4: Latency breakdown of BundleWeaver on a 109K-image pool.
Strategy
Precision
Recall
F1
EM
No-rerank
26.33
26.70
26.13
6.15
Listwise
29.41
31.28
29.94
6.90
Pointwise
30.95
30.46
30.28
7.20
Appendix
Table 5: Performance comparison of different reranking strategies.
Method
Truncation Rule
Precision
Recall
F1
RzenEmbed
Oracle size
14.88
14.88
14.88
Score > 0.95
18.2
3.7
6.1
Score > 0.90
11.8
8.2
9.7
Score > 0.85
7.4
13.6
9.6
Score > 0.80
4.1
18.9
6.7
BundleWeaver (Ours)
N/A
30.95
30.46
30.28
Appendix
Table 6: Dynamic-cardinality evaluation compared with oracle-size truncation.
Figure 6: Hyperparameter study of the beam width and candidates per step.
Figure 7: Hyperparameter study of the candidate pruning range.
Method
Precision
Recall
F1
False Negative Rate
Claude-Sonnet-4.5
22.20
21.48
21.66
0%
BundleWeaver
26.27
24.47
25.08
2%
Appendix
Table 7: Manual audit of strict false negatives on 100 randomly sampled queries, where both BundleWeaver and Claude-Sonnet-4.5 fail under automatic set-level evaluation.
Figure 8: Examples showing the results of different methods on IBC.
Method
Precision
Recall
F1
EM
RzenEmbed
14.88
14.88
14.88
0.30
w/ CCP
8.80
8.80
8.80
0.75
GPT-4o Dec. & Re.
18.50
17.34
17.84
0.60
w/ CCP
16.75
16.74
16.74
3.15
BundleWeaver w/o CCP
24.57
24.74
24.69
5.85
BundleWeaver
30.95
30.46
30.28
7.20
Appendix
Table 8: Controlled experiment on contextual candidate pruning (CCP).
Composed image retrieval, multi-turn composed image retrieval, and composed video retrieval all share a common paradigm: composing the reference visual with modification text to retrieve the desired target. Despite this shared structure, the three tasks have been studied in isolation, with no prior work proposing a unified framework, let alone a zero-shot solution. In this paper, we propose UniCVR, the first unified zero-shot composed visual retrieval framework that jointly addresses all three tasks without any task-specific human-annotated data. UniCVR strategically combines two complementary strengths: Multimodal Large Language Models (MLLMs) for compositional query understanding and Vision-Language Pre-trained (VLP) models for structured visual retrieval. Concretely, UniCVR operates in two stages. In Stage I, we train the MLLM as a compositional query embedder via contrastive learning on a curated multi-source dataset of approximately 3.5M samples, bridging the heterogeneous embedding spaces between the MLLM and the frozen VLP gallery encoder. A cluster-based hard negative sampling strategy is proposed to strengthen contrastive supervision. In Stage II, we introduce an MLLM-guided dual-level reranking mechanism that applies adaptive budgeted subset scoring to a small number of top-ranked candidates, and then exploits the resulting relevance signals through a dual-level re-scoring scheme, producing more accurate final rankings with minimal computational overhead. Extensive experiments across five benchmarks covering all three tasks demonstrate that UniCVR achieves cutting-edge performance, validating its effectiveness and generalizability. Our data and code will be released upon acceptance.
Haokun Wen, Xuemeng Song, Haoyu Zhang +3
Harbin Institute of Technology (Shenzhen) Shenzhen, China · Southern University of Science and Technology Shenzhen, China · Pengcheng Laboratory Shenzhen, China +1
Real-world image search queries are multimodal and compositional: ``find this shirt in pink'' specifies an entity to retain, an attribute to modify, and context to ignore. Yet existing re-rankers either compress such multifaceted relevance into an opaque embedding or rely on free-form chain-of-thought that easily omits or hallucinates fine-grained constraints. Drawing on rubric- and checklist-based evaluation from NLP, we recast multimodal image re-ranking as a semantic constraint satisfaction problem and propose EviRank, which parses any query - text-only, image-only, or composed - into a unified evidence package: typed criteria across six semantic slots (e.g., entities, attributes, relations), each labelled required, forbidden, or ignorable. Re-ranking then reduces to evidence-conditioned verification, combining deterministic rubric scoring and evidence-grounded listwise comparison in a single training-free procedure. The explicit evidence can further serve as structured supervision for optionally distilling a lightweight student. Across five benchmarks spanning text-to-image, image-to-image, and composed image retrieval, EviRank achieves state-of-the-art performance, and the distilled student preserves over 90% of the teacher's capability at substantially lower cost.
Enjun Du, Siyi Liu, Zirong Chen +8
The Hong Kong University of Science and Technology (Guangzhou) · Tencent Yuanbao · The University of Hong Kong
Current instruction-based image retrieval systems are powerful but limited to single-turn interactions, failing to capture the iterative nature of complex, real-world visual searches. To overcome this limitation, we introduce Contextual Composed Image Retrieval (CoCo-IR), a novel task that enables users to progressively refine search results through interactions. We address this new task by proposing a new model based on a Large Multimodal Model (LMM) that functions as a context-aware reasoner for CoCo-IR. Our model interprets the entire interaction history to generate Transformable Image Embeddings (TIE) that evolve across turns. To fuel the model training without expensive human annotations, we develop a fully autonomous, scalable data engine that leverages LMMs to generate high-quality contextual retrieval data, and uses model-guided verification to mine challenging hard negatives. Extensive experiments demonstrate that our approach establishes new state-of-the-art performance: We achieve 39.4 mAP@5 on the challenging single-turn benchmark CIRCO; furthermore, on our new CoCo-IR benchmark, our model maintains robust performance with 44.1 R@1 on 4-turn dialogues, dramatically outperforming existing methods (28.2 4-turn R@1) that fail to handle multi-turn context. Project page: https://CoCo-IR.github.io.