paper-with-me

Papers

TextualVerifier: Verify TextGrad Step-by-Step

2025-10-29 · Eugenius Mario Situmorang, Adila Alfa Krisnadhi, Ari Wibisono arxiv

TextGrad is a novel approach to text-based automatic differentiation that enables composite AI systems to perform optimization without explicit numerical equations. However, it currently lacks self-verification mechanisms that ensure reasoning validity in text-based decision making. This research introduces TextualVerifier, a verification framework that leverages chain-of-thought reasoning and majority voting with large language models to address this verification gap. TextualVerifier implements a four-stage workflow: chain-of-thought decomposition, variant generation, majority voting, and consensus aggregation. It integrates non-invasively with TextGrad at both the loss function and optimization result verification stages. Experimental evaluation using the Gemini 1.5 Pro model is conducted in two phases: (1) standalone evaluation on PRM800K, and (2) integrated evaluation with TextGrad on GPQA-Diamond, MMLU-ML, and MMLU-CP benchmarks. Results show statistically significant improvements (p < 0.001). In phase one, TextualVerifier improves the validity of reasoning steps by 29 percent. In phase two, integration into TextGrad loss function yields a 2.2 percentage point gain from 68.2 to 70.4 percent with a moderate overhead of 5.9 LLM calls on average. Further evaluations of TextualVerifier versioning yield 8.08, 10.71, and 3.92 percentage point improvements on GPQA, MMLU-ML, and MMLU-CP respectively. TextualVerifier thus presents the first self-verification framework for TextGrad through LLM-based techniques without requiring numerical gradients, enabling more reliable reasoning and opening new directions for verification in text-based optimization.

📄 PDF Abstract BibTeX arXiv:2511.03739

Code (0)

등록된 구현이 없습니다.

Tasks

Decision Making

Similar Papers 제목 키워드 기반

Can Textual Gradient Work in Federated Learning?

2025-02-27 · Minghui Chen, Ruinan Jin, Wenlong Deng, YuanYuan Chen 외

Recent studies highlight the promise of LLM-based prompt optimization, especially with TextGrad, which automates differentiation'' via texts and backpropagates textual feedback. This approach facilitates training in vari…

Federated Learning

TextGrad: Automatic "Differentiation" via Text

2024-06-11 · Mert Yuksekgonul, Federico Bianchi, Joseph Boen, Sheng Liu 외

AI is undergoing a paradigm shift, with breakthroughs achieved by systems orchestrating multiple large language models (LLMs) and other complex components. As a result, developing principled and automated optimization me…

Question AnsweringSpecificity

Learning to Self-Evolve

2026-03-19 · Xiaoyin Chen, Canwen Xu, Yite Wang, Boyi Liu 외 arxiv

We introduce Learning to Self-Evolve (LSE), a reinforcement learning framework that trains large language models (LLMs) to improve their own contexts at test time. We situate LSE in the setting of test-time self-evolutio…

Reinforcement LearningQuestion Answering

ReflexGrad: Within-Episode Failure Recovery in LLM Agents via Progress-Gated Dual-Process Routing

2025-11-18 · Ankush Kadu, Aswanth Krishnan arxiv

We present ReflexGrad, a dual-process architecture for within-episode failure recovery in LLM agents without demonstrations. When agents commit to a wrong approach early and exhaust the step budget, the post-failure traj…

PrefPO: Pairwise Preference Prompt Optimization

2026-03-13 · Rahul Singhal, Pradyumna Tambwekar, Karime Maamari arxiv

Prompt engineering is effective but labor-intensive, motivating automated optimization methods. Existing methods typically require labeled datasets, which are often unavailable, and produce verbose, repetitive prompts. W…

Reinforcement LearningPrompt Engineering