CR-Refiner is presented, a training-free reranker that wraps any base retriever's top-K candidates with three components and consistently improves hard-subset R@1 and mAP@10 on every edit axis.
Abstract
Edit-conditioned 3D scene retrieval pairs a reference 3D room with a natural-language modification and retrieves rooms from a corpus that satisfy the edit. Three lines of prior work each fall short on this task. 2D composed image retrieval reasons over pixel-level edits and has no primitive for 3D object sets. 3D foundation encoders embed individual objects but cannot compose at the scene level. 3D scene-grounding methods localize references inside a static scene rather than rank modified rooms across a corpus. We present CR-Refiner, a training-free reranker that wraps any base retriever's top-K candidates with three components. A frozen LLM parses the edit into a structured query entity, and each candidate is scored by an unbalanced optimal-transport problem over a 1xG cost matrix coupling category, style, material, and geometry. The unbalanced solver lets the single-entity query drop mass on irrelevant objects, modelling the asymmetry directly. An axis-conditional structural prior adds size-keyword cues for geometric edits and subject-anchor direction cues for spatial edits. An LLM verifier refines the top three candidates with continuous confidence. Because no benchmark evaluates compositional matching over 3D object sets, we additionally release 3D-CER, 4,963 edit-conditioned queries over a 23,381-room indoor corpus across five edit axes, with multi-positive ground truth, CIRR-style hard subsets, and zero-target adversarials. Across three qualitatively distinct base retrievers, CR-Refiner consistently improves hard-subset R@1 and mAP@10 on every edit axis.
Zero-shot composed image retrieval (ZS-CIR) methods often use large vision-language models (LVLMs) to represent an image-text query comprising a reference image and a modification instruction. However, semantically equivalent instructions can alter the generated representations and final rankings. An individual retriev...
Bo-Wen Fu, Na Liu, Yue-Ming Shu et al.· 2026 International Conferenc...· 0 citations
Open-ended queries in modern Retrieval-Augmented Generation (RAG) are increasingly"diffuse,"requiring a large set of documents to be assembled into a finite LLM context window. To ensure retrieval quality, systems use fast dual-encoders and more expensive cross-encoders (CEs) to score candidates. However, the CE budget...
Eylon Caplan, Shamik Roy, S. Dasgupta et al.· 0 citations
This paper introduces AutoConcept, a training-free reranker that converts concept evidence into an interpretable memory that positions AutoConcept as an interpretable concept-memory reranker for product-style CIR galleries with available metadata.
This work presents AQ3D, which is designed to handle scenes of various sizes during training and inference and sets a new state-of-the-art on validation and hidden test splits across the datasets ScanNetV2, ScanNet200, and ScanNet++V2 among decoder methods trained without additional data augmentation.
Open-vocabulary 3D maps enable robots to reason about previously unknown environments using natural language. However, existing systems typically segment every incoming image, associate detections with persistent 3D segments, and frequently perform costly Vision-Language (VL) inference. We present TRACKGRAPH, an online...
Peder Borge Hellesylt, Albert Gassol Puigjaner, Kostas Alexis et al.· 0 citations
M UL V EC is proposed, a role-aware method whose compiler produces a structured query record that is mapped to four retrieval roles: Global describes the full target, Desired states what should appear, Preserve states what should remain, and Forbidden states what should disappear.
Zihao Zhang, Da-Yan Wu, Xin-Ze Liu et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.