Paper deep dive
Ref-Adv: Exploring MLLM Visual Reasoning in Referring Expression Tasks
Qihua Dong, Kuo Yang, Lin Ju, Handong Zhao, Yitian Zhang, Yizhou Wang, Huimin Zeng, Jianglin Lu, Yun Fu
Intelligence
Status: succeeded | Model: Gemma-4-26B-A4B | Prompt: intel-v1 | Confidence: 91%
Last extracted: 7/20/2026, 7:23:21 AM
Summary
The paper introduces Ref-Adv, a new benchmark for Referring Expression Comprehension (REC) designed to test visual reasoning in Multimodal Large Language Models (MLLMs). It addresses limitations in existing benchmarks (RefCOCO, RefCOCO+, RefCOCOg) such as short expressions, few distractors, and shortcut solutions. Ref-Adv uses linguistically complex expressions, hard distractors, and negation to force genuine reasoning. Evaluations show that state-of-the-art MLLMs perform significantly worse on Ref-Adv compared to standard benchmarks, highlighting gaps in visual reasoning and grounding capabilities.
Entities (10)
Relation Signals (9)
Ref-Adv â challenges â MLLMs
confidence 95% · We evaluate a broad suite of contemporary multimodal LLMs on Ref-Adv. Despite strong results on RefCOCO... models drop markedly on Ref-Adv
Qwen2.5-VL-72B â evaluatedon â Ref-Adv
confidence 95% · We evaluate 13 contemporary MLLMs on Ref-Adv... The suite includes Qwen2.5-VL series... Qwen2.5-VL-72B
Ref-Adv â uses â hard distractors
confidence 92% · The dataset contains referring expressions on real images, curated with hard distractors and annotated with reasoning facets including negation.
Ref-Adv â derivedfrom â COCO
confidence 90% · We sample from the validation and test splits of COCO (Lin et al., 2014) and OpenImages v7 (Kuznetsova et al., 2020).
Ref-Adv â derivedfrom â OpenImages v7
confidence 90% · We sample from the validation and test splits of COCO (Lin et al., 2014) and OpenImages v7 (Kuznetsova et al., 2020).
Ref-Adv â mitigates â grounding shortcuts
confidence 90% · Ref-Adv, a modern REC benchmark that suppresses shortcuts by pairing linguistically nontrivial expressions with only the information necessary to uniquely identify the target.
RefCOCO â suffersfrom â few distractors
confidence 90% · Second, there are few distractors in the images in RefCOCO(+/g)... most cases of only 1 distractors.
Cypher Suggestions (0)
No Cypher suggestions yet.
Abstract
Abstract:Referring Expression Comprehension (REC) links language to region level visual perception. Standard benchmarks (RefCOCO, RefCOCO+, RefCOCOg) have progressed rapidly with multimodal LLMs but remain weak tests of visual reasoning and grounding: (i) many expressions are very short, leaving little reasoning demand; (ii) images often contain few distractors, making the target easy to find; and (iii) redundant descriptors enable shortcut solutions that bypass genuine text understanding and visual reasoning. We introduce Ref-Adv, a modern REC benchmark that suppresses shortcuts by pairing linguistically nontrivial expressions with only the information necessary to uniquely identify the target. The dataset contains referring expressions on real images, curated with hard distractors and annotated with reasoning facets including negation. We conduct comprehensive ablations (word order perturbations and descriptor deletion sufficiency) to show that solving Ref-Adv requires reasoning beyond simple cues, and we evaluate a broad suite of contemporary multimodal LLMs on Ref-Adv. Despite strong results on RefCOCO, RefCOCO+, and RefCOCOg, models drop markedly on Ref-Adv, revealing reliance on shortcuts and gaps in visual reasoning and grounding. We provide an in depth failure analysis and aim for Ref-Adv to guide future work on visual reasoning and grounding in MLLMs.
Tags
Links
- Source: https://arxiv.org/abs/2602.23898v1
- Canonical: https://arxiv.org/abs/2602.23898v1
Trouble viewing inline? Open PDF directly â
Full Text
62,280 characters extracted from source content.
Expand or collapse full text
Published as a conference paper at ICLR 2026 REF-ADV: EXPLORING MLLM VISUAL REASONING IN REFERRING EXPRESSION TASKS Qihua Dong Kuo Yang Lin Ju Handong Zhao Yitian Zhang Yizhou Wang Huimin Zeng Jianglin Lu Yun Fu Northeastern University https://ref-adv.github.io/ ABSTRACT Referring Expression Comprehension (REC) links language to region level visual perception. Standard benchmarks (RefCOCO, RefCOCO+, RefCOCOg) have progressed rapidly with multimodal LLMs but remain weak tests of visual rea- soning and grounding: (i) many expressions are very short, leaving little reason- ing demand; (i) images often contain few distractors, making the target easy to find; and (i) redundant descriptors enable shortcut solutions that bypass genuine text understanding and visual reasoning. We introduce Ref-Adv, a modern REC benchmark that suppresses shortcuts by pairing linguistically nontrivial expres- sions with only the information necessary to uniquely identify the target. The dataset contains referring expressions on real images, curated with hard distrac- tors and annotated with reasoning facets including negation. We conduct compre- hensive ablations (word order perturbations and descriptor deletion sufficiency) to show that solving Ref-Adv requires reasoning beyond simple cues, and we evalu- ate a broad suite of contemporary multimodal LLMs on Ref-Adv. Despite strong results on RefCOCO, RefCOCO+, and RefCOCOg, models drop markedly on Ref-Adv, revealing reliance on shortcuts and gaps in visual reasoning and ground- ing. We provide an in depth failure analysis and aim for Ref-Adv to guide future work on visual reasoning and grounding in MLLMs. 1INTRODUCTION Referring expression comprehension (REC) is the task of grounding a natural language expression to a specific region in an image (Mao et al., 2016; Kazemzadeh et al., 2014; Yu et al., 2016). It has important applications in real world systems and downstream tasks, and it has become a key bench- mark for evaluating multimodal large language models (MLLMs) because it probes fine grained correspondence between language and vision. Recent MLLMs (Google, 2025a; Bai et al., 2025; Zhu et al., 2025), both closed source and open source, have made substantial progress, achieving over 90% accuracy on classic REC benchmarks, i.e., RefCOCO(+/g) (Kazemzadeh et al., 2014; Yu et al., 2016; Mao et al., 2016). Despite this near saturated performance, we identify critical limitations of the classic REC bench- marks that motivate a modern benchmark capable of more challenging and comprehensive evalua- tion of MLLMs. We view modern REC for MLLMs as a multistep reasoning task with two coupled components: (1) textual reasoningâunderstanding the referring expression, identifying the target, and identifying its descriptors; and (2) visual reasoningâsearching for candidates and establishing correspondence between descriptors and image regions. The order of these steps can vary across models, but a meaningful benchmark should require both textual and visual reasoning. From this perspective, we highlight the following limitations of RefCOCO(+/g). First, most of the referring expressions are extremely short, as shown in Figure 1. For RefCOCO and RefCOCO+, the average expression length is around 3 words. Such short expressions lead to two issues: (1) minimal linguistic effort is required, and (2) they typically entail less visual reasoning because fewer descriptors must be verified in the image. Second, there are few distractors in the images in RefCOCO(+/g), as shown in Figure 2 (b), with most cases of only 1 distractors. Here we define a distractor as an object of the same category as the target but a different instance. When few 1 arXiv:2602.23898v1 [cs.CV] 27 Feb 2026 Published as a conference paper at ICLR 2026 a man wearing a brown sweater and holding a game control Find âa DELL mouse connected to the laptopâ Find âa man in the background jumping to return the tennis ballâ Find âpizzaâ (a) Expression too short? (a) Expression too short?(b) Few distractors in image? (c) Expression too descriptive? MLLM User (answer without reasoning) Only one âmouseâ, I donât need to know the rest. I donât know what is âin the backgroundâ, but I see one jumping. Figure 1: Common limitations of classic referring expression benchmarks that reduce the reasoning challenge. These include very short expressions, few visual distractors, and overspecified descriptors that enable shortcut matching without requiring genuine reasoning. The cyan box highlights the ground truth region. distractors exist, the task requires far less textual and visual reasoning: models need only infer the target category and select from a small set of candidates. Figure 2 (b) reveals a negative correlation between the number of distractors and model performance. It is worth noting that for reasoning assessment, task difficulty does not monotonically increase with referring expression length due to âgrounding shortcutsâ. These shortcuts occur when a long, descriptive expression is paired with few distractors, rendering many descriptors redundant. Consequently, a model can localize the target by matching only a subset of descriptors, which can paradoxically lead to higher accuracy for longer expressions, as illustrated in Figure 2 (a). This highlights the need for modern REC benchmarks to mitigate such shortcuts by designing expressions that are concise and carefully balanced against the available distractors. Meanwhile, prior work has acknowledged aspects of these limitations: Wei et al. (2024); Chen et al. (2024) point out the length limitations of RefCOCO(+/g), and Chen et al. (2020) highlights the lack of distractors. However, the proposed datasets also raise new concerns. The former introduces REC data with average lengthâ„ 90 words, which may be unnatural and, more importantly, enable numerous shortcuts since the numbers of descriptors and distractors are heavily imbalanced. The latter proposes settings including referring from a set of images, which shifts away from the classic REC setting, and the referring expressions are sampled from GQA (Hudson & Manning, 2019) scene graphs with fixed templates, reducing naturalness. We therefore aim to build a REC benchmark that preserves the classic REC setting and natural expressions while substantially increasing the reasoning challenge aligned with the capabilities of modern LLMs. To this end, we introduce Ref-Adv, a modern REC benchmark that avoids short rea- soning paths and imposes both reasoning and grounding challenges on contemporary MLLMs. To validate the quality of the benchmark, we conduct comprehensive ablation studies in section 2 that examine what makes a rigorous modern REC benchmark and compare its reasoning and grounding difficulty with RefCOCO(+/g). In section 3, we evaluate 13 contemporary MLLMs on Ref-Adv, spanning both closed source and open source models. We report performance changes and pro- vide detailed analyses. We publicly release Ref-Adv-s, a curated subset of 1,142 cases, to enable reproducible benchmarking. 2THE REF-ADV DATASET 2.1DATA SOURCE We sample from the validation and test splits of COCO (Lin et al., 2014) and OpenImages v7 (Kuznetsova et al., 2020). We filter the images and only use those with panoptic instance anno- tations, since this is important for our later pipeline. For the bounding box annotations, we convert 2 Published as a conference paper at ICLR 2026 Accuracy@0.5 (IoU â„ 0.5) of QwenâVL on the RefCOCO, RefCOCO+, and RefCOCOg validation sets as a function of distractor count. Marker size is proportional to the number of samples in that bin. Accuracy declines with increasing distractors. Accuracy@0.5 (IoU â„ 0.5) of Qwen (QwenâVLâChat) on the RefCOCO, RefCOCO+, and RefCOCOg validation sets as a function of reference expression length (number of words). Each point is the mean accuracy for a given length, with marker size proportional to the number of samples; accuracy declines with longer expressions on RefCOCO/RefCOCO+, while RefCOCOg remains comparatively stable across lengths. (a) (b) Figure 2: Accuracy@0.5 (IoU â„ 0.5) of Qwen on the RefCOCO/+/g validation sets. Marker size is proportional to the number of samples in each bin. (a) is the Acc@0.5 on number of words in expressions, (b) is on distractor count. We can see most cases have short expressions and few distractors. Table 1: Basic statistics of the validation+test sets of RefCOCO, RefCOCO+, RefCOCOg, and Ref-Adv (Ours). The instance size is represented by its square root. Avg. length: average length of annotations. Vocab.: vocabulary size. Avg. distractors: average number of same category distractors per image. Negation ratio: percentage of expressions using explicit negation. BenchmarkImagesInstancesAvg. LengthAvg. DistractorsNegation RatioInstance SizeVocab. RefCOCO 20143,0007,5963.63.990.99%105â6073,525 RefCOCO+ 20163,0007,5783.63.963.36%105â6074,387 RefCOCOg 20163,9007,5968.41.641.41%83â6105,050 Ref-Adv (Ours)2,8335,00011.54.0121.25%30-6075,308 all to using the absolute coordinates in the format of [x1, y1, x2, y2]. The input for our data pipeline is the image, the bounding box annotations and category name of each instance, and we will output the referring expression paired with the target instance. 2.2COLLECTION GUIDELINES As shown in Figure 1, we aim to collect referring data that requires visual reasoning, avoids shortcut solutions, and challenges models. Based on these observations, we propose the following guidelines to mitigate these limitations and yield cases requiring advanced reasoning. Distractor Pressure Distractors are instances of the same category as the target but different in- stances. To avoid easy grounding based solely on the target category, we select images that have at least 3 candidate instances of the same category as the target, based on the instance annotations of each dataset. Language Complexity RefCOCO(+/g) has an average expression length of around 3 words, which limits language complexity and requires much less visual reasoning. Meanwhile, fixed tem- plates that extract referring information from scene graphs limit diversity in the referring expres- sions. Therefore, we employ LLMs (e.g., GPT-4o) with carefully designed pipelines to generate more natural and diverse referring expressions while maintaining linguistic complexity. Hard Distractors Simply increasing the number of distractors and the length of the referring expression does not necessarily make the task more challenging because of the âgrounding shortcutâ illustrated in Figure 1 (c). To reduce such shortcuts (i.e., reliance on redundant descriptors), we ensure the presence of âhard distractorsâ in the images, defined as distractors that partially match, but do not exactly satisfy, the referring expression. Identifying such pairs and composing expressions around them is central to our data collection process. Manual Check It is laborious and time-consuming to manually select images with hard distractors and generate the referring expressions, so we use LLMs to assist generation. However, LLMs can 3 Published as a conference paper at ICLR 2026 1 3 2 Distractors >= 3 ? (a) Prepare Image(b) Similarity Judgement(c) Expression Generation(d) Human Verification SoM Tagging Find the most similar pair and provide descriptors that differ the pair and the rest, and the ones inside the pair. similar group: â1â and â3â, others: â2â, group discriminators: [ âhair ...â, ânecklace ...â,], individual discriminators: [âsunglass ...â, âshirt ...â,] Generate a refer. expression for â1â. Use discrimators to differ with â2â, and then with â3â. Consider using negation. âThe person with short hair, and wearing sunglassâ âNot wearing necklace, the person in the light-colored shirtâ ... 1. The expression is accurate. 2. There exists hard distractors. GPT-4o GPT-4o Ref-Adv Data Figure 3: LLM-authored data curation pipeline for Ref-Adv. (a) Prepare Image: filter images, ensureâ„ 3 distractors, and add number tags to candidate instances. (b) Similarity Judgement: use GPT-4o to identify the most similar pair and elicit group-level and instance-level discriminators. (c) Expression Generation: compose minimally sufficient referring expressions using discriminators and optional negation. (d) Human Verification: verify expression accuracy and confirm the existence of hard distractors before inclusion. make mistakes or hallucinate. To ensure accuracy, we perform a human verification pass to confirm the existence of hard distractors and the correctness and unambiguity of the referring expression. 2.3REFERRING EXPRESSION GENERATION PROCESS As shown in Figure 3, the whole generation process is conducted in four stages. The prompts we use are provided in section 5. Input Preparation We first filter the images to only keep those with at least 3 candidate instances. We then put a number tag on each instance, similar to Set-of-Marks (Yang et al., 2023), but since we already have instance annotations, we only need to add the number tag to the candidate instances. 2.3.1LLM-AUTHORED PIPELINE Before detailing the pipeline, we note an important design choice. We first attempted single step prompting of GPT-4o to directly produce complete referring expressions from the image and can- didate instances. In practice, GPT-4o frequently produced overspecified descriptions with many redundant descriptors, which enabled shortcut grounding and weakened the need to understand the whole expression. To avoid this behavior, we adopt a two stage procedure: we first elicit discrim- inative attributes (between group A and group B and within group A), and then compose the final expression from a minimal yet sufficient subset of those attributes. Similarity Judgement If there is a hard distractor and a target instance, they will be similar in some ways. To encourage the LLMs to identify any such similar pair in the image, we define two groups, group A and group B, where group A contains the hard distractor and the target instance, and group B contains the other distractors. We then prompt the LLMs to identify the two groups and to describe (1) attributes that distinguish the groups and (2) attributes that distinguish the two instances within group A. We ask for multiple alternative descriptions for each distinction. This could help us generate multiple diverse referring expressions for one image and allow us to select the high quality ones. Referring Expression Generation After the similarity judgement, we obtain a list of paired de- scriptors that distinguish (1) group A from group B and (2) the two instances within group A. To ensure naturalness and diversity in phrasing, we prompt LLMs to compose referring expressions from combinations of these descriptors. Specifically, we use two alternative strategies: (1) employ the targetâs descriptors and (2) use the negation of the hard distractorâs descriptors. This promotes more diverse and natural expressions. We also explicitly instruct the LLMs to not include number tag related descriptions. Although the elicited descriptors alone are sufficient for generation, we find that including the image input at this stage yields more diverse and accurate expressions, so 4 Published as a conference paper at ICLR 2026 (a) (b)(c) Figure 4: Dataset statistics across REC benchmarks. (a) Expression length comparison. (b) Distri- bution of distractor counts. (c) Instance size on a log area scale. Table 2: Accuracy@0.5 after replacing the original referring expressions with the fixed âthe oneâ prompt. â is Fixed@0.5 minus Ref-Adv Fixed@0.5 (shown in blue). With fixed prompt, models achieve higher accuracy on RefCOCO, RefCOCO+, and RefCOCOg than Ref-Adv. RefCOCORefCOCO+RefCOCOgRef-Adv ModelFixed@0.5â vs Ref-AdvFixed@0.5â vs Ref-AdvFixed@0.5â vs Ref-AdvFixed@0.5 Qwen2.5-VL-72B35.1%+13.7%39.4%+18.0%38.3%+16.9%21.4% InternVL-3-14B35.9%+13.1%38.0%+15.2%38.2%+15.4%22.8% we include the image. After this stage, we obtain multiple candidate referring expressions for each target instance. 2.3.2HUMAN-AUTHORED PIPELINE We also collect a subset of human-authored referring expressions. For each filtered image, annota- tors first confirm whether there is a hard distractor pair and, if so, write a referring expression for it. Annotators are instructed to produce diverse and natural phrasing. 2.3.3VERIFICATION PROTOCOL We verify each imageâtext pair. Three annotators answer two questions: (1) whether the expression is correct and unambiguous and (2) whether hard distractors are present in the image. Annota- tors first attempt grounding on the original image (without number tags) using the LLM generated expression. We then show the ground truth box overlaid on the image for reference, allowing re- flection if their initial grounding was incorrect. Afterward, annotators record their final decisions on correctness/unambiguity and on the presence of hard distractors. Pairs are presented in a random order per annotator, and a pair is kept only if all three annotators agree. The keep rate is 18.7% for LLM-authored expressions. 2.4QUALITY ANALYSIS Despite verification to ensure correctness, there remain potential issues for an REC benchmark that could affect fairness and the evaluation of reasoning skills. To further assess the quality of our data, we conduct the following analyses. Statistics As shown in Figure 4 and table 1, Ref-Adv exhibits clear advantages in expression length, vocabulary size, distractor counts, and the negation ratio. Model Bias Test Inspired by Cirik et al. (2018); Chen et al. (2020), we conduct a bias test of modern MLLMs (Qwen2.5-VL-72B and InternVL-3) on RefCOCO(+/g) and Ref-Adv. Here, bias refers to statistical regularities that may arise if training data comes from the same source as an evaluation benchmark, which can benefit performance. We design the test as follows: we replace the referring expression with a fixed prompt (âthe oneâ), keep the same image, and prompt the model to output a bounding box. This test reveals whether model bias helps localize the target. The results are shown in table 2. They suggest that Ref-Adv is less affected by this bias than other benchmarks. 5 Published as a conference paper at ICLR 2026 Table 3: Bag-of-words ablation on RefCOCO, RefCOCO+, RefCOCOg, and Ref-Adv. Acc@0.5 with original expressions vs bag-of-words (word order removed). â denotes (BoWâ Original). RefCOCORefCOCO+RefCOCOgRef-Adv ModelOrig@0.5 BoW@0.5âOrig@0.5 BoW@0.5âOrig@0.5 BoW@0.5âOrig@0.5 BoW@0.5â Qwen2.5-VL-72B92.7%82.8%-9.9%88.9%78.2%-10.7%89.9%75.3%-14.6%58.3%41.5%-16.8% InternVL-3-14B92.0%84.7%-7.3%87.6%81.0%-6.6%88.5%74.9%-13.6%52.3%38.6%-13.7% Table 4: One descriptor deletion ablation on RefCOCO, RefCOCO+, RefCOCOg, and Ref-Adv. Acc@0.5 with original expressions vs one descriptor deletion (removing a single descriptor in ex- pression). â denotes (1-Descâ Original). RefCOCORefCOCO+RefCOCOgRef-Adv ModelOrig@0.5 1D@0.5âOrig@0.5 1D@0.5âOrig@0.5 1D@0.5âOrig@0.5 1D@0.5â Qwen2.5-VL-72B92.7%88.0%-4.7%88.9%83.6%-5.3%89.9%85.3%-4.6%58.3%51.9%-6.4% InternVL-3-14B92.0%87.1%-4.9%87.6%82.4%-5.2%88.5%83.8%-4.7%52.3%45.2%-7.1% Textual Reasoning Necessity Test Prior work (Akula et al., 2020) shows that shuffling word order in RefCOCOg often leaves performance largely intact, indicating weak necessity for textual reasoning in prior REC benchmarks. This lack of degradation could stem from two factors: (1) expressions that only mention the target (or its parts) without referencing distractors and (2) images with no or very few distractors. Both factors reduce the reasoning demand in REC. To validate that Ref- Adv requires reasoning, we extend the test to RefCOCO(+/g) and Ref-Adv for comparison. Rather than shuffling while preserving meaning, we propose a simpler test: we convert the expression to a bag of words and randomize its order in the prompt (e.g., âa red ball with yellow stripesâ becomes âwith yellow red ball stripes aâ). We evaluate Qwen2.5-VL-72B and InternVL-3 under this setting. Results are shown in table 3, indicating that Ref-Adv indeed requires textual understanding and reasoning to follow the referring expression exactly. Avoidance of âGrounding Shortcutâ As illustrated in Figure 1, RefCOCO(+/g) admits a âground- ing shortcut,â where a model can localize the target by checking a small subset of descriptors, with- out reasoning over the entire expression. To validate that Ref-Adv avoids this shortcut, we con- duct a descriptor-deletion sufficiency test. For a given referring expression, we first use Qwen2.5- 72B (Yang et al., 2024) to extract all descriptors, randomly delete one, and ask Qwen2.5-72B to rewrite the expression with that descriptor removed. We then evaluate MLLMs on the modified imageâtext pair. If deleting a descriptor does not affect performance, the descriptor is unnecessary, suggesting a shortcut that succeeds without understanding the full expression. Such shortcuts are exacerbated in datasets with imbalanced numbers of descriptors and distractors. Results are shown in table 4, indicating that Ref-Adv has far fewer grounding shortcuts than others. 3EXPERIMENT 3.1EVALUATION SETUP Evaluated Models We evaluate contemporary state of the art MLLMs, both closed source and open source, on Ref-Adv. The suite includes Qwen2.5-VL series (Bai et al., 2025), InternVL- 3 series (Zhu et al., 2025), Gemini 2.5-Flash (Google, 2025a), Gemini 2.5-Pro (Google, 2025b), CogVLM-Grounding (Hong et al., 2024), GLM-4.5V (Team et al., 2025b), GPT-4o (OpenAI, 2024), and Claude-3.5 Sonnet (Anthropic, 2024). Evaluation Methods Set-of-Marks (SoM) overlays numbered marks on candidate objects in the image and leverages a specialized segmenter to provide fine-grained localization, avoiding the need for the MLLM to perform grounding itself. Because GPT-4o and Claude-3.5 have limited grounding ability, we evaluate them using SoM (Yang et al., 2023) with Semantic-SAM (Li et al., 2023). We use Semantic-SAM due to its strong performance on COCO images, one of the sources of Ref-Adv. For each model (except CogVLM-Grounding which does not support CoT), we evaluate both with and without Chain-of-Thought (CoT). While CoT is uncommon in classic REC benchmark evalua- tion, Ref-Adv requires more reasoning, so we include CoT in our setup. Table 6 and Table 7 report results on Ref-Adv with and without CoT. 6 Published as a conference paper at ICLR 2026 LLM-AuthoredHuman-Authored Image ExpressionThe cup that is empty and positioned at the center of the pizzas. The young elephant near the water not covered in more dust. The car is brown or black with a lighter tint on its windows. The person sitting far- ther to the one holding a goose feather Image ExpressionThe frisbee holder who is not facing forward. The occupied chair with the personâs arm not rest- ing on the lap. The sailboat, identified by being anchored, is the one with a flag. The frisbee held by the person on the right hand side of the person in red Table 5: Examples from Ref-Adv. Columns 1 to 3 are LLM generated; column 4 is human authored. Case #470: img94871_cat20_obj4 Expression: "The white sheep facing away that is smaller rather than bigger." Near the vehicle is the one not leaning. Case #397: img402720_cat46_obj 6 Expression: "The less full glass closer to the corner rather than further from it." The user is asking to identify a specific glass in the image based on its fullness and position. 1. **Identify all glasses:** ... 2. **Filter by "less full":** ... 3. **Filter by "closer to the corner rather than further from it":** ... Let's re-evaluate "less full". ... Comparing the two "less full" glasses that are relatively close to the corner: The red wine glass is closer to the bottom-left corner of the table area. Therefore, the target is the red wine glass that is to the left of the wine bottle and to the right of the person on the left. ... Let's re-check the "closer to the corner" part. ... ... [196, 343, 245, 416] The less full glass closer to the corner rather than further from it. The modern sofa, not the one with a metal frame. The user is asking to identify a specific sofa in the image. 1. **Identify all sofas:** ... 2. **Analyze the first part of the referring expression: "The modern sofa"**: ... 3. **Analyze the second part of the referring expression: "not the one with a metal frame"**: ... 4. **Reconcile the two parts:** ... However, ... The key differentiator is the "metal frame". ... Therefore, "the modern sofa, not the one with a metal frame" refers to the dark, high-backed sofa on the left. ... The final answer is [30, 132, 230, 230] The plant in the clay pot that's positioned lower on the ledge. The chair near the middle, taller rather than shorter. The user is asking to identify a specific plant in the image. 1. **"The plant in the clay pot"**: ... 2. **"that's positioned lower on the ledge"**: ... Therefore, the target is the plant in the brown clay pot on the right side of the image, sitting on a small wooden stand. ... x1: ..., y1: ..., x2: ..., y2: ... Let's refine the coordinates to be more precise. ... Let's re-evaluate the bounding box to encompass the entire plant and its pot. ... So the coordinates are ... The final answer is [486, 336, 602, 432] The user is asking to identify a specific chair in the image based on its location and relative height. 1. **"The chair near the middle"**: ... 2. **"taller rather than shorter"**: ... Let's examine the chairs in the image: ... Considering the descriptions, the chair that stands out is the one occupied by the person with long, grey, curly hair wearing a blue patterned shirt. ... Considering the entire chair, including the seat and legs... ... ... Final check: - Is it near the middle? Yes, ... - Is it taller rather than shorter? Yes, ... The bounding box for the chair occupied by the person with long grey hair. ... The final answer is [270, 214, 330, 281] Near the vehicle is the one not leaning. The user is asking to identify the bounding box of a specific object in the image based on the referring expression "Near the vehicle is the one not leaning." 1. **Identify the "vehicle":** ... 2. **Identify objects "near the vehicle":** ... 3. **Identify who is "not leaning":** ... 4. **Resolve ambiguity:** ... Therefore, the target is the person sitting on the red vehicle. ... x1: ..., y1: ..., x2: ..., y2: ... ... [250, 103, 314, 180] The user is asking to determine the bounding box coordinates of the target object based on the given referring expression. 1. **Identify the glasses:** ... 2. **Determine "less full":** ... 3. **Locate the corner:** ... 4. **Proximity to the corner:** ... Therefore, the target is the less-full glass on the right, closer to the corner. Bounding box coordinates (visually estimated): - Top-left (x1, y1): ... - Bottom-right (x2, y2): ... ... [390, 380, 450, 460] The user is asking to identify a specific sofa in the image. 1. **Identify all sofas:** ... 2. **Analyze the first part of the referring expression: "The modern sofa"**: ... 3. **Analyze the second part of the referring expression: "not the one with a metal frame"**: ... 4. **Reconcile the two parts:** ... However, ... The key differentiator is the "metal frame". ... Therefore, "the modern sofa, not the one with a metal frame" refers to the dark, high-backed sofa on the left. ... The final answer is [30, 132, 230, 230] The user is asking to identify the bounding box coordinates of the plant in the clay pot that is positioned lower on the ledge. 1. **Clay Pot:** ... 2. **Lower on the Ledge:** ... Step-by-Step Analysis: - Focus only on pots that appear clay (orange-brown). - Interpret the ledge as the stone shelf behind the bench. - Compare vertical positions of the clay pots on that ledge and pick the lowest. - Verify the candidate is on the right side and contains a broad-leaf green plant. ... [490, 280, 630, 450] The user is asking to identify the chair referred to as âthe chair near the middle, taller rather than shorter.â 1. **Near the middle:** ... 2. **Taller rather than shorter:** ... Step-by-Step Analysis: - Identify the central vertical axis as the middle area. - List chairs intersecting that middle band. - Compare visible heights; select the tallest among them. Observations: The target chair is behind the short-haired person using a laptop and is taller than nearby chairs. Bounding Box Coordinates: Approximate edges noted from visual inspection. ... [230, 180, 330, 350] The user is asking to determine the bounding box for âthe one not leaning.â 1. **Identify the vehicle:** ... 2. **Identify the people near the vehicle:** ... 3. **Determine âthe one not leaningâ:** ... 4. **Locate this person:** On the left of the carriage, standing upright in dark clothing, facing the vehicle. Bounding Box Coordinates: Approximate edges from visual inspection. ... [60, 200, 110, 290] (a) Input(b) Gemini (c) Qwen With Cot Without CoTWith Cot Without CoT Figure 5: Performance of representative multimodal LLMs on Ref-Adv. We include qualitative examples with and without CoT for Gemini 2.5-Flash and Qwen2.5-VL-72B. CoT answers are shown in a gray box. Hard distractors in Ref-Adv challenge current MLLMs. Evaluation Prompts Models differ in prompt format and output conventions.For example, Qwen2.5-VL-72B uses absolute coordinates, while others use normalized coordinates; CogVLM- Grounding requires the question to strictly follow the form âWhere is the âreferring expressionâ?â to output boxes. To ensure fairness, we adopt best-practice prompts for each model. 7 Published as a conference paper at ICLR 2026 Table 6: Results on Ref-Adv-s, a publicly released subset of 1,142 cases, across Qwen2.5-VL, Qwen3-VL, and Qwen3.5 model families. Columns report accuracy at IoU thresholds 0.5, 0.75, and 0.9. For distractor groups (2â3, 4â6, and â„7), we report Acc0.5 and the delta relative to overall Acc0.5. CoT denotes Chain-of-Thought prompting (via thinking mode, think-first prompt, or native in Qwen3.5). ModelCoT?Acc0.5Acc0.75Acc0.9Distractors (Acc0.5) 2â3â4â6â â„7â Qwen2.5-VL 3B-Instructâ23.818.18.825.9+2.121.9-1.917.1-6.8 3B-Instructâ25.319.19.528.2+2.922.9-2.415.5-9.8 7B-Instructâ39.329.212.542.8+3.536.8-2.526.4-13.0 7B-Instructâ39.028.811.643.0+4.035.2-3.726.4-12.6 32B-Instructâ48.035.516.051.6+3.643.8-4.238.8-9.2 32B-Instructâ50.637.716.055.2+4.544.8-5.940.3-10.3 72B-Instructâ54.040.118.057.0+3.0 52.7-1.3 41.1-12.9 72B-Instructâ52.439.018.356.9+4.547.9-4.438.8-13.6 Qwen3-VL 2B-Instructâ23.519.211.026.1+2.620.0-3.517.8-5.6 2B-Instruct â25.220.611.428.1+2.921.3-3.919.4-5.8 2B-Thinking â44.436.821.848.6+4.240.6-3.831.0-13.4 4B-Instructâ41.934.920.746.4+4.536.2-5.831.8-10.2 4B-Instructâ42.534.920.646.6+4.136.5-6.034.9-7.6 4B-Thinkingâ57.645.527.863.0+5.452.7-4.940.3-17.3 8B-Instructâ47.237.019.151.3+4.144.1-3.132.6-14.6 8B-Instructâ52.338.919.955.7+3.550.2-2.138.8-13.5 8B-Thinkingâ59.548.227.363.5+4.055.6-3.947.3-12.2 30B-A3B-Instructâ44.037.623.447.6+3.540.3-3.734.1-9.9 30B-A3B-Instructâ52.143.127.454.7+2.648.9-3.245.7-6.4 30B-A3B-Thinkingâ64.152.631.667.3+3.262.2-1.951.2-12.9 32B-Instructâ53.444.727.156.3+2.950.2-3.345.7-7.7 32B-Instruct â59.047.527.660.9+1.957.5-1.652.7-6.3 32B-Thinkingâ65.652.831.667.9+2.3 65.7+0.152.7-12.9 235B-A22B-Instructâ57.347.530.063.3+6.151.7-5.538.0-19.3 235B-A22B-Instructâ59.348.929.963.5+4.254.9-4.447.3-12.0 235B-A22B-Thinkingâ67.153.631.869.6+2.6 65.7-1.4 56.6-10.5 Qwen3.5 27Bâ67.354.932.769.9+2.765.7-1.556.6-10.7 35B-A3B â66.754.434.968.9+2.265.4-1.3 58.1-8.6 122B-A10Bâ67.255.035.169.9+2.866.3-0.854.3-12.9 397B-A17B-FP8â68.055.634.270.1+2.1 67.9-0.056.6-11.4 3.2EVALUATION METRICS Accuracy serves as a widely adopted metric for evaluating existing REC models. A referring expres- sion instance is deemed successfully grounded when the Intersection over Union (IoU) between the predicted bounding box and the ground truth annotation surpasses 0.5. This conventional evaluation metric is designated as Acc0.5. Here, we implement multiple evaluation protocols, i.e., Accuracy computed under different IoU thresholds such as Acc0.5, Acc0.75, Acc0.9, and mean Accuracy (mAcc) across different IoU criteria, to thoroughly evaluate the precision and robustness. 3.3ANALYSIS Effect of Distractor Count In Ref-Adv, each expression is paired with at least 2 same-category dis- tractors, and images contain roughly 4 distractors on average. Compared with overall Acc0.5, most models show a modest change in the 4â6 group but a larger drop in theâ„7 group (e.g., Qwen2.5-VL- 72B+CoT:â0.2 andâ2.7). This trend indicates that handling larger numbers of similar distractors remains a key challenge for current MLLMs. Effect of CoT Table 6 and Table 7 show that CoT generally improves performance on Ref-Adv. We attribute the improvement on Ref-Adv to its heavier reasoning demand; for RefCOCO(+/g), where 8 Published as a conference paper at ICLR 2026 Table 7: Main results on Ref-Adv. Rows list models; columns report accuracy at IoU thresholds 0.5, 0.75, and 0.9, and mean accuracy (mAcc). For distractor groups (4â6 and â„7), we report Acc0.5 and the delta relative to overall Acc0.5. ModelSettingAcc0.5Acc0.75Acc0.9mAccDistractors (Acc0.5) CoT?SoM?4â6â â„7â GPT-4o 2024ââ52.331.213.427.853.4+1.151.7-0.6 GPT-4o 2024 â63.738.419.734.162.9-0.860.5-3.2 Claude-3.5 Sonnet 2024ââ40.822.13.822.439.0-1.837.4-3.4 Claude-3.5 Sonnet 2024â45.219.82.123.344.2-1.042.3-2.9 Gemini 2.5-Flash 2025aâ50.623.76.919.249.5-1.148.9-1.7 Gemini 2.5-Flash 2025a ââ59.435.116.330.658.1-1.355.6-3.8 Gemini 2.5-Pro 2025bâ51.928.411.723.750.3-1.649.7-2.2 Gemini 2.5-Pro 2025b ââ59.132.614.228.358.0-1.155.9-3.2 InternVL-3-7B 2025â49.539.221.433.149.2-0.348.6-0.9 InternVL-3-7B 2025 ââ48.737.920.131.847.5-1.245.8-2.9 InternVL-3-14B 2025â50.540.722.834.249.7-0.850.3-0.2 InternVL-3-14B 2025 ââ52.342.124.335.651.9-0.449.1-3.2 InternVL-3-38B 2025â53.843.525.737.153.4-0.452.9-0.9 InternVL-3-38B 2025ââ57.246.828.940.356.9-0.354.1-3.1 InternVL-3-78B 2025â54.644.226.437.853.9-0.753.4-1.2 InternVL-3-78B 2025ââ58.447.929.641.257.2-1.255.4-3.0 Qwen2.5-VL-7B 2025â49.339.021.232.948.4-0.948.1-1.2 Qwen2.5-VL-7B 2025ââ49.138.820.932.747.6-1.546.0-3.1 Qwen2.5-VL-32B 2025â52.742.424.636.052.5-0.252.0-0.7 Qwen2.5-VL-32B 2025ââ56.846.528.740.155.8-1.054.3-2.5 Qwen2.5-VL-72B 2025 â54.143.825.937.454.1+0.053.6-0.5 Qwen2.5-VL-72B 2025ââ58.347.829.541.158.1-0.255.6-2.7 GLM-4.5V 2025bâ52.442.124.335.651.9-0.551.6-0.8 GLM-4.5V 2025bââ56.946.628.840.255.9-1.054.6-2.3 CogVLM-Grounding 2024â51.541.223.435.052.4+0.950.8-0.7 grounding can often succeed without extensive reasoning, CoT may introduce unnecessary verbosity or error. It is worth noting that while Argus (Man et al., 2025) reports sizable CoT gains on RefCOCO, its CoT ablations are conducted on VQA style benchmarks by augmenting training with additional CoT data, whereas our study uses off the shelf checkpoints and evaluates directly on RefCOCO(+/g) and Ref-Adv without extra training. RefCOCO(+/g) also contains many short expressions with few distractors, so CoT is often unnecessary and can even harm performance. Moreover, standard mul- timodal evaluation toolkits such as open compass and VLMEvalKit do not enable CoT for Ref- COCO(+/g), which is consistent with our finding that CoT brings limited benefit in this setting and is more helpful on Ref-Adv, where reasoning demand is higher. This observation is in line with the recent study âTo Think or Not To Think: A Study of Thinking in Rule-Based Visual Reinforcement Fine-Tuningâ (Li et al., 2025), which also reports limited CoT benefits on RefCOCO(+/g). Ref-Adv-s To facilitate reproducible evaluation, we publicly release Ref-Adv-s, a curated subset of 1,142 cases from Ref-Adv along with evaluation code. Table 6 reports results on Ref-Adv-s across the Qwen2.5-VL, Qwen3-VL, and Qwen3.5 model families, spanning model sizes from 2B to 397B parameters. The trends observed on Ref-Adv-s are consistent with the full benchmark: accuracy degrades as distractor count increases, and thinking-mode variants substantially outperform their instruct counterparts at the same model size. Main Results Table 7 summarizes results on Ref-Adv. With SoM, GPT-4o attains the best per- formance on Ref-Adv under CoT, suggesting strong reasoning and visual perception capabilities. While other models perform well on RefCOCO(+/g), their accuracy drops markedly on Ref-Adv, revealing gaps in visual reasoning and perception. Qualitative Analysis Figure 5 shows qualitative examples for Qwen2.5-VL-72B and Gemini 2.5- Flash, both with and without CoT. With explicit reasoning, models often follow the intended chain, but in harder cases they fail partway due to incorrect visual perception or a misunderstanding of 9 Published as a conference paper at ICLR 2026 the referring expression. Notably, models often select the hard distractor as the answer, which indi- cates that Ref-Adv challenges models to both deeply understand referring expressions and perform accurate visual perception. This suggests that Ref-Adv stresses advanced reasoning and visual per- ception, and that current state of the art MLLMs still exhibit clear gaps. 4LITERATURE REVIEW Referring Expression Benchmarks. Segmentation based benchmarks constitute a foundational category in computer vision, with numerous datasets spanning diverse domains and applica- tions (Kuznetsova et al., 2020; Lin et al., 2014; Wang et al., 2022; Du et al., 2023; 2025). The fieldâs foundational benchmarks, including the ReferItGame (Kazemzadeh et al., 2014) and the de facto standard RefCOCO suite (RefCOCO/+/g) (Yu et al., 2016; Mao et al., 2016), have been in- strumental in advancing research. However, subsequent analyses revealed that high scores on these datasets can overstate genuine grounding abilities. For example, performance on RefCOCOg often remains high even with shuffled word order, indicating a reliance on superficial cues rather than robust compositional understanding (Akula et al., 2020). To address these cracks in the founda- tionânamely simplistic expressions and a lack of hard, same-category distractorsâa new wave of benchmarks emerged. To directly target reasoning, Cops-Ref (Chen et al., 2020) and its successor FineCops-Ref (Liu et al., 2024) introduced more compositional expressions with explicit distractors and negative examples, while the synthetic CLEVR-Ref+ (Liu et al., 2019) offered a fully con- trolled environment for diagnostic analysis. Concurrently, other efforts expanded the scope of the REC task itself. gRefCOCO (Liu et al., 2023) introduced multi-target and no-target expressions, PhraseCut (Wu et al., 2020) scaled up to phrase-level segmentation over more categories, and recent works like HC-RefLoCo (Wei et al., 2024) and Ref-L4 (Chen et al., 2024) have pushed for longer, more natural descriptions and corrected label noise in the original benchmarks. The need for such challenging benchmarks is further amplified by the rapid advancements in Multi- modal Large Language Models (MLLMs), which now dominate the field. Multimodal Large Language Models. Recent progress in vision language AI has been driven by large multimodal language models (MLLMs) that combine powerful LLM backbones with vision encoders and alignment tuning for instruction following. A growing body of work has explored visual understanding in LLMs, with grounding ability emerging as an important focus (Bai et al., 2025; Hong et al., 2024; Team et al., 2025b; Lu et al., 2025b;a; 2026). Proprietary models like OpenAIâs GPT-4 Vision and Googleâs Gemini exemplify this trend, while open source counterparts such as Alibabaâs Qwen-VL and Shanghai AI Labâs InternVL offer similar capabilities (OpenAI, 2024; Google, 2025a; Bai et al., 2025; Zhu et al., 2025). These systems, trained on massive im- age text corpora, now achieve near ceiling accuracy (often>90%) on classic referring expression benchmarks (Kazemzadeh et al., 2014; Yu et al., 2016; Mao et al., 2016). However, as the reasoning capabilities of MLLMs rapidly advance, it has become clear that these high scores are insufficient to measure genuine multi-step reasoning, necessitating an evolution in the REC task itself (Wei et al., 2022; 2024; Chen et al., 2024; Dong et al., 2025). This has spurred the development of both more challenging benchmarks and reasoning enhanced models. For example, Moonshotâs Kimi-VL (Thinking) applies chain of thought fine tuning and reinforcement learning to strengthen stepwise visual reasoning (Team et al., 2025a), and ZhipuAIâs GLM-4.5V explicitly performs step by step grounding to output precise object bounding boxes (Team et al., 2025b). Similarly, new aligned vision language models like CogVLM and DeepSeek-VL2 incorporate mixture of experts or reward optimization to improve visual grounding and coherence, and even commercial chatbots (e.g., An- thropicâs Claude 3.5, xAIâs Grok) are beginning to integrate advanced multimodal reasoning. Our work builds on these efforts by evaluating a broad suite of state of the art MLLMsâboth gen- eral purpose and reasoning centricâon a novel REC benchmark designed to stress test their visual grounding and reasoning abilities (Hong et al., 2024; Team et al., 2025b;a; Wu et al., 2024; An- thropic, 2024; xAI, 2025). 5CONCLUSION In this work, we introduced Ref-Adv, a modern REC benchmark designed to address the reliance on visual shortcuts in existing datasets by requiring genuine multi-step reasoning. We construct 10 Published as a conference paper at ICLR 2026 Ref-Adv through a two stage pipeline that uses an LLM to compose minimally sufficient referring expressions. Our comprehensive ablation studies (section 2) confirm that Ref-Adv effectively probes both complex textual and visual grounding capabilities. Strikingly, our evaluation of contemporary MLLMs (section 3) revealed a significant performance drop compared to their near-saturated scores on RefCOCO(+/g), exposing a critical overestimation of their visual reasoning abilities. These findings underscore the urgent need for benchmarks that reflect real world visual complexity and offer a clear path forward for developing more robust and capable MLLMs. ETHICS STATEMENT We follow the ICLR Code of Ethics (https://iclr.c/public/CodeOfEthics). We use large language models to draft candidate expressions and then apply a human verification step with three annotators to ensure correctness and remove ambiguous or unsafe content (Section 2). An- notators worked only with public images and could skip any example. Our benchmark is intended for evaluating grounding and visual reasoning, not for surveillance or biometric identification. We release only expressions, target regions, and dataset identifiers, and we provide usage guidance that discourages applications involving identity inference or sensitive attribute prediction. We are not aware of conflicts of interest. REPRODUCIBILITY STATEMENT Section 2 describes the complete data pipeline, including image sources, filtering with same-class distractors, descriptor elicitation, expression composition, and the three-annotator verification pro- tocol, with a step-by-step diagram in Figure 3. We will release the exact image identifiers, the final referring expressions, target regions, and the JSON schema of our annotations, together with scripts to load and evaluate the data. Evaluation protocols and metrics (Acc0.5/Acc0.75/Acc0.9 and mean Accuracy) are specified in Section 3. To facilitate exact replication, we provide the following arti- facts: (i) Ref-Adv-s, a publicly released subset of 1,142 cases from Ref-Adv with evaluation code, enabling immediate reproducible benchmarking; (i) the evaluation scripts that compute IoU and accuracy; and (i) the prompts and configuration files for each evaluated model. Together, these artifacts enable end-to-end reproduction of our tables and figures. 11 Published as a conference paper at ICLR 2026 REFERENCES Arjun R. Akula, Spandana Gella, Yaser Al-Onaizan, Song-Chun Zhu, and Siva Reddy. Words arenât enough, their order matters: On the robustness of grounding visual referring expressions. In Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, p. 6555â6565, Online, 2020. Association for Computational Linguistics. doi: 10.18653/v1/2020. acl-main.586. URL https://aclanthology.org/2020.acl-main.586/. Anthropic.Claude3.5sonnet. https://w.anthropic.com/news/ claude-3-5-sonnet, 2024. Shuai Bai, Keqin Chen, Xuejing Liu, Jialin Wang, Wenbin Ge, Sibo Song, Kai Dang, Peng Wang, Shijie Wang, Jun Tang, Humen Zhong, Yuanzhi Zhu, Mingkun Yang, Zhaohai Li, Jianqiang Wan, Pengfei Wang, Wei Ding, Zheren Fu, Yiheng Xu, Jiabo Ye, Xi Zhang, Tianbao Xie, Zesen Cheng, Hang Zhang, Zhibo Yang, Haiyang Xu, and Junyang Lin. Qwen2.5-vl technical report. arXiv preprint arXiv:2502.13923, 2025. Jierun Chen, Fangyun Wei, Jinjing Zhao, Sizhe Song, Bohuai Wu, Zhuoxuan Peng, S.-H. Gary Chan, and Hongyang Zhang. Revisiting referring expression comprehension evaluation in the era of large multimodal models. arXiv preprint arXiv:2406.16866, 2024. URL https://arxiv. org/abs/2406.16866. Zhenfang Chen, Peng Wang, Lin Ma, Kwan-Yee K. Wong, and Qi Wu. Cops-ref: A new dataset and task on compositional referring expression comprehension. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), p. 10086â10095, June 2020.URL https://openaccess.thecvf.com/content_CVPR_2020/html/ Chen_Cops-Ref_A_New_Dataset_and_Task_on_Compositional_Referring_ Expression_CVPR_2020_paper.html. Volkan Cirik, Louis-Philippe Morency, and Taylor Berg-Kirkpatrick. Visual referring expression recognition: What do systems actually learn? arXiv preprint arXiv:1805.11818, 2018. Qihua Dong, Luis Figueroa, Handong Zhao, Kushal Kafle, Jason Kuen, Zhihong Ding, Scott Cohen, and Yun Fu. Cot referring: Improving referring expression tasks with grounded reasoning, 2025. URL https://arxiv.org/abs/2510.06243. Hao Du, Qihua Dong, Yan Xu, and Jing Liao. Weakly-supervised 3d medical image segmentation using geometric prior and contrastive similarity. IEEE Transactions on Medical Imaging, 42(10): 2936â2947, 2023. Hao Du, Qihua Dong, Yan Xu, and Jing Liao. Tdformer: top-down token generation for 3d medical image segmentation. IEEE Journal of Biomedical and Health Informatics, 2025. Google.Gemini 2.5 flash. https://deepmind.google/technologies/gemini/ flash/, 2025a. Google. Gemini 2.5 pro. https://deepmind.google/technologies/gemini/pro/, 2025b. Wenyi Hong, Weihan Wang, Ming Ding, Wenmeng Yu, Qingsong Lv, Yan Wang, Yean Cheng, Shiyu Huang, Junhui Ji, Zhao Xue, et al. Cogvlm2: Visual language models for image and video understanding. arXiv preprint arXiv:2408.16500, 2024. Drew A Hudson and Christopher D Manning. Gqa: A new dataset for real-world visual reasoning and compositional question answering. In Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, p. 6700â6709, 2019. Sahar Kazemzadeh, Vicente Ordonez, Mark Matten, and Tamara Berg. Referitgame: Referring to objects in photographs of natural scenes. In Proceedings of the 2014 conference on empirical methods in natural language processing (EMNLP), p. 787â798, 2014. Alina Kuznetsova, Hassan Rom, Neil Alldrin, Jasper Uijlings, Ivan Krasin, Jordi Pont-Tuset, Sha- hab Kamali, Stefan Popov, Matteo Malloci, Alexander Kolesnikov, et al. The open images dataset v4: Unified image classification, object detection, and visual relationship detection at scale. In- ternational Journal of Computer Vision, 128(7):1956â1981, 2020. 12 Published as a conference paper at ICLR 2026 Feng Li, Hao Zhang, Peize Sun, Xueyan Zou, Shilong Liu, Jianwei Yang, Chunyuan Li, Lei Zhang, and Jianfeng Gao. Semantic-sam: Segment and recognize anything at any granularity. arXiv preprint arXiv:2307.04767, 2023. URL https://arxiv.org/abs/2307.04767. Ming Li, Jike Zhong, Shitian Zhao, Yuxiang Lai, Haoquan Zhang, Wang Bill Zhu, and Kaipeng Zhang. Think or not think: A study of explicit thinking in rule-based visual reinforcement fine- tuning. arXiv preprint arXiv:2503.16188, 2025. Tsung-Yi Lin, Michael Maire, Serge Belongie, James Hays, Pietro Perona, Deva Ramanan, Piotr Doll Ì ar, and C Lawrence Zitnick. Microsoft coco: Common objects in context. In European conference on computer vision, p. 740â755. Springer, 2014. Chang Liu, Henghui Ding, and Xudong Jiang. Gres: Generalized referring expression segmenta- tion. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), p. 23592â23601, June 2023.URL https://openaccess.thecvf.com/ content/CVPR2023/html/Liu_GRES_Generalized_Referring_Expression_ Segmentation_CVPR_2023_paper.html. Junzhuo Liu, Xuzheng Yang, Weiwei Li, and Peng Wang. Finecops-ref: A new dataset and task for fine-grained compositional referring expression comprehension. In Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing, p. 15440â15457, Miami, Florida, USA, November 2024. Association for Computational Linguistics. doi: 10.18653/ v1/2024.emnlp-main.864.URL https://aclanthology.org/2024.emnlp-main. 864/. Runtao Liu, Chenxi Liu, Yutong Bai, and Alan Yuille. Clevr-ref+: Diagnosing visual reasoning with referring expressions. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pat- tern Recognition (CVPR), p. 4185â4194, June 2019.URL https://openaccess. thecvf.com/content_CVPR_2019/html/Liu_CLEVR-Ref_Diagnosing_ Visual_Reasoning_With_Referring_Expressions_CVPR_2019_paper.html. Jianglin Lu, Hailing Wang, Yi Xu, Yizhou Wang, Kuo Yang, and Yun Fu. Representation potentials of foundation models for multimodal alignment: A survey. In Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing, p. 16669â16684, 2025a. Jianglin Lu, Hailing Wang, Kuo Yang, Yitian Zhang, Simon Jenni, and Yun Fu. The indra repre- sentation hypothesis. In The Thirty-ninth Annual Conference on Neural Information Processing Systems, 2025b. Jianglin Lu, Simon Jenni, Kushal Kafle, Jing Shi, Handong Zhao, and Yun Fu. Seeing through words: Controlling visual retrieval quality with language models. In The Fourteenth International Conference on Learning Representations, 2026. Yunze Man, De-An Huang, Guilin Liu, Shiwei Sheng, Shilong Liu, Liang-Yan Gui, Jan Kautz, Yu- Xiong Wang, and Zhiding Yu. Argus: Vision-centric reasoning with grounded chain-of-thought. In Proceedings of the Computer Vision and Pattern Recognition Conference, p. 14268â14280, 2025. Junhua Mao, Jonathan Huang, Alexander Toshev, Oana Camburu, Alan Yuille, and Kevin Murphy.Generation and comprehension of unambiguous object descriptions.In Pro- ceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2016.URL https://openaccess.thecvf.com/content_cvpr_2016/papers/ Mao_Generation_and_Comprehension_CVPR_2016_paper.pdf. OpenAI. Gpt-4o. https://openai.com/index/gpt-4o/, 2024. Kimi Team, Angang Du, Bohong Yin, Bowei Xing, Bowen Qu, Bowen Wang, Cheng Chen, Chenlin Zhang, Chenzhuang Du, Chu Wei, Congcong Wang, Dehao Zhang, Dikang Du, Dongliang Wang, Enming Yuan, Enzhe Lu, Fang Li, Flood Sung, Guangda Wei, Guokun Lai, Han Zhu, Hao Ding, Hao Hu, Hao Yang, Hao Zhang, Haoning Wu, Haotian Yao, Haoyu Lu, Heng Wang, Hongcheng Gao, Huabin Zheng, Jiaming Li, Jianlin Su, Jianzhou Wang, Jiaqi Deng, Jiezhong Qiu, Jin Xie, Jinhong Wang, Jingyuan Liu, Junjie Yan, Kun Ouyang, Liang Chen, Lin Sui, Longhui Yu, Meng- fan Dong, Mengnan Dong, Nuo Xu, Pengyu Cheng, Qizheng Gu, Runjie Zhou, Shaowei Liu, 13 Published as a conference paper at ICLR 2026 Sihan Cao, Tao Yu, Tianhui Song, Tongtong Bai, Wei Song, Weiran He, Weixiao Huang, Weixin Xu, Xiaokun Yuan, Xingcheng Yao, Xingzhe Wu, Xinhao Li, Xinxing Zu, Xinyu Zhou, Xinyuan Wang, Y. Charles, Yan Zhong, Yang Li, Yangyang Hu, Yanru Chen, Yejie Wang, Yibo Liu, Yibo Miao, Yidao Qin, Yimin Chen, Yiping Bao, Yiqin Wang, Yongsheng Kang, Yuanxin Liu, Yuhao Dong, Yulun Du, Yuxin Wu, Yuzhi Wang, Yuzi Yan, Zaida Zhou, Zhaowei Li, Zhejun Jiang, Zheng Zhang, Zhilin Yang, Zhiqi Huang, Zihao Huang, Zijia Zhao, Ziwei Chen, and Zongyu Lin. Kimi-VL technical report, 2025a. URL https://arxiv.org/abs/2504.07491. V Team, Wenyi Hong, Wenmeng Yu, Xiaotao Gu, Guo Wang, Guobing Gan, Haomiao Tang, Jiale Cheng, Ji Qi, Junhui Ji, Lihang Pan, Shuaiqi Duan, Weihan Wang, Yan Wang, Yean Cheng, Zehai He, Zhe Su, Zhen Yang, Ziyang Pan, Aohan Zeng, Baoxu Wang, Bin Chen, Boyan Shi, Changyu Pang, Chenhui Zhang, Da Yin, Fan Yang, Guoqing Chen, Haochen Li, Jiale Zhu, Jiali Chen, Jiaxing Xu, Jiazheng Xu, Jing Chen, Jinghao Lin, Jinhao Chen, Jinjiang Wang, Junjie Chen, Leqi Lei, Letian Gong, Leyi Pan, Mingdao Liu, Mingde Xu, Mingzhi Zhang, Qinkai Zheng, Ruiliang Lyu, Shangqin Tu, Sheng Yang, Shengbiao Meng, Shi Zhong, Shiyu Huang, Shuyuan Zhao, Siyan Xue, Tianshu Zhang, Tianwei Luo, Tianxiang Hao, Tianyu Tong, Wei Jia, Wenkai Li, Xiao Liu, Xiaohan Zhang, Xin Lyu, Xinyu Zhang, Xinyue Fan, Xuancheng Huang, Yadong Xue, Yanfeng Wang, Yanling Wang, Yanzi Wang, Yifan An, Yifan Du, Yiheng Huang, Yilin Niu, Yiming Shi, Yu Wang, Yuan Wang, Yuanchang Yue, Yuchen Li, Yusen Liu, Yutao Zhang, Yuting Wang, Yuxuan Zhang, Zhao Xue, Zhengxiao Du, Zhenyu Hou, Zihan Wang, Peng Zhang, Debing Liu, Bin Xu, Juanzi Li, Minlie Huang, Yuxiao Dong, and Jie Tang. Glm-4.5v and glm-4.1v- thinking: Towards versatile multimodal reasoning with scalable reinforcement learning, 2025b. URL https://arxiv.org/abs/2507.01006. Tao Wang, Jianglin Lu, Zhihui Lai, Jiajun Wen, and Heng Kong. Uncertainty-guided pixel con- trastive learning for semi-supervised medical image segmentation. In Proceedings of the Thirty- First International Joint Conference on Artificial Intelligence, IJCAI-22, p. 1444â1450. Interna- tional Joint Conferences on Artificial Intelligence Organization, 7 2022. Fangyun Wei, Jinjing Zhao, Kun Yan, Hongyang Zhang, and Chang Xu. A large-scale human-centric benchmark for referring expression comprehension in the lmm era. In NeurIPS Datasets and Benchmarks Track, 2024. URL https://proceedings.neurips.c/paper_files/ paper/2024/file/80f0cd0305f7741659304f5325f3bf6d-Paper-Datasets_ and_Benchmarks_Track.pdf. Jason Wei, Xuezhi Wang, Dale Schuurmans, Maarten Bosma, Brian Ichter, Fei Xia, Ed H. Chi, Quoc V. Le, and Denny Zhou. Chain-of-thought prompting elicits reasoning in large language models. arXiv preprint arXiv:2201.11903, 2022. URL https://arxiv.org/abs/2201. 11903. Chenyun Wu, Zhe Lin, Scott Cohen, Trung Bui, and Subhransu Maji. Phrasecut: Language- based image segmentation in the wild.In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), p. 10216â10225, June 2020. URL https://openaccess.thecvf.com/content_CVPR_2020/html/Wu_ PhraseCut_Language-Based_Image_Segmentation_in_the_Wild_CVPR_ 2020_paper.html. Zhiyu Wu, Xiaokang Chen, Zizheng Pan, Xingchao Liu, Wen Liu, Damai Dai, Huazuo Gao, Yiyang Ma, Chengyue Wu, Bingxuan Wang, Zhenda Xie, Yu Wu, Kai Hu, Jiawei Wang, Yaofeng Sun, Yukun Li, Yishi Piao, Kang Guan, Aixin Liu, Xin Xie, Yuxiang You, Kai Dong, Xingkai Yu, Haowei Zhang, Liang Zhao, Yisong Wang, and Chong Ruan. Deepseek-vl2: Mixture-of- experts vision-language models for advanced multimodal understanding, 2024. URL https: //arxiv.org/abs/2412.10302. xAI. Grok-4 fast. https://x.ai, 2025. An Yang, Baosong Yang, Beichen Zhang, Binyuan Hui, Bo Zheng, Bowen Yu, Chengyuan Li, Dayiheng Liu, Fei Huang, Haoran Wei, Huan Lin, Jian Yang, Jianhong Tu, Jianwei Zhang, Jianxin Yang, Jiaxi Yang, Jingren Zhou, Junyang Lin, Kai Dang, Keming Lu, Keqin Bao, Kexin Yang, Le Yu, Mei Li, Mingfeng Xue, Pei Zhang, Qin Zhu, Rui Men, Runji Lin, Tianhao Li, Tianyi Tang, Tingyu Xia, Xingzhang Ren, Xuancheng Ren, Yang Fan, Yang Su, Yichang Zhang, Yu Wan, 14 Published as a conference paper at ICLR 2026 Yuqiong Liu, Zeyu Cui, Zhenru Zhang, and Zihan Qiu. Qwen2.5 technical report. arXiv preprint arXiv:2412.15115, 2024. Jianwei Yang, Hao Zhang, Feng Li, Xueyan Zou, Chunyuan Li, and Jianfeng Gao. Set-of-mark prompting unleashes extraordinary visual grounding in gpt-4v. arXiv preprint arXiv:2310.11441, 2023. URL https://arxiv.org/abs/2310.11441. Licheng Yu, Patrick Poirson, Shan Yang, Alexander C. Berg, and Tamara L. Berg. Modeling con- text in referring expressions. In Computer Vision â ECCV 2016, p. 69â85. Springer, 2016. doi: 10.1007/978-3-319-46475-6 5. URL https://link.springer.com/chapter/ 10.1007/978-3-319-46475-6_5. Jinguo Zhu, Weiyun Wang, Zhe Chen, Zhaoyang Liu, Shenglong Ye, Lixin Gu, Hao Tian, Yuchen Duan, Weijie Su, Jie Shao, et al. Internvl3: Exploring advanced training and test-time recipes for open-source multimodal models. arXiv preprint arXiv:2504.10479, 2025. 15 Published as a conference paper at ICLR 2026 Figure 6: Category distribution ratio curves for RefCOCO, RefCOCO+, RefCOCOg, and Ref-Adv. The frequency ratio is plotted on a logarithmic scale after sorting categories within each dataset. AUSE OF LLM IN WRITING. We employed large language models (LLMs) to assist in polishing the text throughout this paper, including refining phrasing, improving clarity, and ensuring grammatical correctness. BDATASET CATEGORY DISTRIBUTIONS Figure 6 visualizes the category level frequency ratios for RefCOCO, RefCOCO+, RefCOCOg, and Ref-Adv on a logarithmic scale after sorting categories within each dataset, and shows that Ref-Adv follows a more long tailed distribution. CPROMPT IN DATA COLLECTION We include the core prompt templates used by our two-stage LLM-authored pipeline described in section 2. Query 1 elicits group-level and intra-pair discriminators; Query 2 composes minimally sufficient referring expressions from those discriminators. Placeholders such asnum objects andtargetclass are filled at runtime. We use structured output in JSON format for the LLMs to ensure the output is in the correct format. DLLM API COST FOR DATA COLLECTION The kept rate is 18.7% for a LLM-authored expression, and each expression will cost about 2300 input tokens and 120 output tokens, with GPT-4o price of $2.5 per 1M input tokens and $10 per 1M output tokens, the cost for a LLM-authored expression is (2300Ă 2.5 + 120Ă 10)/1, 000, 000 = $0.00695. Given that we need to generate approximately 1/0.187 = 5.35 expressions to get one kept expression, the effective cost per kept expression is 5.35Ă $0.00695 = $0.0372. For our dataset of 4,000 LLM-authored expressions (others are human-authored), the total cost is approximately 4000Ă 0.0372 = $148.8. 16 Published as a conference paper at ICLR 2026 You are given an image with num_objects target_class objects labeled by integers (1..N). ** Task ** : 1) Choose the most similar pair âi,jâ and call that group ** A ** . Everything else is group ** B ** . 2) Propose exactly ** 2 group-level discriminators ** to separate ** A vs B ** . Each discriminator must have an A-side phrase and a B-side phrase . 3) For the two target_class objects inside A, propose exactly ** 4 intra -pair discriminators ** (2 "noticeable", 2 "unnoticeable"). Each must provide a phrase for object âiâ and a phrase for object âjâ, plus a " noticeability" field with value "noticeable" or "unnoticeable". ** Output JSON only ** , matching this schema (no extra text): "similar_group": "ids":[int,int], "label":"A", "groups": "A":[int,...], "B":[int,...], "group_discriminators":[ "id":"G1","name":string,"A":string,"B":string, "id":"G2","name":string,"A":string,"B":string ], "in_pair_discriminators":[ "id":"P1","name":string,"i":string,"j":string,"noticeability":" noticeable or unnoticeable", "id":"P2","name":string,"i":string,"j":string,"noticeability":" noticeable or unnoticeable", "id":"P3","name":string,"i":string,"j":string,"noticeability":" noticeable or unnoticeable", "id":"P4","name":string,"i":string,"j":string,"noticeability":" noticeable or unnoticeable" ] If the model is multimodal, attend to the image; otherwise rely on the provided description/annotations. Listing 1: Query 1: Similarity Judgement and Discriminator Elicitation 17 Published as a conference paper at ICLR 2026 System: You are a visual assistant that returns JSON only. Follow the userâs schema exactly. Do not include any extra text. Image context template: This is an image with num_objects target_class (s) overlaid with integers (1..N). image_context You are given some observations and a âtarget_idâ. ** Observations ** : query1_json ** Target ID ** : target_id ** Target Class ** : target_class ** Task ** : Write the referring expressions that refer to target_class â target_idâ based on the observations. Each sentence should use one group discriminator (A vs B) and one intra-pair discriminator ( between the two in A). Return 4 in total. Return JSON only with this schema: "expressions": [ "id":"E1","target_id":int,"group_dids":["G?"],"pair_dids":["P?"]," inpair_positive_phrase":string,"inpair_negative_phrase":string," inpair_phrase":"only_positive|only_negative|both","text":string , "id":"E2","target_id":int,"group_dids":["G?"],"pair_dids":["P?"]," inpair_positive_phrase":string,"inpair_negative_phrase":string," inpair_phrase":"only_positive|only_negative|both","text":string , "id":"E3","target_id":int,"group_dids":["G?"],"pair_dids":["P?"]," inpair_positive_phrase":string,"inpair_negative_phrase":string," inpair_phrase":"only_positive|only_negative|both","text":string , "id":"E4","target_id":int,"group_dids":["G?"],"pair_dids":["P?"]," inpair_positive_phrase":string,"inpair_negative_phrase":string," inpair_phrase":"only_positive|only_negative|both","text":string ] Explanation example for âinpair_phraseâ: if âinpair_positive_phraseâ is " sitting" and âinpair_negative_phraseâ is "standing", then " only_positive" means "the one sitting"; "only_negative" means "the one not standing"; "both" means "the one sitting rather than standing ". Constraints: Use different combinations of group_dids and pair_dids. Vary phrasings and sentence structures. Do not mention numeric labels in the text. Listing 2: Query 2: Referring Expression Composition 18