Preprint
Article

This version is not peer-reviewed.

Self-Correcting Multimodal AI Agents for Reliable Autonomous Decision-Making

Submitted:

15 September 2026

Posted:

17 September 2026

You are already at the latest version

Abstract
Recent advances in large language models and multimodal foundation models have enabled artificial intelligence agents to jointly process text, images, and other modalities while performing multi-step reasoning and interacting with external tools. Despite this progress, autonomous agents remain prone to compounding errors that originate in visual perception, language reasoning, tool invocation, or the interaction among these components. This paper proposes a self-correcting multimodal agent architecture that couples task decomposition and planning with an explicit verification and revision loop, allowing the agent to detect inconsistencies in intermediate reasoning steps and in final outputs before a task is considered complete. The architecture combines cross-modal evidence aggregation, secondary-model critique, rule-based consistency checks, and tool-grounded verification to identifycandidate errors, and it uses a bounded iterative revision procedure to correct them without unnecessary recomputation. We formalize the verification-and-correction process as a constrained optimization over an evolving action-reasoning trace and describe a concrete algorithmic instantiation suitable for visual question answering, document understanding, and tool-augmented reasoning tasks. We further describe an evaluation protocol spanning accuracy, factual reliability, task completion, and robustness to injected multimodal errors, together with an explicit accounting of the additional inference-time cost introduced by iterative self-correction. The framework is intended to give practitioners a concrete, reproducible template for building and evaluating multimodal agents that can detect and recover from their own mistakes prior to acting autonomously.
Keywords: 
;  ;  ;  ;  ;  ;  ;  ;  

1. Introduction

Large language models (LLMs) have progressed from single-turn text generators into agentic systems capable of decomposing tasks, invoking external tools, and executing multi-step plans with limited human supervision [1]. The extension of these systems into the multimodal domain, in which an agent must jointly interpret images, documents, or sensor streams alongside natural language instructions, has broadened the range of tasks such agents can address, from visual question answering to document-grounded reasoning and embodied tool use [2,3]. However, this expanded capability comes with an expanded surface for failure. An agent’s final decision can be corrupted by an error at any stage of its pipeline: a visual encoder may misidentify an object, a language module may draw an unsupported inference from a correct perception, a tool call may be malformed or misinterpreted, or an early planning mistake may propagate silently through several subsequent steps.
Conventional agent architectures generate a single reasoning trace and commit to it, offering no internal mechanism to catch errors before they affect the final output. This is problematic in autonomous settings where actions have consequences beyond generating text, such as filling out a form, issuing an API call, or making a decision that a downstream system will execute without further human review. Such operational risks are especially pronounced in complex cyber-physical settings and digital twin architectures, where unverified autonomous actions can cascade across critical infrastructure or networked IoT systems [4,5]. A growing body of work has shown that language agents can be made more reliable by allowing them to reflect on their own outputs, critique their reasoning using auxiliary signals, and revise flawed steps rather than committing to a first attempt [6,7,8]. These self-correction techniques have primarily been developed and evaluated in text-only settings; multimodal environments introduce additional failure modes, such as object hallucination in vision-language models [9], that a text-only verification mechanism cannot detect on its own.
This paper addresses this gap by proposing a self-correcting multimodal agent framework in which verification and revision are treated as first-class components of the agent’s control loop rather than as an optional post-processing step. The agent decomposes an incoming task into subtasks, plans a sequence of actions that may include tool invocations, and evaluates both intermediate reasoning steps and the final answer against multiple independent sources of evidence before returning control to the user. When a verification step flags an inconsistency, the agent revises the relevant portion of its plan or reasoning rather than restarting the entire task, which bounds the additional computation required for correction.
The main contributions of this paper are as follows.
  • We propose a modular self-correcting multimodal agent architecture that integrates perception, planning, tool use, and a dedicated verification-and-revision loop operating over both intermediate and final outputs.
  • We formalize the verification and correction process mathematically as an iterative constrained refinement over an agent’s reasoning trace, and we present a concrete algorithm for bounded self-correction that is agnostic to the underlying foundation model.
  • We describe a taxonomy of multimodal error sources, spanning perceptual, linguistic, tool-interaction, and cross-modal alignment errors, and we map each error category to a corresponding verification strategy.
  • We define an evaluation protocol, covering multimodal reasoning, visual question answering, document understanding, and tool-use tasks, together with metrics for reliability, task completion, and the computational overhead of self-correction, that can be used to empirically test the framework described here.
The remainder of this paper is organized as follows. Section 2 reviews related work on language agents, self-correction, and multimodal foundation models. Section 3 presents the proposed framework at a conceptual level. Section 4 describes the system architecture. Section 5 formalizes the verification and correction process and presents the core algorithm. Section 6 describes the intended experimental setup. Section 7 discusses the evaluation protocol and the form that results should take. Section 8 presents a comparative analysis against related approaches. Section 9 discusses limitations, and Section 10 concludes with directions for future work.

3. Proposed Framework

The proposed framework models an autonomous task as a sequence of individually verifiable decisions rather than a single opaque generation step. The agent operates through four coupled processes: task understanding and decomposition, action planning and tool use, verification of intermediate and final outputs, and bounded revision when inconsistencies are detected.
Given a multimodal task comprising an instruction and one or more supporting images, documents, or tool-accessible resources, the agent first constructs an internal task representation that identifies the subgoals required to produce the final answer or action. Each subgoal is assigned a planned action, such as direct inference from the multimodal input, a call to an external tool (e.g., image cropper, OCR module, calculator, or retrieval system), or generation of an intermediate result for a subsequent subgoal. The output of each action is passed through verification before being accepted into the working context.
Verification is multi-source and combines four complementary strategies. First, cross-modal consistency checking compares language-level claims with evidence extracted from the visual or document modality, requiring claims about objects, quantities, or layouts to be traceable to the input. Second, secondary-model critique uses an independent model instance, or the same model in a distinct critique role, to identify unsupported inferences in the reasoning trace, following the self-critique paradigm of prior text-only work [7]. Third, rule-based checks enforce deterministic task-specific constraints, such as validating numeric outputs, tool-call schemas, or cited document regions. Fourth, tool-grounded verification independently re-executes or checks claims using an external tool, following the tool-interactive critiquing approach of [8].
When a verification strategy detects an inconsistency, the agent enters a revision phase and updates only the implicated portion of the plan or reasoning trace using the verification feedback as an additional conditioning signal. Verification is then repeated until the output passes all applicable checks or a maximum revision budget is reached. In the latter case, the agent returns its best available answer with an explicit confidence annotation indicating unresolved concerns. This bounded revise-then-reverify cycle limits the computational cost of unconstrained self-correction while enabling recovery from detectable errors.

4. System Architecture

Figure 1 shows the high-level architecture of the proposed self-correcting multimodal agent. The system is organized into five layers: a multimodal input layer, a planning and decomposition layer, an execution layer that interfaces with external tools, a verification layer that aggregates evidence from multiple sources, and a revision controller that mediates between verification outcomes and the working reasoning trace.
The multimodal input layer normalizes heterogeneous inputs, such as raw images, scanned documents, or structured tables, into a common representation consumable by the planner. The planning and decomposition layer produces an ordered list of subgoals and, for each subgoal, a candidate action drawn from a predefined action space that includes direct inference, tool invocation, and sub-answer aggregation. The execution layer carries out the selected action and interfaces with external tools such as optical character recognition, object detectors, calculators, and retrieval systems.
Figure 2 details the internal verification and revision workflow, which is the central novelty of the architecture relative to a conventional single-pass agent.
The revision controller receives, for each failed verification check, a structured explanation of the detected inconsistency, such as an object referenced in text but absent from the corresponding image region, a numeric answer that fails a domain constraint, or a tool call whose arguments do not match the expected schema. This explanation is used to condition a targeted regeneration of the affected reasoning segment, rather than discarding the entire trace, which keeps the additional cost of correction proportional to the size of the error rather than to the length of the whole task.

5. Mathematical Model and Algorithms

This section formalizes the verification-and-correction process introduced in Section 3.

5.1. Problem Formulation

Let a multimodal task instance be denoted by x = ( x t , x v ) , where x t is the textual instruction and x v is the associated visual or document evidence. The agent produces a reasoning trace τ = ( s 1 , s 2 , … , s T ) , where each step s i is either an inference, a tool call, or a partial answer, and a final output y = f ( τ ) derived from the completed trace. We associate with each step s i a verification score
v ( s i ) = ∑ k = 1 K w k g k ( s i , x , τ < i ) ,
where g k ∈ { 0 , 1 } is the outcome of the k-th verification source described in Section 4 (cross-modal consistency, secondary-model critique, rule-based constraints, and tool-grounded verification, so K = 4 in the base configuration), w k ≥ 0 is a source-specific weight satisfying ∑ k w k = 1 , and τ < i denotes the reasoning steps preceding s i . A step is accepted if v ( s i ) ≥ θ for a fixed acceptance threshold θ ∈ ( 0 , 1 ] , and is otherwise routed to the revision controller.

5.2. Revision Objective

When a step s i fails verification, the agent seeks a revised step s i ′ that maximizes verification score while remaining consistent with the accepted prefix of the trace. We express this as the constrained objective
s i ′ = arg max s v ( s ) s . t . d ( s , s i ) ≤ δ ,
where d ( · , · ) is a divergence between candidate steps in the model’s latent or textual representation space and δ bounds how far the revision may deviate from the original step, which discourages the revision procedure from silently changing the subgoal being addressed. In practice, Equation (2) is approximated by conditioning the generating model on the verification feedback and resampling, rather than solved exactly, following the same practical relaxation used in prior self-refinement work [7].

5.3. Bounded Iterative Correction

To prevent unbounded computation, the framework caps the number of revision attempts per step at a budget R. The overall trace-level objective combines task success with a penalty on the number of revisions consumed, Preprints 233450 i001 where y * is the (possibly unknown at inference time) correct output, r i ≤ R is the number of revisions used for step i, and λ > 0 trades off reliability against inference-time cost. Equation (3) is not optimized via gradient descent; rather, it defines the quantity that the evaluation protocol in Section 6 is designed to estimate empirically for different configurations of θ , R, and the source weights w k .

5.4. Algorithm

Algorithm 1 summarizes the bounded self-correction procedure executed for each step of the agent’s reasoning trace.
Algorithm 1 Bounded Multimodal Self-Correction
Require: 
task input x = ( x t , x v ) , acceptance threshold θ , revision budget R, source weights { w k }
1:
Initialize trace τ ← ∅
2:
Decompose x into subgoals { g 1 , … , g T } using the planner
3:
for i = 1 to T do
4:
   Generate candidate step s i ← Generate ( g i , x , τ )
5:
    r ← 0
6:
   while  v ( s i ) < θ r < R  do
7:
      c ← Critique ( s i , x , τ ) aggregate 4 sources
8:
      s i ← Revise ( s i , c )
9:
     Recompute v ( s i ) using Equation (1)
10:
      r ← r + 1
11:
   end while
12:
   Append s i to τ ; record r i ← r
13:
end for
14:
y ← f ( τ )
15:
Verify y against x using all four sources; if it fails, revise y with budget R 
16:
return y, confidence estimate derived from final v ( y ) and ∑ i r i
Because verification and revision operate at the granularity of individual steps rather than the entire trace, the worst-case number of additional generation calls introduced by self-correction is bounded by T × R plus a constant number of calls for final-answer verification, giving the framework a predictable inference-time cost profile that can be tuned via R and θ .

6. Experimental Setup

This section describes the evaluation protocol intended to test the framework described above. Because the contribution of this paper is the architecture and its formalization, the values reported for any concrete instantiation should be obtained by implementing the framework on top of a chosen multimodal backbone and are not presented here as already-obtained findings.

6.1. Tasks and Datasets

Four task categories are proposed for evaluation, chosen to exercise distinct combinations of the error sources discussed in Section 2. Multimodal reasoning tasks that require combining information from an image and a textual instruction test the cross-modal consistency verifier directly. Visual question answering tasks, including settings constructed to probe object hallucination in the style of the POPE benchmark [9], test whether the framework reduces ungrounded claims about image content. Document understanding tasks based on layout-sensitive question answering, in the style of DocVQA [20], test the interaction between optical character recognition tool calls and rule-based constraint checking. Tool-use tasks requiring multi-step API invocation, in the style of Toolformer-style tool-augmented evaluation [14], test the tool-grounded verification source and the bounded revision procedure under sequential tool dependencies.

6.2. Baselines

The proposed self-correcting agent should be compared against a single-pass agent with an identical planner and tool interface but no verification loop, an agent restricted to text-only self-critique without cross-modal or tool-grounded verification, and a Reflexion-style agent that revises across full episodes rather than at the level of individual steps [6]. This set of baselines isolates the contribution of multimodal, tool-grounded, step-level verification relative to the closest prior approaches.

6.3. Metrics

Reliability should be measured using task accuracy, exact-match or F1 score where applicable, and a factual-consistency rate that specifically measures whether claims in the output are supported by the multimodal input. Robustness should be measured by injecting controlled perturbations, such as an artificially corrupted visual region or a deliberately mislabeled tool result, and measuring the fraction of injected errors that the verification layer detects and the fraction that the agent successfully corrects. Efficiency should be measured using the mean number of additional generation calls per task attributable to self-correction, wall-clock latency overhead relative to the single-pass baseline, and the distribution of revisions consumed per step, r i in Equation (3).

6.4. Implementation Details

Table 1 lists the implementation parameters that should be fixed and reported for any concrete instantiation of the framework, so that reported results are reproducible and comparable across backbones.

7. Results and Discussion

7.1. Reporting Template

This section specifies the form that results should take once the framework in Sections 3–5 is instantiated and evaluated according to the protocol in Section 6. Table 2 shows the intended reporting structure. Bracketed entries denote quantities to be filled in from actual experiments; they are left unpopulated here because no experiments were run for this paper, and the structure of the table, not any numeric value in it, is the contribution of this section.

7.2. Expected Qualitative Trends

Based on the mechanisms embedded in the architecture and consistent with findings reported for text-only self-correction [7,8] and for object hallucination in vision-language models [9], the framework is expected to reduce ungrounded claims about visual content relative to a single-pass baseline, since the cross-modal consistency verifier directly targets this failure mode. It is likewise expected that step-level revision will consume fewer additional generation calls than episode-level reflection for tasks in which errors are localized to a single subgoal, since only the affected step is regenerated. The clearest anticipated trade-off is between the acceptance threshold θ and inference cost: a stricter threshold should increase factual consistency at the cost of additional revision calls, consistent with the general finding that self-correction improves reliability primarily when grounded in an external verification signal rather than the model’s own unaided judgment [18].
Figure 3 and Figure 4 illustrate the qualitative shape of these expected trends; the numerical axes are illustrative placeholders to be replaced with measured values.

7.3. Ablation Protocol

Table 3 specifies the ablation studies that should be run to isolate the contribution of each verification source described in Section 4. Each row removes one verification source, g k in Equation (1), while holding the remaining architecture fixed, so that the resulting change in factual-consistency rate can be attributed to that source.

8. Comparative Analysis

Relative to episode-level self-correction such as Reflexion, which stores a reflection in memory and only benefits from it on a subsequent attempt at a similar task [6], the proposed framework verifies and, if necessary, revises within the same episode at the granularity of individual reasoning steps, which should reduce the number of full task retries needed to reach an acceptable answer. Relative to Self-Refine, which relies exclusively on the same model’s own critique of its output [7], the proposed framework adds cross-modal and tool-grounded verification sources that do not depend solely on the generating model’s own judgment, which prior work suggests is important because unaided self-verification is often unreliable [8,18]. Relative to CRITIC, which grounds critique in external tools but was developed and evaluated primarily in text-only settings [8], the proposed framework extends tool-grounded verification with an explicit cross-modal consistency source designed to catch failures at the vision-language interface itself, such as the object hallucinations characterized by the POPE benchmark [9]. Table 4 summarizes this qualitative positioning.

9. Limitations

The framework depends on the availability of task-appropriate verification sources; in domains where no reliable external tool, rule set, or secondary evidence exists, verification degenerates toward the same unaided self-critique that prior work has found to be unreliable [18], and the expected reliability gains would not be realized. The divergence bound δ in Equation (2) and the acceptance threshold θ introduce hyperparameters that likely require task-specific tuning, and poorly chosen values could cause the agent to either accept flawed steps too readily or to consume its revision budget without resolving genuine ambiguity in the input. The bounded revision procedure also assumes that errors are predominantly localized to individual steps; tasks in which an early planning decision invalidates the entire subgoal decomposition may require full replanning rather than step-level revision, which the current formulation does not explicitly address. Finally, because this paper presents the architecture and its formalization rather than a completed empirical study, the qualitative trends discussed in Section 7 require validation on concrete multimodal backbones before any quantitative claims can be made.

10. Conclusion and Future Work

This paper presented a self-correcting multimodal agent architecture that treats verification and bounded revision as core components of the agent control loop rather than as an optional refinement step. By combining cross-modal consistency checking, secondary-model critique, rule-based constraints, and tool-grounded verification, the framework is designed to detect and correct a broader class of multimodal errors than text-only self-correction methods, while a step-level revision procedure with an explicit budget keeps the resulting inference-time overhead bounded and predictable. We formalized the verification and revision process mathematically and provided a concrete algorithm suitable for implementation on top of existing multimodal foundation models, together with an evaluation protocol spanning multimodal reasoning, visual question answering, document understanding, and tool-use tasks.
Future work includes implementing the framework on top of open multimodal backbones and empirically populating the reporting templates introduced in Section 7; extending the verification layer with learned, task-specific verifiers rather than only rule-based and tool-grounded checks; studying adaptive acceptance thresholds θ that adjust to estimated task difficulty rather than remaining fixed; and investigating whether reflections accumulated across episodes, in the style of Reflexion [6], can be combined with the step-level verification proposed here to improve performance on repeated or related tasks without sacrificing the bounded per-episode cost that the current framework guarantees. In addition, investigating the deployment of bounded self-correcting multimodal agents within large-scale cyber-physical digital twins [4,15] and federated agent architectures [17] constitutes an important avenue for achieving auditable, resilient, and collaborative autonomous intelligence.

References

  1. Wang, L.; Ma, C.; Feng, X.; Zhang, Z.; Yang, H.; Zhang, J.; Chen, Z.; Tang, J.; Chen, X.; Lin, Y.; et al. A Survey on Large Language Model Based Autonomous Agents. Frontiers of Computer Science 2024, 18, 186345. [CrossRef]
  2. Liu, H.; Li, C.; Wu, Q.; Lee, Y.J. Visual Instruction Tuning. In Proceedings of the Advances in Neural Information Processing Systems. Curran Associates, Inc., 2023, Vol. 36, pp. 34892–34916. [CrossRef]
  3. OpenAI. GPT-4 Technical Report. arXiv preprint arXiv:2303.08774 2023. [CrossRef]
  4. Syed, T.A.; Akarma, A.; Alatify, A.; Naqash, M.T.; Alqurashi, A. Agentic AI-enhanced digital twins for Smart City civil infrastructure: A secure, autonomous and auditable management framework. PLoS ONE 2026, 21, e0353610. [CrossRef]
  5. Jan, S.; Akarma, A.; Syed, T.A.; Muhammad, M.A.; Kamal, S. EAGF: A Four-Pillar Ethical AI Governance Framework for Trustworthy Cybersecurity in 5G Renewable Energy IoT Systems. Scientific Reports 2026. [CrossRef]
  6. Shinn, N.; Cassano, F.; Gopinath, A.; Narasimhan, K.; Yao, S. Reflexion: Language Agents with Verbal Reinforcement Learning. In Proceedings of the Advances in Neural Information Processing Systems, 2023, Vol. 36, pp. 8634–8652. [CrossRef]
  7. Madaan, A.; Tandon, N.; Gupta, P.; Hallinan, S.; Gao, L.; Wiegreffe, S.; Alon, U.; Dziri, N.; Prabhumoye, S.; Yang, Y.; et al. Self-Refine: Iterative Refinement with Self-Feedback. In Proceedings of the Advances in Neural Information Processing Systems, 2023, Vol. 36, pp. 46534–46594. [CrossRef]
  8. Gou, Z.; Shao, Z.; Gong, Y.; Shen, Y.; Yang, Y.; Duan, N.; Chen, W. CRITIC: Large Language Models Can Self-Correct with Tool-Interactive Critiquing. In Proceedings of the International Conference on Learning Representations, 2024.
  9. Li, Y.; Du, Y.; Zhou, K.; Wang, J.; Zhao, W.X.; Wen, J.R. Evaluating Object Hallucination in Large Vision-Language Models. In Proceedings of the Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing. Association for Computational Linguistics, 2023, pp. 292–305. [CrossRef]
  10. Yao, S.; Zhao, J.; Yu, D.; Du, N.; Shafran, I.; Narasimhan, K.R.; Cao, Y. ReAct: Synergizing Reasoning and Acting in Language Models. In Proceedings of the International Conference on Learning Representations, 2023.
  11. Yao, S.; Yu, D.; Zhao, J.; Shafran, I.; Griffiths, T.L.; Cao, Y.; Narasimhan, K. Tree of Thoughts: Deliberate Problem Solving with Large Language Models. In Proceedings of the Advances in Neural Information Processing Systems. Curran Associates, Inc., 2023, Vol. 36, pp. 11809–11822. [CrossRef]
  12. Wei, J.; Wang, X.; Schuurmans, D.; Bosma, M.; Ichter, B.; Xia, F.; Chi, E.H.; Le, Q.V.; Zhou, D. Chain-of-Thought Prompting Elicits Reasoning in Large Language Models. In Proceedings of the Advances in Neural Information Processing Systems, 2022, Vol. 35, pp. 24824–24837. [CrossRef]
  13. Wang, X.; Wei, J.; Schuurmans, D.; Le, Q.V.; Chi, E.H.; Narang, S.; Chowdhery, A.; Zhou, D. Self-Consistency Improves Chain of Thought Reasoning in Language Models. In Proceedings of the International Conference on Learning Representations, 2023.
  14. Schick, T.; Dwivedi-Yu, J.; Dessì, R.; Raileanu, R.; Lomeli, M.; Hambro, E.; Zettlemoyer, L.; Cancedda, N.; Scialom, T. Toolformer: Language Models Can Teach Themselves to Use Tools. In Proceedings of the Advances in Neural Information Processing Systems, 2023, Vol. 36, pp. 68539–68551. [CrossRef]
  15. Syed, T.A.; Akarma, A.; Naqash, M.T.; Hameed, D.; Kamal, S.; Formisano, A. Agentic AI for Climate-Resilient Cities: A PRISMA-Guided Review and Digital Twin Framework. Sustainability 2026, 18. [CrossRef]
  16. Syed, T.A.; Alshahrani, A.; Akarma, A.; Khan, S.; Nauman, M.; Lee, I.E.; Jan, S.; Ullah, A. FinNutriAgent (FNA): An Agentic AI for Nutrition Planning Considering Budget Constraints. Engineering, Technology & Applied Science Research 2026, 16, 36408–36417. [CrossRef]
  17. Syed, T.A.; Siddiqui, M.S.; Akarma, A.; Formisano, A. FedAgent-Chain: A Secure Federated and Agentic AI Framework for Multilingual Disability-Inclusive Employment in AI Cities. Smart Cities 2026, 9. [CrossRef]
  18. Kamoi, R.; Zhang, Y.; Zhang, N.; Han, J.; Zhang, R. When Can LLMs Actually Correct Their Own Mistakes? A Critical Survey of Self-Correction of LLMs. Transactions of the Association for Computational Linguistics 2024, 12, 1417–1440. [CrossRef]
  19. Liu, H.; Li, C.; Li, Y.; Lee, Y.J. Improved Baselines with Visual Instruction Tuning. In Proceedings of the Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2024, pp. 26286–26296. [CrossRef]
  20. Mathew, M.; Karatzas, D.; Jawahar, C.V. DocVQA: A Dataset for VQA on Document Images. In Proceedings of the Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision (WACV). IEEE, 2021, pp. 2199–2208. [CrossRef]
Figure 1. High-level architecture of the proposed self-correcting multimodal agent. Verification failures route back through the revision controller to the planning and execution layers rather than immediately producing a final answer.
Figure 1. High-level architecture of the proposed self-correcting multimodal agent. Verification failures route back through the revision controller to the planning and execution layers rather than immediately producing a final answer.
Preprints 233450 g001
Figure 2. Verification and revision workflow executed after each reasoning step. Evidence from four independent sources is aggregated before a step is accepted or routed to revision.
Figure 2. Verification and revision workflow executed after each reasoning step. Evidence from four independent sources is aggregated before a step is accepted or routed to revision.
Preprints 233450 g002
Figure 3. Illustrative shape of expected accuracy gains from iterative revision. Curve shapes reflect qualitative expectations grounded in prior self-correction literature; illustrative numeric axis values are placeholders and must be replaced with measured results.
Figure 3. Illustrative shape of expected accuracy gains from iterative revision. Curve shapes reflect qualitative expectations grounded in prior self-correction literature; illustrative numeric axis values are placeholders and must be replaced with measured results.
Preprints 233450 g003
Figure 4. Illustrative trade-off between the acceptance threshold θ and both factual consistency and inference overhead. As in Figure 3, values are placeholders illustrating the expected shape of the trade-off, not measured data.
Figure 4. Illustrative trade-off between the acceptance threshold θ and both factual consistency and inference overhead. As in Figure 3, values are placeholders illustrating the expected shape of the trade-off, not measured data.
Preprints 233450 g004
Table 1. Implementation Parameters for the Proposed Framework.
Table 1. Implementation Parameters for the Proposed Framework.
Parameter Value / Range
Acceptance threshold θ to be tuned in [ 0.6 , 0.9 ]
Revision budget R to be tuned in { 1 , 2 , 3 }
Verification source weights w k uniform or task-tuned
Divergence bound δ (Equation (2)) task-dependent
Revision penalty λ (Equation (3)) to be tuned in [ 0.01 , 0.1 ]
Hardware multi-GPU node (e.g., A100-class)
Decoding temperature (generation) low, for determinism
Decoding temperature (critique) moderate, for diverse critiques
Train/validation/test protocol held-out test split per task
Table 2. Reporting Template for Task-Level Evaluation (values to be populated from experiments).
Table 2. Reporting Template for Task-Level Evaluation (values to be populated from experiments).
Task Acc. F1 Fact.-Cons. Calls/Task Latency Δ
Multimodal reasoning [ACC1] [F1_1] [FC1] [CALLS1] [LAT1]
Visual QA (POPE-style) [ACC2] [F1_2] [FC2] [CALLS2] [LAT2]
Document understanding [ACC3] [F1_3] [FC3] [CALLS3] [LAT3]
Tool-use reasoning [ACC4] [F1_4] [FC4] [CALLS4] [LAT4]
Table 3. Ablation Reporting Template (values to be populated from experiments).
Table 3. Ablation Reporting Template (values to be populated from experiments).
Configuration Fact.-Cons. Δ vs. full
Full framework (4 sources) [FC_FULL] —
w/o cross-modal check [FC_A] [D_A]
w/o secondary-model critique [FC_B] [D_B]
w/o rule-based checks [FC_C] [D_C]
w/o tool-grounded verification [FC_D] [D_D]
Table 4. Qualitative Comparison of Self-Correction Approaches.
Table 4. Qualitative Comparison of Self-Correction Approaches.
Approach Granularity External grounding Cross-modal check Bounded cost
Single-pass agent — No No Yes (fixed)
Reflexion [6] Episode Partial No No
Self-Refine [7] Episode No No No
CRITIC [8] Episode Yes (tools) No No
Proposed framework Step Yes (tools + rules) Yes Yes ( T × R )
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.