Teaching MLLMs to Say No: Generalized Referring Expression Comprehension via Refusal Calibrated GRPO
This paper proposes Refusal-Calibrated Group Relative Policy Optimization (RC-GRPO), a reinforcement learning strategy that enables Multimodal Large Language Models to effectively reject nonexistent objects in Generalized Referring Expression Comprehension without compromising their localization accuracy on existing targets.
Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer
Imagine you are teaching a robot to play a game of "I Spy" with a human. The human points to a picture and says, "Find the red ball." If the red ball is there, the robot should point right at it. But what if the human says, "Find the red ball," and the picture actually shows a blue cat? A smart robot should say, "I can't find a red ball here; there isn't one." However, many of today's super-smart computer brains (called Multimodal Large Language Models) are like eager students who are terrified of being wrong. They are so desperate to give an answer that when they don't see the red ball, they just guess anyway, pointing at the blue cat and insisting, "Here it is!" This is called a "hallucination"—making up facts that aren't true.
This paper tackles a specific, tricky version of this problem called "Generalized Referring Expression Comprehension." It's a fancy way of saying: "Can the robot find the object if it's there, and can it honestly say 'I don't see it' if it's not?" The researchers found that while these robots are great at finding things, they are terrible at admitting when things are missing. If you just train them to say "no" more often, they get too scared and stop finding the things that are actually there. The team needed a way to teach the robot to say "no" only when it's truly necessary, without making it forget how to say "yes" when it's right.
The authors of this paper propose a clever new training method called Refusal-Calibrated Group Relative Policy Optimization (RC-GRPO). Think of the robot's learning process like a game of "Hot and Cold." Usually, the robot gets a score based on how close its guess is. But when the object isn't there, the robot keeps guessing anyway, so it never learns the right answer. The researchers' first trick was to force the robot to say "None, I don't see it" during its practice runs, even if it wanted to guess. This gave the robot a clear "reward" for saying the right thing when the object was missing.
However, they realized that if they just praised the robot for saying "None," it would start saying "None" for everything, even when the object was there. To fix this, they added a special rule: if the robot says "None" when an object is actually present, it gets a big penalty. It's like telling the robot, "It's okay to say you don't see the ball if the ball isn't there, but if you say you don't see it when it's right in front of you, you lose points." They also added a second stage where the robot has to explain why it thinks the object is missing (e.g., "I don't see a red ball because there is only a blue cat"). This forces the robot to actually understand the picture rather than just memorizing a pattern.
The results show that this method works really well. When they tested their new method on three different challenging tests, the robots became much better at both finding objects and refusing to guess when they weren't there. For example, on one test, their method improved the robot's overall accuracy from 45% to 62%, and it even beat other advanced methods by a significant margin. The paper suggests that this approach helps the robot find a perfect balance: it stops making up fake locations for missing objects but doesn't lose its ability to find real ones. It's a step toward making AI that is not just smart, but also honest about what it sees and what it doesn't.
Drowning in papers in your field?
Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.