Groc-PO: GROunded Context Preference Optimization for Truthful Multimodal LLMs


Abstract

Despite the rapid progress of Multimodal Large Language Models (MLLMs), they still suffer from untruthfulness issues, such as visual hallucinations, content fabrication, and unfaithful reasoning, which substantially undermine their faithfulness and practical utility. Alignment methods based on human preference, such as Direct Preference Optimization (DPO), have been widely adopted to address these issues. However, multimodal reasoning errors often propagate across stages, and final-answer errors can often be traced to mistakes in early grounding stages, yet standard DPO typically applies preference optimization at the final-answer level. This credit-assignment challenge means that supervision for early grounding stages is indirect rather than stage-specific, making it difficult to suppress error propagation arising from grounding drift and context inconsistency. To address this, we propose Grounded Context Preference Optimization (Groc-PO), a grounded preference optimization framework for MLLMs. We further construct the Grounded Context Preference Dataset (GCPD), organizing multi-stage preference samples around three stages of Object Grounding, Contextual Grounding, and Grounded Reasoning, to capture the formation, integration, and utilization of grounded context. By introducing more explicit preference supervision over multiple grounded stages, Groc-PO strengthens context-dependent reasoning and mitigates cross-stage error propagation. Extensive experiments show that, compared with standard DPO and other strong baselines, Groc-PO achieves improved performance in hallucination mitigation, faithful reasoning, and overall reliability, supporting the value of more explicit grounded supervision for trustworthy multimodal reasoning.

<ccs2012> <concept> <concept_id>10010147.10010257</concept_id> <concept_desc>Computing methodologies Machine learning</concept_desc> <concept_significance>500</concept_significance> </concept> </ccs2012>

1 Introduction↩︎

Figure 1: Motivating example of error propagation across stages in MLLMs. (a) A case where an early grounding error propagates to the later reasoning stage and leads to an incorrect answer. (b) Statistical experiments with LLaVA-v1.5-7B [1] on GCPD dataset (constructed from RLHF-V [2]), showing that introducing errors into 0, 1, or 2 grounding stages is associated with progressively lower final reasoning accuracy, consistent with error propagation in MLLMs.

Multimodal Large Language Models (MLLMs), by integrating powerful vision and language capabilities, are transforming human-computer interaction [3][5]. MLLMs also demonstrate astonishing potential in tasks like Visual Question Answering (VQA) and medical analysis [6][8]. However, despite these advancements, MLLMs suffer from the unfaithfulness problems, such as generating content that contradicts visual facts (e.g., fabricated objects, attributes, or relationships) [9], [10]. This significantly hinders their reliability and utility in real-world applications [11], [12].

To mitigate the above issues, preference learning based on human feedback has become a mainstream alignment paradigm. Among these methods, Direct Preference Optimization (DPO) [13] has been widely adopted because it directly optimizes the policy from preference data without requiring an explicit reward model. Existing DPO methods apply preference supervision at the final-answer-level to guide the model in generating more accurate and reliable outputs. However, multimodal reasoning often involves several stages, including early grounding and later reasoning, and the quality of the final answer depends on the robustness of the full process. As illustrated in Fig.  1a, an error arising in an early grounding stage can propagate to later reasoning stages and lead to reasoning failure. Therefore, it remains unclear whether standard DPO, which mainly relies on holistic final-answer-level preferences, can adequately address reasoning errors rooted in early grounding stages.

To this end, we conduct further controlled explorations. As shown in Fig. 1b, introducing errors into more grounding stages is associated with lower final reasoning accuracy, indicating that errors can propagate and accumulate across stages along the reasoning process. This observation reveals a key structural limitation of final-answer-level preference optimization, namely the propagation of MLLM errors: later reasoning failures often do not arise solely at the answer-generation stage, but instead originate from early grounding stages and then accumulate along the reasoning process, affecting the final reasoning outcome. Yet standard DPO typically supervises only at the final-answer-level, offering holistic guidance while providing little stage-specific supervision for these early grounding stages.

Consequently, an important question for MLLMs preference alignment is how to provide more targeted preference supervision for early grounding stages, so as to reduce error propagation and improve faithful multimodal reasoning. To address these problems, we propose Grounded Context Preference Optimization (Groc-PO), a grounded preference optimization framework for MLLMs. Built upon the newly constructed Grounded Context Preference Dataset (GCPD), Groc-PO leverages preference signals from three contextual stages: Object Grounding, Contextual Grounding, and Grounded Reasoning. This design provides more explicit supervision for upstream grounded stages, thereby enhancing the model’s ability to robustly construct and faithfully utilize the grounded context. The framework incorporates the full context and adopts an adaptive stage-aware optimization strategy, improving complex reasoning while mitigating the propagation of upstream errors. Extensive experiments demonstrate that Groc-PO yields notable gains in hallucination mitigation, contextual understanding, and faithful reasoning. The main contributions of this paper are as follows:

  • We propose the Groc-PO framework. By introducing explicit supervision over grounded pre-final stages, it improves faithful multimodal reasoning under multi-round contexts and effectively mitigates error propagation in MLLMs.

  • We construct the Grounded Context Preference Dataset (GCPD). GCPD organizes multi-stage preference data around Visual Grounding, Context Grounding, and Faithful Complex Reasoning, providing support for explicit stage-wise supervision of grounded context.

  • Built on GCPD, Groc-PO employs an adaptive grounded preference optimization mechanism that dynamically allocates learning emphasis across different stages and sample complexities, enabling more targeted alignment.

  • We conduct systematic experiments across multiple datasets and benchmarks. The results show that Groc-PO consistently outperforms standard DPO and several strong baselines on hallucination and complex capability evaluations, validating the effectiveness of explicit supervision for pre-final grounded stages.

2 Related Works↩︎

Figure 2: Overview of our Grounded Context Preference Optimization (Groc-PO) framework, including GCPD dataset construction. The left panel shows dataset construction, where multi-stage preference pairs are generated through teacher-assisted drafting, model-centric sampling, iterative correction, and human verification. The middle panel presents three stages of grounded preference supervision: Stage 1 for object grounding, Stage 2 for contextual grounding, and Stage 3 for grounded reasoning. The right panel shows Groc-PO training, which jointly uses preference pairs from all three stages with a stage-aware, hardness-aware loss to improve context-dependent reasoning and mitigate cross-stage error propagation.

2.1 Unfaithfulness in MLLMs↩︎

Unfaithfulness (or hallucination) in MLLMs refers to the generation of content inconsistent with the visual input, typically manifested as fabricated objects, incorrect attributes, or misinterpreted relationships [9]. Hallucinations stem from training data flaws [14]; module biases [15]; suboptimal training paradigms [16]; and inference‑stage defects [17]. To address hallucinations, approaches fall into two categories: training‑free methods (e.g., Opera [17], VCD [18]) and training‑based techniques (e.g., RLHF, PPO) [19], [20].

2.2 Preference Learning for faithful MLLMs↩︎

Preference learning initially applied to LLM alignment via RLHF, but DPO has recently gained widespread adoption as a simpler and stable alternative. V-DPO [21] extends DPO by incorporating visual context learning. POVID [22] creates a fine-grained dataset by injecting noise to texts and images. RLHF-V [2] collects segment-level human preference data and performs dense DPO. In addition, SPO-Task Planning [23] constructs preference pairs using curriculum learning to improve long-horizon planning. MM-RLHF [24] constructed a preference dataset and proposed a novel reward model to achieve MLLM alignment. SPO [25] treats questioning and answering jointly as a policy trajectory, co-optimizing them via a structured reward function to enhance the model’s consideration of visual dependency in dialogue. The mrDPO [26] utilizes multi-round DPO and Rebirth Tuning to optimize audio-visual LLMs.

3 Methodology↩︎

The overview of our Groc-PO framework is illustrated in Fig. 2. We first introduce the DPO, followed by the novel Grounded Context Preference Dataset (GCPD) and its generation pipeline, and the adaptive Groc-PO Loss.

3.1 Preliminaries: Direct Preference Optimization↩︎

DPO directly optimizes the model through a contrastive learning objective, making it more inclined to generate human-preferred responses while reducing the probability of generating dispreferred responses. DPO learns from preference data \((x, y^{+}, y^{-}) \sim \mathcal{D}\), where \(x\) is the input prompt, \(y^{+}\) is the human-preferred /chosen response, \(y^{-}\) is the dispreferred /rejected response, and \(\mathcal{D}\) is the dataset.

The DPO objective function assumes that the human preference probability \(p^*(y^{+} \succ y^{-} \mid x)\) can be modeled via a latent reward function \(r^*(x,y)\): \(p^*(y^{+} \succ y^{-} \mid x) = \sigma(r^*(x,y^{+}) - r^*(x,y^{-}))\). DPO further relates the reward function to the model’s policy \(\pi_{\theta}\) and a reference policy \(\pi_{\text{ref}}\): \(r_{^*}(x,y) = \beta (\log(\pi_{\theta}(y \mid x)) - \log(\pi_{\text{ref}}(y \mid x)))\).

where \(\beta\) is a hyperparameter controlling the ratio between reward function and policy deviation. DPO’s loss can directly optimize MLLM to maximize the probability of generating \(y^{+}\) and minimize generating \(y^{-}\). Let us define the log-likelihood ratio for the preferred response as \(r^{+} = \log\left( \pi_\theta(y^{+}\mid x) / \pi_{\mathrm{ref}}(y^{+}\mid x) \right)\) and for the dispreferred response as \(r^{-} = \log\left( \pi_\theta(y^{-}\mid x) / \pi_{\mathrm{ref}}(y^{-}\mid x) \right)\). Then the DPO loss function is defined as:

\[\label{eq:dpo} \mathcal{L}_{\mathrm{DPO}} = -\log\sigma\!\left(\beta(r^+ - r^-)\right).\tag{1}\]

By minimizing this loss function, the model \(\pi_{\theta}\) is trained to increase the difference between the log-probabilities of \(y^{+}\) and \(y^{-}\), It makes DPO simpler and demonstrates comparable or superior performance to RLHF.

3.2 Grounded Context Preference Dataset (GCPD)↩︎

Failures in multimodal reasoning often do not emerge only at the final response, but can originate from imperfect grounding and accumulated inconsistencies in pre-final stages. To explicitly supervise these upstream stages, we construct the Grounded Context Preference Dataset (GCPD), a structured preference dataset organized around progressively accumulated grounded context.

Specifically, GCPD is built as a 3-stage context-dependent preference dataset. Its three stages move from basic visual grounding, to context-grounded understanding, and finally to faithful complex reasoning. This formulation places preference supervision not only on the final answer, but also on the grounded context that supports it, providing a more direct signal for reducing error propagation and improving multimodal faithfulness.

Cumulative Multi-stage Context: For any stage \(s\), the prompt includes all historical context from stage 1 to \(s-1\), ensuring continuous information flow. Let \(\mathit{I}\) denote the image, \(\mathit{Q}\) denote the question, \(\mathit{A}\) denote the answer, \(\mathit{A}_{s}^+\) means the chosen response (human-preferred). Then, we will have the following prompt structure for every stage:

  • Stage 1 (S1): Prompt \(= \{I, Q_1\}\)

  • Stage 2 (S2): Prompt \(= \{I, Q_1, A_{s_1}^+, Q_2\}\)

  • Stage 3 (S3): Prompt \(= \{I, Q_1, A_{s_1}^+, Q_2, A_{s_2}^+, Q_3\}\)

Then, we detail the progressive stages design:

  • S1: Object Grounding. S1 marks the starting point of CoT process—identifying basic facts. We present the model with a standardized question (e.g., List each entity and its key attributes) to extract core visual elements.

  • S2: Contextual Grounding. S2 simulates the intermediate steps of CoT. Building upon S1, S2 focuses on tasks such as relationship description, comprehensive captioning, or visual question answering. It requires the model not only to identify individual entities but also to understand how they form a meaningful whole.

  • S3: Grounded Reasoning. S3 is the culmination of the CoT simulation. We pose complex questions that require integrating the image with context from S1 and S2, and performing logical inference, intent prediction, or reasoning tasks. This compels the model to perform high-level cognition based on established, reliable context.

In this way, our GCPD dataset is no longer fragmented question-answer pairs but offers a progressive learning process aligned with human cognitive laws.

3.3 Pipeline of GCPD’s Generation and Features↩︎

3.3.1 Basic Workflow↩︎

Our pipeline begins with a widely recognized RLHF-V dataset [2], which contains 5,733 images along with human-annotated, high-quality preference pair for tasks like captioning, relational description. Our goal is to generate a structured 3-stage context for each image. For any stage \(s\), the core tasks is to generate a specific question \(Q_s\) and a high-quality preference pair \((y_s^+, y_s^-)\), consisting of a chosen and a rejected response. This three-stage structure is designed with progressively increasing complexity, following a perception-understanding-reasoning path.

For the Stage 1, we define a universal base question \(\mathbf{Q}_1\): “List each entity and its key attributes,” to establish a factual foundation. The chosen response, \(y_{s_1}^+\), is initially generated by an advanced teacher model; the rejected response, \(y_{s_1}^-\), is derived from \(y_{s_1}^+\) via introduced rule-based deficiencies, retaining structural soundness while including factual inaccuracies. Subsequently, \(y_{s_1}^+\) undergoes rigorous verification and refinement to ensure its accuracy.

For the Stage 2, aiming for both efficiency and quality, we adopt the existing data from the RLHF-V dataset corresponding to each image, as its design philosophy aligns perfectly with our goals for this stage. This means that the question \(Q_2\), the chosen response \(y_{s_2}^+\), and the rejected response \(y_{s_2}^-\) are all sourced from this high-quality, human-validated dataset. It guarantees the superiority of the data for relational description and understanding.

In the Stage 3, our objective is to enhance model’s ability of complex thinking. We leverage an advanced teacher model to generate a new, more profound, and complex question, \(Q_3\), based on the context of the original image and the preceding dialogue (\(Q_1, y_{s_1}^+, Q_2, y_{s_2}^+\)). Following the pattern of the 1st stage, we then generate a high-quality chosen response, \(y_{s_3}^+\), via the teacher model combined with rigorous verification and refinement, and a rejected response, \(y_{s_3}^-\), from our LLaVA base model to complete the final preference pair.

3.3.2 Iterative Self-Correction for Chosen Samples (\(y_s^+\))↩︎

To maximize the chosen response quality and factual accuracy, we introduce an iterative self-correction mechanism.

  • In Stage 1, the initial list of entities in the chosen response, generated by the advanced teacher model, is fed back into the teacher model with a detailed verification prompt. The teacher model is instructed to comprehensively check and provide a score. If the response contains hallucinations or the average score is too low, it triggers a rewrite by the advanced teacher model.

  • Similarly, in Stage 3, the complex reasoning answer in the chosen response is sent back for a second review. In this step, the teacher model acts as a "Critic", inspecting the reasoning chain for logical fallacies and ensuring it is fully grounded in the provided visual and textual context.

This "generate-and-refine" closed-loop process significantly enhances the quality of our chosen responses, providing the model with a clear and reliable learning target.

3.3.3 Model-Centric Sampling↩︎

To further improve data quality and make training more efficient, we draw inspiration from the on-policy concept in RLHF [27] and adopt a Model-Centric Sampling strategy. The core idea is to ensure that the distribution of training data, aligns as closely as possible with the generation distribution of our targeted fine-tuned model. This approach enables the model to directly confront and rectify its own predominant error patterns, making the fine-tuning process highly targeted. This strategy is reflected in two key aspects:

  • The rejected responses in Stage 3 (\(y_{s_3}^-\)) are generated by our target LLaVA model. Consequently, these samples are representative of the model’s intrinsic failure modes, particularly in areas like long-range dependency, contextual understanding, and complex reasoning, which manifest as logical fallacies or cumulative hallucinations. In contrast to negative samples from a more capable, external model teacher model, which often suffer from a distribution mismatch in \(y_r^-\). These ‘model-centric’ samples provide a highly targeted and valuable learning signal for DPO.

  • In Stage 2, a key characteristic of the RLHF-V dataset lies in its preference pair construction: the rejected responses (\(y_{s_2}^-\)) are generated by the MLLM family, while the chosen responses (\(y_{s_2}^+\)) are human-revised versions of these same rejected samples. This approach ensures high distributional and stylistic alignment with our target model, effectively forming a tailored "problem-solution" paradigm for its specific weaknesses. This mechanism provides the highly valuable and targeted learning signal that is the core rationale for our adoption of this dataset.

It is worth noting that the Stage 1 responses are highly uniform, making generation variance across models minimal, and thus Model-Centric Sampling has little impact.

3.3.4 Human-in-the-Loop Verification↩︎

To ensure the rigor and quality of our GCPD dataset, we introduced Human-in-the-Loop verification. The audit team consisted of three MLLM-familiar PhD students who adhered to a guideline for all checks and corrections. The samples reviewed included: first, a 10% random sample of the entire dataset; second, a targeted review of \(y_s^+\) samples flagged by the teacher model Critic as having major issues during the "Iterative Self-Correction" process.

Overall, approximately 12% (\(\sim\)​2k) of the \(y_s^+\) samples were manually audited, leading to the revision or rewriting of nearly 2% of severely problematic samples (primarily in R3). The total time cost was approximately 57 hours per reviewer (30h for auditing, 27h for revision). This mechanism ensures the reliability and faithfulness of the dataset.

Table 1: Performance comparison with leading methods on various hallucination and general benchmarks. On LLaVA-v1.5-7B, LLaVA-v1.5-13B [1], Groc-PO achieves significant leads on key faithfulness metrics (e.g., AMBER, MM-Hal) and simultaneously enhances general abilities (e.g., LLAVA-Bench, SEED). Here, AMBER-Gene. refers to AMBER-Generation, and AMBER-Discri. denotes the AMBER-Discrimination.
MM-Hal [28] AMBER-Gene. [29] AMBER-Discri. [29]
2-3 (lr)4-6 (lr)7-8 Score\(\uparrow\) Hal-Rate\(\downarrow\) CHAIR\(\downarrow\) Hal-Rate\(\downarrow\) Cog\(\downarrow\) Acc\(\uparrow\) F1\(\uparrow\)
LLaVA-1.5-7B [1] 2.01 61.4 7.8 36.4 4.2 71.7 74.3 65.6 66.1
+ DPO [13] 2.14 58.3 5.7 27.3 2.6 71.3 82.1 69.1 66.4
+ CSR [30] 2.05 60.4 5.4 25.5 2.6 73.2 76.1 68.9 65.9
+ POVID [22] 2.26 55.2 5.7 26.9 3.0 71.9 74.7 68.2 66.1
+ V-DPO [21] 2.16 56.0 5.6 27.3 2.7 - 81.6 - -
+ RLHF-V [2] 2.02 60.4 5.5 26.3 2.5 74.8 78.5 68.0 66.1
+ mDPO [31] 2.39 54.0 4.4 24.5 2.4 - - - -
+ Groc-PO (Ours) 2.76 47.0 4.2 25.2 1.5 78.0 85.0 72.9 67.1
LLaVA-1.5-13B [1] 2.38 53.1 7.0 33.1 3.3 71.4 73.1 73.1 68.2
+ DPO [13] 2.47 51.0 6.1 26.3 2.7 71.9 82.1 72.8 68.6
+ RLHF-V [2] 2.50 52.1 6.3 25.1 2.1 79.2 82.3 76.7 68.2
+ Groc-PO (Ours) 2.85 45.0 3.8 24.4 1.3 83.5 88.2 76.5 68.8

3.4 Customized Groc-PO Loss↩︎

The standard DPO loss (Equation 1 ) treats all samples in the dataset equally. This uniform approach overlooks the inherent gradient of cognitive depth and sample difficulty within our GCPD dataset. To better leverage this rich and structured information, we propose a Groc-PO Loss, with a sample-level adaptive weight, \(w_i\), enabling the model to dynamically focus on samples that are more informative and have higher learning value. The Groc-PO loss is defined as: \[\mathcal{L}_{\text{Groc-PO}} = -\mathbb{E}_{(x_i, y_{w,i}, y_{l,i}) \sim \mathcal{D}} \left[ w_i \cdot \log\sigma(r_i(\theta)) \right]\] where \(r_i(\theta) = \beta \log \frac{\pi_{\theta}(y_i^+|x_i)}{\pi_{\text{ref}}(y_i^+|x_i)} - \beta \log \frac{\pi_{\theta}(y_i^-|x_i)}{\pi_{\text{ref}}(y_i^-|x_i)}\) is the implicit reward difference for preference pair \(i\). The core innovation lies in the design of adaptive weight \(w_i\), which is composed of two multiplicative components: \[w_i = \lambda_{r(i)} \cdot \gamma_i\]

3.4.1 Stage-aware Importance Weight (\(\lambda_r\))↩︎

This weight is designed to reflect the learning value of different rounds. Later rounds represent more complex tasks that demand stronger long-range dependency and comprehensive abilities. Thus, for any stage \(s\), we design \(\lambda_s\) as a monotonically increasing function of \(s\) to encourage model to focus on these advanced knowledge: \[\lambda_r = 1 + \alpha(r-1)\] where \(r \in \{1, 2, 3\}\) is the dataset stage, and \(\alpha \ge 0\) is a hyperparameter that controls the growth rate of stage importance. When \(\alpha > 0\), samples from the latter 2 stages are assigned a higher loss weight.

3.4.2 Hardness-aware Focusing Weight (\(\gamma_i\))↩︎

This weight aims to make model focus more on "hard samples" that are difficult to distinguish. When the model can easily distinguish between \(y^+\) and \(y^-\) , the sample is "easy" and has low learning value. Conversely, when model perceives two responses as having similar quality, the sample is "hard" and should be prioritized. We define \(\gamma_i\) as: \[\gamma_i = (1 - \sigma(r_i(\theta)))^{\eta}\] where \(\eta \ge 0\) is a focusing parameter. For \(\eta > 0\), this term significantly decreases the loss for well-distinguished samples (where \(\sigma(r_i) \to 1\)), thereby directing the optimization process toward the most challenging pairs.

Through this dual-weighting mechanism, our Groc-PO Loss adaptively evaluates the importance of each training sample, considering both its role in the progressive rounds (via \(\lambda_t\)) and sample’s learning value (via \(\gamma_i\)).

4 Experiments↩︎

4.1 Datasets, Metrics and Implementation Details↩︎

4.1.0.1 Training Data:

Based on our GCPD dataset generation pipeline described in Section 3.2, we constructed the 3-stages preference dataset comprising 5,733 diverse images and 17,199 high-quality preference pairs.

4.1.0.2 Evaluation Benchmarks:

To comprehensively evaluate models’ performance, we employ several widely used benchmarks: For faithfulness evaluation, AMBER [29] is a LLM-free benchmark for evaluating hallucinations, which has two components: (a) Discrimination: deciding whether a statement is correct; (b) Generation: describing for an image. MM-Hal [28] evaluates response-level hallucination rate and informativeness. For general capability evaluation, LLaVA-Bench [32] is a benchmark spanning diverse scenarios. SEED-Bench [33] is a large-scale benchmark to assess model abilities likes visual understanding and reasoning. For complex tasks, some sub-tasks of benchmarks are adopted, such as LLaVA-Bench-complex reasoning [32], LLaVA-Bench-conversation [32], SEED-visual reasoning [33], MME-commonsense-reasoning [34], and multi-turn dialogue benchmark MM-MT [35].

4.1.0.3 Implementation Details:

Our experiments leverage the widely adopted LLaVA-v1.5-7B and 13B [1] and Qwen2.5-VL-7B [36] models to evaluate scalability and effectiveness of our method. We employed LoRA [37] and AdamW optimizer [38]. Training was performed over 2 epochs with an effective batch size of 32. The teacher model we used is GPT-4o [39].

4.2 Main Results↩︎

On multiple mainstream faithfulness and general benchmarks, we conduct a comprehensive comparison of Groc-PO with a series of representative baselines, such as llava-v1.5-7B [1], DPO [13], CSR [30], POVID [22], RLHF-V [2], V-DPO [21], and mDPO [31].

4.2.0.1 On Faithfulness and General Abilities Evaluation.

Table 1 shows that Groc-PO achieves leading performance across almost all key evaluation metrics. These evaluations cover different types of faithfulnesss and general ability tests. These demonstrate that through our progressive preference data and adaptive training framework, the model can not only significantly suppress hallucinations but also improve comprehensive abilities

Furthermore, Groc-PO shows its scalability by delivering consistent and substantial gains across models from 7B to 13B, validating its efficiency and broad applicability.

In addition, to validate the scalability and generalizability of our framework, we applied Groc-PO to Qwen2.5VL-7B [36]. As detailed in Table 2, the model achieved improvements on the faithfulness test.

4.2.0.2 On Complex Understanding and Reasoning.

Table 3 demonstrates the particularly prominent superiority of Groc-PO in complex reasoning tasks. Across demanding benchmarks, including LLaVA-bench-complex, LLaVA-conversation, SEED-reasoning, and MME-Commonsense-reasoning, our model consistently outperforms the baseline, achieving up to a 45% relative improvement.

Furthermore, Groc-PO demonstrates superior conversational capabilities on MM-MT benchmark (multi-round dialogue), validating the effectiveness of its structured context.

Table 2: Comparison with different preference optimization methods on Qwen2.5-VL-7B [36].
Method MM-Hal Score (\(\uparrow\)) MM-Hal Rate (\(\downarrow\))
Qwen2.5-VL-7B [36] 3.55 0.40
+ DPO [13] 3.59 0.38
+ POVID [22] 3.73 0.37
+ CSR [30] 3.71 0.41
+ Groc-PO (Ours) 3.83 0.32
Table 3: Comparison of Groc-PO and DPO on complex tasks. Tasks cover reasoning (LLaVA-Bench-complex reasoning, SEED-visual reasoning, MME-commonsense-reasoning), single-turn conversation (LLaVA-Bench-conversation), and multi-turn dialogue (MM-MT). Groc-PO shows superiority.
Models
complex
reason [32]
conversation
 [32]
reason
 [33]
reason(%)
 [34]
-MT
 [35]
DPO 56.9 62.0 74.3 38.3 1.88
Groc-PO 82.5 67.2 76.5 51.8 2.55
(+45%) (+8%) (+3%) (+35%) (+36%)

1.75pt

4.3 Ablation Study↩︎

4.3.1 Contribution of Groc-PO Loss Components.↩︎

To verify the effectiveness of our Groc-PO Loss, we compared it against 3 variants: (1) DPO Loss: uses GCPD data with standard DPO loss; (2) Stage-aware Only; and (3) Difficulty-aware Only. Table 4 shows that the full Groc-PO Loss achieves the best performance. The individual components each provide significant gains.

In addition, We also performed ablation studies on the key hyperparameters of the loss, \(\alpha\) (Stage-aware) and \(\eta\) (Hardness-aware).

Table 4: Ablation study of the loss components and hyperparameters (\(\alpha, \eta\)) on MM-Hal [28], as described in Section [sec:sec:grocpo95loss].
[0pt]Loss Setting [0pt]\(\alpha\) [0pt]\(\eta\)
Score (\(\uparrow\))
Rate (\(\downarrow\))
(A) Component Ablation
DPO Loss 0 0 2.24 60.0
+ Stage-aware 0.25 0 2.46 55.0
+ Difficulty-aware 0 2 2.42 57.0
+ Groc-PO Loss 0.25 2 2.76 47.0
(B) Sensitivity to \(\alpha\)
w/ \(\alpha=0\) 0 2 2.42 57.0
w/ \(\alpha=0.25\) 0.25 2 2.76 47.0
w/ \(\alpha=0.5\) 0.5 2 2.40 55.5
(C) Sensitivity to \(\eta\)
w/ \(\eta=0\) 0.25 0 2.46 55.0
w/ \(\eta=1\) 0.25 1 2.57 51.0
w/ \(\eta=2\) 0.25 2 2.76 47.0

7pt

Figure 3: Ablations and Analysis. (a) Effectiveness of Model-Centric Sampling or not. (b) Contribution of individual stages: S2 peaks while S3 degrades from misalignment without history. (c) Impact of context depth: monotonic improvement with progressive history. (d) Sensitivity to history length: performance on a fixed stage-3 query improves as context is added.

4.3.2 Effect of Model-Centric Sampling.↩︎

We conduct an ablation of the data construction strategy, comparing a model trained solely on Teacher-generated preference data with one trained on our final dataset using "model-centric sampling". Figure 3a shows that the latter performs better, suggesting that learning from its own imperfect responses provides a closer data distribution and more targeted alignment signals, thereby improving self-alignment.

4.3.3 Contribution of Each Stage.↩︎

To quantify the contribution of each context stage, we established three independent training settings: \(\text{S1}\), \(\text{S2}\), and \(\text{S3}\). These models were exclusively trained on data from their respective stages, lacking historical context in \(\text{S2}\) and \(\text{S3}\).

Figure 3b revealed that \(\text{S2}\) outperformed \(\text{S1}\) and \(\text{S3}\). Because \(\text{S3}\) relies on preceding information, the absence of context leads to misalignment and performance decline. This affirms the necessity of collaboration among three context rounds, asserting that optimal performance requires structured integration.

4.3.4 Impact of Multi-stage Context Depth.↩︎

To investigate the influence of contextual learning depth, we used three training settings: (1) using the 1st-round data (S1-Only); (2) using the data of 1st and 2nd rounds (S1+S2); and (3) using full data of 3 stages. Figure 3c shows the model performance monotonically improves with increasing context depth and complexity.

This demonstrates that our designed "perception\(\rightarrow\)understanding\(\rightarrow\)reasoning" progressive learning path is indispensable for building model’s compressive capabilities and faithfulness.

Figure 4: Token-level log-probability (log-prob) comparison on chosen responses y_r^+ for complex tasks: Groc-PO vs. DPO. The curves (green:Groc-PO, brown:DPO) show log-prob assigned to each token. The top yellow bar chart illustrates the difference (Groc-PO - DPO), which is almost entirely positive. This suggests Groc-PO exhibits higher internal confidence on complex tasks.
Table 5: Comparison of training with and without grounded context. The \("\)Flattened DPO\("\) (the same 3-stage 17k dataset but without grounded context) shows lower faithfulness than Groc-PO (with grounded context).
Setting
Flattened DPO 2.17 61.0
Full Structured Context 2.76 47.0

6.5pt

Table 6: Training Overhead Comparison. The average per-sample processing time and peak memory usage in DPO and Groc-PO, indicating that Groc-PO adds only minor overhead.
Model Avg. time (s) Peak Memory Usage (MB)
DPO 1.99 40420
Groc-PO (Ours) 2.05 (+3%) 40432 (+0.03%)

4pt

Figure 5: Comparison on complex tasks: Groc-PO vs. DPO. While DPO shows certain degree of errors, Groc-PO demonstrates robust, evidence-based, and coherent reasoning.

4.4 Analysis and Discussion↩︎

4.4.1 Dependence on Structured Context.↩︎

To verify the importance of structured context history, we designed a baseline named "Flattened DPO", which uses the same 17k preference pairs but removes all context history, degrading all training data to single-stage question-answer pairs. Table 5 shows the "Flattened DPO" is far below structured context Groc-PO. A likely reason is that many Stage 3 require information from the first two stages, and removing history has left the model misaligned. This result underscores the necessity of incorporating structured context to cultivate contextual coherence and enhance faithfulness.

4.4.2 Sensitivity to History Length.↩︎

We evaluated the model’s ability to leverage contextual history of varying lengths by testing the same third-stage question (S3) under three conditions: Zero-shot (image + S3), 1-stage context (image + S1 + S3), and 2-stage context (full history: image + S1 + S2 + S3). Figure 3d shows that performance exhibited a clear improvement: \(2\text{-stage} > 1\text{-stage} > \text{Zero-shot}\). This empirically validates the critical role of multi-stage context in multimodal dialogue, demonstrating that more complete history enables the model to better localize the question, perform logical reasoning, and generate accurate responses.

4.4.3 Training Overhead.↩︎

We compared the training overhead of Groc-PO with DPO. Table 6 reports the average processing time per sample and peak memory usage. Results show that Groc-PO introduces only marginal overhead.

4.4.4 Discussion: Effectiveness of Grounded Context Supervision.↩︎

Our analysis highlights the effectiveness of grounded context supervision. As shown in Figure 3c, model performance consistently improves as more complete grounded context is incorporated during training. This suggests that more targeted and stage-specific supervision on early grounding stages may improve the reliability of later-stage reasoning. Notably, the improvement is most evident on complex reasoning tasks. As reported in Table 3, the full Groc-PO achieves clear gains on these tasks. At the same time, it maintains strong performance on general and faithfulness benchmarks. These results indicate that grounded context supervision improves reasoning quality, is beneficial for challenging multimodal tasks, and maintains competitive performance on general and faithfulness benchmarks.

4.5 Case Study and Visualization↩︎

4.5.1 Token-level Log-Probabilities on Chosen Responses of Complex Tasks: Groc-PO vs. DPO↩︎

To further investigate Groc-PO’s generation confidence for complex tasks, we conducted a case study for token-level log-probability (log-prob) comparison.

In Figure 4, we observe that Groc-PO (green curve) assigns a higher log-prob to the majority of tokens in the chosen responses compared to DPO (brown curve), where the difference (yellow bars) is almost entirely positive. This indicates that Groc-PO exhibits higher internal confidence when handling complex tasks.

4.5.2 Visualization of Qualitative Comparison.↩︎

Figure 5 visually confirms that while the DPO relatively fails on complex queries, Groc-PO generates logically accurate responses that are well-supported by explicit visual evidence.

5 Conclusion↩︎

In this paper, we proposed Grounded Context Preference Optimization (Groc-PO), a framework that improves MLLM faithfulness through explicit preference supervision over grounded pre-final stages. To support this objective, we introduced the Grounded Context Preference Dataset (GCPD) and novel adaptive loss function. Extensive evaluations demonstrate that Groc-PO comprehensively enhances multiple capabilities, contributing to developing more faithful MLLMs.

6 Acknowledgements↩︎

This work was supported by the Artificial Intelligence-National Science and Technology Major Project (2023ZD0121200) and the Fundamental and Interdisciplinary Disciplines Breakthrough Plan of the Ministry of Education of China (No. JYB2025XDXM103).

References↩︎

[1]
H. Liu, C. Li, Q. Wu, and Y. J. Lee, “Visual instruction tuning.” NeurIPS, 2023.
[2]
T. Yu et al., “Rlhf-v: Towards trustworthy mllms via behavior alignment from fine-grained correctional human feedback,” in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, 2024, pp. 13807–13816.
[3]
J.-B. Alayrac et al., “Flamingo: A visual language model for few-shot learning,” Advances in neural information processing systems, vol. 35, pp. 23716–23736, 2022.
[4]
H. Liu, C. Li, Y. Li, and Y. J. Lee, “Improved baselines with visual instruction tuning,” in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, 2024, pp. 26296–26306.
[5]
E. Amirloo et al., “Understanding alignment in multimodal llms: A comprehensive study,” arXiv preprint arXiv:2407.02477, 2024.
[6]
W. Xiao et al., “Detecting and mitigating hallucination in large vision language models via fine-grained ai feedback,” arXiv preprint arXiv:2404.14233, 2024.
[7]
R. Pi et al., “Strengthening multimodal large language model with bootstrapped preference optimization,” in European conference on computer vision, 2024, pp. 382–398.
[8]
M. Zhang et al., “Automated multi-level preference for mllms,” Advances in Neural Information Processing Systems, vol. 37, pp. 26171–26194, 2024.
[9]
Z. Bai et al., “Hallucination of multimodal large language models: A survey,” arXiv preprint arXiv:2404.18930, 2024.
[10]
A. Gunjal, J. Yin, and E. Bas, “Detecting and preventing hallucinations in large vision language models,” in Proceedings of the AAAI conference on artificial intelligence, 2024, vol. 38, pp. 18135–18143.
[11]
H. Liu et al., “A survey on hallucination in large vision-language models,” arXiv preprint arXiv:2402.00253, 2024.
[12]
Z. Liang et al., “A survey of multimodel large language models,” in Proceedings of the 3rd international conference on computer, artificial intelligence and control engineering, 2024, pp. 405–409.
[13]
R. Rafailov, A. Sharma, E. Mitchell, C. D. Manning, S. Ermon, and C. Finn, “Direct preference optimization: Your language model is secretly a reward model,” Advances in Neural Information Processing Systems, vol. 36, pp. 53728–53741, 2023.
[14]
Y. Li, Y. Du, K. Zhou, J. Wang, W. X. Zhao, and J.-R. Wen, “Evaluating object hallucination in large vision-language models,” arXiv preprint arXiv:2305.10355, 2023.
[15]
T. Guan et al., “Hallusionbench: An advanced diagnostic suite for entangled language hallucination and visual illusion in large vision-language models,” in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, 2024, pp. 14375–14385.
[16]
A. Ben-Kish, M. Yanuka, M. Alper, R. Giryes, and H. Averbuch-Elor, “Mocha: Multi-objective reinforcement mitigating caption hallucinations,” arXiv preprint arXiv:2312.03631, vol. 2, 2023.
[17]
Q. Huang et al., “Opera: Alleviating hallucination in multi-modal large language models via over-trust penalty and retrospection-allocation,” in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, 2024, pp. 13418–13427.
[18]
S. Leng et al., “Mitigating object hallucinations in large vision-language models through visual contrastive decoding,” in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, 2024, pp. 13872–13882.
[19]
W. Xiao et al., “Detecting and mitigating hallucination in large vision language models via fine-grained ai feedback,” in Proceedings of the AAAI conference on artificial intelligence, 2025, vol. 39, pp. 25543–25551.
[20]
J. Schulman, F. Wolski, P. Dhariwal, A. Radford, and O. Klimov, “Proximal policy optimization algorithms,” arXiv preprint arXiv:1707.06347, 2017.
[21]
Y. Xie, G. Li, X. Xu, and M.-Y. Kan, “V-dpo: Mitigating hallucination in large vision language models via vision-guided direct preference optimization,” arXiv preprint arXiv:2411.02712, 2024.
[22]
Y. Zhou, C. Cui, R. Rafailov, C. Finn, and H. Yao, “Aligning modalities in vision large language models via preference fine-tuning,” arXiv preprint arXiv:2402.11411, 2024.
[23]
X. Liang et al., “Structured preference optimization for vision-language long-horizon task planning,” arXiv preprint arXiv:2502.20742, 2025.
[24]
Y.-F. Zhang et al., “Mm-rlhf: The next step forward in multimodal llm alignment,” arXiv preprint arXiv:2502.10391, 2025.
[25]
G. Sun et al., “Structured policy optimization: Enhance large vision-language model via self-referenced dialogue,” in Proceedings of the IEEE/CVF international conference on computer vision, 2025, pp. 741–751.
[26]
C. Tang et al., “Enhancing multimodal LLM for detailed and accurate video captioning using multi-round preference optimization,” arXiv preprint arXiv:2410.06682, 2024.
[27]
P. F. Christiano, J. Leike, T. Brown, M. Martic, S. Legg, and D. Amodei, “Deep reinforcement learning from human preferences,” Advances in neural information processing systems, vol. 30, 2017.
[28]
Z. Sun et al., “Aligning large multimodal models with factually augmented rlhf,” arXiv preprint arXiv:2309.14525, 2023.
[29]
J. Wang et al., “An LLM-free multi-dimensional benchmark for MLLMs hallucination evaluation,” arXiv preprint arXiv:2311.07397, 2023.
[30]
Y. Zhou et al., “Calibrated self-rewarding vision language models,” arXiv preprint arXiv:2405.14622, 2024.
[31]
F. Wang et al., “Mdpo: Conditional preference optimization for multimodal large language models,” arXiv preprint arXiv:2406.11839, 2024.
[32]
H. Liu, C. Li, Q. Wu, and Y. J. Lee, “Visual instruction tuning,” Advances in neural information processing systems, vol. 36, pp. 34892–34916, 2023.
[33]
B. Li, R. Wang, G. Wang, Y. Ge, Y. Ge, and Y. Shan, “Seed-bench: Benchmarking multimodal llms with generative comprehension,” arXiv preprint arXiv:2307.16125, 2023.
[34]
C. Fu et al., “MME: A comprehensive evaluation benchmark for multimodal large language models,” arXiv preprint arXiv:2306.13394, 2023.
[35]
P. Agrawal et al., “Pixtral 12B,” arXiv preprint arXiv:2410.07073, 2024.
[36]
S. Bai et al., “Qwen2.5-VL technical report,” arXiv preprint arXiv:2502.13923, 2025.
[37]
E. J. Hu et al., “Lora: Low-rank adaptation of large language models.” ICLR, vol. 1, no. 2, p. 3, 2022.
[38]
I. Loshchilov and F. Hutter, “Decoupled weight decay regularization,” arXiv preprint arXiv:1711.05101, 2017.
[39]
A. Hurst et al., “Gpt-4o system card,” arXiv preprint arXiv:2410.21276, 2024.