paper-with-me

홈 › Papers

SketchVL: Policy Optimization via Fine-Grained Credit Assignment for Chart Understanding and More

2026-01-09 · Muye Huang, Lingling Zhang, Yifei Li, Yaqiang Wu, Jun Liu arxiv

Charts are high-density visual carriers of complex data and medium for information extraction and analysis. Due to the need for precise and complex visual reasoning, automated chart understanding poses a significant challenge to existing Multimodal Large Language Models (MLLMs). Many MLLMs trained with reinforcement learning (RL) face the challenge of credit assignment. Their advantage estimation, typically performed at the trajectory level, cannot distinguish between correct and incorrect reasoning steps within a single generated response. To address this limitation, we introduce SketchVL, a novel MLLM that optimized with FinePO, a new RL algorithm designed for fine-grained credit assignment within each trajectory. SketchVL's methodology involves drawing its intermediate reasoning steps as markers on the image and feeding the annotated image back to itself, creating a robust, multi-step reasoning process. During training, the FinePO algorithm leverages a Fine-grained Process Reward Model (FinePRM) to score each drawing action within a trajectory, thereby precisely assigning credit for each step. This mechanism allows FinePO to more strongly reward correct tokens when a trajectory is globally successful, and more heavily penalize incorrect tokens when the trajectory is globally suboptimal, thus achieving fine-grained reinforcement signals. Experiments show that SketchVL learns to align its step-level behavior with the FinePRM, achieving an average performance gain of 7.23\% over its base model across chart datasets, natural image datasets, and mathematics, providing a promising new direction for training powerful reasoning models.

📄 PDF Abstract BibTeX arXiv:2601.05688

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement LearningInformation ExtractionVisual Reasoning

Similar Papers 제목 키워드 기반

GeneralThinker: Domain-General Reasoning through Likelihood-Guided Answer-Conditioned Optimization

2026-05-27 · Shengmin Piao, Sanghyun Park arxiv

Reinforcement learning with verifiable rewards improves language model reasoning, but its reliance on domain-specific verifiers, sparse outcome rewards, and coarse-grained credit assignment limits its applicability. We i…

Reinforcement Learning

SketchVLM: Vision language models can annotate images to explain thoughts and guide users

2026-04-23 · Brandon Collins, Logan Bolton, Hung Huy Nguyen, Mohammad Reza Taesiri 외 arxiv

When answering questions about images, humans naturally point, label, and draw to explain their reasoning. In contrast, modern vision-language models (VLMs) such as Gemini-3-Pro and GPT-5 only respond with text, which ca…

Trajectory PredictionVisual ReasoningObject Counting

Reinforcing Language Agents via Policy Optimization with Action Decomposition

2024-05-23 · Muning Wen, Ziyu Wan, Weinan Zhang, Jun Wang 외

Language models as intelligent agents push the boundaries of sequential decision-making agents but struggle with limited knowledge of environmental dynamics and exponentially huge action space. Recent efforts like GLAM a…

Sequential Decision Making

DGPO: Distribution Guided Policy Optimization for Fine Grained Credit Assignment

2026-05-05 · Hongbo Jin, Rongpeng Zhu, Zhongjing Du, Xu Jiang 외 arxiv

Reinforcement learning is crucial for aligning large language models to perform complex reasoning tasks. However, current algorithms such as Group Relative Policy Optimization suffer from coarse grained, sequence level c…

Reinforcement Learning

AT$^2$PO: Agentic Turn-based Policy Optimization via Tree Search

2026-01-08 · Zefang Zong, Dingwei Chen, Yang Li, Qi Yi 외 arxiv

LLM agents have emerged as powerful systems for tackling multi-turn tasks by interleaving internal reasoning and external tool interactions. Agentic Reinforcement Learning has recently drawn significant research attentio…

Reinforcement Learning