andyjzhao commited on
Commit
2e80eee
·
verified ·
1 Parent(s): 2f53b8b

Upload folder using huggingface_hub

Browse files
iclr26/3kouij8BWi/appendix_chunks.jsonl ADDED
@@ -0,0 +1,66 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0062", "section": "A DATA DISTRIBUTION", "page_start": 15, "page_end": 15, "type": "Text", "text": "As shown in Figure 6, our RL training corpus for jigsaw is derived from multiple sources, covering a diverse range of visual scenarios:", "source": "marker_v2", "marker_block_id": "/page/14/Text/3"}
2
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0063", "section": "A DATA DISTRIBUTION", "page_start": 15, "page_end": 15, "type": "FigureGroup", "text": "Figure 6: Distribution of jigsaw RL training data.", "source": "marker_v2", "marker_block_id": "/page/14/FigureGroup/165"}
3
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0064", "section": "A DATA DISTRIBUTION", "page_start": 15, "page_end": 15, "type": "ListGroup", "text": "High-resolution and visual search images (39.7%, 6.2K samples): To enhance the model's fine-grained perception in high-resolution images, we collect data from the VStar (Wu & Xie, 2024) dataset, high-resolution natural scenes in DeepEyes (Zheng et al., 2025) , and selected samples from HRBench (Wang et al., 2025c) . This improves the model's ability to capture subtle visual cues and recognize small object attributes. Text recognition and structured scenes (33.3%, 5.2K samples): To strengthen the model's capacity for text perception and recognition, we include text-rich images from diverse domains, such as the TextVQA (Singh et al., 2019) training set, InfoVQA (Mathew et al., 2022) book covers and posters, as well as structured visual reasoning tasks involving tables and subject-specific charts (Yue et al., 2024; Li et al., 2024a; Chen et al., 2024b) . Dense natural and real-world scenes (26.9%, 4.2K samples): To enhance the model's recognition and understanding in complex and real-world environments, we collected images from COCO2017 (Lin et al., 2014) and RealWorldQA (xAI, 2024) datasets.", "source": "marker_v2", "marker_block_id": "/page/14/ListGroup/166"}
4
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0065", "section": "B PROMPTS", "page_start": 15, "page_end": 15, "type": "Text", "text": "In this section, we present the prompt used to collect high-quality jigsaw trajectories, as illustrated in Figure B. The same prompt is employed to prompt the Qwen2.5-VL-7B model during both the SFT and RL stages.", "source": "marker_v2", "marker_block_id": "/page/14/Text/10"}
5
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0066", "section": "System Prompt", "page_start": 15, "page_end": 15, "type": "Text", "text": "You are a skilled and experienced puzzle master. I will divide an image evenly into 2 × 2 grid, get 4 image blocks, and then shuffle them. The image blocks will be labeled A, B, C, and D. Initially, the image blocks are named and arranged in the following order:", "source": "marker_v2", "marker_block_id": "/page/14/Text/13"}
6
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0067", "section": "System Prompt", "page_start": 15, "page_end": 15, "type": "Equation", "text": "[\"A\", \"B\", \"C\", \"D\"]", "source": "marker_v2", "marker_block_id": "/page/14/Equation/14"}
7
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0068", "section": "System Prompt", "page_start": 15, "page_end": 15, "type": "Text", "text": "That is, the initial layout of the image blocks is as follows:", "source": "marker_v2", "marker_block_id": "/page/14/Text/15"}
8
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0069", "section": "System Prompt", "page_start": 15, "page_end": 15, "type": "Text", "text": "A B", "source": "marker_v2", "marker_block_id": "/page/14/Text/16"}
9
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0070", "section": "System Prompt", "page_start": 15, "page_end": 15, "type": "Text", "text": "C D", "source": "marker_v2", "marker_block_id": "/page/14/Text/17"}
10
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0071", "section": "Your Task", "page_start": 16, "page_end": 16, "type": "Text", "text": "Your goal is to reconstruct the original image by observing and analyzing the visual content between the image blocks. Pay attention to the details in each image block and establish visual connections between adjacent image blocks to achieve the goal of completing the puzzle correctly. For example:", "source": "marker_v2", "marker_block_id": "/page/15/Text/1"}
11
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0072", "section": "Your Task", "page_start": 16, "page_end": 16, "type": "ListGroup", "text": "Continuity of text information: If the image contains text or logos, observe whether the text continues naturally between adjacent blocks (e.g., characters connect smoothly and the font direction is consistent). This is one of the key clues to determine whether the image blocks should be adjacent. Structure and shape consistency: Identify possible structural elements in the image (such as buildings, roads, object outlines, etc.), and infer which image blocks should be visually spliced together to form a complete and reasonable shape. Continuation of edge visual details: Observe the color, texture or pattern (such as sky, grass, lines or shadows) at the edge of the image block to determine whether it can be visually connected to the adjacent block naturally. Direction and angle consistency: Pay attention to the direction of image elements (such as human faces, object directions, text angles, etc.) to ensure the rationality of the overall visual direction of the image.", "source": "marker_v2", "marker_block_id": "/page/15/ListGroup/228"}
12
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0073", "section": "Your Task", "page_start": 16, "page_end": 16, "type": "Text", "text": "You can swap any two image blocks each time to achieve the correct layout.", "source": "marker_v2", "marker_block_id": "/page/15/Text/6"}
13
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0074", "section": "Inference Process", "page_start": 16, "page_end": 16, "type": "Text", "text": "1. State Representation: At each step, you need to maintain a \"state\" list representing current arrangement of image blocks.", "source": "marker_v2", "marker_block_id": "/page/15/Text/8"}
14
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0075", "section": "Inference Process", "page_start": 16, "page_end": 16, "type": "Text", "text": "Example:", "source": "marker_v2", "marker_block_id": "/page/15/Text/9"}
15
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0076", "section": "Inference Process", "page_start": 16, "page_end": 16, "type": "Code", "text": "state = [\"B\", \"C\", \"A\", \"D\"]", "source": "marker_v2", "marker_block_id": "/page/15/Code/10"}
16
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0077", "section": "Inference Process", "page_start": 16, "page_end": 16, "type": "Text", "text": "This corresponds to: Top left (index 0): B Top right (index 1): C Bottom left (index 2): A Bottom right (index 3): D", "source": "marker_v2", "marker_block_id": "/page/15/Text/11"}
17
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0078", "section": "Inference Process", "page_start": 16, "page_end": 16, "type": "ListGroup", "text": "2. Visual Analysis: Carefully analyze the image patch content and visual details to determine the image patch location. To better complete the puzzle task, you can use additional image operations to enhance visual perception: Crop the image area of observation image to more closely observe the visual correlation between different regions in multiple image patches. Used to find clues during the puzzle or verify whether the puzzle is complete (For example: it looks like the puzzle is not completely fixed, maybe because of the lower left and upper right corners of observation image 2. I need to crop these two areas separately to get some visual information to further judge. First I will crop the lower left area <code>...</code>By observing the cropped lower left area, it shows that part of the text \"OF H\" may be related to the \"appyness\" text in the upper right corner. To further verify and manage, I will now crop the upper right image <code>...</code>. By observing the cropped image, I will swap image blocks B and C...) Zoom area to enlarge visual details (selectively observe the details of the cropped image).", "source": "marker_v2", "marker_block_id": "/page/15/ListGroup/229"}
18
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0079", "section": "Inference Process", "page_start": 16, "page_end": 16, "type": "Text", "text": "These operations can help you make more informed decisions.", "source": "marker_v2", "marker_block_id": "/page/15/Text/15"}
19
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0080", "section": "Inference Process", "page_start": 17, "page_end": 17, "type": "Text", "text": "3. Move Execution: After making a decision, generate a Python code snippet to swap tiles. Use the 'observation(state)' function to get the updated layout image for the next step.", "source": "marker_v2", "marker_block_id": "/page/16/Text/1"}
20
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0081", "section": "Available Image Operations", "page_start": 17, "page_end": 17, "type": "Text", "text": "You can use the following Python functions to assist in inference:", "source": "marker_v2", "marker_block_id": "/page/16/Text/3"}
21
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0082", "section": "Available Image Operations", "page_start": 17, "page_end": 17, "type": "Text", "text": "1. Crop a region from an image using normalized coordinates (from 0 to 1).", "source": "marker_v2", "marker_block_id": "/page/16/Text/4"}
22
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0083", "section": "Available Image Operations", "page_start": 17, "page_end": 17, "type": "Code", "text": "crop_box = [x1, y1, x2, y2] crop_image_{id} = crop(image, crop_box)", "source": "marker_v2", "marker_block_id": "/page/16/Code/5"}
23
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0084", "section": "Available Image Operations", "page_start": 17, "page_end": 17, "type": "Text", "text": "2. Zoom in an image by a specified factor (e.g., 1.5× zoom means 150% zoom).", "source": "marker_v2", "marker_block_id": "/page/16/Text/6"}
24
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0085", "section": "Available Image Operations", "page_start": 17, "page_end": 17, "type": "Code", "text": "zoom_image_{id} = zoom(image, zoom_factor)", "source": "marker_v2", "marker_block_id": "/page/16/Code/7"}
25
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0086", "section": "Available Image Operations", "page_start": 17, "page_end": 17, "type": "Text", "text": "3. Swap tiles (e.g., top left and bottom left) and call observation function to see the jigsaw progress.", "source": "marker_v2", "marker_block_id": "/page/16/Text/8"}
26
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0087", "section": "Available Image Operations", "page_start": 17, "page_end": 17, "type": "Code", "text": "state[0], state[2] = state[2], state[0] observation_image_{id} = observation(state)", "source": "marker_v2", "marker_block_id": "/page/16/Code/9"}
27
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0088", "section": "Available Image Operations", "page_start": 17, "page_end": 17, "type": "Text", "text": "Replace \"id\" with an integer to uniquely identify each operation result. The \"image\" parameter must point to an existing image (e.g., \"observation image 1\", \"crop image 1\", etc.).", "source": "marker_v2", "marker_block_id": "/page/16/Text/10"}
28
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0089", "section": "Format", "page_start": 17, "page_end": 17, "type": "Text", "text": "All Python code must be enclosed in <code>...</code>tags.", "source": "marker_v2", "marker_block_id": "/page/16/Text/12"}
29
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0090", "section": "Format", "page_start": 17, "page_end": 17, "type": "Text", "text": "All reasoning steps must be enclosed in <think>...</think>tags.", "source": "marker_v2", "marker_block_id": "/page/16/Text/13"}
30
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0091", "section": "Format", "page_start": 17, "page_end": 17, "type": "Text", "text": "The final answer must be enclosed in <answer>...</answer>tags.", "source": "marker_v2", "marker_block_id": "/page/16/Text/14"}
31
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0092", "section": "Important", "page_start": 17, "page_end": 17, "type": "ListGroup", "text": "1. For both swap and image manipulation, always explain why you are doing this before generating code. 2. Stop as soon as you generate a code snippet. I will execute the code and return the generated image for the next step. 3. You can only perform one image operation or observation of the puzzle state per turn. 4. Final answer: When you are sure that the puzzle is fully reconstructed (all edges are aligned and the visual information is complete and continuous), return the final \"state\" list in the \"<answer>\" block. 5. Please pay close attention to the rationality of your cropping area and ensure that the cropped area is a reasonable criterion for completing the puzzle.", "source": "marker_v2", "marker_block_id": "/page/16/ListGroup/223"}
32
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0093", "section": "User Prompt", "page_start": 17, "page_end": 17, "type": "Text", "text": "The four images are respectively labeled A, B, C, and D. Please complete the jigsaw.", "source": "marker_v2", "marker_block_id": "/page/16/Text/22"}
33
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0094", "section": "User Prompt", "page_start": 17, "page_end": 17, "type": "Text", "text": "Image A: <image>Image B: <image>Image C: <image>Image D: <image>", "source": "marker_v2", "marker_block_id": "/page/16/Text/23"}
34
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0095", "section": "C CASE STUDY", "page_start": 18, "page_end": 18, "type": "Text", "text": "In Figures 7 - 10, we present representative high-quality jigsaw trajectories collected to illustrate how our model performs reasoning and interacts with the environment. These cases specifically demonstrate: (1) how the model generates Python code to interact with the environment, such as swapping any two jigsaw pieces, observing jigsaw progress, and cropping/zooming in on regions for finer visual inspection; and (2) how the environment provides feedback that guides the model's subsequent reasoning.", "source": "marker_v2", "marker_block_id": "/page/17/Text/2"}
35
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0096", "section": "C CASE STUDY", "page_start": 18, "page_end": 18, "type": "FigureGroup", "text": "Figure 7: Representative high-quality jigsaw trajectory case 1 (part 1).", "source": "marker_v2", "marker_block_id": "/page/17/FigureGroup/43"}
36
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0097", "section": "C CASE STUDY", "page_start": 19, "page_end": 19, "type": "FigureGroup", "text": "Figure 8: Representative high-quality jigsaw trajectory case 1 (part 2).", "source": "marker_v2", "marker_block_id": "/page/18/FigureGroup/12"}
37
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0098", "section": "C CASE STUDY", "page_start": 20, "page_end": 20, "type": "FigureGroup", "text": "Figure 9: Representative high-quality jigsaw trajectory case 2 (part 1).", "source": "marker_v2", "marker_block_id": "/page/19/FigureGroup/12"}
38
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0099", "section": "C CASE STUDY", "page_start": 21, "page_end": 21, "type": "FigureGroup", "text": "Figure 10: Representative high-quality jigsaw trajectory case 2 (part 2).", "source": "marker_v2", "marker_block_id": "/page/20/FigureGroup/30"}
39
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0100", "section": "D THE IMPLEMENTATION OF TRAINING", "page_start": 21, "page_end": 21, "type": "Text", "text": "The detailed training hyperparameters are provided in Tables 4 and 5, and all experiments are conducted on 8 NVIDIA A100 GPUs, each equipped with 80 GB of memory.", "source": "marker_v2", "marker_block_id": "/page/20/Text/4"}
40
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0101", "section": "D THE IMPLEMENTATION OF TRAINING", "page_start": 22, "page_end": 22, "type": "TableGroup", "text": "Table 4: Key hyperparameters for SFT. Name Value Finetuning type Full Freeze vision tower True Freeze multi-modal projector True Freeze language model False Cutoff len 16384 Image max pixels 401408 Epochs 2.0 Batch size 32 Gradient accumulation steps 4 Learning rate 1.0e-5 LR scheduler type cosine Warmup ratio 0.1", "source": "marker_v2", "marker_block_id": "/page/21/TableGroup/204"}
41
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0102", "section": "D THE IMPLEMENTATION OF TRAINING", "page_start": 22, "page_end": 22, "type": "TableGroup", "text": "Table 5: Key hyperparameters for RL. Name Value Max turns 5 Rollout num 8 Train batch size 64 Mini batch size 64 Micro batch size per GPU 2 Learning rate 2.0e-6 KL loss coefficient 0.0 Total epochs 1 Max prompt length 8192 Single response max tokens 2048 Max response length 20000 GPU memory utilization 0.7", "source": "marker_v2", "marker_block_id": "/page/21/TableGroup/205"}
42
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0103", "section": "E ANALYSIS OF WANDB CURVES IN JIGSAW OPTIMIZATION", "page_start": 22, "page_end": 22, "type": "Text", "text": "In this section, we present the training curves of our RL process and provide an analysis of the training dynamics. We monitor the evolution of rewards (including accuracy and format rewards), response length, number of interaction turns, and validation accuracy.", "source": "marker_v2", "marker_block_id": "/page/21/Text/6"}
43
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0104", "section": "E ANALYSIS OF WANDB CURVES IN JIGSAW OPTIMIZATION", "page_start": 22, "page_end": 22, "type": "FigureGroup", "text": "Figure 11: Visualization of Wandb curves in jigsaw RL optimization.", "source": "marker_v2", "marker_block_id": "/page/21/FigureGroup/206"}
44
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0105", "section": "E ANALYSIS OF WANDB CURVES IN JIGSAW OPTIMIZATION", "page_start": 22, "page_end": 22, "type": "Text", "text": "At the beginning of training, both validation accuracy and reward values are low, indicating that the model has very limited jigsaw-solving ability in the early stage. As training progresses, the number of interaction turns increases briefly, suggesting that the model explores more interactions (e.g., swapping tiles, cropping for observation) in order to achieve higher accuracy. With continued training, the reward values steadily increase, reflecting a stable improvement in jigsaw-solving capability through RL. After sufficient training, the model gradually reduces both the number of turns and response length, demonstrating enhanced perceptual and reasoning ability, such that it can solve jigsaw correctly with fewer interactions.", "source": "marker_v2", "marker_block_id": "/page/21/Text/9"}
45
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0106", "section": "F LIMITATIONS", "page_start": 23, "page_end": 23, "type": "Text", "text": "Despite our best efforts, this work has several limitations. Multi-turn jigsaw interactions inevitably increase context length and introduce significant computational overhead. In the 3 × 3 setting, the context often exceeds the model's maximum window size, restricting our RL training to the 2 × 2 case. Future work could investigate more efficient interaction mechanisms with external environments or integrate memory modules to mitigate context length constraints, thereby enabling RL training on larger and more complex jigsaw tasks.", "source": "marker_v2", "marker_block_id": "/page/22/Text/2"}
46
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0107", "section": "G QUALITATIVE ANALYSIS ON ATTENTION PATTERNS", "page_start": 23, "page_end": 23, "type": "Text", "text": "To further verify that AGILE brings genuine improvements in perceptual and reasoning abilities rather than merely increasing benchmark scores, we conduct additional qualitative analyses on general downstream tasks. Specifically, we visualize the attention distributions of Qwen2.5-VL-7B before and after AGILE training. As shown in attention examples (Figure 12) , the original model often exhibits scattered and unstable attention allocation, focusing on large irrelevant regions when processing complex high-resolution scenes or fine-grained recognition tasks. This dispersed attention leads to unreliable reasoning and misinterpretation of critical visual evidence. In contrast, the AGILE-trained model shows significantly more concentrated attention on key visual elements, such as small objects, text regions, and structurally important areas. This improved focus enhances the model's ability to extract fine-grained cues and supports more reliable multimodal reasoning. These qualitative findings align with our quantitative gains across HRBench, VStarBench, and Real-WorldQA, suggesting that AGILE enhances fundamental perceptual mechanisms underlying general visual understanding.", "source": "marker_v2", "marker_block_id": "/page/22/Text/4"}
47
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0108", "section": "H WHICH TASKS CAN BENEFIT MORE FROM AGILE?", "page_start": 23, "page_end": 23, "type": "Text", "text": "Beyond overall benchmark gains, we analyze the types of perceptual and reasoning skills most enhanced by AGILE:", "source": "marker_v2", "marker_block_id": "/page/22/Text/6"}
48
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0109", "section": "H WHICH TASKS CAN BENEFIT MORE FROM AGILE?", "page_start": 23, "page_end": 23, "type": "ListGroup", "text": "Fine-grained recognition. These tasks require high precision in identifying subtle visual cues, such as detecting small objects, recognizing text, or distinguishing fine-grained visual differences. AGILE enhances the model's ability to focus on the most critical visual elements, improving its sensitivity to subtle but important features and thereby boosting fine-grained recognition performance. Spatial relation reasoning. Benchmarks such as VStarBench contain a substantial number of questions involving spatial positional reasoning. AGILE's interaction-driven training helps the model better attend to spatial layouts and contextual relationships within a scene, substantially improving its ability to understand and reason about complex spatial arrangements. This capability transfers effectively to real-world spatial reasoning tasks. Visual–textual integration. AGILE also leads to notable improvements in tasks requiring the integration of visual and textual information. Tasks involving reading product details, interpreting signs, or extracting structured information from charts benefit from AGILE's strengthened ability to jointly process textual cues grounded in visual context.", "source": "marker_v2", "marker_block_id": "/page/22/ListGroup/203"}
49
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0110", "section": "I HANDLING INVALID CODE EXECUTIONS", "page_start": 23, "page_end": 23, "type": "Text", "text": "During reinforcement learning, the model may generate malformed or invalid code. Instead of discarding such rollouts, the environment executes the code and returns explicit error messages to the model. These erroneous interactions increase the total number of steps required to reach the correct solution and thus naturally lead to lower step rewards under our reward formulation (Eq. 5 and Eq. 6) . As a result, invalid code is implicitly penalized, encouraging the model to generate valid actions and interact more efficiently. This design stabilizes training without requiring complex filtering mechanisms.", "source": "marker_v2", "marker_block_id": "/page/22/Text/11"}
50
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0111", "section": "I HANDLING INVALID CODE EXECUTIONS", "page_start": 24, "page_end": 24, "type": "FigureGroup", "text": "Figure 12: Comparison of Attention Maps Before and After AGILE Training. Warm colors indicate higher attention; cool colors indicate lower attention.", "source": "marker_v2", "marker_block_id": "/page/23/FigureGroup/71"}
51
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0112", "section": "J.1 SENSITIVITY TO REWARD COEFFICIENTS.", "page_start": 24, "page_end": 24, "type": "Text", "text": "We further investigate the sensitivity of AGILE to the reward-weighting coefficients (α, β, and γ). As shown in Table 6, varying the values of α and β yields only minor fluctuations in performance, indicating that AGILE is robust to these parameters. In contrast, removing the step reward (γ) produces notable performance degradation, especially on VStarBench and MMVP. This finding ver-", "source": "marker_v2", "marker_block_id": "/page/23/Text/5"}
52
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0113", "section": "J.1 SENSITIVITY TO REWARD COEFFICIENTS.", "page_start": 25, "page_end": 25, "type": "Text", "text": "ifies that the step-penalty plays a critical role in encouraging efficient and meaningful interactions, preventing long, unfocused rollouts during RL.", "source": "marker_v2", "marker_block_id": "/page/24/Text/1"}
53
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0114", "section": "J.1 SENSITIVITY TO REWARD COEFFICIENTS.", "page_start": 25, "page_end": 25, "type": "TableGroup", "text": "Table 6: Ablation on Reward Coefficients. Sensitivity analysis of the weighting coefficients \\alpha , \\beta , and \\gamma in the total reward. Model MME-RW RWQA HRB4K HRB8K VStar MMVP BLINK HalBench MMMU Avg. Qwen2.5-VL-7B 44.6 68.5 68.8 65.3 76.4 74.3 56.4 50.1 54.8 62.1 \\alpha = 0.8, \\beta = 0.2, \\gamma = 1.0 48.4 70.2 73.0 70.5 80.6 78.0 58.0 51.9 55.8 65.2 \\alpha = 0.8, \\beta = 0.2, \\gamma = 0.5 49.2 69.7 72.8 69.8 78.5 79.0 57.5 50.8 55.8 64.8 \\alpha = 0.8, \\beta = 0.2, \\gamma = 0.0 47.4 71.1 72.4 69.8 78.5 75.3 56.7 52.8 55.6 64.4 \\alpha = 0.9, \\beta = 0.1, \\gamma = 1.0 48.9 70.8 73.3 69.6 79.1 78.0 57.5 51.4 55.1 64.9", "source": "marker_v2", "marker_block_id": "/page/24/TableGroup/93"}
54
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0115", "section": "J.2 RESULTS OF LARGER JIGSAW GRID SIZES AND CURRICULUM RL TRAINING", "page_start": 25, "page_end": 25, "type": "Text", "text": "To further assess the scalability of AGILE beyond the 2\\times 2 jigsaw setting, we conduct an additional reinforcement learning stage on 8K\\ 3\\times 3 jigsaw puzzles. This stage is applied after the initial 15.6K\\ 2\\times 2 RL training, forming curriculum-style optimization principle. As shown in Table 7, training on 3\\times 3 jigsaw puzzles leads to further improvements across all 9 benchmarks. These results demonstrate that AGILE naturally generalizes to larger and more challenging jigsaw configurations when model capability allows, and further highlight that curriculum reinforcement learning on increasingly difficult grid sizes provides an effective path for continued scaling.", "source": "marker_v2", "marker_block_id": "/page/24/Text/5"}
55
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0116", "section": "J.2 RESULTS OF LARGER JIGSAW GRID SIZES AND CURRICULUM RL TRAINING", "page_start": 25, "page_end": 25, "type": "TableGroup", "text": "Table 7: Results of 3 \\times 3 Jigsaw RL Training. Model MME-RW RWQA HRB4K HRB8K VStar MMVP BLINK HalBench MMMU Avg. Qwen2.5-VL-7B 44.6 68.5 68.8 65.3 76.4 74.3 56.4 50.1 54.8 62.1 + 15.6K 2×2 RL 48.4 70.2 73.0 70.5 80.6 78.0 58.0 51.9 55.8 65.2 + 15.6 K 2 \\times 2 + 8 K 3 \\times 3 RL 50.4 70.6 73.4 70.5 80.1 79.0 58.1 52.1 55.8 65.6", "source": "marker_v2", "marker_block_id": "/page/24/TableGroup/94"}
56
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0117", "section": "J.3 EXPERT TRAJECTORIES ABLATIONS", "page_start": 25, "page_end": 25, "type": "Text", "text": "To disentangle the effect of expert cold-start trajectories and verify that AGILE's improvements are not merely due to distillation, we conducted additional experiments without any expert trajectories. Specifically, we performed RL directly on the 15.6K 2 \\times 2 jigsaw dataset under two conditions: (1) the full action space, and (2) an ablated action space with Crop/Zoom removed. The results show that even in the absence of expert supervision, AGILE still delivers a +1.8% improvement over the Qwen2.5-VL-7B baseline, demonstrating that the performance gain arises from agentic visual interaction combined with verifiable RL, rather than imitation of Gemini 2.5 Pro trajectories.", "source": "marker_v2", "marker_block_id": "/page/24/Text/9"}
57
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0118", "section": "J.3 EXPERT TRAJECTORIES ABLATIONS", "page_start": 25, "page_end": 25, "type": "TableGroup", "text": "Table 8: Performance of RL without Gemini 2.5 Pro expert trajectories and with ablated action spaces. Model MME-RW RWQA HRB4K HRB8K VStar MMVP BLINK HalBench MMMU Avg. Qwen2.5-VL-7B 44.6 68.5 68.8 65.3 76.4 74.3 56.4 50.1 54.8 62.1 Cold-Start 46.2 68.4 71.0 68.4 77.5 76.7 55.7 49.8 54.0 63.1 Cold-Start + RL 48.4 70.2 73.0 70.5 80.6 78.0 58.0 51.9 55.8 65.2 Only RL (Full action space) 46.3 69.5 71.5 68.1 78.5 79.0 56.3 53.2 53.1 63.9 Only RL (No Crop/Zoom) 46.2 69.3 71.9 68.0 78.0 78.3 53.7 52.8 53.3 63.5", "source": "marker_v2", "marker_block_id": "/page/24/TableGroup/95"}
58
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0119", "section": "J.3 EXPERT TRAJECTORIES ABLATIONS", "page_start": 25, "page_end": 25, "type": "Text", "text": "Furthermore, removing the Crop/Zoom operations leads to a clear decline in performance, underscoring the importance of AGILE's interaction design in enabling effective fine-grained perceptual reasoning.", "source": "marker_v2", "marker_block_id": "/page/24/Text/12"}
59
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0120", "section": "J.4 GENERAL QA DATASET DETAILS AND EXTENDED COMPARISON WITH JIGSAW TRAINING", "page_start": 25, "page_end": 25, "type": "Text", "text": "We provide additional clarification regarding the composition of the general QA dataset. Our 20K QA corpus is constructed entirely from high-resolution, real-world visual scenes, consisting of 15K samples from DeepEyes (Zheng et al., 2025) and 5K samples from MMEureka (Meng et al., 2025).", "source": "marker_v2", "marker_block_id": "/page/24/Text/14"}
60
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0121", "section": "J.4 GENERAL QA DATASET DETAILS AND EXTENDED COMPARISON WITH JIGSAW TRAINING", "page_start": 26, "page_end": 26, "type": "TableGroup", "text": "Table 9: Comparison between General QA and Jigsaw-based RL under equal training budgets (20K). Model MME-RW RWQA HRB4K HRB8K VStar MMVP BLINK HalBench MMMU Avg. Qwen2.5-VL-7B 44.6 68.5 68.8 65.3 76.4 74.3 56.4 50.1 54.8 62.1 20K General QA 50.5 68.9 72.4 69.5 82.7 78.3 54.8 51.3 54.2 64.7 10K General QA + 10K Jigsaw 51.6 69.8 73.0 70.6 81.7 79.0 57.3 51.2 55.7 65.5 20K Jigsaw-only 48.5 70.5 73.6 70.5 80.1 77.3 57.7 52.1 53.8 64.9", "source": "marker_v2", "marker_block_id": "/page/25/TableGroup/68"}
61
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0122", "section": "J.4 GENERAL QA DATASET DETAILS AND EXTENDED COMPARISON WITH JIGSAW TRAINING", "page_start": 26, "page_end": 26, "type": "Text", "text": "These datasets span diverse perceptual and reasoning categories, including fine-grained attributes, spatial relationships, counting, and commonsense scene understanding.", "source": "marker_v2", "marker_block_id": "/page/25/Text/3"}
62
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0123", "section": "J.4 GENERAL QA DATASET DETAILS AND EXTENDED COMPARISON WITH JIGSAW TRAINING", "page_start": 26, "page_end": 26, "type": "Text", "text": "Accordingly, the comparison between jigsaw training and QA training is inherently fair: both training regimes operate on high-resolution, real-world, and complex perceptual inputs. To further strengthen this comparison, we additionally include the 20K pure jigsaw setting. As shown in Table 9, jigsaw-based RL consistently outperforms high-resolution QA-based RL under the same training budget, demonstrating that AGILE's performance gains do not stem from differences in input resolution, but instead from the structured, verifiable, and spatially grounded training signal introduced by the jigsaw task.", "source": "marker_v2", "marker_block_id": "/page/25/Text/4"}
63
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0124", "section": "J.5 IMPACT OF SCALING THE COLD-START (SFT) DATASET", "page_start": 26, "page_end": 26, "type": "Text", "text": "To understand whether training longer or scaling up the supervised cold-start phase affects performance, we expand the cold-start dataset to 1.5 \\times and 2 \\times its original size and repeated all experiments. As shown in Table 10, enlarging the SFT dataset leads to only marginal differences, with no signs of overfitting or meaningful performance degradation.", "source": "marker_v2", "marker_block_id": "/page/25/Text/6"}
64
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0125", "section": "J.5 IMPACT OF SCALING THE COLD-START (SFT) DATASET", "page_start": 26, "page_end": 26, "type": "TableGroup", "text": "Table 10: Effect of scaling the cold-start (SFT) dataset size. Increasing SFT data provides only marginal differences, indicating that most performance gains come from the RL stage. Model MME-RW RWQA HRB4K HRB8K VStar MMVP BLINK HalBench MMMU Avg. Qwen2.5-VL-7B 44.6 68.5 68.8 65.3 76.4 74.3 56.4 50.1 54.8 62.1 Cold-start (1.6K) 46.2 68.4 71.0 68.4 77.5 76.7 55.7 49.8 54.0 63.1 +RL 48.4 70.2 73.0 70.5 80.6 78.0 58.0 51.9 55.8 65.2 Cold-start (2.4K) 46.2 68.9 71.4 68.8 77.0 76.0 57.8 50.2 54.0 63.4 +RL 48.4 69.8 73.0 69.9 78.5 79.0 57.7 50.5 56.3 64.8 Cold-start (3.2K) 46.5 67.8 71.4 68.8 77.0 76.7 58.1 49.2 53.3 63.2 +RL 47.1 70.1 73.0 70.5 79.6 78.3 57.2 50.5 55.7 64.7", "source": "marker_v2", "marker_block_id": "/page/25/TableGroup/69"}
65
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0126", "section": "J.5 IMPACT OF SCALING THE COLD-START (SFT) DATASET", "page_start": 26, "page_end": 26, "type": "Text", "text": "In practice, the cold-start stage serves a very specific purpose: teaching the model the tool-use pattern (i.e., how to invoke the predefined Python APIs). Its goal is not to solve the jigsaw task fully. Consequently, the model's performance is largely unaffected by moderate expansions of the SFT set. The primary source of generalization and performance improvement comes from the interactive RL stage, where the model learns to solve jigsaw puzzles through real environment feedback rather than through imitation.", "source": "marker_v2", "marker_block_id": "/page/25/Text/9"}
66
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0127", "section": "K USE OF LLMS", "page_start": 26, "page_end": 26, "type": "Text", "text": "Yes. We use LLMs solely to assist in language polishing and improving readability. All technical content, experiments, and analyses are conducted by the authors.", "source": "marker_v2", "marker_block_id": "/page/25/Text/11"}
iclr26/3kouij8BWi/appendix_text_v3.txt ADDED
@@ -0,0 +1,197 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ [p. 15 | section: A DATA DISTRIBUTION | type: Text]
2
+ As shown in Figure 6, our RL training corpus for jigsaw is derived from multiple sources, covering a diverse range of visual scenarios:
3
+
4
+ [p. 15 | section: A DATA DISTRIBUTION | type: FigureGroup]
5
+ Figure 6: Distribution of jigsaw RL training data.
6
+
7
+ [p. 15 | section: A DATA DISTRIBUTION | type: ListGroup]
8
+ High-resolution and visual search images (39.7%, 6.2K samples): To enhance the model's fine-grained perception in high-resolution images, we collect data from the VStar (Wu & Xie, 2024) dataset, high-resolution natural scenes in DeepEyes (Zheng et al., 2025) , and selected samples from HRBench (Wang et al., 2025c) . This improves the model's ability to capture subtle visual cues and recognize small object attributes. Text recognition and structured scenes (33.3%, 5.2K samples): To strengthen the model's capacity for text perception and recognition, we include text-rich images from diverse domains, such as the TextVQA (Singh et al., 2019) training set, InfoVQA (Mathew et al., 2022) book covers and posters, as well as structured visual reasoning tasks involving tables and subject-specific charts (Yue et al., 2024; Li et al., 2024a; Chen et al., 2024b) . Dense natural and real-world scenes (26.9%, 4.2K samples): To enhance the model's recognition and understanding in complex and real-world environments, we collected images from COCO2017 (Lin et al., 2014) and RealWorldQA (xAI, 2024) datasets.
9
+
10
+ [p. 15 | section: B PROMPTS | type: Text]
11
+ In this section, we present the prompt used to collect high-quality jigsaw trajectories, as illustrated in Figure B. The same prompt is employed to prompt the Qwen2.5-VL-7B model during both the SFT and RL stages.
12
+
13
+ [p. 15 | section: System Prompt | type: Text]
14
+ You are a skilled and experienced puzzle master. I will divide an image evenly into 2 × 2 grid, get 4 image blocks, and then shuffle them. The image blocks will be labeled A, B, C, and D. Initially, the image blocks are named and arranged in the following order:
15
+
16
+ [p. 15 | section: System Prompt | type: Equation]
17
+ ["A", "B", "C", "D"]
18
+
19
+ [p. 15 | section: System Prompt | type: Text]
20
+ That is, the initial layout of the image blocks is as follows:
21
+
22
+ [p. 15 | section: System Prompt | type: Text]
23
+ A B
24
+
25
+ [p. 15 | section: System Prompt | type: Text]
26
+ C D
27
+
28
+ [p. 16 | section: Your Task | type: Text]
29
+ Your goal is to reconstruct the original image by observing and analyzing the visual content between the image blocks. Pay attention to the details in each image block and establish visual connections between adjacent image blocks to achieve the goal of completing the puzzle correctly. For example:
30
+
31
+ [p. 16 | section: Your Task | type: ListGroup]
32
+ Continuity of text information: If the image contains text or logos, observe whether the text continues naturally between adjacent blocks (e.g., characters connect smoothly and the font direction is consistent). This is one of the key clues to determine whether the image blocks should be adjacent. Structure and shape consistency: Identify possible structural elements in the image (such as buildings, roads, object outlines, etc.), and infer which image blocks should be visually spliced together to form a complete and reasonable shape. Continuation of edge visual details: Observe the color, texture or pattern (such as sky, grass, lines or shadows) at the edge of the image block to determine whether it can be visually connected to the adjacent block naturally. Direction and angle consistency: Pay attention to the direction of image elements (such as human faces, object directions, text angles, etc.) to ensure the rationality of the overall visual direction of the image.
33
+
34
+ [p. 16 | section: Your Task | type: Text]
35
+ You can swap any two image blocks each time to achieve the correct layout.
36
+
37
+ [p. 16 | section: Inference Process | type: Text]
38
+ 1. State Representation: At each step, you need to maintain a "state" list representing current arrangement of image blocks.
39
+
40
+ [p. 16 | section: Inference Process | type: Text]
41
+ Example:
42
+
43
+ [p. 16 | section: Inference Process | type: Code]
44
+ state = ["B", "C", "A", "D"]
45
+
46
+ [p. 16 | section: Inference Process | type: Text]
47
+ This corresponds to: Top left (index 0): B Top right (index 1): C Bottom left (index 2): A Bottom right (index 3): D
48
+
49
+ [p. 16 | section: Inference Process | type: ListGroup]
50
+ 2. Visual Analysis: Carefully analyze the image patch content and visual details to determine the image patch location. To better complete the puzzle task, you can use additional image operations to enhance visual perception: Crop the image area of observation image to more closely observe the visual correlation between different regions in multiple image patches. Used to find clues during the puzzle or verify whether the puzzle is complete (For example: it looks like the puzzle is not completely fixed, maybe because of the lower left and upper right corners of observation image 2. I need to crop these two areas separately to get some visual information to further judge. First I will crop the lower left area <code>...</code>By observing the cropped lower left area, it shows that part of the text "OF H" may be related to the "appyness" text in the upper right corner. To further verify and manage, I will now crop the upper right image <code>...</code>. By observing the cropped image, I will swap image blocks B and C...) Zoom area to enlarge visual details (selectively observe the details of the cropped image).
51
+
52
+ [p. 16 | section: Inference Process | type: Text]
53
+ These operations can help you make more informed decisions.
54
+
55
+ [p. 17 | section: Inference Process | type: Text]
56
+ 3. Move Execution: After making a decision, generate a Python code snippet to swap tiles. Use the 'observation(state)' function to get the updated layout image for the next step.
57
+
58
+ [p. 17 | section: Available Image Operations | type: Text]
59
+ You can use the following Python functions to assist in inference:
60
+
61
+ [p. 17 | section: Available Image Operations | type: Text]
62
+ 1. Crop a region from an image using normalized coordinates (from 0 to 1).
63
+
64
+ [p. 17 | section: Available Image Operations | type: Code]
65
+ crop_box = [x1, y1, x2, y2] crop_image_{id} = crop(image, crop_box)
66
+
67
+ [p. 17 | section: Available Image Operations | type: Text]
68
+ 2. Zoom in an image by a specified factor (e.g., 1.5× zoom means 150% zoom).
69
+
70
+ [p. 17 | section: Available Image Operations | type: Code]
71
+ zoom_image_{id} = zoom(image, zoom_factor)
72
+
73
+ [p. 17 | section: Available Image Operations | type: Text]
74
+ 3. Swap tiles (e.g., top left and bottom left) and call observation function to see the jigsaw progress.
75
+
76
+ [p. 17 | section: Available Image Operations | type: Code]
77
+ state[0], state[2] = state[2], state[0] observation_image_{id} = observation(state)
78
+
79
+ [p. 17 | section: Available Image Operations | type: Text]
80
+ Replace "id" with an integer to uniquely identify each operation result. The "image" parameter must point to an existing image (e.g., "observation image 1", "crop image 1", etc.).
81
+
82
+ [p. 17 | section: Format | type: Text]
83
+ All Python code must be enclosed in <code>...</code>tags.
84
+
85
+ [p. 17 | section: Format | type: Text]
86
+ All reasoning steps must be enclosed in <think>...</think>tags.
87
+
88
+ [p. 17 | section: Format | type: Text]
89
+ The final answer must be enclosed in <answer>...</answer>tags.
90
+
91
+ [p. 17 | section: Important | type: ListGroup]
92
+ 1. For both swap and image manipulation, always explain why you are doing this before generating code. 2. Stop as soon as you generate a code snippet. I will execute the code and return the generated image for the next step. 3. You can only perform one image operation or observation of the puzzle state per turn. 4. Final answer: When you are sure that the puzzle is fully reconstructed (all edges are aligned and the visual information is complete and continuous), return the final "state" list in the "<answer>" block. 5. Please pay close attention to the rationality of your cropping area and ensure that the cropped area is a reasonable criterion for completing the puzzle.
93
+
94
+ [p. 17 | section: User Prompt | type: Text]
95
+ The four images are respectively labeled A, B, C, and D. Please complete the jigsaw.
96
+
97
+ [p. 17 | section: User Prompt | type: Text]
98
+ Image A: <image>Image B: <image>Image C: <image>Image D: <image>
99
+
100
+ [p. 18 | section: C CASE STUDY | type: Text]
101
+ In Figures 7 - 10, we present representative high-quality jigsaw trajectories collected to illustrate how our model performs reasoning and interacts with the environment. These cases specifically demonstrate: (1) how the model generates Python code to interact with the environment, such as swapping any two jigsaw pieces, observing jigsaw progress, and cropping/zooming in on regions for finer visual inspection; and (2) how the environment provides feedback that guides the model's subsequent reasoning.
102
+
103
+ [p. 18 | section: C CASE STUDY | type: FigureGroup]
104
+ Figure 7: Representative high-quality jigsaw trajectory case 1 (part 1).
105
+
106
+ [p. 19 | section: C CASE STUDY | type: FigureGroup]
107
+ Figure 8: Representative high-quality jigsaw trajectory case 1 (part 2).
108
+
109
+ [p. 20 | section: C CASE STUDY | type: FigureGroup]
110
+ Figure 9: Representative high-quality jigsaw trajectory case 2 (part 1).
111
+
112
+ [p. 21 | section: C CASE STUDY | type: FigureGroup]
113
+ Figure 10: Representative high-quality jigsaw trajectory case 2 (part 2).
114
+
115
+ [p. 21 | section: D THE IMPLEMENTATION OF TRAINING | type: Text]
116
+ The detailed training hyperparameters are provided in Tables 4 and 5, and all experiments are conducted on 8 NVIDIA A100 GPUs, each equipped with 80 GB of memory.
117
+
118
+ [p. 22 | section: D THE IMPLEMENTATION OF TRAINING | type: TableGroup]
119
+ Table 4: Key hyperparameters for SFT. Name Value Finetuning type Full Freeze vision tower True Freeze multi-modal projector True Freeze language model False Cutoff len 16384 Image max pixels 401408 Epochs 2.0 Batch size 32 Gradient accumulation steps 4 Learning rate 1.0e-5 LR scheduler type cosine Warmup ratio 0.1
120
+
121
+ [p. 22 | section: D THE IMPLEMENTATION OF TRAINING | type: TableGroup]
122
+ Table 5: Key hyperparameters for RL. Name Value Max turns 5 Rollout num 8 Train batch size 64 Mini batch size 64 Micro batch size per GPU 2 Learning rate 2.0e-6 KL loss coefficient 0.0 Total epochs 1 Max prompt length 8192 Single response max tokens 2048 Max response length 20000 GPU memory utilization 0.7
123
+
124
+ [p. 22 | section: E ANALYSIS OF WANDB CURVES IN JIGSAW OPTIMIZATION | type: Text]
125
+ In this section, we present the training curves of our RL process and provide an analysis of the training dynamics. We monitor the evolution of rewards (including accuracy and format rewards), response length, number of interaction turns, and validation accuracy.
126
+
127
+ [p. 22 | section: E ANALYSIS OF WANDB CURVES IN JIGSAW OPTIMIZATION | type: FigureGroup]
128
+ Figure 11: Visualization of Wandb curves in jigsaw RL optimization.
129
+
130
+ [p. 22 | section: E ANALYSIS OF WANDB CURVES IN JIGSAW OPTIMIZATION | type: Text]
131
+ At the beginning of training, both validation accuracy and reward values are low, indicating that the model has very limited jigsaw-solving ability in the early stage. As training progresses, the number of interaction turns increases briefly, suggesting that the model explores more interactions (e.g., swapping tiles, cropping for observation) in order to achieve higher accuracy. With continued training, the reward values steadily increase, reflecting a stable improvement in jigsaw-solving capability through RL. After sufficient training, the model gradually reduces both the number of turns and response length, demonstrating enhanced perceptual and reasoning ability, such that it can solve jigsaw correctly with fewer interactions.
132
+
133
+ [p. 23 | section: F LIMITATIONS | type: Text]
134
+ Despite our best efforts, this work has several limitations. Multi-turn jigsaw interactions inevitably increase context length and introduce significant computational overhead. In the 3 × 3 setting, the context often exceeds the model's maximum window size, restricting our RL training to the 2 × 2 case. Future work could investigate more efficient interaction mechanisms with external environments or integrate memory modules to mitigate context length constraints, thereby enabling RL training on larger and more complex jigsaw tasks.
135
+
136
+ [p. 23 | section: G QUALITATIVE ANALYSIS ON ATTENTION PATTERNS | type: Text]
137
+ To further verify that AGILE brings genuine improvements in perceptual and reasoning abilities rather than merely increasing benchmark scores, we conduct additional qualitative analyses on general downstream tasks. Specifically, we visualize the attention distributions of Qwen2.5-VL-7B before and after AGILE training. As shown in attention examples (Figure 12) , the original model often exhibits scattered and unstable attention allocation, focusing on large irrelevant regions when processing complex high-resolution scenes or fine-grained recognition tasks. This dispersed attention leads to unreliable reasoning and misinterpretation of critical visual evidence. In contrast, the AGILE-trained model shows significantly more concentrated attention on key visual elements, such as small objects, text regions, and structurally important areas. This improved focus enhances the model's ability to extract fine-grained cues and supports more reliable multimodal reasoning. These qualitative findings align with our quantitative gains across HRBench, VStarBench, and Real-WorldQA, suggesting that AGILE enhances fundamental perceptual mechanisms underlying general visual understanding.
138
+
139
+ [p. 23 | section: H WHICH TASKS CAN BENEFIT MORE FROM AGILE? | type: Text]
140
+ Beyond overall benchmark gains, we analyze the types of perceptual and reasoning skills most enhanced by AGILE:
141
+
142
+ [p. 23 | section: H WHICH TASKS CAN BENEFIT MORE FROM AGILE? | type: ListGroup]
143
+ Fine-grained recognition. These tasks require high precision in identifying subtle visual cues, such as detecting small objects, recognizing text, or distinguishing fine-grained visual differences. AGILE enhances the model's ability to focus on the most critical visual elements, improving its sensitivity to subtle but important features and thereby boosting fine-grained recognition performance. Spatial relation reasoning. Benchmarks such as VStarBench contain a substantial number of questions involving spatial positional reasoning. AGILE's interaction-driven training helps the model better attend to spatial layouts and contextual relationships within a scene, substantially improving its ability to understand and reason about complex spatial arrangements. This capability transfers effectively to real-world spatial reasoning tasks. Visual–textual integration. AGILE also leads to notable improvements in tasks requiring the integration of visual and textual information. Tasks involving reading product details, interpreting signs, or extracting structured information from charts benefit from AGILE's strengthened ability to jointly process textual cues grounded in visual context.
144
+
145
+ [p. 23 | section: I HANDLING INVALID CODE EXECUTIONS | type: Text]
146
+ During reinforcement learning, the model may generate malformed or invalid code. Instead of discarding such rollouts, the environment executes the code and returns explicit error messages to the model. These erroneous interactions increase the total number of steps required to reach the correct solution and thus naturally lead to lower step rewards under our reward formulation (Eq. 5 and Eq. 6) . As a result, invalid code is implicitly penalized, encouraging the model to generate valid actions and interact more efficiently. This design stabilizes training without requiring complex filtering mechanisms.
147
+
148
+ [p. 24 | section: I HANDLING INVALID CODE EXECUTIONS | type: FigureGroup]
149
+ Figure 12: Comparison of Attention Maps Before and After AGILE Training. Warm colors indicate higher attention; cool colors indicate lower attention.
150
+
151
+ [p. 24 | section: J.1 SENSITIVITY TO REWARD COEFFICIENTS. | type: Text]
152
+ We further investigate the sensitivity of AGILE to the reward-weighting coefficients (α, β, and γ). As shown in Table 6, varying the values of α and β yields only minor fluctuations in performance, indicating that AGILE is robust to these parameters. In contrast, removing the step reward (γ) produces notable performance degradation, especially on VStarBench and MMVP. This finding ver-
153
+
154
+ [p. 25 | section: J.1 SENSITIVITY TO REWARD COEFFICIENTS. | type: Text]
155
+ ifies that the step-penalty plays a critical role in encouraging efficient and meaningful interactions, preventing long, unfocused rollouts during RL.
156
+
157
+ [p. 25 | section: J.1 SENSITIVITY TO REWARD COEFFICIENTS. | type: TableGroup]
158
+ Table 6: Ablation on Reward Coefficients. Sensitivity analysis of the weighting coefficients \alpha , \beta , and \gamma in the total reward. Model MME-RW RWQA HRB4K HRB8K VStar MMVP BLINK HalBench MMMU Avg. Qwen2.5-VL-7B 44.6 68.5 68.8 65.3 76.4 74.3 56.4 50.1 54.8 62.1 \alpha = 0.8, \beta = 0.2, \gamma = 1.0 48.4 70.2 73.0 70.5 80.6 78.0 58.0 51.9 55.8 65.2 \alpha = 0.8, \beta = 0.2, \gamma = 0.5 49.2 69.7 72.8 69.8 78.5 79.0 57.5 50.8 55.8 64.8 \alpha = 0.8, \beta = 0.2, \gamma = 0.0 47.4 71.1 72.4 69.8 78.5 75.3 56.7 52.8 55.6 64.4 \alpha = 0.9, \beta = 0.1, \gamma = 1.0 48.9 70.8 73.3 69.6 79.1 78.0 57.5 51.4 55.1 64.9
159
+
160
+ [p. 25 | section: J.2 RESULTS OF LARGER JIGSAW GRID SIZES AND CURRICULUM RL TRAINING | type: Text]
161
+ To further assess the scalability of AGILE beyond the 2\times 2 jigsaw setting, we conduct an additional reinforcement learning stage on 8K\ 3\times 3 jigsaw puzzles. This stage is applied after the initial 15.6K\ 2\times 2 RL training, forming curriculum-style optimization principle. As shown in Table 7, training on 3\times 3 jigsaw puzzles leads to further improvements across all 9 benchmarks. These results demonstrate that AGILE naturally generalizes to larger and more challenging jigsaw configurations when model capability allows, and further highlight that curriculum reinforcement learning on increasingly difficult grid sizes provides an effective path for continued scaling.
162
+
163
+ [p. 25 | section: J.2 RESULTS OF LARGER JIGSAW GRID SIZES AND CURRICULUM RL TRAINING | type: TableGroup]
164
+ Table 7: Results of 3 \times 3 Jigsaw RL Training. Model MME-RW RWQA HRB4K HRB8K VStar MMVP BLINK HalBench MMMU Avg. Qwen2.5-VL-7B 44.6 68.5 68.8 65.3 76.4 74.3 56.4 50.1 54.8 62.1 + 15.6K 2×2 RL 48.4 70.2 73.0 70.5 80.6 78.0 58.0 51.9 55.8 65.2 + 15.6 K 2 \times 2 + 8 K 3 \times 3 RL 50.4 70.6 73.4 70.5 80.1 79.0 58.1 52.1 55.8 65.6
165
+
166
+ [p. 25 | section: J.3 EXPERT TRAJECTORIES ABLATIONS | type: Text]
167
+ To disentangle the effect of expert cold-start trajectories and verify that AGILE's improvements are not merely due to distillation, we conducted additional experiments without any expert trajectories. Specifically, we performed RL directly on the 15.6K 2 \times 2 jigsaw dataset under two conditions: (1) the full action space, and (2) an ablated action space with Crop/Zoom removed. The results show that even in the absence of expert supervision, AGILE still delivers a +1.8% improvement over the Qwen2.5-VL-7B baseline, demonstrating that the performance gain arises from agentic visual interaction combined with verifiable RL, rather than imitation of Gemini 2.5 Pro trajectories.
168
+
169
+ [p. 25 | section: J.3 EXPERT TRAJECTORIES ABLATIONS | type: TableGroup]
170
+ Table 8: Performance of RL without Gemini 2.5 Pro expert trajectories and with ablated action spaces. Model MME-RW RWQA HRB4K HRB8K VStar MMVP BLINK HalBench MMMU Avg. Qwen2.5-VL-7B 44.6 68.5 68.8 65.3 76.4 74.3 56.4 50.1 54.8 62.1 Cold-Start 46.2 68.4 71.0 68.4 77.5 76.7 55.7 49.8 54.0 63.1 Cold-Start + RL 48.4 70.2 73.0 70.5 80.6 78.0 58.0 51.9 55.8 65.2 Only RL (Full action space) 46.3 69.5 71.5 68.1 78.5 79.0 56.3 53.2 53.1 63.9 Only RL (No Crop/Zoom) 46.2 69.3 71.9 68.0 78.0 78.3 53.7 52.8 53.3 63.5
171
+
172
+ [p. 25 | section: J.3 EXPERT TRAJECTORIES ABLATIONS | type: Text]
173
+ Furthermore, removing the Crop/Zoom operations leads to a clear decline in performance, underscoring the importance of AGILE's interaction design in enabling effective fine-grained perceptual reasoning.
174
+
175
+ [p. 25 | section: J.4 GENERAL QA DATASET DETAILS AND EXTENDED COMPARISON WITH JIGSAW TRAINING | type: Text]
176
+ We provide additional clarification regarding the composition of the general QA dataset. Our 20K QA corpus is constructed entirely from high-resolution, real-world visual scenes, consisting of 15K samples from DeepEyes (Zheng et al., 2025) and 5K samples from MMEureka (Meng et al., 2025).
177
+
178
+ [p. 26 | section: J.4 GENERAL QA DATASET DETAILS AND EXTENDED COMPARISON WITH JIGSAW TRAINING | type: TableGroup]
179
+ Table 9: Comparison between General QA and Jigsaw-based RL under equal training budgets (20K). Model MME-RW RWQA HRB4K HRB8K VStar MMVP BLINK HalBench MMMU Avg. Qwen2.5-VL-7B 44.6 68.5 68.8 65.3 76.4 74.3 56.4 50.1 54.8 62.1 20K General QA 50.5 68.9 72.4 69.5 82.7 78.3 54.8 51.3 54.2 64.7 10K General QA + 10K Jigsaw 51.6 69.8 73.0 70.6 81.7 79.0 57.3 51.2 55.7 65.5 20K Jigsaw-only 48.5 70.5 73.6 70.5 80.1 77.3 57.7 52.1 53.8 64.9
180
+
181
+ [p. 26 | section: J.4 GENERAL QA DATASET DETAILS AND EXTENDED COMPARISON WITH JIGSAW TRAINING | type: Text]
182
+ These datasets span diverse perceptual and reasoning categories, including fine-grained attributes, spatial relationships, counting, and commonsense scene understanding.
183
+
184
+ [p. 26 | section: J.4 GENERAL QA DATASET DETAILS AND EXTENDED COMPARISON WITH JIGSAW TRAINING | type: Text]
185
+ Accordingly, the comparison between jigsaw training and QA training is inherently fair: both training regimes operate on high-resolution, real-world, and complex perceptual inputs. To further strengthen this comparison, we additionally include the 20K pure jigsaw setting. As shown in Table 9, jigsaw-based RL consistently outperforms high-resolution QA-based RL under the same training budget, demonstrating that AGILE's performance gains do not stem from differences in input resolution, but instead from the structured, verifiable, and spatially grounded training signal introduced by the jigsaw task.
186
+
187
+ [p. 26 | section: J.5 IMPACT OF SCALING THE COLD-START (SFT) DATASET | type: Text]
188
+ To understand whether training longer or scaling up the supervised cold-start phase affects performance, we expand the cold-start dataset to 1.5 \times and 2 \times its original size and repeated all experiments. As shown in Table 10, enlarging the SFT dataset leads to only marginal differences, with no signs of overfitting or meaningful performance degradation.
189
+
190
+ [p. 26 | section: J.5 IMPACT OF SCALING THE COLD-START (SFT) DATASET | type: TableGroup]
191
+ Table 10: Effect of scaling the cold-start (SFT) dataset size. Increasing SFT data provides only marginal differences, indicating that most performance gains come from the RL stage. Model MME-RW RWQA HRB4K HRB8K VStar MMVP BLINK HalBench MMMU Avg. Qwen2.5-VL-7B 44.6 68.5 68.8 65.3 76.4 74.3 56.4 50.1 54.8 62.1 Cold-start (1.6K) 46.2 68.4 71.0 68.4 77.5 76.7 55.7 49.8 54.0 63.1 +RL 48.4 70.2 73.0 70.5 80.6 78.0 58.0 51.9 55.8 65.2 Cold-start (2.4K) 46.2 68.9 71.4 68.8 77.0 76.0 57.8 50.2 54.0 63.4 +RL 48.4 69.8 73.0 69.9 78.5 79.0 57.7 50.5 56.3 64.8 Cold-start (3.2K) 46.5 67.8 71.4 68.8 77.0 76.7 58.1 49.2 53.3 63.2 +RL 47.1 70.1 73.0 70.5 79.6 78.3 57.2 50.5 55.7 64.7
192
+
193
+ [p. 26 | section: J.5 IMPACT OF SCALING THE COLD-START (SFT) DATASET | type: Text]
194
+ In practice, the cold-start stage serves a very specific purpose: teaching the model the tool-use pattern (i.e., how to invoke the predefined Python APIs). Its goal is not to solve the jigsaw task fully. Consequently, the model's performance is largely unaffected by moderate expansions of the SFT set. The primary source of generalization and performance improvement comes from the interactive RL stage, where the model learns to solve jigsaw puzzles through real environment feedback rather than through imitation.
195
+
196
+ [p. 26 | section: K USE OF LLMS | type: Text]
197
+ Yes. We use LLMs solely to assist in language polishing and improving readability. All technical content, experiments, and analyses are conducted by the authors.
iclr26/3kouij8BWi/assets.json ADDED
@@ -0,0 +1,156 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ [
2
+ {
3
+ "filename": "_page_14_Figure_4.jpeg",
4
+ "path": "/network/scratch/j/jianan.zhao/ReviewAgent/data/processed_papers/iclr26_20260429_1952_all/marker_raw/3kouij8BWi/marker_markdown/3kouij8BWi/_page_14_Figure_4.jpeg",
5
+ "bytes": 23069,
6
+ "width": 806,
7
+ "height": 352,
8
+ "aspect_ratio": 2.289772727272727,
9
+ "keep": true,
10
+ "reject_reason": null,
11
+ "model_path": "assets/_page_14_Figure_4.jpeg"
12
+ },
13
+ {
14
+ "filename": "_page_17_Figure_3.jpeg",
15
+ "path": "/network/scratch/j/jianan.zhao/ReviewAgent/data/processed_papers/iclr26_20260429_1952_all/marker_raw/3kouij8BWi/marker_markdown/3kouij8BWi/_page_17_Figure_3.jpeg",
16
+ "bytes": 211162,
17
+ "width": 1112,
18
+ "height": 1347,
19
+ "aspect_ratio": 0.8255382331106161,
20
+ "keep": true,
21
+ "reject_reason": null,
22
+ "model_path": "assets/_page_17_Figure_3.jpeg"
23
+ },
24
+ {
25
+ "filename": "_page_18_Figure_1.jpeg",
26
+ "path": "/network/scratch/j/jianan.zhao/ReviewAgent/data/processed_papers/iclr26_20260429_1952_all/marker_raw/3kouij8BWi/marker_markdown/3kouij8BWi/_page_18_Figure_1.jpeg",
27
+ "bytes": 217562,
28
+ "width": 1122,
29
+ "height": 1487,
30
+ "aspect_ratio": 0.7545393409549428,
31
+ "keep": true,
32
+ "reject_reason": null,
33
+ "model_path": "assets/_page_18_Figure_1.jpeg"
34
+ },
35
+ {
36
+ "filename": "_page_19_Figure_1.jpeg",
37
+ "path": "/network/scratch/j/jianan.zhao/ReviewAgent/data/processed_papers/iclr26_20260429_1952_all/marker_raw/3kouij8BWi/marker_markdown/3kouij8BWi/_page_19_Figure_1.jpeg",
38
+ "bytes": 196858,
39
+ "width": 1139,
40
+ "height": 1437,
41
+ "aspect_ratio": 0.7926235212247739,
42
+ "keep": true,
43
+ "reject_reason": null,
44
+ "model_path": "assets/_page_19_Figure_1.jpeg"
45
+ },
46
+ {
47
+ "filename": "_page_1_Picture_1.jpeg",
48
+ "path": "/network/scratch/j/jianan.zhao/ReviewAgent/data/processed_papers/iclr26_20260429_1952_all/marker_raw/3kouij8BWi/marker_markdown/3kouij8BWi/_page_1_Picture_1.jpeg",
49
+ "bytes": 23694,
50
+ "width": 424,
51
+ "height": 267,
52
+ "aspect_ratio": 1.5880149812734083,
53
+ "keep": true,
54
+ "reject_reason": null,
55
+ "model_path": "assets/_page_1_Picture_1.jpeg"
56
+ },
57
+ {
58
+ "filename": "_page_1_Picture_2.jpeg",
59
+ "path": "/network/scratch/j/jianan.zhao/ReviewAgent/data/processed_papers/iclr26_20260429_1952_all/marker_raw/3kouij8BWi/marker_markdown/3kouij8BWi/_page_1_Picture_2.jpeg",
60
+ "bytes": 16059,
61
+ "width": 357,
62
+ "height": 255,
63
+ "aspect_ratio": 1.4,
64
+ "keep": true,
65
+ "reject_reason": null,
66
+ "model_path": "assets/_page_1_Picture_2.jpeg"
67
+ },
68
+ {
69
+ "filename": "_page_1_Picture_3.jpeg",
70
+ "path": "/network/scratch/j/jianan.zhao/ReviewAgent/data/processed_papers/iclr26_20260429_1952_all/marker_raw/3kouij8BWi/marker_markdown/3kouij8BWi/_page_1_Picture_3.jpeg",
71
+ "bytes": 14239,
72
+ "width": 280,
73
+ "height": 277,
74
+ "aspect_ratio": 1.0108303249097472,
75
+ "keep": true,
76
+ "reject_reason": null,
77
+ "model_path": "assets/_page_1_Picture_3.jpeg"
78
+ },
79
+ {
80
+ "filename": "_page_20_Figure_1.jpeg",
81
+ "path": "/network/scratch/j/jianan.zhao/ReviewAgent/data/processed_papers/iclr26_20260429_1952_all/marker_raw/3kouij8BWi/marker_markdown/3kouij8BWi/_page_20_Figure_1.jpeg",
82
+ "bytes": 270841,
83
+ "width": 1120,
84
+ "height": 1485,
85
+ "aspect_ratio": 0.7542087542087542,
86
+ "keep": true,
87
+ "reject_reason": null,
88
+ "model_path": "assets/_page_20_Figure_1.jpeg"
89
+ },
90
+ {
91
+ "filename": "_page_21_Figure_7.jpeg",
92
+ "path": "/network/scratch/j/jianan.zhao/ReviewAgent/data/processed_papers/iclr26_20260429_1952_all/marker_raw/3kouij8BWi/marker_markdown/3kouij8BWi/_page_21_Figure_7.jpeg",
93
+ "bytes": 69973,
94
+ "width": 1100,
95
+ "height": 767,
96
+ "aspect_ratio": 1.4341590612777053,
97
+ "keep": true,
98
+ "reject_reason": null,
99
+ "model_path": "assets/_page_21_Figure_7.jpeg"
100
+ },
101
+ {
102
+ "filename": "_page_23_Figure_1.jpeg",
103
+ "path": "/network/scratch/j/jianan.zhao/ReviewAgent/data/processed_papers/iclr26_20260429_1952_all/marker_raw/3kouij8BWi/marker_markdown/3kouij8BWi/_page_23_Figure_1.jpeg",
104
+ "bytes": 260155,
105
+ "width": 1089,
106
+ "height": 1382,
107
+ "aspect_ratio": 0.7879884225759769,
108
+ "keep": true,
109
+ "reject_reason": null,
110
+ "model_path": "assets/_page_23_Figure_1.jpeg"
111
+ },
112
+ {
113
+ "filename": "_page_3_Figure_1.jpeg",
114
+ "path": "/network/scratch/j/jianan.zhao/ReviewAgent/data/processed_papers/iclr26_20260429_1952_all/marker_raw/3kouij8BWi/marker_markdown/3kouij8BWi/_page_3_Figure_1.jpeg",
115
+ "bytes": 110840,
116
+ "width": 1118,
117
+ "height": 645,
118
+ "aspect_ratio": 1.7333333333333334,
119
+ "keep": true,
120
+ "reject_reason": null,
121
+ "model_path": "assets/_page_3_Figure_1.jpeg"
122
+ },
123
+ {
124
+ "filename": "_page_8_Figure_1.jpeg",
125
+ "path": "/network/scratch/j/jianan.zhao/ReviewAgent/data/processed_papers/iclr26_20260429_1952_all/marker_raw/3kouij8BWi/marker_markdown/3kouij8BWi/_page_8_Figure_1.jpeg",
126
+ "bytes": 25688,
127
+ "width": 565,
128
+ "height": 438,
129
+ "aspect_ratio": 1.2899543378995433,
130
+ "keep": true,
131
+ "reject_reason": null,
132
+ "model_path": "assets/_page_8_Figure_1.jpeg"
133
+ },
134
+ {
135
+ "filename": "_page_8_Figure_3.jpeg",
136
+ "path": "/network/scratch/j/jianan.zhao/ReviewAgent/data/processed_papers/iclr26_20260429_1952_all/marker_raw/3kouij8BWi/marker_markdown/3kouij8BWi/_page_8_Figure_3.jpeg",
137
+ "bytes": 26234,
138
+ "width": 519,
139
+ "height": 484,
140
+ "aspect_ratio": 1.072314049586777,
141
+ "keep": true,
142
+ "reject_reason": null,
143
+ "model_path": "assets/_page_8_Figure_3.jpeg"
144
+ },
145
+ {
146
+ "filename": "_page_8_Figure_6.jpeg",
147
+ "path": "/network/scratch/j/jianan.zhao/ReviewAgent/data/processed_papers/iclr26_20260429_1952_all/marker_raw/3kouij8BWi/marker_markdown/3kouij8BWi/_page_8_Figure_6.jpeg",
148
+ "bytes": 179457,
149
+ "width": 1114,
150
+ "height": 739,
151
+ "aspect_ratio": 1.5074424898511503,
152
+ "keep": true,
153
+ "reject_reason": null,
154
+ "model_path": "assets/_page_8_Figure_6.jpeg"
155
+ }
156
+ ]
iclr26/3kouij8BWi/assets/_page_14_Figure_4.jpeg ADDED

Git LFS Details

  • SHA256: 1abc27ed3992406e215016ff81be9c18259f929bd57bf8a8d6398f47da0642ad
  • Pointer size: 130 Bytes
  • Size of remote file: 23.1 kB
iclr26/3kouij8BWi/assets/_page_17_Figure_3.jpeg ADDED

Git LFS Details

  • SHA256: 38fddd8f50f0ba9a2ff8d647a31143c2f64f7cc06e4bd8f34166ec51145aa6c9
  • Pointer size: 131 Bytes
  • Size of remote file: 211 kB
iclr26/3kouij8BWi/assets/_page_18_Figure_1.jpeg ADDED

Git LFS Details

  • SHA256: 36fdfda767e16973525b0da104e86faa2879d2ceb39ef5acdadfcfb849fb32a9
  • Pointer size: 131 Bytes
  • Size of remote file: 218 kB
iclr26/3kouij8BWi/assets/_page_19_Figure_1.jpeg ADDED

Git LFS Details

  • SHA256: 8b8a8aedaab279ab867088ddeb0d5111db08bcf1d8e137aaa83774f64a4ce113
  • Pointer size: 131 Bytes
  • Size of remote file: 197 kB
iclr26/3kouij8BWi/assets/_page_1_Picture_1.jpeg ADDED

Git LFS Details

  • SHA256: 41d2e56ca23160650b082ff9e4e7c4414e5120192d4359a41067e37aed4213dc
  • Pointer size: 130 Bytes
  • Size of remote file: 23.7 kB
iclr26/3kouij8BWi/assets/_page_1_Picture_2.jpeg ADDED

Git LFS Details

  • SHA256: 0f51d03659c7870f8d54e103537e9007bdd0e179f57479262f79b9e3aff511c5
  • Pointer size: 130 Bytes
  • Size of remote file: 16.1 kB
iclr26/3kouij8BWi/assets/_page_1_Picture_3.jpeg ADDED

Git LFS Details

  • SHA256: 3de19e5500532a3a0fa68b58df81307044ae7b4a53ff05d24f253afdd9b43d6d
  • Pointer size: 130 Bytes
  • Size of remote file: 14.2 kB
iclr26/3kouij8BWi/assets/_page_20_Figure_1.jpeg ADDED

Git LFS Details

  • SHA256: 7e9dc361889aa753ee2aaa18ba4beaf6a0a77feb0e6979d76e9dc94ac04cc9bd
  • Pointer size: 131 Bytes
  • Size of remote file: 271 kB
iclr26/3kouij8BWi/assets/_page_21_Figure_7.jpeg ADDED

Git LFS Details

  • SHA256: de8750e8d01f9f744b18fa604f732a6dbccdb4bf479d9c22f3a2e8c95a8c823d
  • Pointer size: 130 Bytes
  • Size of remote file: 70 kB
iclr26/3kouij8BWi/assets/_page_23_Figure_1.jpeg ADDED

Git LFS Details

  • SHA256: e8ef2c0541a87bd03b3e43fa4705d7d4507ceaa4a5665a42a9a918f95cb8fdf7
  • Pointer size: 131 Bytes
  • Size of remote file: 260 kB
iclr26/3kouij8BWi/assets/_page_3_Figure_1.jpeg ADDED

Git LFS Details

  • SHA256: 01117a2337ebe61742d2fc1bf1f6d0b5b6f7843e9e37e6a929896fbe90fa294f
  • Pointer size: 131 Bytes
  • Size of remote file: 111 kB
iclr26/3kouij8BWi/assets/_page_8_Figure_1.jpeg ADDED

Git LFS Details

  • SHA256: a2fbfce2894c2f1ade0f4d2deafe33185d8d13fc2db201ed36f9e89dd9a24ee2
  • Pointer size: 130 Bytes
  • Size of remote file: 25.7 kB
iclr26/3kouij8BWi/assets/_page_8_Figure_3.jpeg ADDED

Git LFS Details

  • SHA256: 60ad437d624f2be3e091b15d2f78c277ce575c02376f182feea52352f8b7b1a8
  • Pointer size: 130 Bytes
  • Size of remote file: 26.2 kB
iclr26/3kouij8BWi/assets/_page_8_Figure_6.jpeg ADDED

Git LFS Details

  • SHA256: 915eebd25b9ee2bf5e3b8f70e9c5b0dcfd376ba4abeb382efec66c2130cdeacf
  • Pointer size: 131 Bytes
  • Size of remote file: 179 kB
iclr26/3kouij8BWi/chunks_v3_anonymized.jsonl ADDED
@@ -0,0 +1,128 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0000", "section": "ABSTRACT", "page_start": 1, "page_end": 1, "type": "Text", "text": "Although current large Vision-Language Models (VLMs) have advanced in multimodal understanding and reasoning, their fundamental perceptual and reasoning abilities remain limited. Specifically, even on simple jigsaw tasks, existing VLMs perform near randomly, revealing deficiencies in core perception and reasoning capabilities. While high-quality vision-language data can enhance these capabilities, its scarcity and limited scalability impose significant constraints. To address this, we propose AGILE, an Agentic jiGsaw Interaction Learning for Enhancing visual perception and reasoning in VLMs. AGILE formulates jigsaw solving as an interactive process, enabling the model to progressively engage with the environment. At each step, the model generates executable code to perform an action based on the current state, while the environment provides fine-grained visual feedback to guide task completion. Through this iterative cycle of observation and interaction, the model incrementally improves its perceptual and reasoning capabilities via exploration and feedback. Experimental results show that AGILE not only substantially boosts performance on jigsaw tasks of varying complexity (e.g., increasing accuracy from 9.5% to 82.8% under the 2 \\times 2 setting) but also demonstrates strong generalization across 9 general vision tasks, achieving an average improvement of 3.1%. These results indicate notable enhancements in both perceptual and reasoning abilities. This work opens a new avenue for advancing reasoning and generalization in multimodal models and provides an efficient, scalable solution to the scarcity of multimodal reinforcement learning data. The code and datasets is available at", "source": "marker_v2", "marker_block_id": "/page/0/Text/8"}
2
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0001", "section": "1 Introduction", "page_start": 1, "page_end": 1, "type": "Text", "text": "Large Vision-Language Models (VLMs) have recently achieved remarkable success across a wide range of multimodal tasks, including image captioning (Chen et al., 2024a;c; Li et al., 2024b; Zeng et al., 2025), visual question answering (Bai et al., 2025; Zhu et al., 2025; Hurst et al., 2024; Comanici et al., 2025; Qi et al., 2025; Zhao et al., 2025; Huang et al., 2026b; Zeng et al., 2026; Wang et al., 2026; Pan et al., 2025), document understanding (Wang et al., 2025b;a), and complex real-world applications (Huang et al., 2025b; Han et al., 2026; Fang et al., 2025; Huang et al., 2025a; Zhang et al., 2025a). By effectively associating visual and textual information, these models exhibit strong multimodal perception and reasoning capabilities. However, their performance remains severely limited on tasks that require comprehensive visual understanding and structured reasoning. In particular, we find that current VLMs often perform near random even on relatively simple 2\\times 2 jigsaw tasks (Carlucci et al., 2019; Chen et al., 2023), which demand both perceptual accuracy and", "source": "marker_v2", "marker_block_id": "/page/0/Text/10"}
3
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0002", "section": "1 Introduction", "page_start": 1, "page_end": 1, "type": "Footnote", "text": "& lt;sup>2</sup>Shanghai AI Laboratory", "source": "marker_v2", "marker_block_id": "/page/0/Footnote/4"}
4
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0003", "section": "1 Introduction", "page_start": 2, "page_end": 2, "type": "PictureGroup", "text": "Figure 1: Description of the action space. (a) illustrates swapping two jigsaw pieces and observing the updated jigsaw state; (b) shows cropping a specific region of the jigsaw for closer inspection; and (c) depicts zooming into a selected area to examine fine-grained details.", "source": "marker_v2", "marker_block_id": "/page/1/PictureGroup/180"}
5
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0004", "section": "1 Introduction", "page_start": 2, "page_end": 2, "type": "Text", "text": "logical inference. This suggests that existing pretraining and fine-tuning strategies are insufficient for developing robust perceptual and reasoning abilities.", "source": "marker_v2", "marker_block_id": "/page/1/Text/5"}
6
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0005", "section": "1 Introduction", "page_start": 2, "page_end": 2, "type": "Text", "text": "Recent studies have explored reinforcement learning (RL) (Schulman et al., 2017; Rafailov et al., 2023; Shao et al., 2024; Huang et al., 2026a; Ma et al., 2025; Zhang et al., 2025c; b; Ren et al., 2026) as a way to enhance these capabilities by enabling models to learn through interaction, trial-anderror, and feedback. While RL-based approaches show promise, they are fundamentally constrained by the scarcity and limited scalability of high-quality vision-language RL data. Current methods for constructing multimodal RL datasets (Huang et al., 2025c; Yang et al., 2025; Lu et al., 2023) generally fall into two categories: human expert supervision and automated synthesis. Humansupervised datasets are either prohibitively expensive or too small in scale for large-scale training, while automated approaches that rely on closed-source models suffer from limited quality, capability constraints, and substantial API costs. These challenges collectively hinder the development of VLMs with strong reasoning and generalization abilities.", "source": "marker_v2", "marker_block_id": "/page/1/Text/6"}
7
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0006", "section": "1 Introduction", "page_start": 2, "page_end": 2, "type": "Text", "text": "To address these limitations, we propose AGILE, an Agentic jiGsaw Interaction Learning framework for Enhancing visual perception and reasoning in VLMs. Our approach leverages the structured nature of the jigsaw puzzle as a proxy task for perception and reasoning, modeling the jigsawsolving process as a progressive interaction between the model and its environment. At each step, the model generates Python code to perform actions within a well-defined action space (swapping two image tiles, observing the current jigsaw state, cropping regions for detailed observation, or zooming in for fine-grained analysis). This interaction-driven process enables the model to iteratively refine its perceptual and reasoning capabilities while receiving explicit feedback at every step. By simulating the step-by-step dynamics of jigsaw solving, the model is encouraged to capture structural relationships among visual components and acquire more robust perception and reasoning skills.", "source": "marker_v2", "marker_block_id": "/page/1/Text/7"}
8
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0007", "section": "1 Introduction", "page_start": 2, "page_end": 2, "type": "Text", "text": "A key feature of our approach is the use of code and rule-based data generation, which offers two major advantages. First, the difficulty of the jigsaw task can be precisely controlled by adjusting factors such as the number of correctly placed tiles in the initial state and the overall jigsaw size. Second, because the ground-truth solution is inherently available, the synthetic dataset can be scaled to arbitrary sizes with strict supervision, overcoming the data scarcity inherent in human-annotated or closed-source datasets. The combination of interactive training and scalable data generation yields an efficient and effective framework for advancing visual perception and reasoning in VLMs.", "source": "marker_v2", "marker_block_id": "/page/1/Text/8"}
9
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0008", "section": "1 Introduction", "page_start": 2, "page_end": 2, "type": "Text", "text": "We validate the effectiveness of our approach through comprehensive experiments. Our method substantially improves performance across jigsaw tasks of varying complexity, for instance, raising accuracy from 9.5% to 82.8% on the 2 × 2 setting, while also demonstrating strong generalization to a wide range of vision tasks, including high-resolution image understanding, real-world scene analysis, fine-grained recognition, visual reasoning, and hallucination benchmarks. Moreover, we show that scaling the training data further boosts performance, and that under equal data budgets, jigsaw-based training achieves results comparable to or even surpassing those obtained with general QA data. These findings underscore the potential of jigsaw tasks in addressing the scarcity of multimodal RL data. By combining interactive training with scalable data generation, our method significantly enhances both perceptual and higher-order reasoning abilities, pointing to a promising new direction for advancing VLMs. Our main contributions are as follows:", "source": "marker_v2", "marker_block_id": "/page/1/Text/9"}
10
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0009", "section": "1 Introduction", "page_start": 3, "page_end": 3, "type": "ListGroup", "text": "We introduce AGILE, an agentic jigsaw interaction learning framework that formulates jigsaw solving as a stepwise interactive process, thereby driving incremental improvements in both visual perception and reasoning capabilities of VLMs. We present a scalable jigsaw-based data generation method that yields high-quality multimodal reinforcement learning datasets with controllable difficulty, providing an efficient solution to the current shortage of high-quality training data. Extensive experiments demonstrate that our approach substantially improves performance on jigsaw tasks of varying complexity while exhibiting strong generalization across diverse vision benchmarks, highlighting its effectiveness in enhancing both perception and reasoning in VLMs.", "source": "marker_v2", "marker_block_id": "/page/2/ListGroup/207"}
11
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0010", "section": "2 RELATED WORK", "page_start": 3, "page_end": 3, "type": "Text", "text": "Reinforcement Learning for Vision Language Models. Reinforcement learning (RL) (Schulman et al., 2017; Rafailov et al., 2023; Shao et al., 2024) has been widely applied to improve reasoning in language models, as exemplified by the success of DeepSeek-R1 (Guo et al., 2025) in mathematical reasoning. Building on this progress, recent studies have extended RL to VLMs, with rule-based RL in multimodal domains emerging as a promising direction. For perception enhancement, R1-V (Chen et al., 2025b) applies RL to object counting, while Perception-R1 (Yu et al., 2025) leverages object matching and IoU as reward signals to improve grounding. DeepEyes (Zheng et al., 2025) shows how RL can encourage models to invoke visual tools, thereby expanding perceptual abilities. For reasoning, MMEureka (Meng et al., 2025) demonstrates the effectiveness of rule-based RL in mathematical tasks. From a data perspective, Vision-R1 (Huang et al., 2025c) and R1-OneVision (Yang et al., 2025) convert visual information into textual representations to build multimodal chainof-thought (CoT) datasets that support stronger reasoning. Despite these advances, the lack of scalable, high-quality RL datasets remains a fundamental bottleneck, severely limiting further improvements in both perception and reasoning for VLMs.", "source": "marker_v2", "marker_block_id": "/page/2/Text/5"}
12
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0011", "section": "2 RELATED WORK", "page_start": 3, "page_end": 3, "type": "Text", "text": "Enhancing Generalization via Proxy Tasks. Rule-based reinforcement learning (RL) has shown promise but typically requires large amounts of high-quality, verifiable data. Logic-RL (Xie et al., 2025a) addressed this by introducing the \"Knights and Knaves\" (K&K) puzzle, which offers controllable difficulty and algorithmically generated ground truth, enabling models to acquire reasoning skills transferable to mathematical tasks. Enigmata (Chen et al., 2025a) extended this approach to a broader set of text-based puzzles (e.g., cryptographic, arithmetic, logical), demonstrating that solving such tasks with RL improves general reasoning without external data. RPT (Dong et al., 2025) further reframed next-token prediction as a reasoning task, using verifiable rewards to enhance predictive ability and strengthen the basis for reinforcement fine-tuning. Inspired by these proxy-task successes in LLMs, recent work has begun exploring similar ideas for VLMs. Code2Logic (Tong et al., 2025) and ViGaL (Xie et al., 2025b) leverage code-synthesized games to improve mathematical reasoning, while ViCrit (Wang et al., 2025d) enhances perceptual robustness by reinforcing models to detect hallucinated entities via modified captions. Jigsaw-R1 (Wang et al., 2025e) proposed a puzzle-based RL paradigm, but due to training limitations, its models still performed poorly even on 2 × 2 jigsaw puzzles, failing to fully exploit the proxy-task benefits. To address this gap, we propose a agentic jigsaw interaction learning framework, which casts jigsaw solving as an interactive process between the model and environment. This enables iterative refinement of perception and reasoning with explicit stepwise feedback, allowing the model to better capture visual relationships and develop stronger perceptual and reasoning skills.", "source": "marker_v2", "marker_block_id": "/page/2/Text/6"}
13
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0012", "section": "3 METHOD", "page_start": 3, "page_end": 3, "type": "Text", "text": "In this section, we provide a comprehensive description of our proposed agentic jigsaw interaction learning framework. We first introduce the jigsaw task and describe how the model interacts with the environment to accomplish it (Sec. 3.1) , then present the construction of the training data (Sec. 3.2) . Finally, we outline the training paradigm, including both the cold-start stage and the reinforcement learning stage (Sec. 3.3) .", "source": "marker_v2", "marker_block_id": "/page/2/Text/8"}
14
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0013", "section": "3 METHOD", "page_start": 4, "page_end": 4, "type": "FigureGroup", "text": "Figure 2: Overview of the AGILE framework. (a) depicts the interaction process between the model and the external environment, together with the implementation of the GRPO algorithm; (b) shows the collection of high-quality jigsaw trajectory data; and (c) illustrates the model–environment interaction during the jigsaw rollout process.", "source": "marker_v2", "marker_block_id": "/page/3/FigureGroup/270"}
15
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0014", "section": "3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION", "page_start": 4, "page_end": 4, "type": "Text", "text": "Jigsaw Task. Given an input image, we partition it into an m × m grid of jigsaw pieces, where task difficulty can be flexibly adjusted by varying m. If the image height or width is not divisible by m, the image is resized so that its dimensions are exact multiples of the grid. The grid is then randomly shuffled, and each piece is assigned an index in row-major order ranging from 1 (top-left) to m 2 (bottom-right). The shuffled configuration is denoted as", "source": "marker_v2", "marker_block_id": "/page/3/Text/4"}
16
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0015", "section": "3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION", "page_start": 4, "page_end": 4, "type": "Equation", "text": "I_{Shuffle} = \\{I_1, I_2, \\dots, I_{m^2}\\}, (1)", "source": "marker_v2", "marker_block_id": "/page/3/Equation/5"}
17
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0016", "section": "3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION", "page_start": 4, "page_end": 4, "type": "Text", "text": "where each I k corresponds to one jigsaw block. Since the shuffling process is explicitly recorded during data generation, we can recover the ground-truth jigsaw layout as", "source": "marker_v2", "marker_block_id": "/page/3/Text/6"}
18
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0017", "section": "3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION", "page_start": 4, "page_end": 4, "type": "Equation", "text": "I_{GT} = \\{I_{\\pi(1)}, I_{\\pi(2)}, \\dots, I_{\\pi(m^2)}\\},\\tag{2}", "source": "marker_v2", "marker_block_id": "/page/3/Equation/7"}
19
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0018", "section": "3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION", "page_start": 4, "page_end": 4, "type": "Text", "text": "where π is a permutation over {1, 2, . . . , m 2 }. During jigsaw solving, the model will maintain a current state", "source": "marker_v2", "marker_block_id": "/page/3/Text/8"}
20
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0019", "section": "3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION", "page_start": 4, "page_end": 4, "type": "Equation", "text": "I_{State} = \\{I_{\\pi^*(1)}, I_{\\pi^*(2)}, \\dots, I_{\\pi^*(m^2)}\\},\\tag{3}", "source": "marker_v2", "marker_block_id": "/page/3/Equation/9"}
21
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0020", "section": "3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION", "page_start": 4, "page_end": 4, "type": "Text", "text": "where π ∗ denotes the current arrangement of pieces. At each step, the model iteratively swaps two pieces, observes the resulting configuration, and aims to reconstruct the ground-truth layout IGT .", "source": "marker_v2", "marker_block_id": "/page/3/Text/10"}
22
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0021", "section": "3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION", "page_start": 4, "page_end": 4, "type": "Text", "text": "Environment Interaction. The model interacts with the environment throughout the jigsawsolving process in an iterative manner. As illustrated in Figure 1, , we predefine a set of API for model–environment interactions in Python. The model expresses its actions by generating Python code, which is executed by the environment to produce the corresponding resulting image. The model then uses these results to reason further and decide on subsequent actions, repeating this process iteratively until the jigsaw is completed. Specifically, at each step, the model can perform the following actions:", "source": "marker_v2", "marker_block_id": "/page/3/Text/11"}
23
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0022", "section": "3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION", "page_start": 4, "page_end": 4, "type": "ListGroup", "text": "Swap: Given the current jigsaw state IState, the model calls the Swap function to exchange the positions of any two jigsaw pieces. Observe: Given IState, the model calls the Observe function to obtain the current jigsaw progress IObs, which is then used to determine the next action.", "source": "marker_v2", "marker_block_id": "/page/3/ListGroup/271"}
24
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0023", "section": "3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION", "page_start": 5, "page_end": 5, "type": "Text", "text": "• Crop & Zoom: Given IObs, the model crops and zooms into a local region to inspect finer details and inform subsequent actions.", "source": "marker_v2", "marker_block_id": "/page/4/Text/1"}
25
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0024", "section": "3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION", "page_start": 5, "page_end": 5, "type": "Text", "text": "To better illustrate the overall procedure, the entire rollout process is presented in Algorithm 1.", "source": "marker_v2", "marker_block_id": "/page/4/Text/2"}
26
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0025", "section": "3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION", "page_start": 5, "page_end": 5, "type": "Code", "text": "Algorithm 1 Interactive Jigsaw-Solving Procedure of VLMs with the Environment", "source": "marker_v2", "marker_block_id": "/page/4/Code/3"}
27
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0026", "section": "3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION", "page_start": 5, "page_end": 5, "type": "Code", "text": "Input: Query x, IShuff le, Policy model πθ, External environment V, Maximum iteration steps T. Output: Final interaction trajectory y. 1: Initialize trajectory y ← ∅, step counter t ← 0. 2: while t < T do 3: Sample response yt ∼ πθ(· | x, IShuff le, y). 4: Append assistant response yt to trajectory: y ← y + yt. 5: if <code> </code> detected in yt then 6: Parse the Python code (e.g., Swap, Observe, Crop, Zoom), execute it in the environment V, and obtain feedback Ot. 7: else if <answer> </answer> detected in yt then 8: return final trajectory y. 9: end if 10: Append environment feedback Ot as user input: y ← y + Ot. 11: Update step counter t ← t + 1. 12: end while 13: return final trajectory y.", "source": "marker_v2", "marker_block_id": "/page/4/Code/4"}
28
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0027", "section": "3.2 DATA CONSTRUCTION", "page_start": 5, "page_end": 5, "type": "Text", "text": "In Section 3.1, we have introduced the jigsaw task and described how the model interacts with the environment to complete it. Based on this task design, we observe that the model (e.g., Qwen-2.5VL-7B) exhibits limited foundational capabilities, manifested in poor instruction-following and incorrect Python code generation, which hinders proper interaction with the environment and introduces substantial training noise. Directly applying reinforcement learning (RL) thus results in low learning efficiency. To bridge this gap and more effectively train our model, we employ Gemini 2.5 Pro 1 to collect expert trajectories for the cold-start phase, endowing Qwen-2.5VL-7B with basic interactive jigsaw-solving capabilities. For this purpose, we design structured prompts to guide Gemini 2.5 Pro in interacting with the environment to complete the jigsaw tasks (The prompt templates are provided in Appendix B. ).", "source": "marker_v2", "marker_block_id": "/page/4/Text/6"}
29
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0028", "section": "3.2 DATA CONSTRUCTION", "page_start": 5, "page_end": 5, "type": "Text", "text": "To further ensure data quality, we apply an additional filtering process: first, selecting samples where Gemini's outputs match the ground truth, and then manually verifying each interaction step in the correct samples to ensure rationality and consistency. To ensure that our model can perform diverse jigsaw reasoning actions during reinforcement learning, we carefully balance the training data. Specifically, trajectories are balanced with respect to both the number of steps (4–8) and the types of actions involved (e.g., Swap, Observe, Crop, Zoom). This design ensures that the model is sufficiently exposed to the full action space and learns to handle various interactions with the environment effectively. Overall, we curate a dataset comprising 1.6K high-quality reasoning trajectories for the jigsaw task.", "source": "marker_v2", "marker_block_id": "/page/4/Text/7"}
30
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0029", "section": "3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING", "page_start": 5, "page_end": 5, "type": "Text", "text": "Cold-start. During the cold-start phase, we leverage the 1.6K high-quality jigsaw-solving trajectories constructed in Section 3.2 to equip the model with basic instruction-following and Python code generation capabilities, ensuring effective interaction with the environment.", "source": "marker_v2", "marker_block_id": "/page/4/Text/9"}
31
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0030", "section": "3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING", "page_start": 5, "page_end": 5, "type": "Text", "text": "Reinforcement Learning. Our framework adopts Group Relative Policy Optimization (GRPO), which utilizes the average reward of multiple sampled outputs as a baseline, instead of relying on a learned value function. The policy model is optimized by maximizing the following objective:", "source": "marker_v2", "marker_block_id": "/page/4/Text/10"}
32
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0031", "section": "3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING", "page_start": 5, "page_end": 5, "type": "Footnote", "text": "1 The version is Gemini-2.5-Pro-Preview-05-06.", "source": "marker_v2", "marker_block_id": "/page/4/Footnote/11"}
33
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0032", "section": "3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING", "page_start": 6, "page_end": 6, "type": "Equation", "text": "\\mathcal{J}_{GRPO}(\\theta) = \\mathbb{E}_{x \\sim \\mathcal{D}, \\{y_i\\}_{i=1}^G \\sim \\pi_{\\text{old}}(\\cdot | x; \\mathcal{V})} \\left[ \\frac{1}{G} \\sum_{i=1}^G \\frac{1}{\\sum_{t=1}^{|y_i|} I(y_{i,t})} \\sum_{t=1:I(y_{i,t})=1}^{|y_i|} \\min \\left( \\frac{\\pi_{\\theta}(y_{i,t} \\mid x, y_{i,< t}; \\mathcal{V})}{\\pi_{\\text{old}}(y_{i,t} \\mid x, y_{i,< t}; \\mathcal{V})} \\hat{A}_{i,t}, \\right) \\right] \\\\ \\operatorname{clip} \\left( \\frac{\\pi_{\\theta}(y_{i,t} \\mid x, y_{i,< t}; \\mathcal{V})}{\\pi_{\\text{old}}(y_{i,t} \\mid x, y_{i,< t}; \\mathcal{V})}, 1 - \\epsilon, 1 + \\epsilon \\right) \\hat{A}_{i,t} \\right) - \\beta \\, \\mathbb{D}_{KL}(\\pi_{\\theta} \\parallel \\pi_{\\text{ref}}), \\tag{4}", "source": "marker_v2", "marker_block_id": "/page/5/Equation/1"}
34
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0033", "section": "3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING", "page_start": 6, "page_end": 6, "type": "Text", "text": "where the rollout module samples a group of trajectories \\{y_1, y_2, \\dots, y_G\\} from the old policy \\pi_{\\text{old}} for each input question x through interaction with the external environment \\mathcal{V} . The advantage term \\hat{A}_{i,t} is computed based on the relative rewards of outputs within each group. Our reward system comprises three components: an accuracy reward, a format reward, and a step reward. The total reward is computed as the sum of these components.", "source": "marker_v2", "marker_block_id": "/page/5/Text/2"}
35
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0034", "section": "3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING", "page_start": 6, "page_end": 6, "type": "ListGroup", "text": "Accuracy Reward: We compare the model's generated answer I_{Answer} with the ground truth I_{GT} . If all jigsaw image blocks are correctly placed, the accuracy reward is 1; otherwise, it is 0. Format Reward: The model receives a reward of 1 if its output follows the required structured format, with the reasoning process, code, and final answer correctly enclosed within the <think>, <code>, and <answer> tags, respectively. \\bullet Step Reward: We encourage the model to complete the jigsaw in as few steps as possible. For a 2 \\times 2 jigsaw, if each step swaps any two image blocks, at most three steps are theoretically required to place all blocks correctly. Excessive actions may lead the model to perform invalid steps, reducing the proportion of effective perception and reasoning. Furthermore, to prevent the model from prematurely hacking the step reward during early RL training, the step reward is applied only when the jigsaw is correctly completed. If the jigsaw is incorrect, the model is penalized by assigning the maximum step penalty. Formally, the step reward is defined as:", "source": "marker_v2", "marker_block_id": "/page/5/ListGroup/125"}
36
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0035", "section": "3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING", "page_start": 6, "page_end": 6, "type": "Equation", "text": "R_{\\text{step}} = \\lambda \\cdot \\left( \\mathbb{I}_{\\{R_{\\text{acc}}=1\\}} \\cdot step_{\\text{num}} + \\mathbb{I}_{\\{R_{\\text{acc}}=0\\}} \\cdot step_{\\text{max}} \\right), \\tag{5}", "source": "marker_v2", "marker_block_id": "/page/5/Equation/6"}
37
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0036", "section": "3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING", "page_start": 6, "page_end": 6, "type": "Text", "text": "where step_{num} is the number of steps the model actually used to complete the jigsaw, step_{max} is the maximum allowed steps, \\lambda denotes the step penalty coefficient, which is set to -0.05, and \\mathbb{I}_{\\{\\cdot\\}} is the indicator function. The final reward formulation is shown in Equation 6:", "source": "marker_v2", "marker_block_id": "/page/5/Text/7"}
38
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0037", "section": "3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING", "page_start": 6, "page_end": 6, "type": "Equation", "text": "R = \\alpha \\cdot R_{\\text{acc}} + \\beta \\cdot R_{\\text{format}} + \\gamma \\cdot R_{\\text{step}}, \\tag{6}", "source": "marker_v2", "marker_block_id": "/page/5/Equation/8"}
39
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0038", "section": "3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING", "page_start": 6, "page_end": 6, "type": "Text", "text": "where the coefficients \\alpha , \\beta , and \\gamma weight the relative importance of accuracy, format, and step rewards, respectively. In our experimental setup, \\alpha , \\beta , and \\gamma are set to 0.8, 0.2, and 1.0, respectively.", "source": "marker_v2", "marker_block_id": "/page/5/Text/9"}
40
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0039", "section": "4 EXPERIMENT", "page_start": 6, "page_end": 6, "type": "Text", "text": "In this section, we present a comprehensive experimental study. We first describe the implementation details, including datasets, training procedures, and inference settings (Sec. 4.1). We then evaluate the effectiveness of our agentic jigsaw interaction learning framework on both jigsaw-solving and general vision tasks (Sec. 4.2). Finally, we perform ablation studies to assess the impact of jigsaw data scale and to contrast the benefits of jigsaw data with those of general QA data (Sec. 4.3).", "source": "marker_v2", "marker_block_id": "/page/5/Text/11"}
41
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0040", "section": "4.1 IMPLEMENTATION DETAILS", "page_start": 6, "page_end": 6, "type": "Text", "text": "Datasets and Models. Our training data consist of two components corresponding to the cold-start and reinforcement learning (RL) stages. In the cold-start stage, we employ 1.6K high-quality jigsaw puzzle trajectories collected in Sec. 3.2 to endow the model with basic interactive jigsaw-solving skills. In the RL stage, we construct a dataset of 15.6K images spanning diverse domains, including high-resolution visual search, OCR-based text recognition, real-world scenes, and structured diagrams (see Appendix A for details). Each image is partitioned into 2 \\times 2 patches and randomly shuffled to ensure that all patches are initially misplaced. All experiments are conducted using Qwen2.5-VL-7B (Bai et al., 2025) as the base model.", "source": "marker_v2", "marker_block_id": "/page/5/Text/13"}
42
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0041", "section": "4.1 IMPLEMENTATION DETAILS", "page_start": 7, "page_end": 7, "type": "TableGroup", "text": "Table 1: Jigsaw Acc result. LN indicates the difficulty level, where N denotes the initial number of correct pieces. A smaller N corresponds to a more scrambled jigsaw and higher difficulty. The best results are highlighted in bold, and the second-best results are underlined. Model 2 × 2 3 × 3 L0 L1 L2 Avg. L0 L1 L2 L3 L4 L5 L6 L7 Avg. Random 4.5 3.7 4.2 4.1 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 GPT-4o 38.7 37.7 47.0 41.1 1.0 1.3 2.7 3.0 3.0 7.0 7.7 13.7 4.9 Gemini-2.5-Pro 43.3 46.3 49.7 46.4 7.0 8.7 9.7 10.0 11.0 15.0 23.0 32.0 14.6 MiMo-VL-7B-RL 11.3 14.3 17.0 14.2 0.3 0.0 0.0 0.0 0.3 0.3 1.0 3.7 0.7 InternVL3-8B 3.7 3.7 5.0 4.1 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 InternVL3-78B 3.3 4.3 3.0 3.5 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 Qwen2.5VL-72B 22.7 24.3 35.3 27.4 0.3 1.3 2.3 2.7 2.0 3.0 6.7 12.7 3.9 Qwen2.5VL-7B 6.3 6.0 16.3 9.5 0.0 0.0 0.0 0.0 0.0 0.7 1.3 1.3 0.4 +Cold-Start 12.0 32.0 22.0 22.0 0.0 0.3 0.0 0.0 0.0 0.7 0.3 0.0 0.2 +RL 78.7 83.0 86.7 82.8 5.0 7.0 11.0 14.0 17.7 25.3 38.0 48.0 20.8", "source": "marker_v2", "marker_block_id": "/page/6/TableGroup/389"}
43
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0042", "section": "4.1 IMPLEMENTATION DETAILS", "page_start": 7, "page_end": 7, "type": "Text", "text": "Training and Inference Setups. We conduct supervised fine-tuning (SFT) on llama-factory (Zheng et al., 2024) and reinforcement learning (RL) training on verl (Sheng et al., 2024) , both with fullparameter tuning. For inference and evaluation, we adopt VLMEvalKit (Duan et al., 2024) as the framework. To ensure a fair comparison, all evaluations on general downstream benchmarks are conducted in a strict single-turn setting following VLMEvalKit, fully consistent with the evaluation protocol of all baseline models. All experiments are performed on 8 NVIDIA A100 GPUs with 80GB memory each. Detailed training hyperparameters are provided in the Appendix D.", "source": "marker_v2", "marker_block_id": "/page/6/Text/3"}
44
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0043", "section": "4.2 MAIN RESULTS", "page_start": 7, "page_end": 7, "type": "Text", "text": "Significant Improvements on the Jigsaw Task. To comprehensively evaluate performance on the jigsaw task, we curate a test set of 300 images spanning diverse scenarios, including high-resolution visual search, OCR-based text recognition, and real-world scenes. Each image is partitioned into 2 × 2 and 3 × 3 grids, and the performance is measured using two metrics: Acc, which equals 1 only when all patches are correctly placed, and Score, defined as the ratio of correctly placed patches to the total number of patches. As shown in Table 1 and 2, the base model Qwen2.5-VL-7B performs poorly without training (achieving only 9.5% accuracy even under the simplest 2 × 2 setting) while the proprietary Gemini2.5-Pro and the larger Qwen2.5-VL-72B models also struggle on this task. After supervised fine-tuning (SFT) with 1.6K cold-start trajectories and reinforcement learning (RL) with 15.6K images, Qwen2.5-VL-7B achieves substantial gains: on the 2 × 2 setting, Acc improves from 9.5% to 82.8% and Score from 29.4% to 89.0%; on the more challenging 3 × 3 setting, it also generalizes well, with Acc increasing from 0.4% to 20.8% and Score from 31.1% to 62.1%, significantly surpassing Gemini2.5-Pro and Qwen2.5-VL-72B. These results demonstrate that modeling jigsaw solving as an interactive multi-turn dialogue enables the model to progressively enhance its visual perception and reasoning abilities, thereby achieving superior performance on the jigsaw task.", "source": "marker_v2", "marker_block_id": "/page/6/Text/5"}
45
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0044", "section": "4.2 MAIN RESULTS", "page_start": 7, "page_end": 7, "type": "Text", "text": "Generalization to Downstream Visual Tasks. The proposed agentic jigsaw interaction learning framework delivers substantial improvements on the jigsaw task. By leveraging explicit step-by-step feedback for iterative refinement, it enables the model to capture visual relations more effectively and to develop stronger reasoning capabilities.", "source": "marker_v2", "marker_block_id": "/page/6/Text/6"}
46
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0045", "section": "4.2 MAIN RESULTS", "page_start": 7, "page_end": 7, "type": "Text", "text": "To further assess whether jigsaw training enhances performance on general vision downstream tasks, we evaluate the model on 9 benchmarks: high-resolution image understanding (HRBench4K (Wang et al., 2025c) , HRBench8K (Wang et al., 2025c) , VStarBench (Wu & Xie, 2024) ), real-world scene understanding (MME-RealWorld (Zhang et al., 2024) , RealWorldQA (xAI, 2024) ), fine-grained visual recognition (MMVP (Tong et al., 2024) , BLINK (Fu et al., 2024) ), visual reasoning (MMMU (Yue et al., 2024) ), and hallucination evaluation (HallusionBench (Guan et al., 2024) ). As shown in Table 3, the jigsaw-trained model demonstrates strong visual generalization, achieving notable gains on HRBench4K (+4.2%), HRBench8K (+5.2%), and VStarBench (+4.2%). On average, it surpasses the base model Qwen2.5-VL-7B by 3.1% across all 9 benchmarks, providing compelling evidence", "source": "marker_v2", "marker_block_id": "/page/6/Text/7"}
47
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0046", "section": "4.2 MAIN RESULTS", "page_start": 8, "page_end": 8, "type": "TableGroup", "text": "Table 2: Jigsaw Score result. LN indicates the difficulty level, where N denotes the initial number of correct pieces. A smaller N corresponds to a more scrambled jigsaw and higher difficulty. The best results are highlighted in bold , and the second-best results are underlined. Model 2 : × 2 3 × 3 L0 L1 L2 Avg. L0 L1 L2 L3 L4 L5 L6 L7 Avg. Random 25.2 24.7 24.8 24.9 11.4 11.3 11.0 10.9 11.1 11.4 11.3 10.8 11.2 GPT-4o 54.8 59.1 63.2 59.0 25.9 27.3 34.1 36.3 42.3 48.0 54.4 64.0 41.5 Gemini-2.5-Pro 55.3 60.1 61.6 59.0 31.9 31.8 35.7 39.4 43.1 48.7 61.8 68.6 45.1 MiMo-VL-7B-RL 21.8 27.2 29.2 26.1 5.5 6.9 8.0 10.7 15.9 19.5 20.6 28.9 14.5 InternVL3-8B 24.6 24.3 25.3 24.7 7.5 10.1 15.7 16.8 20.3 25.1 28.2 31.7 19.4 InternVL3-78B 21.3 26.5 28.4 25.4 7.1 10.9 14.1 18.5 23.1 25.7 29.0 37.0 20.7 Qwen2.5VL-72B 40.7 46.1 56.1 47.6 21.7 25.6 30.8 33.4 34.7 40.0 46.3 55.2 36.0 Qwen2.5VL-7B 14.4 30.1 43.8 29.4 5.8 12.0 20.3 25.6 32.7 40.9 50.2 60.9 31.1 +Cold-Start +RL 40.6 86.4 45.6 88.7 45.3 91.9 43.8 89.0 6.5 41.1 6.9 46.8 7.8 52.6 10.2 58.6 10.4 65.3 13.2 71.0 15.7 77.9 17.0 83.6 11.0 62.1 Table 3: Main results. Performance comparison of different models on the 9 benchmarks. Abbreviations: MME-RW (MME-RealWorld-Lite), RWQA (RealWorldQA), HRB4K (HRBench4K), HRB8K (HRBench8K), Halbench (HallusionBench), MMMU (MMMU_VAL), Avg. denotes the average performance across all 9 benchmarks. \\Delta represents the relative performance gain achieved by RL compared to the base model Qwen2.5-VL-7B. The best results are highlighted in bold , and the second-best results are underlined.", "source": "marker_v2", "marker_block_id": "/page/7/TableGroup/67"}
48
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0047", "section": "4.2 MAIN RESULTS", "page_start": 8, "page_end": 8, "type": "Table", "text": "Model MME-RW RWQA HRB4K HRB8K VStar MMVP BLINK HalBench MMMU Avg. LLaVA-OV-7B 48.4 69.5 65.3 58.4 73.3 77.3 52.6 36.6 48.2 58.8 InternVL2.5-8B 48.2 69.4 68.0 63.3 71.7 75.7 54.9 49.9 53.6 61.6 InternVL2.5-78B 49.7 78.4 74.5 72.5 75.9 83.0 63.6 57.1 65.4 68.9 Qwen2.5-VL-72B 44.7 75.3 80.1 77.1 85.9 81.7 61.6 53.5 66.9 69.6 Qwen2.5-VL-7B 44.6 68.5 68.8 65.3 76.4 74.3 56.4 50.1 54.8 62.1 + Cold-Start 46.2 68.4 71.0 68.4 77.5 76.7 55.7 49.8 54.0 63.1 + RL 48.4 70.2 73.0 70.5 80.6 78.0 58.0 51.9 55.8 65.2 \\Delta (vs. Qwen2.5-VL-7B) +3.8 +1.7 +4.2 +5.2 +4.2 +3.7 +1.6 +1.8 +1.0 +3.1", "source": "marker_v2", "marker_block_id": "/page/7/Table/4"}
49
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0048", "section": "4.2 MAIN RESULTS", "page_start": 8, "page_end": 8, "type": "Text", "text": "that jigsaw-based training effectively enhances the model's ability to capture visual relations and strengthen reasoning skills, thereby improving its performance on general vision downstream tasks.", "source": "marker_v2", "marker_block_id": "/page/7/Text/5"}
50
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0049", "section": "4.3 ANALYSIS", "page_start": 8, "page_end": 8, "type": "Text", "text": "Impact of Jigsaw Training Data Scale. To investigate the effect of data scale, we systematically vary the amount of training data and evaluate model performance on both jigsaw task and general vision tasks. As shown in Figure 3, scaling up the data yields substantial performance gains: jigsaw task accuracy increases from 22.0% to 82.8%, while HRBench4K and RealWorldQA see improvements of 2.0% and 1.8%, respectively. These results highlight a clear data-to-performance trend, demonstrating that larger training sets translate directly into stronger perceptual and reasoning abilities. Crucially, because jigasw data in our reinforcement learning stage are generated via scalable programmatic synthesis, AGILE can easily leverage larger datasets. This scalability not only provides richer learning signals for continual capability growth but also offers a practical and sustainable solution to the scarcity of high-quality multimodal RL data.", "source": "marker_v2", "marker_block_id": "/page/7/Text/7"}
51
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0050", "section": "4.3 ANALYSIS", "page_start": 8, "page_end": 8, "type": "Text", "text": "Performance Comparison: Jigsaw vs. General QA Data. We compare the effectiveness of jigsaw data against conventional General QA data for model training. As shown in Figure 4, models trained with jigsaw data consistently outperform those trained with QA data across multiple benchmarks. Notably, combining 10K jigsaw samples with 10K QA samples yields superior performance on general vision benchmarks compared to training with 20K QA samples alone. These results highlight the unique role of jigsaw data in enhancing fundamental visual generalization, demonstrating the efficiency and controllability of jigsaw-solving as a proxy for visual perception and reasoning. A key advantage of our approach lies in the programmatic synthesis of jigsaw data, which enables effortless construction of large-scale, high-quality datasets, a process that is otherwise costly and", "source": "marker_v2", "marker_block_id": "/page/7/Text/8"}
52
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0051", "section": "4.3 ANALYSIS", "page_start": 9, "page_end": 9, "type": "FigureGroup", "text": "Figure 3: Impact of Training Data Scale. The left y-axis denotes the accuracies on HRBench4K and RealWorldQA, while the right y-axis corresponds to the accuracy on the jigsaw task.", "source": "marker_v2", "marker_block_id": "/page/8/FigureGroup/79"}
53
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0052", "section": "4.3 ANALYSIS", "page_start": 9, "page_end": 9, "type": "FigureGroup", "text": "Figure 4: Comparison with General QA Data. The total number of samples is consistently maintained at 20K across both experimental setups.", "source": "marker_v2", "marker_block_id": "/page/8/FigureGroup/80"}
54
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0053", "section": "4.3 ANALYSIS", "page_start": 9, "page_end": 9, "type": "Text", "text": "labor-intensive for QA data. Thus, jigsaw data not only serves as an effective alternative to General QA data but, in some cases, proves to be the superior choice. This finding underscores the potential of jigsaw tasks in alleviating the scarcity of multimodal RL data and opens a promising new direction for advancing multimodal model development.", "source": "marker_v2", "marker_block_id": "/page/8/Text/5"}
55
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0054", "section": "4.3 ANALYSIS", "page_start": 9, "page_end": 9, "type": "FigureGroup", "text": "Figure 5: Case Study. Jigsaw-solving reasoning and behaviors exhibited by our model.", "source": "marker_v2", "marker_block_id": "/page/8/FigureGroup/81"}
56
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0055", "section": "4.3 ANALYSIS", "page_start": 9, "page_end": 9, "type": "Text", "text": "Case Study. In Figure 5, we showcase several jigsaw-solving reasoning patterns and behaviors exhibited by our model. These cases illustrate the emergence of high-quality perceptual and reasoning strategies in the jigsaw task, including comprehensively interpreting the visual content of individual pieces to infer their spatial relations, employing cropping and zooming to examine and validate edge alignment, and reasoning about semantic consistency across pieces. Such behaviors demon-", "source": "marker_v2", "marker_block_id": "/page/8/Text/8"}
57
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0056", "section": "4.3 ANALYSIS", "page_start": 10, "page_end": 10, "type": "Text", "text": "strate human-like reasoning, thereby effectively enhancing the model's perceptual and reasoning capabilities.", "source": "marker_v2", "marker_block_id": "/page/9/Text/1"}
58
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0057", "section": "5 CONCLUSION", "page_start": 10, "page_end": 10, "type": "Text", "text": "In this work, we propose a novel agentic jigsaw interaction learning framework that formulates jigsaw solving as an interactive process to enhance visual perception and reasoning in large Vision-Language Models (VLMs). By treating jigsaw solving as an iterative interaction, the model progressively refines its perceptual and reasoning capabilities through exploration and feedback. Our approach significantly improves performance on jigsaw tasks of varying complexity and demonstrates strong generalization to broader general visual tasks, including visual question answering and scene understanding. Furthermore, by analyzing the performance gains from increasing the scale of jigsaw data and comparing it with general QA data, we show that jigsaw serve as an effective proxy for alleviating the scarcity of high-quality RL data, highlighting the potential of task-driven proxy training for stimulating complex multimodal perception and reasoning in VLMs.", "source": "marker_v2", "marker_block_id": "/page/9/Text/3"}
59
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0058", "section": "REFERENCES", "page_start": 11, "page_end": 11, "type": "ListGroup", "text": "Shuai Bai, Keqin Chen, Xuejing Liu, Jialin Wang, Wenbin Ge, Sibo Song, Kai Dang, Peng Wang, Shijie Wang, Jun Tang, et al. Qwen2. 5-vl technical report. arXiv preprint arXiv:2502.13923 , 2025. Fabio M Carlucci, Antonio D'Innocente, Silvia Bucci, Barbara Caputo, and Tatiana Tommasi. Domain generalization by solving jigsaw puzzles. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pp. 2229–2238, 2019. Jiangjie Chen, Qianyu He, Siyu Yuan, Aili Chen, Zhicheng Cai, Weinan Dai, Hongli Yu, Qiying Yu, Xuefeng Li, Jiaze Chen, et al. Enigmata: Scaling logical reasoning in large language models with synthetic verifiable puzzles. arXiv preprint arXiv:2505.19914 , 2025a. Liang Chen, Lei Li, Haozhe Zhao, Yifan Song, and Vinci. R1-v: Reinforcing super generalization ability in vision-language models with less than $3. R1-V , 2025b. Accessed: 2025-02-02. Lin Chen, Jinsong Li, Xiaoyi Dong, Pan Zhang, Conghui He, Jiaqi Wang, Feng Zhao, and Dahua Lin. Sharegpt4v: Improving large multi-modal models with better captions. In European Confer ence on Computer Vision , pp. 370–387. Springer, 2024a. Lin Chen, Jinsong Li, Xiaoyi Dong, Pan Zhang, Yuhang Zang, Zehui Chen, Haodong Duan, Jiaqi Wang, Yu Qiao, Dahua Lin, et al. Are we on the right way for evaluating large vision-language models? Advances in Neural Information Processing Systems , 37:27056–27087, 2024b. Lin Chen, Xilin Wei, Jinsong Li, Xiaoyi Dong, Pan Zhang, Yuhang Zang, Zehui Chen, Haodong Duan, Zhenyu Tang, Li Yuan, et al. Sharegpt4video: Improving video understanding and generation with better captions. Advances in Neural Information Processing Systems , 37:19472–19495, 2024c. Yingyi Chen, Xi Shen, Yahui Liu, Qinghua Tao, and Johan AK Suykens. Jigsaw-vit: Learning jigsaw puzzles in vision transformer. Pattern Recognition Letters , 166:53–60, 2023. Gheorghe Comanici, Eric Bieber, Mike Schaekermann, Ice Pasupat, Noveen Sachdeva, Inderjit Dhillon, Marcel Blistein, Ori Ram, Dan Zhang, Evan Rosen, et al. Gemini 2.5: Pushing the frontier with advanced reasoning, multimodality, long context, and next generation agentic capabilities. arXiv preprint arXiv:2507.06261 , 2025. Qingxiu Dong, Li Dong, Yao Tang, Tianzhu Ye, Yutao Sun, Zhifang Sui, and Furu Wei. Reinforcement pre-training. arXiv preprint arXiv:2506.08007 , 2025. Haodong Duan, Junming Yang, Yuxuan Qiao, Xinyu Fang, Lin Chen, Yuan Liu, Xiaoyi Dong, Yuhang Zang, Pan Zhang, Jiaqi Wang, et al. Vlmevalkit: An open-source toolkit for evaluating large multi-modality models. In Proceedings of the 32nd ACM International Conference on Multimedia , pp. 11198–11201, 2024. Zhen Fang, Zhuoyang Liu, Jiaming Liu, Hao Chen, Yu Zeng, Shiting Huang, Zehui Chen, Lin Chen, Shanghang Zhang, and Feng Zhao. Dualvla: Building a generalizable embodied agent via partial decoupling of reasoning and action. arXiv preprint arXiv:2511.22134 , 2025. Xingyu Fu, Yushi Hu, Bangzheng Li, Yu Feng, Haoyu Wang, Xudong Lin, Dan Roth, Noah A Smith, Wei-Chiu Ma, and Ranjay Krishna. Blink: Multimodal large language models can see but not perceive. In European Conference on Computer Vision , pp. 148–166. Springer, 2024. Tianrui Guan, Fuxiao Liu, Xiyang Wu, Ruiqi Xian, Zongxia Li, Xiaoyu Liu, Xijun Wang, Lichang Chen, Furong Huang, Yaser Yacoob, et al. Hallusionbench: an advanced diagnostic suite for entangled language hallucination and visual illusion in large vision-language models. In Pro ceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pp. 14375– 14385, 2024. Daya Guo, Dejian Yang, Haowei Zhang, Junxiao Song, Ruoyu Zhang, Runxin Xu, Qihao Zhu, Shirong Ma, Peiyi Wang, Xiao Bi, et al. Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning. arXiv preprint arXiv:2501.12948 , 2025.", "source": "marker_v2", "marker_block_id": "/page/10/ListGroup/209"}
60
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0059", "section": "REFERENCES", "page_start": 12, "page_end": 12, "type": "ListGroup", "text": "Ruiyan Han, Zhen Fang, XinYu Sun, Yuchen Ma, Ziheng Wang, Yu Zeng, Zehui Chen, Lin Chen, Wenxuan Huang, Wei-Jie Xu, et al. Unicorn: Towards self-improving unified multimodal models through self-generated supervision. arXiv preprint arXiv:2601.03193 , 2026. Shiting Huang, Zhen Fang, Zehui Chen, Siyu Yuan, Junjie Ye, Yu Zeng, Lin Chen, Qi Mao, and Feng Zhao. Critictool: Evaluating self-critique capabilities of large language models in toolcalling error scenarios. arXiv preprint arXiv:2506.13977 , 2025a. Shiting Huang, Zecheng Li, Yu Zeng, Qingnan Ren, Zhen Fang, Qisheng Su, Kou Shi, Lin Chen, Zehui Chen, and Feng Zhao. Internalizing meta-experience into memory for guided reinforcement learning in large language models. arXiv preprint arXiv:2602.10224 , 2026a. Wenxuan Huang, Shuang Chen, Zheyong Xie, Shaosheng Cao, Shixiang Tang, Yufan Shen, Qingyu Yin, Wenbo Hu, Xiaoman Wang, Yuntian Tang, et al. Interleaving reasoning for better text-toimage generation. arXiv preprint arXiv:2509.06945 , 2025b. Wenxuan Huang, Bohan Jia, Zijie Zhai, Shaosheng Cao, Zheyu Ye, Fei Zhao, Zhe Xu, Yao Hu, and Shaohui Lin. Vision-r1: Incentivizing reasoning capability in multimodal large language models. arXiv preprint arXiv:2503.06749 , 2025c. Wenxuan Huang, Yu Zeng, Qiuchen Wang, Zhen Fang, Shaosheng Cao, Zheng Chu, Qingyu Yin, Shuang Chen, Zhenfei Yin, Lin Chen, et al. Vision-deepresearch: Incentivizing deepresearch capability in multimodal large language models. arXiv preprint arXiv:2601.22060 , 2026b. Aaron Hurst, Adam Lerer, Adam P Goucher, Adam Perelman, Aditya Ramesh, Aidan Clark, AJ Ostrow, Akila Welihinda, Alan Hayes, Alec Radford, et al. Gpt-4o system card. arXiv preprint arXiv:2410.21276 , 2024. Bohao Li, Yuying Ge, Yi Chen, Yixiao Ge, Ruimao Zhang, and Ying Shan. Seed-bench-2-plus: Benchmarking multimodal large language models with text-rich visual comprehension. arXiv preprint arXiv:2404.16790 , 2024a. Xiaotong Li, Fan Zhang, Haiwen Diao, Yueze Wang, Xinlong Wang, and Lingyu Duan. Densefusion-1m: Merging vision experts for comprehensive multimodal perception. Advances in Neural Information Processing Systems , 37:18535–18556, 2024b. Tsung-Yi Lin, Michael Maire, Serge Belongie, James Hays, Pietro Perona, Deva Ramanan, Piotr Dollar, and C Lawrence Zitnick. Microsoft coco: Common objects in context. In ´ European Conference on Computer Vision , pp. 740–755. Springer, 2014. Pan Lu, Hritik Bansal, Tony Xia, Jiacheng Liu, Chunyuan Li, Hannaneh Hajishirzi, Hao Cheng, Kai-Wei Chang, Michel Galley, and Jianfeng Gao. Mathvista: Evaluating mathematical reasoning of foundation models in visual contexts. arXiv preprint arXiv:2310.02255 , 2023. Xiaoxiao Ma, Haibo Qiu, Guohui Zhang, Zhixiong Zeng, Siqi Yang, Lin Ma, and Feng Zhao. Stage: Stable and generalizable grpo for autoregressive image generation. arXiv preprint arXiv:2509.25027 , 2025. Minesh Mathew, Viraj Bagal, Ruben Tito, Dimosthenis Karatzas, Ernest Valveny, and CV Jawahar. ` Infographicvqa. In Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision , pp. 1697–1706, 2022. Fanqing Meng, Lingxiao Du, Zongkai Liu, Zhixiang Zhou, Quanfeng Lu, Daocheng Fu, Botian Shi, Wenhai Wang, Junjun He, Kaipeng Zhang, et al. Mm-eureka: Exploring visual aha moment with rule-based large-scale reinforcement learning. CoRR , 2025. Yaning Pan, Qianqian Xie, Guohui Zhang, Zekun Wang, Yongqian Wen, Yuanxing Zhang, Haoxuan Hu, Zhiyu Pan, Yibing Huang, Zhidong Gan, et al. Mt-video-bench: A holistic video understanding benchmark for evaluating multimodal llms in multi-turn dialogues. arXiv preprint arXiv:2510.17722 , 2025. Yukun Qi, Yiming Zhao, Yu Zeng, Xikun Bao, Wenxuan Huang, Lin Chen, Zehui Chen, Jie Zhao, Zhongang Qi, and Feng Zhao. Vcr-bench: A comprehensive evaluation framework for video chain-of-thought reasoning. arXiv preprint arXiv:2504.07956 , 2025.", "source": "marker_v2", "marker_block_id": "/page/11/ListGroup/214"}
61
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0060", "section": "REFERENCES", "page_start": 13, "page_end": 13, "type": "ListGroup", "text": "Rafael Rafailov, Archit Sharma, Eric Mitchell, Christopher D Manning, Stefano Ermon, and Chelsea Finn. Direct preference optimization: Your language model is secretly a reward model. Advances in Neural Information Processing Systems , 36:53728–53741, 2023. Qingnan Ren, Shiting Huang, Zhen Fang, Zehui Chen, Lin Chen, Lijun Li, and Feng Zhao. Adora: Training reasoning models with dynamic advantage estimation on reinforcement learning. arXiv preprint arXiv:2602.10019 , 2026. John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347 , 2017. Zhihong Shao, Peiyi Wang, Qihao Zhu, Runxin Xu, Junxiao Song, Xiao Bi, Haowei Zhang, Mingchuan Zhang, YK Li, Yang Wu, et al. Deepseekmath: Pushing the limits of mathematical reasoning in open language models. arXiv preprint arXiv:2402.03300 , 2024. Guangming Sheng, Chi Zhang, Zilingfeng Ye, Xibin Wu, Wang Zhang, Ru Zhang, Yanghua Peng, Haibin Lin, and Chuan Wu. Hybridflow: A flexible and efficient rlhf framework. arXiv preprint arXiv: 2409.19256 , 2024. Amanpreet Singh, Vivek Natarajan, Meet Shah, Yu Jiang, Xinlei Chen, Dhruv Batra, Devi Parikh, and Marcus Rohrbach. Towards vqa models that can read. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pp. 8317–8326, 2019. Jingqi Tong, Jixin Tang, Hangcheng Li, Yurong Mou, Ming Zhang, Jun Zhao, Yanbo Wen, Fan Song, Jiahao Zhan, Yuyang Lu, et al. Code2logic: Game-code-driven data synthesis for enhancing vlms general reasoning. arXiv preprint arXiv:2505.13886 , 2025. Shengbang Tong, Zhuang Liu, Yuexiang Zhai, Yi Ma, Yann LeCun, and Saining Xie. Eyes wide shut? exploring the visual shortcomings of multimodal llms. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pp. 9568–9578, 2024. Qiuchen Wang, Ruixue Ding, Zehui Chen, Weiqi Wu, Shihang Wang, Pengjun Xie, and Feng Zhao. Vidorag: Visual document retrieval-augmented generation via dynamic iterative reasoning agents. arXiv preprint arXiv:2502.18017 , 2025a. Qiuchen Wang, Ruixue Ding, Yu Zeng, Zehui Chen, Lin Chen, Shihang Wang, Pengjun Xie, Fei Huang, and Feng Zhao. Vrag-rl: Empower vision-perception-based rag for visually rich information understanding via iterative reasoning with reinforcement learning. arXiv preprint arXiv:2505.22019 , 2025b. Qiuchen Wang, Shihang Wang, Yu Zeng, Qiang Zhang, Fanrui Zhang, Zhuoning Guo, Bosi Zhang, Wenxuan Huang, Lin Chen, Zehui Chen, et al. Vimrag: Navigating massive visual context in retrieval-augmented generation via multimodal memory graph. arXiv preprint arXiv:2602.12735 , 2026. Wenbin Wang, Liang Ding, Minyan Zeng, Xiabin Zhou, Li Shen, Yong Luo, Wei Yu, and Dacheng Tao. Divide, conquer and combine: A training-free framework for high-resolution image perception in multimodal large language models. In Proceedings of the AAAI Conference on Artificial Intelligence , volume 39, pp. 7907–7915, 2025c. Xiyao Wang, Zhengyuan Yang, Chao Feng, Yongyuan Liang, Yuhang Zhou, Xiaoyu Liu, Ziyi Zang, Ming Li, Chung-Ching Lin, Kevin Lin, et al. Vicrit: A verifiable reinforcement learning proxy task for visual perception in vlms. arXiv preprint arXiv:2506.10128 , 2025d. Zifu Wang, Junyi Zhu, Bo Tang, Zhiyu Li, Feiyu Xiong, Jiaqian Yu, and Matthew B Blaschko. Jigsaw-r1: A study of rule-based visual reinforcement learning with jigsaw puzzles. arXiv preprint arXiv:2505.23590 , 2025e. Penghao Wu and Saining Xie. V?: Guided visual search as a core mechanism in multimodal llms. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pp. 13084–13094, 2024. xAI. Grok-1.5 Vision Preview. , 2024.", "source": "marker_v2", "marker_block_id": "/page/12/ListGroup/210"}
62
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0061", "section": "REFERENCES", "page_start": 14, "page_end": 14, "type": "ListGroup", "text": "Tian Xie, Zitian Gao, Qingnan Ren, Haoming Luo, Yuqian Hong, Bryan Dai, Joey Zhou, Kai Qiu, Zhirong Wu, and Chong Luo. Logic-rl: Unleashing llm reasoning with rule-based reinforcement learning. arXiv preprint arXiv:2502.14768 , 2025a. Yunfei Xie, Yinsong Ma, Shiyi Lan, Alan Yuille, Junfei Xiao, and Chen Wei. Play to generalize: Learning to reason through game play. arXiv preprint arXiv:2506.08011 , 2025b. Yi Yang, Xiaoxuan He, Hongkun Pan, Xiyan Jiang, Yan Deng, Xingtao Yang, Haoyu Lu, Dacheng Yin, Fengyun Rao, Minfeng Zhu, et al. R1-onevision: Advancing generalized multimodal reasoning through cross-modal formalization. arXiv preprint arXiv:2503.10615 , 2025. En Yu, Kangheng Lin, Liang Zhao, Jisheng Yin, Yana Wei, Yuang Peng, Haoran Wei, Jianjian Sun, Chunrui Han, Zheng Ge, et al. Perception-r1: Pioneering perception policy with reinforcement learning. arXiv preprint arXiv:2504.07954 , 2025. Xiang Yue, Yuansheng Ni, Kai Zhang, Tianyu Zheng, Ruoqi Liu, Ge Zhang, Samuel Stevens, Dongfu Jiang, Weiming Ren, Yuxuan Sun, et al. Mmmu: A massive multi-discipline multimodal understanding and reasoning benchmark for expert agi. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pp. 9556–9567, 2024. Yu Zeng, Yukun Qi, Yiming Zhao, Xikun Bao, Lin Chen, Zehui Chen, Shiting Huang, Jie Zhao, and Feng Zhao. Enhancing large vision-language models with ultra-detailed image caption generation. In Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing , pp. 26703–26729, 2025. Yu Zeng, Wenxuan Huang, Zhen Fang, Shuang Chen, Yufan Shen, Yishuo Cai, Xiaoman Wang, Zhenfei Yin, Lin Chen, Zehui Chen, et al. Vision-deepresearch benchmark: Rethinking visual and textual search for multimodal large language models. arXiv preprint arXiv:2602.02185 , 2026. Guohui Zhang, Jiangtong Tan, Linjiang Huang, Zhonghang Yuan, Mingde Yao, Jie Huang, and Feng Zhao. Infoscale: Unleashing training-free variable-scaled image generation via effective utilization of information. arXiv preprint arXiv:2509.01421 , 2025a. Guohui Zhang, Hu Yu, Xiaoxiao Ma, Yaning Pan, Hang Xu, and Feng Zhao. Maskfocus: Focusing policy optimization on critical steps for masked image generation. arXiv preprint arXiv:2512.18766 , 2025b. Guohui Zhang, Hu Yu, Xiaoxiao Ma, JingHao Zhang, Yaning Pan, Mingde Yao, Jie Xiao, Linjiang Huang, and Feng Zhao. Group critical-token policy optimization for autoregressive image generation. arXiv preprint arXiv:2509.22485 , 2025c. Yi-Fan Zhang, Huanyu Zhang, Haochen Tian, Chaoyou Fu, Shuangqing Zhang, Junfei Wu, Feng Li, Kun Wang, Qingsong Wen, Zhang Zhang, et al. Mme-realworld: Could your multimodal llm challenge high-resolution real-world scenarios that are difficult for humans? arXiv preprint arXiv:2408.13257 , 2024. Yiming Zhao, Yu Zeng, Yukun Qi, YaoYang Liu, Lin Chen, Zehui Chen, Xikun Bao, Jie Zhao, and Feng Zhao. V2p-bench: Evaluating video-language understanding with visual prompts for better human-model interaction. arXiv preprint arXiv:2503.17736 , 2025. Yaowei Zheng, Richong Zhang, Junhao Zhang, Yanhan Ye, Zheyan Luo, Zhangchi Feng, and Yongqiang Ma. Llamafactory: Unified efficient fine-tuning of 100+ language models. arXiv preprint arXiv:2403.13372 , 2024. Ziwei Zheng, Michael Yang, Jack Hong, Chenxiao Zhao, Guohai Xu, Le Yang, Chao Shen, and Xing Yu. Deepeyes: Incentivizing\" thinking with images\" via reinforcement learning. arXiv preprint arXiv:2505.14362 , 2025. Jinguo Zhu, Weiyun Wang, Zhe Chen, Zhaoyang Liu, Shenglong Ye, Lixin Gu, Hao Tian, Yuchen Duan, Weijie Su, Jie Shao, et al. Internvl3: Exploring advanced training and test-time recipes for open-source multimodal models. arXiv preprint arXiv:2504.10479 , 2025.", "source": "marker_v2", "marker_block_id": "/page/13/ListGroup/203"}
63
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0062", "section": "A DATA DISTRIBUTION", "page_start": 15, "page_end": 15, "type": "Text", "text": "As shown in Figure 6, our RL training corpus for jigsaw is derived from multiple sources, covering a diverse range of visual scenarios:", "source": "marker_v2", "marker_block_id": "/page/14/Text/3"}
64
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0063", "section": "A DATA DISTRIBUTION", "page_start": 15, "page_end": 15, "type": "FigureGroup", "text": "Figure 6: Distribution of jigsaw RL training data.", "source": "marker_v2", "marker_block_id": "/page/14/FigureGroup/165"}
65
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0064", "section": "A DATA DISTRIBUTION", "page_start": 15, "page_end": 15, "type": "ListGroup", "text": "High-resolution and visual search images (39.7%, 6.2K samples): To enhance the model's fine-grained perception in high-resolution images, we collect data from the VStar (Wu & Xie, 2024) dataset, high-resolution natural scenes in DeepEyes (Zheng et al., 2025) , and selected samples from HRBench (Wang et al., 2025c) . This improves the model's ability to capture subtle visual cues and recognize small object attributes. Text recognition and structured scenes (33.3%, 5.2K samples): To strengthen the model's capacity for text perception and recognition, we include text-rich images from diverse domains, such as the TextVQA (Singh et al., 2019) training set, InfoVQA (Mathew et al., 2022) book covers and posters, as well as structured visual reasoning tasks involving tables and subject-specific charts (Yue et al., 2024; Li et al., 2024a; Chen et al., 2024b) . Dense natural and real-world scenes (26.9%, 4.2K samples): To enhance the model's recognition and understanding in complex and real-world environments, we collected images from COCO2017 (Lin et al., 2014) and RealWorldQA (xAI, 2024) datasets.", "source": "marker_v2", "marker_block_id": "/page/14/ListGroup/166"}
66
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0065", "section": "B PROMPTS", "page_start": 15, "page_end": 15, "type": "Text", "text": "In this section, we present the prompt used to collect high-quality jigsaw trajectories, as illustrated in Figure B. The same prompt is employed to prompt the Qwen2.5-VL-7B model during both the SFT and RL stages.", "source": "marker_v2", "marker_block_id": "/page/14/Text/10"}
67
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0066", "section": "System Prompt", "page_start": 15, "page_end": 15, "type": "Text", "text": "You are a skilled and experienced puzzle master. I will divide an image evenly into 2 × 2 grid, get 4 image blocks, and then shuffle them. The image blocks will be labeled A, B, C, and D. Initially, the image blocks are named and arranged in the following order:", "source": "marker_v2", "marker_block_id": "/page/14/Text/13"}
68
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0067", "section": "System Prompt", "page_start": 15, "page_end": 15, "type": "Equation", "text": "[\"A\", \"B\", \"C\", \"D\"]", "source": "marker_v2", "marker_block_id": "/page/14/Equation/14"}
69
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0068", "section": "System Prompt", "page_start": 15, "page_end": 15, "type": "Text", "text": "That is, the initial layout of the image blocks is as follows:", "source": "marker_v2", "marker_block_id": "/page/14/Text/15"}
70
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0069", "section": "System Prompt", "page_start": 15, "page_end": 15, "type": "Text", "text": "A B", "source": "marker_v2", "marker_block_id": "/page/14/Text/16"}
71
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0070", "section": "System Prompt", "page_start": 15, "page_end": 15, "type": "Text", "text": "C D", "source": "marker_v2", "marker_block_id": "/page/14/Text/17"}
72
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0071", "section": "Your Task", "page_start": 16, "page_end": 16, "type": "Text", "text": "Your goal is to reconstruct the original image by observing and analyzing the visual content between the image blocks. Pay attention to the details in each image block and establish visual connections between adjacent image blocks to achieve the goal of completing the puzzle correctly. For example:", "source": "marker_v2", "marker_block_id": "/page/15/Text/1"}
73
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0072", "section": "Your Task", "page_start": 16, "page_end": 16, "type": "ListGroup", "text": "Continuity of text information: If the image contains text or logos, observe whether the text continues naturally between adjacent blocks (e.g., characters connect smoothly and the font direction is consistent). This is one of the key clues to determine whether the image blocks should be adjacent. Structure and shape consistency: Identify possible structural elements in the image (such as buildings, roads, object outlines, etc.), and infer which image blocks should be visually spliced together to form a complete and reasonable shape. Continuation of edge visual details: Observe the color, texture or pattern (such as sky, grass, lines or shadows) at the edge of the image block to determine whether it can be visually connected to the adjacent block naturally. Direction and angle consistency: Pay attention to the direction of image elements (such as human faces, object directions, text angles, etc.) to ensure the rationality of the overall visual direction of the image.", "source": "marker_v2", "marker_block_id": "/page/15/ListGroup/228"}
74
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0073", "section": "Your Task", "page_start": 16, "page_end": 16, "type": "Text", "text": "You can swap any two image blocks each time to achieve the correct layout.", "source": "marker_v2", "marker_block_id": "/page/15/Text/6"}
75
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0074", "section": "Inference Process", "page_start": 16, "page_end": 16, "type": "Text", "text": "1. State Representation: At each step, you need to maintain a \"state\" list representing current arrangement of image blocks.", "source": "marker_v2", "marker_block_id": "/page/15/Text/8"}
76
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0075", "section": "Inference Process", "page_start": 16, "page_end": 16, "type": "Text", "text": "Example:", "source": "marker_v2", "marker_block_id": "/page/15/Text/9"}
77
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0076", "section": "Inference Process", "page_start": 16, "page_end": 16, "type": "Code", "text": "state = [\"B\", \"C\", \"A\", \"D\"]", "source": "marker_v2", "marker_block_id": "/page/15/Code/10"}
78
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0077", "section": "Inference Process", "page_start": 16, "page_end": 16, "type": "Text", "text": "This corresponds to: Top left (index 0): B Top right (index 1): C Bottom left (index 2): A Bottom right (index 3): D", "source": "marker_v2", "marker_block_id": "/page/15/Text/11"}
79
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0078", "section": "Inference Process", "page_start": 16, "page_end": 16, "type": "ListGroup", "text": "2. Visual Analysis: Carefully analyze the image patch content and visual details to determine the image patch location. To better complete the puzzle task, you can use additional image operations to enhance visual perception: Crop the image area of observation image to more closely observe the visual correlation between different regions in multiple image patches. Used to find clues during the puzzle or verify whether the puzzle is complete (For example: it looks like the puzzle is not completely fixed, maybe because of the lower left and upper right corners of observation image 2. I need to crop these two areas separately to get some visual information to further judge. First I will crop the lower left area <code>...</code>By observing the cropped lower left area, it shows that part of the text \"OF H\" may be related to the \"appyness\" text in the upper right corner. To further verify and manage, I will now crop the upper right image <code>...</code>. By observing the cropped image, I will swap image blocks B and C...) Zoom area to enlarge visual details (selectively observe the details of the cropped image).", "source": "marker_v2", "marker_block_id": "/page/15/ListGroup/229"}
80
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0079", "section": "Inference Process", "page_start": 16, "page_end": 16, "type": "Text", "text": "These operations can help you make more informed decisions.", "source": "marker_v2", "marker_block_id": "/page/15/Text/15"}
81
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0080", "section": "Inference Process", "page_start": 17, "page_end": 17, "type": "Text", "text": "3. Move Execution: After making a decision, generate a Python code snippet to swap tiles. Use the 'observation(state)' function to get the updated layout image for the next step.", "source": "marker_v2", "marker_block_id": "/page/16/Text/1"}
82
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0081", "section": "Available Image Operations", "page_start": 17, "page_end": 17, "type": "Text", "text": "You can use the following Python functions to assist in inference:", "source": "marker_v2", "marker_block_id": "/page/16/Text/3"}
83
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0082", "section": "Available Image Operations", "page_start": 17, "page_end": 17, "type": "Text", "text": "1. Crop a region from an image using normalized coordinates (from 0 to 1).", "source": "marker_v2", "marker_block_id": "/page/16/Text/4"}
84
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0083", "section": "Available Image Operations", "page_start": 17, "page_end": 17, "type": "Code", "text": "crop_box = [x1, y1, x2, y2] crop_image_{id} = crop(image, crop_box)", "source": "marker_v2", "marker_block_id": "/page/16/Code/5"}
85
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0084", "section": "Available Image Operations", "page_start": 17, "page_end": 17, "type": "Text", "text": "2. Zoom in an image by a specified factor (e.g., 1.5× zoom means 150% zoom).", "source": "marker_v2", "marker_block_id": "/page/16/Text/6"}
86
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0085", "section": "Available Image Operations", "page_start": 17, "page_end": 17, "type": "Code", "text": "zoom_image_{id} = zoom(image, zoom_factor)", "source": "marker_v2", "marker_block_id": "/page/16/Code/7"}
87
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0086", "section": "Available Image Operations", "page_start": 17, "page_end": 17, "type": "Text", "text": "3. Swap tiles (e.g., top left and bottom left) and call observation function to see the jigsaw progress.", "source": "marker_v2", "marker_block_id": "/page/16/Text/8"}
88
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0087", "section": "Available Image Operations", "page_start": 17, "page_end": 17, "type": "Code", "text": "state[0], state[2] = state[2], state[0] observation_image_{id} = observation(state)", "source": "marker_v2", "marker_block_id": "/page/16/Code/9"}
89
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0088", "section": "Available Image Operations", "page_start": 17, "page_end": 17, "type": "Text", "text": "Replace \"id\" with an integer to uniquely identify each operation result. The \"image\" parameter must point to an existing image (e.g., \"observation image 1\", \"crop image 1\", etc.).", "source": "marker_v2", "marker_block_id": "/page/16/Text/10"}
90
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0089", "section": "Format", "page_start": 17, "page_end": 17, "type": "Text", "text": "All Python code must be enclosed in <code>...</code>tags.", "source": "marker_v2", "marker_block_id": "/page/16/Text/12"}
91
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0090", "section": "Format", "page_start": 17, "page_end": 17, "type": "Text", "text": "All reasoning steps must be enclosed in <think>...</think>tags.", "source": "marker_v2", "marker_block_id": "/page/16/Text/13"}
92
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0091", "section": "Format", "page_start": 17, "page_end": 17, "type": "Text", "text": "The final answer must be enclosed in <answer>...</answer>tags.", "source": "marker_v2", "marker_block_id": "/page/16/Text/14"}
93
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0092", "section": "Important", "page_start": 17, "page_end": 17, "type": "ListGroup", "text": "1. For both swap and image manipulation, always explain why you are doing this before generating code. 2. Stop as soon as you generate a code snippet. I will execute the code and return the generated image for the next step. 3. You can only perform one image operation or observation of the puzzle state per turn. 4. Final answer: When you are sure that the puzzle is fully reconstructed (all edges are aligned and the visual information is complete and continuous), return the final \"state\" list in the \"<answer>\" block. 5. Please pay close attention to the rationality of your cropping area and ensure that the cropped area is a reasonable criterion for completing the puzzle.", "source": "marker_v2", "marker_block_id": "/page/16/ListGroup/223"}
94
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0093", "section": "User Prompt", "page_start": 17, "page_end": 17, "type": "Text", "text": "The four images are respectively labeled A, B, C, and D. Please complete the jigsaw.", "source": "marker_v2", "marker_block_id": "/page/16/Text/22"}
95
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0094", "section": "User Prompt", "page_start": 17, "page_end": 17, "type": "Text", "text": "Image A: <image>Image B: <image>Image C: <image>Image D: <image>", "source": "marker_v2", "marker_block_id": "/page/16/Text/23"}
96
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0095", "section": "C CASE STUDY", "page_start": 18, "page_end": 18, "type": "Text", "text": "In Figures 7 - 10, we present representative high-quality jigsaw trajectories collected to illustrate how our model performs reasoning and interacts with the environment. These cases specifically demonstrate: (1) how the model generates Python code to interact with the environment, such as swapping any two jigsaw pieces, observing jigsaw progress, and cropping/zooming in on regions for finer visual inspection; and (2) how the environment provides feedback that guides the model's subsequent reasoning.", "source": "marker_v2", "marker_block_id": "/page/17/Text/2"}
97
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0096", "section": "C CASE STUDY", "page_start": 18, "page_end": 18, "type": "FigureGroup", "text": "Figure 7: Representative high-quality jigsaw trajectory case 1 (part 1).", "source": "marker_v2", "marker_block_id": "/page/17/FigureGroup/43"}
98
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0097", "section": "C CASE STUDY", "page_start": 19, "page_end": 19, "type": "FigureGroup", "text": "Figure 8: Representative high-quality jigsaw trajectory case 1 (part 2).", "source": "marker_v2", "marker_block_id": "/page/18/FigureGroup/12"}
99
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0098", "section": "C CASE STUDY", "page_start": 20, "page_end": 20, "type": "FigureGroup", "text": "Figure 9: Representative high-quality jigsaw trajectory case 2 (part 1).", "source": "marker_v2", "marker_block_id": "/page/19/FigureGroup/12"}
100
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0099", "section": "C CASE STUDY", "page_start": 21, "page_end": 21, "type": "FigureGroup", "text": "Figure 10: Representative high-quality jigsaw trajectory case 2 (part 2).", "source": "marker_v2", "marker_block_id": "/page/20/FigureGroup/30"}
101
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0100", "section": "D THE IMPLEMENTATION OF TRAINING", "page_start": 21, "page_end": 21, "type": "Text", "text": "The detailed training hyperparameters are provided in Tables 4 and 5, and all experiments are conducted on 8 NVIDIA A100 GPUs, each equipped with 80 GB of memory.", "source": "marker_v2", "marker_block_id": "/page/20/Text/4"}
102
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0101", "section": "D THE IMPLEMENTATION OF TRAINING", "page_start": 22, "page_end": 22, "type": "TableGroup", "text": "Table 4: Key hyperparameters for SFT. Name Value Finetuning type Full Freeze vision tower True Freeze multi-modal projector True Freeze language model False Cutoff len 16384 Image max pixels 401408 Epochs 2.0 Batch size 32 Gradient accumulation steps 4 Learning rate 1.0e-5 LR scheduler type cosine Warmup ratio 0.1", "source": "marker_v2", "marker_block_id": "/page/21/TableGroup/204"}
103
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0102", "section": "D THE IMPLEMENTATION OF TRAINING", "page_start": 22, "page_end": 22, "type": "TableGroup", "text": "Table 5: Key hyperparameters for RL. Name Value Max turns 5 Rollout num 8 Train batch size 64 Mini batch size 64 Micro batch size per GPU 2 Learning rate 2.0e-6 KL loss coefficient 0.0 Total epochs 1 Max prompt length 8192 Single response max tokens 2048 Max response length 20000 GPU memory utilization 0.7", "source": "marker_v2", "marker_block_id": "/page/21/TableGroup/205"}
104
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0103", "section": "E ANALYSIS OF WANDB CURVES IN JIGSAW OPTIMIZATION", "page_start": 22, "page_end": 22, "type": "Text", "text": "In this section, we present the training curves of our RL process and provide an analysis of the training dynamics. We monitor the evolution of rewards (including accuracy and format rewards), response length, number of interaction turns, and validation accuracy.", "source": "marker_v2", "marker_block_id": "/page/21/Text/6"}
105
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0104", "section": "E ANALYSIS OF WANDB CURVES IN JIGSAW OPTIMIZATION", "page_start": 22, "page_end": 22, "type": "FigureGroup", "text": "Figure 11: Visualization of Wandb curves in jigsaw RL optimization.", "source": "marker_v2", "marker_block_id": "/page/21/FigureGroup/206"}
106
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0105", "section": "E ANALYSIS OF WANDB CURVES IN JIGSAW OPTIMIZATION", "page_start": 22, "page_end": 22, "type": "Text", "text": "At the beginning of training, both validation accuracy and reward values are low, indicating that the model has very limited jigsaw-solving ability in the early stage. As training progresses, the number of interaction turns increases briefly, suggesting that the model explores more interactions (e.g., swapping tiles, cropping for observation) in order to achieve higher accuracy. With continued training, the reward values steadily increase, reflecting a stable improvement in jigsaw-solving capability through RL. After sufficient training, the model gradually reduces both the number of turns and response length, demonstrating enhanced perceptual and reasoning ability, such that it can solve jigsaw correctly with fewer interactions.", "source": "marker_v2", "marker_block_id": "/page/21/Text/9"}
107
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0106", "section": "F LIMITATIONS", "page_start": 23, "page_end": 23, "type": "Text", "text": "Despite our best efforts, this work has several limitations. Multi-turn jigsaw interactions inevitably increase context length and introduce significant computational overhead. In the 3 × 3 setting, the context often exceeds the model's maximum window size, restricting our RL training to the 2 × 2 case. Future work could investigate more efficient interaction mechanisms with external environments or integrate memory modules to mitigate context length constraints, thereby enabling RL training on larger and more complex jigsaw tasks.", "source": "marker_v2", "marker_block_id": "/page/22/Text/2"}
108
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0107", "section": "G QUALITATIVE ANALYSIS ON ATTENTION PATTERNS", "page_start": 23, "page_end": 23, "type": "Text", "text": "To further verify that AGILE brings genuine improvements in perceptual and reasoning abilities rather than merely increasing benchmark scores, we conduct additional qualitative analyses on general downstream tasks. Specifically, we visualize the attention distributions of Qwen2.5-VL-7B before and after AGILE training. As shown in attention examples (Figure 12) , the original model often exhibits scattered and unstable attention allocation, focusing on large irrelevant regions when processing complex high-resolution scenes or fine-grained recognition tasks. This dispersed attention leads to unreliable reasoning and misinterpretation of critical visual evidence. In contrast, the AGILE-trained model shows significantly more concentrated attention on key visual elements, such as small objects, text regions, and structurally important areas. This improved focus enhances the model's ability to extract fine-grained cues and supports more reliable multimodal reasoning. These qualitative findings align with our quantitative gains across HRBench, VStarBench, and Real-WorldQA, suggesting that AGILE enhances fundamental perceptual mechanisms underlying general visual understanding.", "source": "marker_v2", "marker_block_id": "/page/22/Text/4"}
109
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0108", "section": "H WHICH TASKS CAN BENEFIT MORE FROM AGILE?", "page_start": 23, "page_end": 23, "type": "Text", "text": "Beyond overall benchmark gains, we analyze the types of perceptual and reasoning skills most enhanced by AGILE:", "source": "marker_v2", "marker_block_id": "/page/22/Text/6"}
110
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0109", "section": "H WHICH TASKS CAN BENEFIT MORE FROM AGILE?", "page_start": 23, "page_end": 23, "type": "ListGroup", "text": "Fine-grained recognition. These tasks require high precision in identifying subtle visual cues, such as detecting small objects, recognizing text, or distinguishing fine-grained visual differences. AGILE enhances the model's ability to focus on the most critical visual elements, improving its sensitivity to subtle but important features and thereby boosting fine-grained recognition performance. Spatial relation reasoning. Benchmarks such as VStarBench contain a substantial number of questions involving spatial positional reasoning. AGILE's interaction-driven training helps the model better attend to spatial layouts and contextual relationships within a scene, substantially improving its ability to understand and reason about complex spatial arrangements. This capability transfers effectively to real-world spatial reasoning tasks. Visual–textual integration. AGILE also leads to notable improvements in tasks requiring the integration of visual and textual information. Tasks involving reading product details, interpreting signs, or extracting structured information from charts benefit from AGILE's strengthened ability to jointly process textual cues grounded in visual context.", "source": "marker_v2", "marker_block_id": "/page/22/ListGroup/203"}
111
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0110", "section": "I HANDLING INVALID CODE EXECUTIONS", "page_start": 23, "page_end": 23, "type": "Text", "text": "During reinforcement learning, the model may generate malformed or invalid code. Instead of discarding such rollouts, the environment executes the code and returns explicit error messages to the model. These erroneous interactions increase the total number of steps required to reach the correct solution and thus naturally lead to lower step rewards under our reward formulation (Eq. 5 and Eq. 6) . As a result, invalid code is implicitly penalized, encouraging the model to generate valid actions and interact more efficiently. This design stabilizes training without requiring complex filtering mechanisms.", "source": "marker_v2", "marker_block_id": "/page/22/Text/11"}
112
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0111", "section": "I HANDLING INVALID CODE EXECUTIONS", "page_start": 24, "page_end": 24, "type": "FigureGroup", "text": "Figure 12: Comparison of Attention Maps Before and After AGILE Training. Warm colors indicate higher attention; cool colors indicate lower attention.", "source": "marker_v2", "marker_block_id": "/page/23/FigureGroup/71"}
113
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0112", "section": "J.1 SENSITIVITY TO REWARD COEFFICIENTS.", "page_start": 24, "page_end": 24, "type": "Text", "text": "We further investigate the sensitivity of AGILE to the reward-weighting coefficients (α, β, and γ). As shown in Table 6, varying the values of α and β yields only minor fluctuations in performance, indicating that AGILE is robust to these parameters. In contrast, removing the step reward (γ) produces notable performance degradation, especially on VStarBench and MMVP. This finding ver-", "source": "marker_v2", "marker_block_id": "/page/23/Text/5"}
114
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0113", "section": "J.1 SENSITIVITY TO REWARD COEFFICIENTS.", "page_start": 25, "page_end": 25, "type": "Text", "text": "ifies that the step-penalty plays a critical role in encouraging efficient and meaningful interactions, preventing long, unfocused rollouts during RL.", "source": "marker_v2", "marker_block_id": "/page/24/Text/1"}
115
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0114", "section": "J.1 SENSITIVITY TO REWARD COEFFICIENTS.", "page_start": 25, "page_end": 25, "type": "TableGroup", "text": "Table 6: Ablation on Reward Coefficients. Sensitivity analysis of the weighting coefficients \\alpha , \\beta , and \\gamma in the total reward. Model MME-RW RWQA HRB4K HRB8K VStar MMVP BLINK HalBench MMMU Avg. Qwen2.5-VL-7B 44.6 68.5 68.8 65.3 76.4 74.3 56.4 50.1 54.8 62.1 \\alpha = 0.8, \\beta = 0.2, \\gamma = 1.0 48.4 70.2 73.0 70.5 80.6 78.0 58.0 51.9 55.8 65.2 \\alpha = 0.8, \\beta = 0.2, \\gamma = 0.5 49.2 69.7 72.8 69.8 78.5 79.0 57.5 50.8 55.8 64.8 \\alpha = 0.8, \\beta = 0.2, \\gamma = 0.0 47.4 71.1 72.4 69.8 78.5 75.3 56.7 52.8 55.6 64.4 \\alpha = 0.9, \\beta = 0.1, \\gamma = 1.0 48.9 70.8 73.3 69.6 79.1 78.0 57.5 51.4 55.1 64.9", "source": "marker_v2", "marker_block_id": "/page/24/TableGroup/93"}
116
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0115", "section": "J.2 RESULTS OF LARGER JIGSAW GRID SIZES AND CURRICULUM RL TRAINING", "page_start": 25, "page_end": 25, "type": "Text", "text": "To further assess the scalability of AGILE beyond the 2\\times 2 jigsaw setting, we conduct an additional reinforcement learning stage on 8K\\ 3\\times 3 jigsaw puzzles. This stage is applied after the initial 15.6K\\ 2\\times 2 RL training, forming curriculum-style optimization principle. As shown in Table 7, training on 3\\times 3 jigsaw puzzles leads to further improvements across all 9 benchmarks. These results demonstrate that AGILE naturally generalizes to larger and more challenging jigsaw configurations when model capability allows, and further highlight that curriculum reinforcement learning on increasingly difficult grid sizes provides an effective path for continued scaling.", "source": "marker_v2", "marker_block_id": "/page/24/Text/5"}
117
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0116", "section": "J.2 RESULTS OF LARGER JIGSAW GRID SIZES AND CURRICULUM RL TRAINING", "page_start": 25, "page_end": 25, "type": "TableGroup", "text": "Table 7: Results of 3 \\times 3 Jigsaw RL Training. Model MME-RW RWQA HRB4K HRB8K VStar MMVP BLINK HalBench MMMU Avg. Qwen2.5-VL-7B 44.6 68.5 68.8 65.3 76.4 74.3 56.4 50.1 54.8 62.1 + 15.6K 2×2 RL 48.4 70.2 73.0 70.5 80.6 78.0 58.0 51.9 55.8 65.2 + 15.6 K 2 \\times 2 + 8 K 3 \\times 3 RL 50.4 70.6 73.4 70.5 80.1 79.0 58.1 52.1 55.8 65.6", "source": "marker_v2", "marker_block_id": "/page/24/TableGroup/94"}
118
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0117", "section": "J.3 EXPERT TRAJECTORIES ABLATIONS", "page_start": 25, "page_end": 25, "type": "Text", "text": "To disentangle the effect of expert cold-start trajectories and verify that AGILE's improvements are not merely due to distillation, we conducted additional experiments without any expert trajectories. Specifically, we performed RL directly on the 15.6K 2 \\times 2 jigsaw dataset under two conditions: (1) the full action space, and (2) an ablated action space with Crop/Zoom removed. The results show that even in the absence of expert supervision, AGILE still delivers a +1.8% improvement over the Qwen2.5-VL-7B baseline, demonstrating that the performance gain arises from agentic visual interaction combined with verifiable RL, rather than imitation of Gemini 2.5 Pro trajectories.", "source": "marker_v2", "marker_block_id": "/page/24/Text/9"}
119
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0118", "section": "J.3 EXPERT TRAJECTORIES ABLATIONS", "page_start": 25, "page_end": 25, "type": "TableGroup", "text": "Table 8: Performance of RL without Gemini 2.5 Pro expert trajectories and with ablated action spaces. Model MME-RW RWQA HRB4K HRB8K VStar MMVP BLINK HalBench MMMU Avg. Qwen2.5-VL-7B 44.6 68.5 68.8 65.3 76.4 74.3 56.4 50.1 54.8 62.1 Cold-Start 46.2 68.4 71.0 68.4 77.5 76.7 55.7 49.8 54.0 63.1 Cold-Start + RL 48.4 70.2 73.0 70.5 80.6 78.0 58.0 51.9 55.8 65.2 Only RL (Full action space) 46.3 69.5 71.5 68.1 78.5 79.0 56.3 53.2 53.1 63.9 Only RL (No Crop/Zoom) 46.2 69.3 71.9 68.0 78.0 78.3 53.7 52.8 53.3 63.5", "source": "marker_v2", "marker_block_id": "/page/24/TableGroup/95"}
120
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0119", "section": "J.3 EXPERT TRAJECTORIES ABLATIONS", "page_start": 25, "page_end": 25, "type": "Text", "text": "Furthermore, removing the Crop/Zoom operations leads to a clear decline in performance, underscoring the importance of AGILE's interaction design in enabling effective fine-grained perceptual reasoning.", "source": "marker_v2", "marker_block_id": "/page/24/Text/12"}
121
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0120", "section": "J.4 GENERAL QA DATASET DETAILS AND EXTENDED COMPARISON WITH JIGSAW TRAINING", "page_start": 25, "page_end": 25, "type": "Text", "text": "We provide additional clarification regarding the composition of the general QA dataset. Our 20K QA corpus is constructed entirely from high-resolution, real-world visual scenes, consisting of 15K samples from DeepEyes (Zheng et al., 2025) and 5K samples from MMEureka (Meng et al., 2025).", "source": "marker_v2", "marker_block_id": "/page/24/Text/14"}
122
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0121", "section": "J.4 GENERAL QA DATASET DETAILS AND EXTENDED COMPARISON WITH JIGSAW TRAINING", "page_start": 26, "page_end": 26, "type": "TableGroup", "text": "Table 9: Comparison between General QA and Jigsaw-based RL under equal training budgets (20K). Model MME-RW RWQA HRB4K HRB8K VStar MMVP BLINK HalBench MMMU Avg. Qwen2.5-VL-7B 44.6 68.5 68.8 65.3 76.4 74.3 56.4 50.1 54.8 62.1 20K General QA 50.5 68.9 72.4 69.5 82.7 78.3 54.8 51.3 54.2 64.7 10K General QA + 10K Jigsaw 51.6 69.8 73.0 70.6 81.7 79.0 57.3 51.2 55.7 65.5 20K Jigsaw-only 48.5 70.5 73.6 70.5 80.1 77.3 57.7 52.1 53.8 64.9", "source": "marker_v2", "marker_block_id": "/page/25/TableGroup/68"}
123
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0122", "section": "J.4 GENERAL QA DATASET DETAILS AND EXTENDED COMPARISON WITH JIGSAW TRAINING", "page_start": 26, "page_end": 26, "type": "Text", "text": "These datasets span diverse perceptual and reasoning categories, including fine-grained attributes, spatial relationships, counting, and commonsense scene understanding.", "source": "marker_v2", "marker_block_id": "/page/25/Text/3"}
124
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0123", "section": "J.4 GENERAL QA DATASET DETAILS AND EXTENDED COMPARISON WITH JIGSAW TRAINING", "page_start": 26, "page_end": 26, "type": "Text", "text": "Accordingly, the comparison between jigsaw training and QA training is inherently fair: both training regimes operate on high-resolution, real-world, and complex perceptual inputs. To further strengthen this comparison, we additionally include the 20K pure jigsaw setting. As shown in Table 9, jigsaw-based RL consistently outperforms high-resolution QA-based RL under the same training budget, demonstrating that AGILE's performance gains do not stem from differences in input resolution, but instead from the structured, verifiable, and spatially grounded training signal introduced by the jigsaw task.", "source": "marker_v2", "marker_block_id": "/page/25/Text/4"}
125
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0124", "section": "J.5 IMPACT OF SCALING THE COLD-START (SFT) DATASET", "page_start": 26, "page_end": 26, "type": "Text", "text": "To understand whether training longer or scaling up the supervised cold-start phase affects performance, we expand the cold-start dataset to 1.5 \\times and 2 \\times its original size and repeated all experiments. As shown in Table 10, enlarging the SFT dataset leads to only marginal differences, with no signs of overfitting or meaningful performance degradation.", "source": "marker_v2", "marker_block_id": "/page/25/Text/6"}
126
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0125", "section": "J.5 IMPACT OF SCALING THE COLD-START (SFT) DATASET", "page_start": 26, "page_end": 26, "type": "TableGroup", "text": "Table 10: Effect of scaling the cold-start (SFT) dataset size. Increasing SFT data provides only marginal differences, indicating that most performance gains come from the RL stage. Model MME-RW RWQA HRB4K HRB8K VStar MMVP BLINK HalBench MMMU Avg. Qwen2.5-VL-7B 44.6 68.5 68.8 65.3 76.4 74.3 56.4 50.1 54.8 62.1 Cold-start (1.6K) 46.2 68.4 71.0 68.4 77.5 76.7 55.7 49.8 54.0 63.1 +RL 48.4 70.2 73.0 70.5 80.6 78.0 58.0 51.9 55.8 65.2 Cold-start (2.4K) 46.2 68.9 71.4 68.8 77.0 76.0 57.8 50.2 54.0 63.4 +RL 48.4 69.8 73.0 69.9 78.5 79.0 57.7 50.5 56.3 64.8 Cold-start (3.2K) 46.5 67.8 71.4 68.8 77.0 76.7 58.1 49.2 53.3 63.2 +RL 47.1 70.1 73.0 70.5 79.6 78.3 57.2 50.5 55.7 64.7", "source": "marker_v2", "marker_block_id": "/page/25/TableGroup/69"}
127
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0126", "section": "J.5 IMPACT OF SCALING THE COLD-START (SFT) DATASET", "page_start": 26, "page_end": 26, "type": "Text", "text": "In practice, the cold-start stage serves a very specific purpose: teaching the model the tool-use pattern (i.e., how to invoke the predefined Python APIs). Its goal is not to solve the jigsaw task fully. Consequently, the model's performance is largely unaffected by moderate expansions of the SFT set. The primary source of generalization and performance improvement comes from the interactive RL stage, where the model learns to solve jigsaw puzzles through real environment feedback rather than through imitation.", "source": "marker_v2", "marker_block_id": "/page/25/Text/9"}
128
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0127", "section": "K USE OF LLMS", "page_start": 26, "page_end": 26, "type": "Text", "text": "Yes. We use LLMs solely to assist in language polishing and improving readability. All technical content, experiments, and analyses are conducted by the authors.", "source": "marker_v2", "marker_block_id": "/page/25/Text/11"}
iclr26/3kouij8BWi/dataset_meta.json ADDED
@@ -0,0 +1,64 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {
2
+ "paper_id": "3kouij8BWi",
3
+ "pipeline": "Paper2Markdown-V3",
4
+ "ok": true,
5
+ "page_count": 26,
6
+ "chunk_count": 128,
7
+ "main_body_chunk_count": 58,
8
+ "appendix_chunk_count": 66,
9
+ "reference_chunk_count": 4,
10
+ "model_text_chars": 35860,
11
+ "raw_markdown_chars": 83077,
12
+ "sanitized_chars": 77257,
13
+ "page_provenance": {
14
+ "min_page": 1,
15
+ "max_page": 26,
16
+ "invalid_count": 0
17
+ },
18
+ "marker_block_type_counts": {
19
+ "Code": 6,
20
+ "Equation": 7,
21
+ "FigureGroup": 11,
22
+ "Footnote": 7,
23
+ "ListGroup": 12,
24
+ "PageFooter": 26,
25
+ "PageHeader": 26,
26
+ "Picture": 2,
27
+ "PictureGroup": 1,
28
+ "SectionHeader": 42,
29
+ "Table": 1,
30
+ "TableGroup": 9,
31
+ "Text": 83
32
+ },
33
+ "asset_count_raw": 14,
34
+ "asset_count_model_kept": 14,
35
+ "asset_count_rejected": 0,
36
+ "asset_reject_reasons": {
37
+ "kept": 14
38
+ },
39
+ "artifact_leak_audit": {
40
+ "ok": true,
41
+ "hits": {
42
+ "Anonymous Authors": [],
43
+ "ACKNOWLEDGMENT": [],
44
+ "OpenReview": [],
45
+ "\"accept_label\"": [],
46
+ "\"decision\"": [],
47
+ "\"decision_tier\"": [],
48
+ "\"source_status\"": [],
49
+ "Meta-review": [],
50
+ "Official Review": [],
51
+ "official_reviews": [],
52
+ "meta_reviews": [],
53
+ "suggested_verdict_score": []
54
+ },
55
+ "artifact_count": 2
56
+ },
57
+ "default_model_input": "model_text_v3.txt",
58
+ "appendix_input": "appendix_text_v3.txt",
59
+ "reference_input": "reference_text_v3.txt",
60
+ "source": "iclr2026_test_public",
61
+ "run_name": "iclr26_20260429_1952_all",
62
+ "partial_snapshot": true,
63
+ "snapshot_created_at": "2026-04-30T02:34:47.606558+00:00"
64
+ }
iclr26/3kouij8BWi/main_body_chunks.jsonl ADDED
@@ -0,0 +1,58 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0000", "section": "ABSTRACT", "page_start": 1, "page_end": 1, "type": "Text", "text": "Although current large Vision-Language Models (VLMs) have advanced in multimodal understanding and reasoning, their fundamental perceptual and reasoning abilities remain limited. Specifically, even on simple jigsaw tasks, existing VLMs perform near randomly, revealing deficiencies in core perception and reasoning capabilities. While high-quality vision-language data can enhance these capabilities, its scarcity and limited scalability impose significant constraints. To address this, we propose AGILE, an Agentic jiGsaw Interaction Learning for Enhancing visual perception and reasoning in VLMs. AGILE formulates jigsaw solving as an interactive process, enabling the model to progressively engage with the environment. At each step, the model generates executable code to perform an action based on the current state, while the environment provides fine-grained visual feedback to guide task completion. Through this iterative cycle of observation and interaction, the model incrementally improves its perceptual and reasoning capabilities via exploration and feedback. Experimental results show that AGILE not only substantially boosts performance on jigsaw tasks of varying complexity (e.g., increasing accuracy from 9.5% to 82.8% under the 2 \\times 2 setting) but also demonstrates strong generalization across 9 general vision tasks, achieving an average improvement of 3.1%. These results indicate notable enhancements in both perceptual and reasoning abilities. This work opens a new avenue for advancing reasoning and generalization in multimodal models and provides an efficient, scalable solution to the scarcity of multimodal reinforcement learning data. The code and datasets is available at", "source": "marker_v2", "marker_block_id": "/page/0/Text/8"}
2
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0001", "section": "1 Introduction", "page_start": 1, "page_end": 1, "type": "Text", "text": "Large Vision-Language Models (VLMs) have recently achieved remarkable success across a wide range of multimodal tasks, including image captioning (Chen et al., 2024a;c; Li et al., 2024b; Zeng et al., 2025), visual question answering (Bai et al., 2025; Zhu et al., 2025; Hurst et al., 2024; Comanici et al., 2025; Qi et al., 2025; Zhao et al., 2025; Huang et al., 2026b; Zeng et al., 2026; Wang et al., 2026; Pan et al., 2025), document understanding (Wang et al., 2025b;a), and complex real-world applications (Huang et al., 2025b; Han et al., 2026; Fang et al., 2025; Huang et al., 2025a; Zhang et al., 2025a). By effectively associating visual and textual information, these models exhibit strong multimodal perception and reasoning capabilities. However, their performance remains severely limited on tasks that require comprehensive visual understanding and structured reasoning. In particular, we find that current VLMs often perform near random even on relatively simple 2\\times 2 jigsaw tasks (Carlucci et al., 2019; Chen et al., 2023), which demand both perceptual accuracy and", "source": "marker_v2", "marker_block_id": "/page/0/Text/10"}
3
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0002", "section": "1 Introduction", "page_start": 1, "page_end": 1, "type": "Footnote", "text": "& lt;sup>2</sup>Shanghai AI Laboratory", "source": "marker_v2", "marker_block_id": "/page/0/Footnote/4"}
4
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0003", "section": "1 Introduction", "page_start": 2, "page_end": 2, "type": "PictureGroup", "text": "Figure 1: Description of the action space. (a) illustrates swapping two jigsaw pieces and observing the updated jigsaw state; (b) shows cropping a specific region of the jigsaw for closer inspection; and (c) depicts zooming into a selected area to examine fine-grained details.", "source": "marker_v2", "marker_block_id": "/page/1/PictureGroup/180"}
5
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0004", "section": "1 Introduction", "page_start": 2, "page_end": 2, "type": "Text", "text": "logical inference. This suggests that existing pretraining and fine-tuning strategies are insufficient for developing robust perceptual and reasoning abilities.", "source": "marker_v2", "marker_block_id": "/page/1/Text/5"}
6
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0005", "section": "1 Introduction", "page_start": 2, "page_end": 2, "type": "Text", "text": "Recent studies have explored reinforcement learning (RL) (Schulman et al., 2017; Rafailov et al., 2023; Shao et al., 2024; Huang et al., 2026a; Ma et al., 2025; Zhang et al., 2025c; b; Ren et al., 2026) as a way to enhance these capabilities by enabling models to learn through interaction, trial-anderror, and feedback. While RL-based approaches show promise, they are fundamentally constrained by the scarcity and limited scalability of high-quality vision-language RL data. Current methods for constructing multimodal RL datasets (Huang et al., 2025c; Yang et al., 2025; Lu et al., 2023) generally fall into two categories: human expert supervision and automated synthesis. Humansupervised datasets are either prohibitively expensive or too small in scale for large-scale training, while automated approaches that rely on closed-source models suffer from limited quality, capability constraints, and substantial API costs. These challenges collectively hinder the development of VLMs with strong reasoning and generalization abilities.", "source": "marker_v2", "marker_block_id": "/page/1/Text/6"}
7
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0006", "section": "1 Introduction", "page_start": 2, "page_end": 2, "type": "Text", "text": "To address these limitations, we propose AGILE, an Agentic jiGsaw Interaction Learning framework for Enhancing visual perception and reasoning in VLMs. Our approach leverages the structured nature of the jigsaw puzzle as a proxy task for perception and reasoning, modeling the jigsawsolving process as a progressive interaction between the model and its environment. At each step, the model generates Python code to perform actions within a well-defined action space (swapping two image tiles, observing the current jigsaw state, cropping regions for detailed observation, or zooming in for fine-grained analysis). This interaction-driven process enables the model to iteratively refine its perceptual and reasoning capabilities while receiving explicit feedback at every step. By simulating the step-by-step dynamics of jigsaw solving, the model is encouraged to capture structural relationships among visual components and acquire more robust perception and reasoning skills.", "source": "marker_v2", "marker_block_id": "/page/1/Text/7"}
8
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0007", "section": "1 Introduction", "page_start": 2, "page_end": 2, "type": "Text", "text": "A key feature of our approach is the use of code and rule-based data generation, which offers two major advantages. First, the difficulty of the jigsaw task can be precisely controlled by adjusting factors such as the number of correctly placed tiles in the initial state and the overall jigsaw size. Second, because the ground-truth solution is inherently available, the synthetic dataset can be scaled to arbitrary sizes with strict supervision, overcoming the data scarcity inherent in human-annotated or closed-source datasets. The combination of interactive training and scalable data generation yields an efficient and effective framework for advancing visual perception and reasoning in VLMs.", "source": "marker_v2", "marker_block_id": "/page/1/Text/8"}
9
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0008", "section": "1 Introduction", "page_start": 2, "page_end": 2, "type": "Text", "text": "We validate the effectiveness of our approach through comprehensive experiments. Our method substantially improves performance across jigsaw tasks of varying complexity, for instance, raising accuracy from 9.5% to 82.8% on the 2 × 2 setting, while also demonstrating strong generalization to a wide range of vision tasks, including high-resolution image understanding, real-world scene analysis, fine-grained recognition, visual reasoning, and hallucination benchmarks. Moreover, we show that scaling the training data further boosts performance, and that under equal data budgets, jigsaw-based training achieves results comparable to or even surpassing those obtained with general QA data. These findings underscore the potential of jigsaw tasks in addressing the scarcity of multimodal RL data. By combining interactive training with scalable data generation, our method significantly enhances both perceptual and higher-order reasoning abilities, pointing to a promising new direction for advancing VLMs. Our main contributions are as follows:", "source": "marker_v2", "marker_block_id": "/page/1/Text/9"}
10
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0009", "section": "1 Introduction", "page_start": 3, "page_end": 3, "type": "ListGroup", "text": "We introduce AGILE, an agentic jigsaw interaction learning framework that formulates jigsaw solving as a stepwise interactive process, thereby driving incremental improvements in both visual perception and reasoning capabilities of VLMs. We present a scalable jigsaw-based data generation method that yields high-quality multimodal reinforcement learning datasets with controllable difficulty, providing an efficient solution to the current shortage of high-quality training data. Extensive experiments demonstrate that our approach substantially improves performance on jigsaw tasks of varying complexity while exhibiting strong generalization across diverse vision benchmarks, highlighting its effectiveness in enhancing both perception and reasoning in VLMs.", "source": "marker_v2", "marker_block_id": "/page/2/ListGroup/207"}
11
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0010", "section": "2 RELATED WORK", "page_start": 3, "page_end": 3, "type": "Text", "text": "Reinforcement Learning for Vision Language Models. Reinforcement learning (RL) (Schulman et al., 2017; Rafailov et al., 2023; Shao et al., 2024) has been widely applied to improve reasoning in language models, as exemplified by the success of DeepSeek-R1 (Guo et al., 2025) in mathematical reasoning. Building on this progress, recent studies have extended RL to VLMs, with rule-based RL in multimodal domains emerging as a promising direction. For perception enhancement, R1-V (Chen et al., 2025b) applies RL to object counting, while Perception-R1 (Yu et al., 2025) leverages object matching and IoU as reward signals to improve grounding. DeepEyes (Zheng et al., 2025) shows how RL can encourage models to invoke visual tools, thereby expanding perceptual abilities. For reasoning, MMEureka (Meng et al., 2025) demonstrates the effectiveness of rule-based RL in mathematical tasks. From a data perspective, Vision-R1 (Huang et al., 2025c) and R1-OneVision (Yang et al., 2025) convert visual information into textual representations to build multimodal chainof-thought (CoT) datasets that support stronger reasoning. Despite these advances, the lack of scalable, high-quality RL datasets remains a fundamental bottleneck, severely limiting further improvements in both perception and reasoning for VLMs.", "source": "marker_v2", "marker_block_id": "/page/2/Text/5"}
12
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0011", "section": "2 RELATED WORK", "page_start": 3, "page_end": 3, "type": "Text", "text": "Enhancing Generalization via Proxy Tasks. Rule-based reinforcement learning (RL) has shown promise but typically requires large amounts of high-quality, verifiable data. Logic-RL (Xie et al., 2025a) addressed this by introducing the \"Knights and Knaves\" (K&K) puzzle, which offers controllable difficulty and algorithmically generated ground truth, enabling models to acquire reasoning skills transferable to mathematical tasks. Enigmata (Chen et al., 2025a) extended this approach to a broader set of text-based puzzles (e.g., cryptographic, arithmetic, logical), demonstrating that solving such tasks with RL improves general reasoning without external data. RPT (Dong et al., 2025) further reframed next-token prediction as a reasoning task, using verifiable rewards to enhance predictive ability and strengthen the basis for reinforcement fine-tuning. Inspired by these proxy-task successes in LLMs, recent work has begun exploring similar ideas for VLMs. Code2Logic (Tong et al., 2025) and ViGaL (Xie et al., 2025b) leverage code-synthesized games to improve mathematical reasoning, while ViCrit (Wang et al., 2025d) enhances perceptual robustness by reinforcing models to detect hallucinated entities via modified captions. Jigsaw-R1 (Wang et al., 2025e) proposed a puzzle-based RL paradigm, but due to training limitations, its models still performed poorly even on 2 × 2 jigsaw puzzles, failing to fully exploit the proxy-task benefits. To address this gap, we propose a agentic jigsaw interaction learning framework, which casts jigsaw solving as an interactive process between the model and environment. This enables iterative refinement of perception and reasoning with explicit stepwise feedback, allowing the model to better capture visual relationships and develop stronger perceptual and reasoning skills.", "source": "marker_v2", "marker_block_id": "/page/2/Text/6"}
13
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0012", "section": "3 METHOD", "page_start": 3, "page_end": 3, "type": "Text", "text": "In this section, we provide a comprehensive description of our proposed agentic jigsaw interaction learning framework. We first introduce the jigsaw task and describe how the model interacts with the environment to accomplish it (Sec. 3.1) , then present the construction of the training data (Sec. 3.2) . Finally, we outline the training paradigm, including both the cold-start stage and the reinforcement learning stage (Sec. 3.3) .", "source": "marker_v2", "marker_block_id": "/page/2/Text/8"}
14
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0013", "section": "3 METHOD", "page_start": 4, "page_end": 4, "type": "FigureGroup", "text": "Figure 2: Overview of the AGILE framework. (a) depicts the interaction process between the model and the external environment, together with the implementation of the GRPO algorithm; (b) shows the collection of high-quality jigsaw trajectory data; and (c) illustrates the model–environment interaction during the jigsaw rollout process.", "source": "marker_v2", "marker_block_id": "/page/3/FigureGroup/270"}
15
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0014", "section": "3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION", "page_start": 4, "page_end": 4, "type": "Text", "text": "Jigsaw Task. Given an input image, we partition it into an m × m grid of jigsaw pieces, where task difficulty can be flexibly adjusted by varying m. If the image height or width is not divisible by m, the image is resized so that its dimensions are exact multiples of the grid. The grid is then randomly shuffled, and each piece is assigned an index in row-major order ranging from 1 (top-left) to m 2 (bottom-right). The shuffled configuration is denoted as", "source": "marker_v2", "marker_block_id": "/page/3/Text/4"}
16
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0015", "section": "3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION", "page_start": 4, "page_end": 4, "type": "Equation", "text": "I_{Shuffle} = \\{I_1, I_2, \\dots, I_{m^2}\\}, (1)", "source": "marker_v2", "marker_block_id": "/page/3/Equation/5"}
17
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0016", "section": "3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION", "page_start": 4, "page_end": 4, "type": "Text", "text": "where each I k corresponds to one jigsaw block. Since the shuffling process is explicitly recorded during data generation, we can recover the ground-truth jigsaw layout as", "source": "marker_v2", "marker_block_id": "/page/3/Text/6"}
18
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0017", "section": "3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION", "page_start": 4, "page_end": 4, "type": "Equation", "text": "I_{GT} = \\{I_{\\pi(1)}, I_{\\pi(2)}, \\dots, I_{\\pi(m^2)}\\},\\tag{2}", "source": "marker_v2", "marker_block_id": "/page/3/Equation/7"}
19
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0018", "section": "3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION", "page_start": 4, "page_end": 4, "type": "Text", "text": "where π is a permutation over {1, 2, . . . , m 2 }. During jigsaw solving, the model will maintain a current state", "source": "marker_v2", "marker_block_id": "/page/3/Text/8"}
20
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0019", "section": "3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION", "page_start": 4, "page_end": 4, "type": "Equation", "text": "I_{State} = \\{I_{\\pi^*(1)}, I_{\\pi^*(2)}, \\dots, I_{\\pi^*(m^2)}\\},\\tag{3}", "source": "marker_v2", "marker_block_id": "/page/3/Equation/9"}
21
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0020", "section": "3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION", "page_start": 4, "page_end": 4, "type": "Text", "text": "where π ∗ denotes the current arrangement of pieces. At each step, the model iteratively swaps two pieces, observes the resulting configuration, and aims to reconstruct the ground-truth layout IGT .", "source": "marker_v2", "marker_block_id": "/page/3/Text/10"}
22
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0021", "section": "3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION", "page_start": 4, "page_end": 4, "type": "Text", "text": "Environment Interaction. The model interacts with the environment throughout the jigsawsolving process in an iterative manner. As illustrated in Figure 1, , we predefine a set of API for model–environment interactions in Python. The model expresses its actions by generating Python code, which is executed by the environment to produce the corresponding resulting image. The model then uses these results to reason further and decide on subsequent actions, repeating this process iteratively until the jigsaw is completed. Specifically, at each step, the model can perform the following actions:", "source": "marker_v2", "marker_block_id": "/page/3/Text/11"}
23
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0022", "section": "3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION", "page_start": 4, "page_end": 4, "type": "ListGroup", "text": "Swap: Given the current jigsaw state IState, the model calls the Swap function to exchange the positions of any two jigsaw pieces. Observe: Given IState, the model calls the Observe function to obtain the current jigsaw progress IObs, which is then used to determine the next action.", "source": "marker_v2", "marker_block_id": "/page/3/ListGroup/271"}
24
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0023", "section": "3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION", "page_start": 5, "page_end": 5, "type": "Text", "text": "• Crop & Zoom: Given IObs, the model crops and zooms into a local region to inspect finer details and inform subsequent actions.", "source": "marker_v2", "marker_block_id": "/page/4/Text/1"}
25
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0024", "section": "3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION", "page_start": 5, "page_end": 5, "type": "Text", "text": "To better illustrate the overall procedure, the entire rollout process is presented in Algorithm 1.", "source": "marker_v2", "marker_block_id": "/page/4/Text/2"}
26
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0025", "section": "3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION", "page_start": 5, "page_end": 5, "type": "Code", "text": "Algorithm 1 Interactive Jigsaw-Solving Procedure of VLMs with the Environment", "source": "marker_v2", "marker_block_id": "/page/4/Code/3"}
27
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0026", "section": "3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION", "page_start": 5, "page_end": 5, "type": "Code", "text": "Input: Query x, IShuff le, Policy model πθ, External environment V, Maximum iteration steps T. Output: Final interaction trajectory y. 1: Initialize trajectory y ← ∅, step counter t ← 0. 2: while t < T do 3: Sample response yt ∼ πθ(· | x, IShuff le, y). 4: Append assistant response yt to trajectory: y ← y + yt. 5: if <code> </code> detected in yt then 6: Parse the Python code (e.g., Swap, Observe, Crop, Zoom), execute it in the environment V, and obtain feedback Ot. 7: else if <answer> </answer> detected in yt then 8: return final trajectory y. 9: end if 10: Append environment feedback Ot as user input: y ← y + Ot. 11: Update step counter t ← t + 1. 12: end while 13: return final trajectory y.", "source": "marker_v2", "marker_block_id": "/page/4/Code/4"}
28
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0027", "section": "3.2 DATA CONSTRUCTION", "page_start": 5, "page_end": 5, "type": "Text", "text": "In Section 3.1, we have introduced the jigsaw task and described how the model interacts with the environment to complete it. Based on this task design, we observe that the model (e.g., Qwen-2.5VL-7B) exhibits limited foundational capabilities, manifested in poor instruction-following and incorrect Python code generation, which hinders proper interaction with the environment and introduces substantial training noise. Directly applying reinforcement learning (RL) thus results in low learning efficiency. To bridge this gap and more effectively train our model, we employ Gemini 2.5 Pro 1 to collect expert trajectories for the cold-start phase, endowing Qwen-2.5VL-7B with basic interactive jigsaw-solving capabilities. For this purpose, we design structured prompts to guide Gemini 2.5 Pro in interacting with the environment to complete the jigsaw tasks (The prompt templates are provided in Appendix B. ).", "source": "marker_v2", "marker_block_id": "/page/4/Text/6"}
29
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0028", "section": "3.2 DATA CONSTRUCTION", "page_start": 5, "page_end": 5, "type": "Text", "text": "To further ensure data quality, we apply an additional filtering process: first, selecting samples where Gemini's outputs match the ground truth, and then manually verifying each interaction step in the correct samples to ensure rationality and consistency. To ensure that our model can perform diverse jigsaw reasoning actions during reinforcement learning, we carefully balance the training data. Specifically, trajectories are balanced with respect to both the number of steps (4–8) and the types of actions involved (e.g., Swap, Observe, Crop, Zoom). This design ensures that the model is sufficiently exposed to the full action space and learns to handle various interactions with the environment effectively. Overall, we curate a dataset comprising 1.6K high-quality reasoning trajectories for the jigsaw task.", "source": "marker_v2", "marker_block_id": "/page/4/Text/7"}
30
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0029", "section": "3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING", "page_start": 5, "page_end": 5, "type": "Text", "text": "Cold-start. During the cold-start phase, we leverage the 1.6K high-quality jigsaw-solving trajectories constructed in Section 3.2 to equip the model with basic instruction-following and Python code generation capabilities, ensuring effective interaction with the environment.", "source": "marker_v2", "marker_block_id": "/page/4/Text/9"}
31
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0030", "section": "3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING", "page_start": 5, "page_end": 5, "type": "Text", "text": "Reinforcement Learning. Our framework adopts Group Relative Policy Optimization (GRPO), which utilizes the average reward of multiple sampled outputs as a baseline, instead of relying on a learned value function. The policy model is optimized by maximizing the following objective:", "source": "marker_v2", "marker_block_id": "/page/4/Text/10"}
32
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0031", "section": "3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING", "page_start": 5, "page_end": 5, "type": "Footnote", "text": "1 The version is Gemini-2.5-Pro-Preview-05-06.", "source": "marker_v2", "marker_block_id": "/page/4/Footnote/11"}
33
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0032", "section": "3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING", "page_start": 6, "page_end": 6, "type": "Equation", "text": "\\mathcal{J}_{GRPO}(\\theta) = \\mathbb{E}_{x \\sim \\mathcal{D}, \\{y_i\\}_{i=1}^G \\sim \\pi_{\\text{old}}(\\cdot | x; \\mathcal{V})} \\left[ \\frac{1}{G} \\sum_{i=1}^G \\frac{1}{\\sum_{t=1}^{|y_i|} I(y_{i,t})} \\sum_{t=1:I(y_{i,t})=1}^{|y_i|} \\min \\left( \\frac{\\pi_{\\theta}(y_{i,t} \\mid x, y_{i,< t}; \\mathcal{V})}{\\pi_{\\text{old}}(y_{i,t} \\mid x, y_{i,< t}; \\mathcal{V})} \\hat{A}_{i,t}, \\right) \\right] \\\\ \\operatorname{clip} \\left( \\frac{\\pi_{\\theta}(y_{i,t} \\mid x, y_{i,< t}; \\mathcal{V})}{\\pi_{\\text{old}}(y_{i,t} \\mid x, y_{i,< t}; \\mathcal{V})}, 1 - \\epsilon, 1 + \\epsilon \\right) \\hat{A}_{i,t} \\right) - \\beta \\, \\mathbb{D}_{KL}(\\pi_{\\theta} \\parallel \\pi_{\\text{ref}}), \\tag{4}", "source": "marker_v2", "marker_block_id": "/page/5/Equation/1"}
34
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0033", "section": "3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING", "page_start": 6, "page_end": 6, "type": "Text", "text": "where the rollout module samples a group of trajectories \\{y_1, y_2, \\dots, y_G\\} from the old policy \\pi_{\\text{old}} for each input question x through interaction with the external environment \\mathcal{V} . The advantage term \\hat{A}_{i,t} is computed based on the relative rewards of outputs within each group. Our reward system comprises three components: an accuracy reward, a format reward, and a step reward. The total reward is computed as the sum of these components.", "source": "marker_v2", "marker_block_id": "/page/5/Text/2"}
35
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0034", "section": "3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING", "page_start": 6, "page_end": 6, "type": "ListGroup", "text": "Accuracy Reward: We compare the model's generated answer I_{Answer} with the ground truth I_{GT} . If all jigsaw image blocks are correctly placed, the accuracy reward is 1; otherwise, it is 0. Format Reward: The model receives a reward of 1 if its output follows the required structured format, with the reasoning process, code, and final answer correctly enclosed within the <think>, <code>, and <answer> tags, respectively. \\bullet Step Reward: We encourage the model to complete the jigsaw in as few steps as possible. For a 2 \\times 2 jigsaw, if each step swaps any two image blocks, at most three steps are theoretically required to place all blocks correctly. Excessive actions may lead the model to perform invalid steps, reducing the proportion of effective perception and reasoning. Furthermore, to prevent the model from prematurely hacking the step reward during early RL training, the step reward is applied only when the jigsaw is correctly completed. If the jigsaw is incorrect, the model is penalized by assigning the maximum step penalty. Formally, the step reward is defined as:", "source": "marker_v2", "marker_block_id": "/page/5/ListGroup/125"}
36
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0035", "section": "3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING", "page_start": 6, "page_end": 6, "type": "Equation", "text": "R_{\\text{step}} = \\lambda \\cdot \\left( \\mathbb{I}_{\\{R_{\\text{acc}}=1\\}} \\cdot step_{\\text{num}} + \\mathbb{I}_{\\{R_{\\text{acc}}=0\\}} \\cdot step_{\\text{max}} \\right), \\tag{5}", "source": "marker_v2", "marker_block_id": "/page/5/Equation/6"}
37
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0036", "section": "3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING", "page_start": 6, "page_end": 6, "type": "Text", "text": "where step_{num} is the number of steps the model actually used to complete the jigsaw, step_{max} is the maximum allowed steps, \\lambda denotes the step penalty coefficient, which is set to -0.05, and \\mathbb{I}_{\\{\\cdot\\}} is the indicator function. The final reward formulation is shown in Equation 6:", "source": "marker_v2", "marker_block_id": "/page/5/Text/7"}
38
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0037", "section": "3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING", "page_start": 6, "page_end": 6, "type": "Equation", "text": "R = \\alpha \\cdot R_{\\text{acc}} + \\beta \\cdot R_{\\text{format}} + \\gamma \\cdot R_{\\text{step}}, \\tag{6}", "source": "marker_v2", "marker_block_id": "/page/5/Equation/8"}
39
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0038", "section": "3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING", "page_start": 6, "page_end": 6, "type": "Text", "text": "where the coefficients \\alpha , \\beta , and \\gamma weight the relative importance of accuracy, format, and step rewards, respectively. In our experimental setup, \\alpha , \\beta , and \\gamma are set to 0.8, 0.2, and 1.0, respectively.", "source": "marker_v2", "marker_block_id": "/page/5/Text/9"}
40
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0039", "section": "4 EXPERIMENT", "page_start": 6, "page_end": 6, "type": "Text", "text": "In this section, we present a comprehensive experimental study. We first describe the implementation details, including datasets, training procedures, and inference settings (Sec. 4.1). We then evaluate the effectiveness of our agentic jigsaw interaction learning framework on both jigsaw-solving and general vision tasks (Sec. 4.2). Finally, we perform ablation studies to assess the impact of jigsaw data scale and to contrast the benefits of jigsaw data with those of general QA data (Sec. 4.3).", "source": "marker_v2", "marker_block_id": "/page/5/Text/11"}
41
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0040", "section": "4.1 IMPLEMENTATION DETAILS", "page_start": 6, "page_end": 6, "type": "Text", "text": "Datasets and Models. Our training data consist of two components corresponding to the cold-start and reinforcement learning (RL) stages. In the cold-start stage, we employ 1.6K high-quality jigsaw puzzle trajectories collected in Sec. 3.2 to endow the model with basic interactive jigsaw-solving skills. In the RL stage, we construct a dataset of 15.6K images spanning diverse domains, including high-resolution visual search, OCR-based text recognition, real-world scenes, and structured diagrams (see Appendix A for details). Each image is partitioned into 2 \\times 2 patches and randomly shuffled to ensure that all patches are initially misplaced. All experiments are conducted using Qwen2.5-VL-7B (Bai et al., 2025) as the base model.", "source": "marker_v2", "marker_block_id": "/page/5/Text/13"}
42
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0041", "section": "4.1 IMPLEMENTATION DETAILS", "page_start": 7, "page_end": 7, "type": "TableGroup", "text": "Table 1: Jigsaw Acc result. LN indicates the difficulty level, where N denotes the initial number of correct pieces. A smaller N corresponds to a more scrambled jigsaw and higher difficulty. The best results are highlighted in bold, and the second-best results are underlined. Model 2 × 2 3 × 3 L0 L1 L2 Avg. L0 L1 L2 L3 L4 L5 L6 L7 Avg. Random 4.5 3.7 4.2 4.1 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 GPT-4o 38.7 37.7 47.0 41.1 1.0 1.3 2.7 3.0 3.0 7.0 7.7 13.7 4.9 Gemini-2.5-Pro 43.3 46.3 49.7 46.4 7.0 8.7 9.7 10.0 11.0 15.0 23.0 32.0 14.6 MiMo-VL-7B-RL 11.3 14.3 17.0 14.2 0.3 0.0 0.0 0.0 0.3 0.3 1.0 3.7 0.7 InternVL3-8B 3.7 3.7 5.0 4.1 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 InternVL3-78B 3.3 4.3 3.0 3.5 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 Qwen2.5VL-72B 22.7 24.3 35.3 27.4 0.3 1.3 2.3 2.7 2.0 3.0 6.7 12.7 3.9 Qwen2.5VL-7B 6.3 6.0 16.3 9.5 0.0 0.0 0.0 0.0 0.0 0.7 1.3 1.3 0.4 +Cold-Start 12.0 32.0 22.0 22.0 0.0 0.3 0.0 0.0 0.0 0.7 0.3 0.0 0.2 +RL 78.7 83.0 86.7 82.8 5.0 7.0 11.0 14.0 17.7 25.3 38.0 48.0 20.8", "source": "marker_v2", "marker_block_id": "/page/6/TableGroup/389"}
43
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0042", "section": "4.1 IMPLEMENTATION DETAILS", "page_start": 7, "page_end": 7, "type": "Text", "text": "Training and Inference Setups. We conduct supervised fine-tuning (SFT) on llama-factory (Zheng et al., 2024) and reinforcement learning (RL) training on verl (Sheng et al., 2024) , both with fullparameter tuning. For inference and evaluation, we adopt VLMEvalKit (Duan et al., 2024) as the framework. To ensure a fair comparison, all evaluations on general downstream benchmarks are conducted in a strict single-turn setting following VLMEvalKit, fully consistent with the evaluation protocol of all baseline models. All experiments are performed on 8 NVIDIA A100 GPUs with 80GB memory each. Detailed training hyperparameters are provided in the Appendix D.", "source": "marker_v2", "marker_block_id": "/page/6/Text/3"}
44
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0043", "section": "4.2 MAIN RESULTS", "page_start": 7, "page_end": 7, "type": "Text", "text": "Significant Improvements on the Jigsaw Task. To comprehensively evaluate performance on the jigsaw task, we curate a test set of 300 images spanning diverse scenarios, including high-resolution visual search, OCR-based text recognition, and real-world scenes. Each image is partitioned into 2 × 2 and 3 × 3 grids, and the performance is measured using two metrics: Acc, which equals 1 only when all patches are correctly placed, and Score, defined as the ratio of correctly placed patches to the total number of patches. As shown in Table 1 and 2, the base model Qwen2.5-VL-7B performs poorly without training (achieving only 9.5% accuracy even under the simplest 2 × 2 setting) while the proprietary Gemini2.5-Pro and the larger Qwen2.5-VL-72B models also struggle on this task. After supervised fine-tuning (SFT) with 1.6K cold-start trajectories and reinforcement learning (RL) with 15.6K images, Qwen2.5-VL-7B achieves substantial gains: on the 2 × 2 setting, Acc improves from 9.5% to 82.8% and Score from 29.4% to 89.0%; on the more challenging 3 × 3 setting, it also generalizes well, with Acc increasing from 0.4% to 20.8% and Score from 31.1% to 62.1%, significantly surpassing Gemini2.5-Pro and Qwen2.5-VL-72B. These results demonstrate that modeling jigsaw solving as an interactive multi-turn dialogue enables the model to progressively enhance its visual perception and reasoning abilities, thereby achieving superior performance on the jigsaw task.", "source": "marker_v2", "marker_block_id": "/page/6/Text/5"}
45
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0044", "section": "4.2 MAIN RESULTS", "page_start": 7, "page_end": 7, "type": "Text", "text": "Generalization to Downstream Visual Tasks. The proposed agentic jigsaw interaction learning framework delivers substantial improvements on the jigsaw task. By leveraging explicit step-by-step feedback for iterative refinement, it enables the model to capture visual relations more effectively and to develop stronger reasoning capabilities.", "source": "marker_v2", "marker_block_id": "/page/6/Text/6"}
46
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0045", "section": "4.2 MAIN RESULTS", "page_start": 7, "page_end": 7, "type": "Text", "text": "To further assess whether jigsaw training enhances performance on general vision downstream tasks, we evaluate the model on 9 benchmarks: high-resolution image understanding (HRBench4K (Wang et al., 2025c) , HRBench8K (Wang et al., 2025c) , VStarBench (Wu & Xie, 2024) ), real-world scene understanding (MME-RealWorld (Zhang et al., 2024) , RealWorldQA (xAI, 2024) ), fine-grained visual recognition (MMVP (Tong et al., 2024) , BLINK (Fu et al., 2024) ), visual reasoning (MMMU (Yue et al., 2024) ), and hallucination evaluation (HallusionBench (Guan et al., 2024) ). As shown in Table 3, the jigsaw-trained model demonstrates strong visual generalization, achieving notable gains on HRBench4K (+4.2%), HRBench8K (+5.2%), and VStarBench (+4.2%). On average, it surpasses the base model Qwen2.5-VL-7B by 3.1% across all 9 benchmarks, providing compelling evidence", "source": "marker_v2", "marker_block_id": "/page/6/Text/7"}
47
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0046", "section": "4.2 MAIN RESULTS", "page_start": 8, "page_end": 8, "type": "TableGroup", "text": "Table 2: Jigsaw Score result. LN indicates the difficulty level, where N denotes the initial number of correct pieces. A smaller N corresponds to a more scrambled jigsaw and higher difficulty. The best results are highlighted in bold , and the second-best results are underlined. Model 2 : × 2 3 × 3 L0 L1 L2 Avg. L0 L1 L2 L3 L4 L5 L6 L7 Avg. Random 25.2 24.7 24.8 24.9 11.4 11.3 11.0 10.9 11.1 11.4 11.3 10.8 11.2 GPT-4o 54.8 59.1 63.2 59.0 25.9 27.3 34.1 36.3 42.3 48.0 54.4 64.0 41.5 Gemini-2.5-Pro 55.3 60.1 61.6 59.0 31.9 31.8 35.7 39.4 43.1 48.7 61.8 68.6 45.1 MiMo-VL-7B-RL 21.8 27.2 29.2 26.1 5.5 6.9 8.0 10.7 15.9 19.5 20.6 28.9 14.5 InternVL3-8B 24.6 24.3 25.3 24.7 7.5 10.1 15.7 16.8 20.3 25.1 28.2 31.7 19.4 InternVL3-78B 21.3 26.5 28.4 25.4 7.1 10.9 14.1 18.5 23.1 25.7 29.0 37.0 20.7 Qwen2.5VL-72B 40.7 46.1 56.1 47.6 21.7 25.6 30.8 33.4 34.7 40.0 46.3 55.2 36.0 Qwen2.5VL-7B 14.4 30.1 43.8 29.4 5.8 12.0 20.3 25.6 32.7 40.9 50.2 60.9 31.1 +Cold-Start +RL 40.6 86.4 45.6 88.7 45.3 91.9 43.8 89.0 6.5 41.1 6.9 46.8 7.8 52.6 10.2 58.6 10.4 65.3 13.2 71.0 15.7 77.9 17.0 83.6 11.0 62.1 Table 3: Main results. Performance comparison of different models on the 9 benchmarks. Abbreviations: MME-RW (MME-RealWorld-Lite), RWQA (RealWorldQA), HRB4K (HRBench4K), HRB8K (HRBench8K), Halbench (HallusionBench), MMMU (MMMU_VAL), Avg. denotes the average performance across all 9 benchmarks. \\Delta represents the relative performance gain achieved by RL compared to the base model Qwen2.5-VL-7B. The best results are highlighted in bold , and the second-best results are underlined.", "source": "marker_v2", "marker_block_id": "/page/7/TableGroup/67"}
48
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0047", "section": "4.2 MAIN RESULTS", "page_start": 8, "page_end": 8, "type": "Table", "text": "Model MME-RW RWQA HRB4K HRB8K VStar MMVP BLINK HalBench MMMU Avg. LLaVA-OV-7B 48.4 69.5 65.3 58.4 73.3 77.3 52.6 36.6 48.2 58.8 InternVL2.5-8B 48.2 69.4 68.0 63.3 71.7 75.7 54.9 49.9 53.6 61.6 InternVL2.5-78B 49.7 78.4 74.5 72.5 75.9 83.0 63.6 57.1 65.4 68.9 Qwen2.5-VL-72B 44.7 75.3 80.1 77.1 85.9 81.7 61.6 53.5 66.9 69.6 Qwen2.5-VL-7B 44.6 68.5 68.8 65.3 76.4 74.3 56.4 50.1 54.8 62.1 + Cold-Start 46.2 68.4 71.0 68.4 77.5 76.7 55.7 49.8 54.0 63.1 + RL 48.4 70.2 73.0 70.5 80.6 78.0 58.0 51.9 55.8 65.2 \\Delta (vs. Qwen2.5-VL-7B) +3.8 +1.7 +4.2 +5.2 +4.2 +3.7 +1.6 +1.8 +1.0 +3.1", "source": "marker_v2", "marker_block_id": "/page/7/Table/4"}
49
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0048", "section": "4.2 MAIN RESULTS", "page_start": 8, "page_end": 8, "type": "Text", "text": "that jigsaw-based training effectively enhances the model's ability to capture visual relations and strengthen reasoning skills, thereby improving its performance on general vision downstream tasks.", "source": "marker_v2", "marker_block_id": "/page/7/Text/5"}
50
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0049", "section": "4.3 ANALYSIS", "page_start": 8, "page_end": 8, "type": "Text", "text": "Impact of Jigsaw Training Data Scale. To investigate the effect of data scale, we systematically vary the amount of training data and evaluate model performance on both jigsaw task and general vision tasks. As shown in Figure 3, scaling up the data yields substantial performance gains: jigsaw task accuracy increases from 22.0% to 82.8%, while HRBench4K and RealWorldQA see improvements of 2.0% and 1.8%, respectively. These results highlight a clear data-to-performance trend, demonstrating that larger training sets translate directly into stronger perceptual and reasoning abilities. Crucially, because jigasw data in our reinforcement learning stage are generated via scalable programmatic synthesis, AGILE can easily leverage larger datasets. This scalability not only provides richer learning signals for continual capability growth but also offers a practical and sustainable solution to the scarcity of high-quality multimodal RL data.", "source": "marker_v2", "marker_block_id": "/page/7/Text/7"}
51
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0050", "section": "4.3 ANALYSIS", "page_start": 8, "page_end": 8, "type": "Text", "text": "Performance Comparison: Jigsaw vs. General QA Data. We compare the effectiveness of jigsaw data against conventional General QA data for model training. As shown in Figure 4, models trained with jigsaw data consistently outperform those trained with QA data across multiple benchmarks. Notably, combining 10K jigsaw samples with 10K QA samples yields superior performance on general vision benchmarks compared to training with 20K QA samples alone. These results highlight the unique role of jigsaw data in enhancing fundamental visual generalization, demonstrating the efficiency and controllability of jigsaw-solving as a proxy for visual perception and reasoning. A key advantage of our approach lies in the programmatic synthesis of jigsaw data, which enables effortless construction of large-scale, high-quality datasets, a process that is otherwise costly and", "source": "marker_v2", "marker_block_id": "/page/7/Text/8"}
52
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0051", "section": "4.3 ANALYSIS", "page_start": 9, "page_end": 9, "type": "FigureGroup", "text": "Figure 3: Impact of Training Data Scale. The left y-axis denotes the accuracies on HRBench4K and RealWorldQA, while the right y-axis corresponds to the accuracy on the jigsaw task.", "source": "marker_v2", "marker_block_id": "/page/8/FigureGroup/79"}
53
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0052", "section": "4.3 ANALYSIS", "page_start": 9, "page_end": 9, "type": "FigureGroup", "text": "Figure 4: Comparison with General QA Data. The total number of samples is consistently maintained at 20K across both experimental setups.", "source": "marker_v2", "marker_block_id": "/page/8/FigureGroup/80"}
54
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0053", "section": "4.3 ANALYSIS", "page_start": 9, "page_end": 9, "type": "Text", "text": "labor-intensive for QA data. Thus, jigsaw data not only serves as an effective alternative to General QA data but, in some cases, proves to be the superior choice. This finding underscores the potential of jigsaw tasks in alleviating the scarcity of multimodal RL data and opens a promising new direction for advancing multimodal model development.", "source": "marker_v2", "marker_block_id": "/page/8/Text/5"}
55
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0054", "section": "4.3 ANALYSIS", "page_start": 9, "page_end": 9, "type": "FigureGroup", "text": "Figure 5: Case Study. Jigsaw-solving reasoning and behaviors exhibited by our model.", "source": "marker_v2", "marker_block_id": "/page/8/FigureGroup/81"}
56
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0055", "section": "4.3 ANALYSIS", "page_start": 9, "page_end": 9, "type": "Text", "text": "Case Study. In Figure 5, we showcase several jigsaw-solving reasoning patterns and behaviors exhibited by our model. These cases illustrate the emergence of high-quality perceptual and reasoning strategies in the jigsaw task, including comprehensively interpreting the visual content of individual pieces to infer their spatial relations, employing cropping and zooming to examine and validate edge alignment, and reasoning about semantic consistency across pieces. Such behaviors demon-", "source": "marker_v2", "marker_block_id": "/page/8/Text/8"}
57
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0056", "section": "4.3 ANALYSIS", "page_start": 10, "page_end": 10, "type": "Text", "text": "strate human-like reasoning, thereby effectively enhancing the model's perceptual and reasoning capabilities.", "source": "marker_v2", "marker_block_id": "/page/9/Text/1"}
58
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0057", "section": "5 CONCLUSION", "page_start": 10, "page_end": 10, "type": "Text", "text": "In this work, we propose a novel agentic jigsaw interaction learning framework that formulates jigsaw solving as an interactive process to enhance visual perception and reasoning in large Vision-Language Models (VLMs). By treating jigsaw solving as an iterative interaction, the model progressively refines its perceptual and reasoning capabilities through exploration and feedback. Our approach significantly improves performance on jigsaw tasks of varying complexity and demonstrates strong generalization to broader general visual tasks, including visual question answering and scene understanding. Furthermore, by analyzing the performance gains from increasing the scale of jigsaw data and comparing it with general QA data, we show that jigsaw serve as an effective proxy for alleviating the scarcity of high-quality RL data, highlighting the potential of task-driven proxy training for stimulating complex multimodal perception and reasoning in VLMs.", "source": "marker_v2", "marker_block_id": "/page/9/Text/3"}
iclr26/3kouij8BWi/marker_meta.json ADDED
@@ -0,0 +1,2297 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {
2
+ "table_of_contents": [
3
+ {
4
+ "title": "AGENTIC JIGSAW INTERACTION LEARNING FOR ENHANCING VISUAL PERCEPTION AND REASONING IN VISION-LANGUAGE MODELS",
5
+ "heading_level": null,
6
+ "page_id": 0,
7
+ "polygon": [
8
+ [
9
+ 106.3828125,
10
+ 79.6640625
11
+ ],
12
+ [
13
+ 504.0,
14
+ 79.6640625
15
+ ],
16
+ [
17
+ 504.0,
18
+ 133.5
19
+ ],
20
+ [
21
+ 106.3828125,
22
+ 133.5
23
+ ]
24
+ ]
25
+ },
26
+ {
27
+ "title": "ABSTRACT",
28
+ "heading_level": null,
29
+ "page_id": 0,
30
+ "polygon": [
31
+ [
32
+ 276.75,
33
+ 264.0
34
+ ],
35
+ [
36
+ 334.5,
37
+ 264.0
38
+ ],
39
+ [
40
+ 334.5,
41
+ 273.41015625
42
+ ],
43
+ [
44
+ 276.75,
45
+ 273.41015625
46
+ ]
47
+ ]
48
+ },
49
+ {
50
+ "title": "1 Introduction",
51
+ "heading_level": null,
52
+ "page_id": 0,
53
+ "polygon": [
54
+ [
55
+ 108.17578125,
56
+ 555.71484375
57
+ ],
58
+ [
59
+ 207.0,
60
+ 555.71484375
61
+ ],
62
+ [
63
+ 207.0,
64
+ 565.5
65
+ ],
66
+ [
67
+ 108.17578125,
68
+ 565.5
69
+ ]
70
+ ]
71
+ },
72
+ {
73
+ "title": "2 RELATED WORK",
74
+ "heading_level": null,
75
+ "page_id": 2,
76
+ "polygon": [
77
+ [
78
+ 107.279296875,
79
+ 232.41796875
80
+ ],
81
+ [
82
+ 211.18983459472656,
83
+ 232.41796875
84
+ ],
85
+ [
86
+ 211.18983459472656,
87
+ 244.62042236328125
88
+ ],
89
+ [
90
+ 107.279296875,
91
+ 244.62042236328125
92
+ ]
93
+ ]
94
+ },
95
+ {
96
+ "title": "3 METHOD",
97
+ "heading_level": null,
98
+ "page_id": 2,
99
+ "polygon": [
100
+ [
101
+ 108.29900360107422,
102
+ 648.52734375
103
+ ],
104
+ [
105
+ 172.81619262695312,
106
+ 648.52734375
107
+ ],
108
+ [
109
+ 172.81619262695312,
110
+ 662.1391754150391
111
+ ],
112
+ [
113
+ 108.29900360107422,
114
+ 662.1391754150391
115
+ ]
116
+ ]
117
+ },
118
+ {
119
+ "title": "3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION",
120
+ "heading_level": null,
121
+ "page_id": 3,
122
+ "polygon": [
123
+ [
124
+ 108.17578125,
125
+ 382.34844970703125
126
+ ],
127
+ [
128
+ 339.8639831542969,
129
+ 382.34844970703125
130
+ ],
131
+ [
132
+ 339.8639831542969,
133
+ 392.3110656738281
134
+ ],
135
+ [
136
+ 108.17578125,
137
+ 392.3110656738281
138
+ ]
139
+ ]
140
+ },
141
+ {
142
+ "title": "3.2 DATA CONSTRUCTION",
143
+ "heading_level": null,
144
+ "page_id": 4,
145
+ "polygon": [
146
+ [
147
+ 106.681640625,
148
+ 350.75390625
149
+ ],
150
+ [
151
+ 226.18246459960938,
152
+ 350.75390625
153
+ ],
154
+ [
155
+ 226.18246459960938,
156
+ 361.55108642578125
157
+ ],
158
+ [
159
+ 106.681640625,
160
+ 361.55108642578125
161
+ ]
162
+ ]
163
+ },
164
+ {
165
+ "title": "3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING",
166
+ "heading_level": null,
167
+ "page_id": 4,
168
+ "polygon": [
169
+ [
170
+ 108.2490005493164,
171
+ 608.30859375
172
+ ],
173
+ [
174
+ 432.9128112792969,
175
+ 608.30859375
176
+ ],
177
+ [
178
+ 432.9128112792969,
179
+ 618.7889404296875
180
+ ],
181
+ [
182
+ 108.2490005493164,
183
+ 618.7889404296875
184
+ ]
185
+ ]
186
+ },
187
+ {
188
+ "title": "4 EXPERIMENT",
189
+ "heading_level": null,
190
+ "page_id": 5,
191
+ "polygon": [
192
+ [
193
+ 106.98046875,
194
+ 530.96484375
195
+ ],
196
+ [
197
+ 195.0,
198
+ 530.96484375
199
+ ],
200
+ [
201
+ 195.0,
202
+ 541.5
203
+ ],
204
+ [
205
+ 106.98046875,
206
+ 541.5
207
+ ]
208
+ ]
209
+ },
210
+ {
211
+ "title": "4.1 IMPLEMENTATION DETAILS",
212
+ "heading_level": null,
213
+ "page_id": 5,
214
+ "polygon": [
215
+ [
216
+ 106.3828125,
217
+ 623.77734375
218
+ ],
219
+ [
220
+ 249.75,
221
+ 623.77734375
222
+ ],
223
+ [
224
+ 249.75,
225
+ 633.75
226
+ ],
227
+ [
228
+ 106.3828125,
229
+ 633.75
230
+ ]
231
+ ]
232
+ },
233
+ {
234
+ "title": "4.2 MAIN RESULTS",
235
+ "heading_level": null,
236
+ "page_id": 6,
237
+ "polygon": [
238
+ [
239
+ 106.98046875,
240
+ 381.3046875
241
+ ],
242
+ [
243
+ 197.7371826171875,
244
+ 381.3046875
245
+ ],
246
+ [
247
+ 197.7371826171875,
248
+ 391.3050537109375
249
+ ],
250
+ [
251
+ 106.98046875,
252
+ 391.3050537109375
253
+ ]
254
+ ]
255
+ },
256
+ {
257
+ "title": "4.3 ANALYSIS",
258
+ "heading_level": null,
259
+ "page_id": 7,
260
+ "polygon": [
261
+ [
262
+ 105.78515625,
263
+ 496.5
264
+ ],
265
+ [
266
+ 175.5,
267
+ 496.5
268
+ ],
269
+ [
270
+ 175.5,
271
+ 505.5
272
+ ],
273
+ [
274
+ 105.78515625,
275
+ 505.5
276
+ ]
277
+ ]
278
+ },
279
+ {
280
+ "title": "5 CONCLUSION",
281
+ "heading_level": null,
282
+ "page_id": 9,
283
+ "polygon": [
284
+ [
285
+ 106.98046875,
286
+ 122.58984375
287
+ ],
288
+ [
289
+ 195.37310791015625,
290
+ 122.58984375
291
+ ],
292
+ [
293
+ 195.37310791015625,
294
+ 134.56353759765625
295
+ ],
296
+ [
297
+ 106.98046875,
298
+ 134.56353759765625
299
+ ]
300
+ ]
301
+ },
302
+ {
303
+ "title": "6 ACKNOWLEDGEMENTS",
304
+ "heading_level": null,
305
+ "page_id": 9,
306
+ "polygon": [
307
+ [
308
+ 108.29900360107422,
309
+ 273.791259765625
310
+ ],
311
+ [
312
+ 243.449462890625,
313
+ 273.791259765625
314
+ ],
315
+ [
316
+ 243.449462890625,
317
+ 285.7464599609375
318
+ ],
319
+ [
320
+ 108.29900360107422,
321
+ 285.7464599609375
322
+ ]
323
+ ]
324
+ },
325
+ {
326
+ "title": "7 ETHICS STATEMENT",
327
+ "heading_level": null,
328
+ "page_id": 9,
329
+ "polygon": [
330
+ [
331
+ 106.98046875,
332
+ 359.2202453613281
333
+ ],
334
+ [
335
+ 227.9197540283203,
336
+ 359.2202453613281
337
+ ],
338
+ [
339
+ 227.9197540283203,
340
+ 371.1754455566406
341
+ ],
342
+ [
343
+ 106.98046875,
344
+ 371.1754455566406
345
+ ]
346
+ ]
347
+ },
348
+ {
349
+ "title": "8 REPRODICIBILITY STATEMENT",
350
+ "heading_level": null,
351
+ "page_id": 9,
352
+ "polygon": [
353
+ [
354
+ 108.29900360107422,
355
+ 444.33984375
356
+ ],
357
+ [
358
+ 281.3352355957031,
359
+ 444.33984375
360
+ ],
361
+ [
362
+ 281.3352355957031,
363
+ 456.60540771484375
364
+ ],
365
+ [
366
+ 108.29900360107422,
367
+ 456.60540771484375
368
+ ]
369
+ ]
370
+ },
371
+ {
372
+ "title": "REFERENCES",
373
+ "heading_level": null,
374
+ "page_id": 10,
375
+ "polygon": [
376
+ [
377
+ 107.279296875,
378
+ 82.37109375
379
+ ],
380
+ [
381
+ 175.2549285888672,
382
+ 82.37109375
383
+ ],
384
+ [
385
+ 175.2549285888672,
386
+ 94.7125244140625
387
+ ],
388
+ [
389
+ 107.279296875,
390
+ 94.7125244140625
391
+ ]
392
+ ]
393
+ },
394
+ {
395
+ "title": "APPENDIX",
396
+ "heading_level": null,
397
+ "page_id": 14,
398
+ "polygon": [
399
+ [
400
+ 107.279296875,
401
+ 82.75732421875
402
+ ],
403
+ [
404
+ 161.44195556640625,
405
+ 82.75732421875
406
+ ],
407
+ [
408
+ 161.44195556640625,
409
+ 94.7125244140625
410
+ ],
411
+ [
412
+ 107.279296875,
413
+ 94.7125244140625
414
+ ]
415
+ ]
416
+ },
417
+ {
418
+ "title": "A DATA DISTRIBUTION",
419
+ "heading_level": null,
420
+ "page_id": 14,
421
+ "polygon": [
422
+ [
423
+ 108.29899597167969,
424
+ 108.59234619140625
425
+ ],
426
+ [
427
+ 235.81500244140625,
428
+ 108.59234619140625
429
+ ],
430
+ [
431
+ 235.81500244140625,
432
+ 120.54754638671875
433
+ ],
434
+ [
435
+ 108.29899597167969,
436
+ 120.54754638671875
437
+ ]
438
+ ]
439
+ },
440
+ {
441
+ "title": "B PROMPTS",
442
+ "heading_level": null,
443
+ "page_id": 14,
444
+ "polygon": [
445
+ [
446
+ 106.98046875,
447
+ 490.74609375
448
+ ],
449
+ [
450
+ 176.9048614501953,
451
+ 490.74609375
452
+ ],
453
+ [
454
+ 176.9048614501953,
455
+ 503.4554443359375
456
+ ],
457
+ [
458
+ 106.98046875,
459
+ 503.4554443359375
460
+ ]
461
+ ]
462
+ },
463
+ {
464
+ "title": "Prompt for Interactive Collection of High-Quality Jigsaw Trajectories",
465
+ "heading_level": null,
466
+ "page_id": 14,
467
+ "polygon": [
468
+ [
469
+ 122.51953125,
470
+ 557.5894775390625
471
+ ],
472
+ [
473
+ 401.3283386230469,
474
+ 557.5894775390625
475
+ ],
476
+ [
477
+ 401.3283386230469,
478
+ 567.5520782470703
479
+ ],
480
+ [
481
+ 122.51953125,
482
+ 567.5520782470703
483
+ ]
484
+ ]
485
+ },
486
+ {
487
+ "title": "System Prompt:",
488
+ "heading_level": null,
489
+ "page_id": 14,
490
+ "polygon": [
491
+ [
492
+ 122.51953125,
493
+ 579.1181640625
494
+ ],
495
+ [
496
+ 206.0460205078125,
497
+ 579.1181640625
498
+ ],
499
+ [
500
+ 206.0460205078125,
501
+ 591.0733642578125
502
+ ],
503
+ [
504
+ 122.51953125,
505
+ 591.0733642578125
506
+ ]
507
+ ]
508
+ },
509
+ {
510
+ "title": "Your Task:",
511
+ "heading_level": null,
512
+ "page_id": 14,
513
+ "polygon": [
514
+ [
515
+ 123.416015625,
516
+ 710.40234375
517
+ ],
518
+ [
519
+ 170.55470275878906,
520
+ 710.40234375
521
+ ],
522
+ [
523
+ 170.55470275878906,
524
+ 722.1171112060547
525
+ ],
526
+ [
527
+ 123.416015625,
528
+ 722.1171112060547
529
+ ]
530
+ ]
531
+ },
532
+ {
533
+ "title": "Inference Process:",
534
+ "heading_level": null,
535
+ "page_id": 15,
536
+ "polygon": [
537
+ [
538
+ 122.818359375,
539
+ 353.4609375
540
+ ],
541
+ [
542
+ 201.51846313476562,
543
+ 353.4609375
544
+ ],
545
+ [
546
+ 201.51846313476562,
547
+ 363.9769287109375
548
+ ],
549
+ [
550
+ 122.818359375,
551
+ 363.9769287109375
552
+ ]
553
+ ]
554
+ },
555
+ {
556
+ "title": "Available Image Operations:",
557
+ "heading_level": null,
558
+ "page_id": 16,
559
+ "polygon": [
560
+ [
561
+ 122.51953125,
562
+ 122.9765625
563
+ ],
564
+ [
565
+ 245.3638458251953,
566
+ 122.9765625
567
+ ],
568
+ [
569
+ 245.3638458251953,
570
+ 133.84014892578125
571
+ ],
572
+ [
573
+ 122.51953125,
574
+ 133.84014892578125
575
+ ]
576
+ ]
577
+ },
578
+ {
579
+ "title": "Format:",
580
+ "heading_level": null,
581
+ "page_id": 16,
582
+ "polygon": [
583
+ [
584
+ 122.51953125,
585
+ 296.2315368652344
586
+ ],
587
+ [
588
+ 158.7480010986328,
589
+ 296.2315368652344
590
+ ],
591
+ [
592
+ 158.7480010986328,
593
+ 306.1941223144531
594
+ ],
595
+ [
596
+ 122.51953125,
597
+ 306.1941223144531
598
+ ]
599
+ ]
600
+ },
601
+ {
602
+ "title": "Important:",
603
+ "heading_level": null,
604
+ "page_id": 16,
605
+ "polygon": [
606
+ [
607
+ 123.1171875,
608
+ 349.59375
609
+ ],
610
+ [
611
+ 171.1813201904297,
612
+ 349.59375
613
+ ],
614
+ [
615
+ 171.1813201904297,
616
+ 360.98809814453125
617
+ ],
618
+ [
619
+ 123.1171875,
620
+ 360.98809814453125
621
+ ]
622
+ ]
623
+ },
624
+ {
625
+ "title": "User Prompt:",
626
+ "heading_level": null,
627
+ "page_id": 16,
628
+ "polygon": [
629
+ [
630
+ 122.220703125,
631
+ 538.9271697998047
632
+ ],
633
+ [
634
+ 193.42132568359375,
635
+ 538.9271697998047
636
+ ],
637
+ [
638
+ 193.42132568359375,
639
+ 550.8823699951172
640
+ ],
641
+ [
642
+ 122.220703125,
643
+ 550.8823699951172
644
+ ]
645
+ ]
646
+ },
647
+ {
648
+ "title": "C CASE STUDY",
649
+ "heading_level": null,
650
+ "page_id": 17,
651
+ "polygon": [
652
+ [
653
+ 106.3828125,
654
+ 81.59765625
655
+ ],
656
+ [
657
+ 195.26319885253906,
658
+ 81.59765625
659
+ ],
660
+ [
661
+ 195.26319885253906,
662
+ 94.7125244140625
663
+ ],
664
+ [
665
+ 106.3828125,
666
+ 94.7125244140625
667
+ ]
668
+ ]
669
+ },
670
+ {
671
+ "title": "D THE IMPLEMENTATION OF TRAINING",
672
+ "heading_level": null,
673
+ "page_id": 20,
674
+ "polygon": [
675
+ [
676
+ 108.29900360107422,
677
+ 679.46484375
678
+ ],
679
+ [
680
+ 317.3537292480469,
681
+ 679.46484375
682
+ ],
683
+ [
684
+ 317.3537292480469,
685
+ 692.1374969482422
686
+ ],
687
+ [
688
+ 108.29900360107422,
689
+ 692.1374969482422
690
+ ]
691
+ ]
692
+ },
693
+ {
694
+ "title": "E ANALYSIS OF WANDB CURVES IN JIGSAW OPTIMIZATION",
695
+ "heading_level": null,
696
+ "page_id": 21,
697
+ "polygon": [
698
+ [
699
+ 107.578125,
700
+ 276.4312744140625
701
+ ],
702
+ [
703
+ 415.96875,
704
+ 276.4312744140625
705
+ ],
706
+ [
707
+ 415.96875,
708
+ 288.3865051269531
709
+ ],
710
+ [
711
+ 107.578125,
712
+ 288.3865051269531
713
+ ]
714
+ ]
715
+ },
716
+ {
717
+ "title": "F LIMITATIONS",
718
+ "heading_level": null,
719
+ "page_id": 22,
720
+ "polygon": [
721
+ [
722
+ 107.578125,
723
+ 81.59765625
724
+ ],
725
+ [
726
+ 194.5506134033203,
727
+ 81.59765625
728
+ ],
729
+ [
730
+ 194.5506134033203,
731
+ 94.7125244140625
732
+ ],
733
+ [
734
+ 107.578125,
735
+ 94.7125244140625
736
+ ]
737
+ ]
738
+ },
739
+ {
740
+ "title": "G QUALITATIVE ANALYSIS ON ATTENTION PATTERNS",
741
+ "heading_level": null,
742
+ "page_id": 22,
743
+ "polygon": [
744
+ [
745
+ 107.578125,
746
+ 198.7734375
747
+ ],
748
+ [
749
+ 390.74639892578125,
750
+ 198.7734375
751
+ ],
752
+ [
753
+ 390.74639892578125,
754
+ 211.928466796875
755
+ ],
756
+ [
757
+ 107.578125,
758
+ 211.928466796875
759
+ ]
760
+ ]
761
+ },
762
+ {
763
+ "title": "H WHICH TASKS CAN BENEFIT MORE FROM AGILE?",
764
+ "heading_level": null,
765
+ "page_id": 22,
766
+ "polygon": [
767
+ [
768
+ 106.98046875,
769
+ 393.901123046875
770
+ ],
771
+ [
772
+ 385.48828125,
773
+ 393.901123046875
774
+ ],
775
+ [
776
+ 385.48828125,
777
+ 405.8563232421875
778
+ ],
779
+ [
780
+ 106.98046875,
781
+ 405.8563232421875
782
+ ]
783
+ ]
784
+ },
785
+ {
786
+ "title": "I HANDLING INVALID CODE EXECUTIONS",
787
+ "heading_level": null,
788
+ "page_id": 22,
789
+ "polygon": [
790
+ [
791
+ 108.29899597167969,
792
+ 626.87109375
793
+ ],
794
+ [
795
+ 331.1015625,
796
+ 626.87109375
797
+ ],
798
+ [
799
+ 331.1015625,
800
+ 639.6343231201172
801
+ ],
802
+ [
803
+ 108.29899597167969,
804
+ 639.6343231201172
805
+ ]
806
+ ]
807
+ },
808
+ {
809
+ "title": "J ADDITIONAL EXPERIMENTS",
810
+ "heading_level": null,
811
+ "page_id": 23,
812
+ "polygon": [
813
+ [
814
+ 106.98046875,
815
+ 641.9393005371094
816
+ ],
817
+ [
818
+ 268.5528869628906,
819
+ 641.9393005371094
820
+ ],
821
+ [
822
+ 268.5528869628906,
823
+ 653.8945007324219
824
+ ],
825
+ [
826
+ 106.98046875,
827
+ 653.8945007324219
828
+ ]
829
+ ]
830
+ },
831
+ {
832
+ "title": "J.1 SENSITIVITY TO REWARD COEFFICIENTS.",
833
+ "heading_level": null,
834
+ "page_id": 23,
835
+ "polygon": [
836
+ [
837
+ 108.17578125,
838
+ 667.08984375
839
+ ],
840
+ [
841
+ 307.1546936035156,
842
+ 667.08984375
843
+ ],
844
+ [
845
+ 307.1546936035156,
846
+ 678.1510696411133
847
+ ],
848
+ [
849
+ 108.17578125,
850
+ 678.1510696411133
851
+ ]
852
+ ]
853
+ },
854
+ {
855
+ "title": "J.2 RESULTS OF LARGER JIGSAW GRID SIZES AND CURRICULUM RL TRAINING",
856
+ "heading_level": null,
857
+ "page_id": 24,
858
+ "polygon": [
859
+ [
860
+ 106.3828125,
861
+ 226.6171875
862
+ ],
863
+ [
864
+ 455.25,
865
+ 226.6171875
866
+ ],
867
+ [
868
+ 455.25,
869
+ 236.25
870
+ ],
871
+ [
872
+ 106.3828125,
873
+ 236.25
874
+ ]
875
+ ]
876
+ },
877
+ {
878
+ "title": "J.3 EXPERT TRAJECTORIES ABLATIONS",
879
+ "heading_level": null,
880
+ "page_id": 24,
881
+ "polygon": [
882
+ [
883
+ 106.5,
884
+ 413.40234375
885
+ ],
886
+ [
887
+ 284.25,
888
+ 413.40234375
889
+ ],
890
+ [
891
+ 284.25,
892
+ 423.0
893
+ ],
894
+ [
895
+ 106.5,
896
+ 423.0
897
+ ]
898
+ ]
899
+ },
900
+ {
901
+ "title": "J.4 GENERAL QA DATASET DETAILS AND EXTENDED COMPARISON WITH JIGSAW TRAINING",
902
+ "heading_level": null,
903
+ "page_id": 24,
904
+ "polygon": [
905
+ [
906
+ 106.5,
907
+ 668.25
908
+ ],
909
+ [
910
+ 465.0,
911
+ 668.25
912
+ ],
913
+ [
914
+ 465.0,
915
+ 687.75
916
+ ],
917
+ [
918
+ 106.5,
919
+ 687.75
920
+ ]
921
+ ]
922
+ },
923
+ {
924
+ "title": "J.5 IMPACT OF SCALING THE COLD-START (SFT) DATASET",
925
+ "heading_level": null,
926
+ "page_id": 25,
927
+ "polygon": [
928
+ [
929
+ 106.5,
930
+ 289.5
931
+ ],
932
+ [
933
+ 369.0,
934
+ 289.5
935
+ ],
936
+ [
937
+ 369.0,
938
+ 299.25
939
+ ],
940
+ [
941
+ 106.5,
942
+ 299.25
943
+ ]
944
+ ]
945
+ },
946
+ {
947
+ "title": "K USE OF LLMS",
948
+ "heading_level": null,
949
+ "page_id": 25,
950
+ "polygon": [
951
+ [
952
+ 106.3828125,
953
+ 564.99609375
954
+ ],
955
+ [
956
+ 204.0,
957
+ 564.99609375
958
+ ],
959
+ [
960
+ 204.0,
961
+ 574.5
962
+ ],
963
+ [
964
+ 106.3828125,
965
+ 574.5
966
+ ]
967
+ ]
968
+ }
969
+ ],
970
+ "page_stats": [
971
+ {
972
+ "page_id": 0,
973
+ "text_extraction_method": "surya",
974
+ "block_counts": [
975
+ [
976
+ "Line",
977
+ 59
978
+ ],
979
+ [
980
+ "Span",
981
+ 43
982
+ ],
983
+ [
984
+ "Footnote",
985
+ 6
986
+ ],
987
+ [
988
+ "SectionHeader",
989
+ 3
990
+ ],
991
+ [
992
+ "Text",
993
+ 3
994
+ ],
995
+ [
996
+ "PageHeader",
997
+ 1
998
+ ],
999
+ [
1000
+ "PageFooter",
1001
+ 1
1002
+ ]
1003
+ ],
1004
+ "block_metadata": {
1005
+ "llm_request_count": 0,
1006
+ "llm_error_count": 0,
1007
+ "llm_tokens_used": 0,
1008
+ "previous_text": "",
1009
+ "previous_type": "",
1010
+ "previous_order": 0
1011
+ }
1012
+ },
1013
+ {
1014
+ "page_id": 1,
1015
+ "text_extraction_method": "pdftext",
1016
+ "block_counts": [
1017
+ [
1018
+ "Span",
1019
+ 122
1020
+ ],
1021
+ [
1022
+ "Line",
1023
+ 47
1024
+ ],
1025
+ [
1026
+ "Text",
1027
+ 5
1028
+ ],
1029
+ [
1030
+ "Picture",
1031
+ 3
1032
+ ],
1033
+ [
1034
+ "PageHeader",
1035
+ 1
1036
+ ],
1037
+ [
1038
+ "Caption",
1039
+ 1
1040
+ ],
1041
+ [
1042
+ "PageFooter",
1043
+ 1
1044
+ ],
1045
+ [
1046
+ "PictureGroup",
1047
+ 1
1048
+ ],
1049
+ [
1050
+ "Reference",
1051
+ 1
1052
+ ]
1053
+ ],
1054
+ "block_metadata": {
1055
+ "llm_request_count": 0,
1056
+ "llm_error_count": 0,
1057
+ "llm_tokens_used": 0,
1058
+ "previous_text": "",
1059
+ "previous_type": "",
1060
+ "previous_order": 0
1061
+ }
1062
+ },
1063
+ {
1064
+ "page_id": 2,
1065
+ "text_extraction_method": "pdftext",
1066
+ "block_counts": [
1067
+ [
1068
+ "Span",
1069
+ 145
1070
+ ],
1071
+ [
1072
+ "Line",
1073
+ 52
1074
+ ],
1075
+ [
1076
+ "ListItem",
1077
+ 3
1078
+ ],
1079
+ [
1080
+ "Text",
1081
+ 3
1082
+ ],
1083
+ [
1084
+ "SectionHeader",
1085
+ 2
1086
+ ],
1087
+ [
1088
+ "PageHeader",
1089
+ 1
1090
+ ],
1091
+ [
1092
+ "PageFooter",
1093
+ 1
1094
+ ],
1095
+ [
1096
+ "ListGroup",
1097
+ 1
1098
+ ]
1099
+ ],
1100
+ "block_metadata": {
1101
+ "llm_request_count": 0,
1102
+ "llm_error_count": 0,
1103
+ "llm_tokens_used": 0,
1104
+ "previous_text": "",
1105
+ "previous_type": "",
1106
+ "previous_order": 0
1107
+ }
1108
+ },
1109
+ {
1110
+ "page_id": 3,
1111
+ "text_extraction_method": "pdftext",
1112
+ "block_counts": [
1113
+ [
1114
+ "Span",
1115
+ 222
1116
+ ],
1117
+ [
1118
+ "Line",
1119
+ 33
1120
+ ],
1121
+ [
1122
+ "Text",
1123
+ 5
1124
+ ],
1125
+ [
1126
+ "Equation",
1127
+ 3
1128
+ ],
1129
+ [
1130
+ "ListItem",
1131
+ 2
1132
+ ],
1133
+ [
1134
+ "PageHeader",
1135
+ 1
1136
+ ],
1137
+ [
1138
+ "Figure",
1139
+ 1
1140
+ ],
1141
+ [
1142
+ "Caption",
1143
+ 1
1144
+ ],
1145
+ [
1146
+ "SectionHeader",
1147
+ 1
1148
+ ],
1149
+ [
1150
+ "PageFooter",
1151
+ 1
1152
+ ],
1153
+ [
1154
+ "FigureGroup",
1155
+ 1
1156
+ ],
1157
+ [
1158
+ "ListGroup",
1159
+ 1
1160
+ ],
1161
+ [
1162
+ "Reference",
1163
+ 1
1164
+ ]
1165
+ ],
1166
+ "block_metadata": {
1167
+ "llm_request_count": 0,
1168
+ "llm_error_count": 0,
1169
+ "llm_tokens_used": 0,
1170
+ "previous_text": "",
1171
+ "previous_type": "",
1172
+ "previous_order": 0
1173
+ }
1174
+ },
1175
+ {
1176
+ "page_id": 4,
1177
+ "text_extraction_method": "pdftext",
1178
+ "block_counts": [
1179
+ [
1180
+ "Span",
1181
+ 300
1182
+ ],
1183
+ [
1184
+ "Line",
1185
+ 51
1186
+ ],
1187
+ [
1188
+ "Text",
1189
+ 6
1190
+ ],
1191
+ [
1192
+ "Reference",
1193
+ 4
1194
+ ],
1195
+ [
1196
+ "Code",
1197
+ 2
1198
+ ],
1199
+ [
1200
+ "SectionHeader",
1201
+ 2
1202
+ ],
1203
+ [
1204
+ "PageHeader",
1205
+ 1
1206
+ ],
1207
+ [
1208
+ "Footnote",
1209
+ 1
1210
+ ],
1211
+ [
1212
+ "PageFooter",
1213
+ 1
1214
+ ]
1215
+ ],
1216
+ "block_metadata": {
1217
+ "llm_request_count": 0,
1218
+ "llm_error_count": 0,
1219
+ "llm_tokens_used": 0,
1220
+ "previous_text": "",
1221
+ "previous_type": "",
1222
+ "previous_order": 0
1223
+ }
1224
+ },
1225
+ {
1226
+ "page_id": 5,
1227
+ "text_extraction_method": "surya",
1228
+ "block_counts": [
1229
+ [
1230
+ "Line",
1231
+ 56
1232
+ ],
1233
+ [
1234
+ "Span",
1235
+ 54
1236
+ ],
1237
+ [
1238
+ "Text",
1239
+ 5
1240
+ ],
1241
+ [
1242
+ "Equation",
1243
+ 3
1244
+ ],
1245
+ [
1246
+ "ListItem",
1247
+ 3
1248
+ ],
1249
+ [
1250
+ "Reference",
1251
+ 3
1252
+ ],
1253
+ [
1254
+ "SectionHeader",
1255
+ 2
1256
+ ],
1257
+ [
1258
+ "PageHeader",
1259
+ 1
1260
+ ],
1261
+ [
1262
+ "PageFooter",
1263
+ 1
1264
+ ],
1265
+ [
1266
+ "ListGroup",
1267
+ 1
1268
+ ]
1269
+ ],
1270
+ "block_metadata": {
1271
+ "llm_request_count": 0,
1272
+ "llm_error_count": 0,
1273
+ "llm_tokens_used": 0,
1274
+ "previous_text": "",
1275
+ "previous_type": "",
1276
+ "previous_order": 0
1277
+ }
1278
+ },
1279
+ {
1280
+ "page_id": 6,
1281
+ "text_extraction_method": "pdftext",
1282
+ "block_counts": [
1283
+ [
1284
+ "Span",
1285
+ 326
1286
+ ],
1287
+ [
1288
+ "TableCell",
1289
+ 161
1290
+ ],
1291
+ [
1292
+ "Line",
1293
+ 54
1294
+ ],
1295
+ [
1296
+ "Text",
1297
+ 4
1298
+ ],
1299
+ [
1300
+ "Reference",
1301
+ 2
1302
+ ],
1303
+ [
1304
+ "PageHeader",
1305
+ 1
1306
+ ],
1307
+ [
1308
+ "Caption",
1309
+ 1
1310
+ ],
1311
+ [
1312
+ "Table",
1313
+ 1
1314
+ ],
1315
+ [
1316
+ "SectionHeader",
1317
+ 1
1318
+ ],
1319
+ [
1320
+ "PageFooter",
1321
+ 1
1322
+ ],
1323
+ [
1324
+ "TableGroup",
1325
+ 1
1326
+ ]
1327
+ ],
1328
+ "block_metadata": {
1329
+ "llm_request_count": 0,
1330
+ "llm_error_count": 0,
1331
+ "llm_tokens_used": 0,
1332
+ "previous_text": "",
1333
+ "previous_type": "",
1334
+ "previous_order": 0
1335
+ }
1336
+ },
1337
+ {
1338
+ "page_id": 7,
1339
+ "text_extraction_method": "surya",
1340
+ "block_counts": [
1341
+ [
1342
+ "TableCell",
1343
+ 245
1344
+ ],
1345
+ [
1346
+ "Line",
1347
+ 39
1348
+ ],
1349
+ [
1350
+ "Span",
1351
+ 18
1352
+ ],
1353
+ [
1354
+ "Text",
1355
+ 3
1356
+ ],
1357
+ [
1358
+ "Reference",
1359
+ 3
1360
+ ],
1361
+ [
1362
+ "Caption",
1363
+ 2
1364
+ ],
1365
+ [
1366
+ "Table",
1367
+ 2
1368
+ ],
1369
+ [
1370
+ "PageHeader",
1371
+ 1
1372
+ ],
1373
+ [
1374
+ "SectionHeader",
1375
+ 1
1376
+ ],
1377
+ [
1378
+ "PageFooter",
1379
+ 1
1380
+ ],
1381
+ [
1382
+ "TableGroup",
1383
+ 1
1384
+ ]
1385
+ ],
1386
+ "block_metadata": {
1387
+ "llm_request_count": 0,
1388
+ "llm_error_count": 0,
1389
+ "llm_tokens_used": 0,
1390
+ "previous_text": "",
1391
+ "previous_type": "",
1392
+ "previous_order": 0
1393
+ }
1394
+ },
1395
+ {
1396
+ "page_id": 8,
1397
+ "text_extraction_method": "pdftext",
1398
+ "block_counts": [
1399
+ [
1400
+ "Span",
1401
+ 48
1402
+ ],
1403
+ [
1404
+ "Line",
1405
+ 21
1406
+ ],
1407
+ [
1408
+ "Figure",
1409
+ 3
1410
+ ],
1411
+ [
1412
+ "Caption",
1413
+ 3
1414
+ ],
1415
+ [
1416
+ "FigureGroup",
1417
+ 3
1418
+ ],
1419
+ [
1420
+ "Text",
1421
+ 2
1422
+ ],
1423
+ [
1424
+ "Reference",
1425
+ 2
1426
+ ],
1427
+ [
1428
+ "PageHeader",
1429
+ 1
1430
+ ],
1431
+ [
1432
+ "PageFooter",
1433
+ 1
1434
+ ]
1435
+ ],
1436
+ "block_metadata": {
1437
+ "llm_request_count": 0,
1438
+ "llm_error_count": 0,
1439
+ "llm_tokens_used": 0,
1440
+ "previous_text": "",
1441
+ "previous_type": "",
1442
+ "previous_order": 0
1443
+ }
1444
+ },
1445
+ {
1446
+ "page_id": 9,
1447
+ "text_extraction_method": "pdftext",
1448
+ "block_counts": [
1449
+ [
1450
+ "Span",
1451
+ 61
1452
+ ],
1453
+ [
1454
+ "Line",
1455
+ 30
1456
+ ],
1457
+ [
1458
+ "Text",
1459
+ 5
1460
+ ],
1461
+ [
1462
+ "SectionHeader",
1463
+ 4
1464
+ ],
1465
+ [
1466
+ "PageHeader",
1467
+ 1
1468
+ ],
1469
+ [
1470
+ "PageFooter",
1471
+ 1
1472
+ ]
1473
+ ],
1474
+ "block_metadata": {
1475
+ "llm_request_count": 0,
1476
+ "llm_error_count": 0,
1477
+ "llm_tokens_used": 0,
1478
+ "previous_text": "",
1479
+ "previous_type": "",
1480
+ "previous_order": 0
1481
+ }
1482
+ },
1483
+ {
1484
+ "page_id": 10,
1485
+ "text_extraction_method": "pdftext",
1486
+ "block_counts": [
1487
+ [
1488
+ "Span",
1489
+ 140
1490
+ ],
1491
+ [
1492
+ "Line",
1493
+ 51
1494
+ ],
1495
+ [
1496
+ "ListItem",
1497
+ 15
1498
+ ],
1499
+ [
1500
+ "Reference",
1501
+ 15
1502
+ ],
1503
+ [
1504
+ "PageHeader",
1505
+ 1
1506
+ ],
1507
+ [
1508
+ "SectionHeader",
1509
+ 1
1510
+ ],
1511
+ [
1512
+ "PageFooter",
1513
+ 1
1514
+ ],
1515
+ [
1516
+ "ListGroup",
1517
+ 1
1518
+ ]
1519
+ ],
1520
+ "block_metadata": {
1521
+ "llm_request_count": 0,
1522
+ "llm_error_count": 0,
1523
+ "llm_tokens_used": 0,
1524
+ "previous_text": "",
1525
+ "previous_type": "",
1526
+ "previous_order": 0
1527
+ }
1528
+ },
1529
+ {
1530
+ "page_id": 11,
1531
+ "text_extraction_method": "pdftext",
1532
+ "block_counts": [
1533
+ [
1534
+ "Span",
1535
+ 145
1536
+ ],
1537
+ [
1538
+ "Line",
1539
+ 51
1540
+ ],
1541
+ [
1542
+ "ListItem",
1543
+ 16
1544
+ ],
1545
+ [
1546
+ "Reference",
1547
+ 16
1548
+ ],
1549
+ [
1550
+ "PageHeader",
1551
+ 1
1552
+ ],
1553
+ [
1554
+ "PageFooter",
1555
+ 1
1556
+ ],
1557
+ [
1558
+ "ListGroup",
1559
+ 1
1560
+ ]
1561
+ ],
1562
+ "block_metadata": {
1563
+ "llm_request_count": 0,
1564
+ "llm_error_count": 0,
1565
+ "llm_tokens_used": 0,
1566
+ "previous_text": "",
1567
+ "previous_type": "",
1568
+ "previous_order": 0
1569
+ }
1570
+ },
1571
+ {
1572
+ "page_id": 12,
1573
+ "text_extraction_method": "pdftext",
1574
+ "block_counts": [
1575
+ [
1576
+ "Span",
1577
+ 142
1578
+ ],
1579
+ [
1580
+ "Line",
1581
+ 50
1582
+ ],
1583
+ [
1584
+ "ListItem",
1585
+ 16
1586
+ ],
1587
+ [
1588
+ "Reference",
1589
+ 16
1590
+ ],
1591
+ [
1592
+ "PageHeader",
1593
+ 1
1594
+ ],
1595
+ [
1596
+ "PageFooter",
1597
+ 1
1598
+ ],
1599
+ [
1600
+ "ListGroup",
1601
+ 1
1602
+ ]
1603
+ ],
1604
+ "block_metadata": {
1605
+ "llm_request_count": 0,
1606
+ "llm_error_count": 0,
1607
+ "llm_tokens_used": 0,
1608
+ "previous_text": "",
1609
+ "previous_type": "",
1610
+ "previous_order": 0
1611
+ }
1612
+ },
1613
+ {
1614
+ "page_id": 13,
1615
+ "text_extraction_method": "pdftext",
1616
+ "block_counts": [
1617
+ [
1618
+ "Span",
1619
+ 137
1620
+ ],
1621
+ [
1622
+ "Line",
1623
+ 49
1624
+ ],
1625
+ [
1626
+ "ListItem",
1627
+ 15
1628
+ ],
1629
+ [
1630
+ "Reference",
1631
+ 15
1632
+ ],
1633
+ [
1634
+ "PageHeader",
1635
+ 1
1636
+ ],
1637
+ [
1638
+ "PageFooter",
1639
+ 1
1640
+ ],
1641
+ [
1642
+ "ListGroup",
1643
+ 1
1644
+ ]
1645
+ ],
1646
+ "block_metadata": {
1647
+ "llm_request_count": 0,
1648
+ "llm_error_count": 0,
1649
+ "llm_tokens_used": 0,
1650
+ "previous_text": "",
1651
+ "previous_type": "",
1652
+ "previous_order": 0
1653
+ }
1654
+ },
1655
+ {
1656
+ "page_id": 14,
1657
+ "text_extraction_method": "pdftext",
1658
+ "block_counts": [
1659
+ [
1660
+ "Span",
1661
+ 111
1662
+ ],
1663
+ [
1664
+ "Line",
1665
+ 34
1666
+ ],
1667
+ [
1668
+ "SectionHeader",
1669
+ 6
1670
+ ],
1671
+ [
1672
+ "Text",
1673
+ 6
1674
+ ],
1675
+ [
1676
+ "ListItem",
1677
+ 3
1678
+ ],
1679
+ [
1680
+ "Reference",
1681
+ 3
1682
+ ],
1683
+ [
1684
+ "PageHeader",
1685
+ 1
1686
+ ],
1687
+ [
1688
+ "Figure",
1689
+ 1
1690
+ ],
1691
+ [
1692
+ "Caption",
1693
+ 1
1694
+ ],
1695
+ [
1696
+ "Equation",
1697
+ 1
1698
+ ],
1699
+ [
1700
+ "PageFooter",
1701
+ 1
1702
+ ],
1703
+ [
1704
+ "FigureGroup",
1705
+ 1
1706
+ ],
1707
+ [
1708
+ "ListGroup",
1709
+ 1
1710
+ ]
1711
+ ],
1712
+ "block_metadata": {
1713
+ "llm_request_count": 0,
1714
+ "llm_error_count": 0,
1715
+ "llm_tokens_used": 0,
1716
+ "previous_text": "",
1717
+ "previous_type": "",
1718
+ "previous_order": 0
1719
+ }
1720
+ },
1721
+ {
1722
+ "page_id": 15,
1723
+ "text_extraction_method": "pdftext",
1724
+ "block_counts": [
1725
+ [
1726
+ "Span",
1727
+ 165
1728
+ ],
1729
+ [
1730
+ "Line",
1731
+ 46
1732
+ ],
1733
+ [
1734
+ "ListItem",
1735
+ 7
1736
+ ],
1737
+ [
1738
+ "Text",
1739
+ 6
1740
+ ],
1741
+ [
1742
+ "ListGroup",
1743
+ 2
1744
+ ],
1745
+ [
1746
+ "PageHeader",
1747
+ 1
1748
+ ],
1749
+ [
1750
+ "SectionHeader",
1751
+ 1
1752
+ ],
1753
+ [
1754
+ "Code",
1755
+ 1
1756
+ ],
1757
+ [
1758
+ "PageFooter",
1759
+ 1
1760
+ ]
1761
+ ],
1762
+ "block_metadata": {
1763
+ "llm_request_count": 0,
1764
+ "llm_error_count": 0,
1765
+ "llm_tokens_used": 0,
1766
+ "previous_text": "",
1767
+ "previous_type": "",
1768
+ "previous_order": 0
1769
+ }
1770
+ },
1771
+ {
1772
+ "page_id": 16,
1773
+ "text_extraction_method": "pdftext",
1774
+ "block_counts": [
1775
+ [
1776
+ "Span",
1777
+ 163
1778
+ ],
1779
+ [
1780
+ "Line",
1781
+ 35
1782
+ ],
1783
+ [
1784
+ "Text",
1785
+ 11
1786
+ ],
1787
+ [
1788
+ "ListItem",
1789
+ 5
1790
+ ],
1791
+ [
1792
+ "SectionHeader",
1793
+ 4
1794
+ ],
1795
+ [
1796
+ "Code",
1797
+ 3
1798
+ ],
1799
+ [
1800
+ "PageHeader",
1801
+ 1
1802
+ ],
1803
+ [
1804
+ "PageFooter",
1805
+ 1
1806
+ ],
1807
+ [
1808
+ "ListGroup",
1809
+ 1
1810
+ ]
1811
+ ],
1812
+ "block_metadata": {
1813
+ "llm_request_count": 0,
1814
+ "llm_error_count": 0,
1815
+ "llm_tokens_used": 0,
1816
+ "previous_text": "",
1817
+ "previous_type": "",
1818
+ "previous_order": 0
1819
+ }
1820
+ },
1821
+ {
1822
+ "page_id": 17,
1823
+ "text_extraction_method": "pdftext",
1824
+ "block_counts": [
1825
+ [
1826
+ "Span",
1827
+ 27
1828
+ ],
1829
+ [
1830
+ "Line",
1831
+ 10
1832
+ ],
1833
+ [
1834
+ "PageHeader",
1835
+ 1
1836
+ ],
1837
+ [
1838
+ "SectionHeader",
1839
+ 1
1840
+ ],
1841
+ [
1842
+ "Text",
1843
+ 1
1844
+ ],
1845
+ [
1846
+ "Figure",
1847
+ 1
1848
+ ],
1849
+ [
1850
+ "Caption",
1851
+ 1
1852
+ ],
1853
+ [
1854
+ "PageFooter",
1855
+ 1
1856
+ ],
1857
+ [
1858
+ "FigureGroup",
1859
+ 1
1860
+ ],
1861
+ [
1862
+ "Reference",
1863
+ 1
1864
+ ]
1865
+ ],
1866
+ "block_metadata": {
1867
+ "llm_request_count": 0,
1868
+ "llm_error_count": 0,
1869
+ "llm_tokens_used": 0,
1870
+ "previous_text": "",
1871
+ "previous_type": "",
1872
+ "previous_order": 0
1873
+ }
1874
+ },
1875
+ {
1876
+ "page_id": 18,
1877
+ "text_extraction_method": "pdftext",
1878
+ "block_counts": [
1879
+ [
1880
+ "Span",
1881
+ 5
1882
+ ],
1883
+ [
1884
+ "Line",
1885
+ 3
1886
+ ],
1887
+ [
1888
+ "PageHeader",
1889
+ 1
1890
+ ],
1891
+ [
1892
+ "Figure",
1893
+ 1
1894
+ ],
1895
+ [
1896
+ "Caption",
1897
+ 1
1898
+ ],
1899
+ [
1900
+ "PageFooter",
1901
+ 1
1902
+ ],
1903
+ [
1904
+ "FigureGroup",
1905
+ 1
1906
+ ]
1907
+ ],
1908
+ "block_metadata": {
1909
+ "llm_request_count": 0,
1910
+ "llm_error_count": 0,
1911
+ "llm_tokens_used": 0,
1912
+ "previous_text": "",
1913
+ "previous_type": "",
1914
+ "previous_order": 0
1915
+ }
1916
+ },
1917
+ {
1918
+ "page_id": 19,
1919
+ "text_extraction_method": "pdftext",
1920
+ "block_counts": [
1921
+ [
1922
+ "Span",
1923
+ 5
1924
+ ],
1925
+ [
1926
+ "Line",
1927
+ 3
1928
+ ],
1929
+ [
1930
+ "PageHeader",
1931
+ 1
1932
+ ],
1933
+ [
1934
+ "Figure",
1935
+ 1
1936
+ ],
1937
+ [
1938
+ "Caption",
1939
+ 1
1940
+ ],
1941
+ [
1942
+ "PageFooter",
1943
+ 1
1944
+ ],
1945
+ [
1946
+ "FigureGroup",
1947
+ 1
1948
+ ]
1949
+ ],
1950
+ "block_metadata": {
1951
+ "llm_request_count": 0,
1952
+ "llm_error_count": 0,
1953
+ "llm_tokens_used": 0,
1954
+ "previous_text": "",
1955
+ "previous_type": "",
1956
+ "previous_order": 0
1957
+ }
1958
+ },
1959
+ {
1960
+ "page_id": 20,
1961
+ "text_extraction_method": "pdftext",
1962
+ "block_counts": [
1963
+ [
1964
+ "Span",
1965
+ 18
1966
+ ],
1967
+ [
1968
+ "Line",
1969
+ 6
1970
+ ],
1971
+ [
1972
+ "Reference",
1973
+ 2
1974
+ ],
1975
+ [
1976
+ "PageHeader",
1977
+ 1
1978
+ ],
1979
+ [
1980
+ "Figure",
1981
+ 1
1982
+ ],
1983
+ [
1984
+ "Caption",
1985
+ 1
1986
+ ],
1987
+ [
1988
+ "SectionHeader",
1989
+ 1
1990
+ ],
1991
+ [
1992
+ "Text",
1993
+ 1
1994
+ ],
1995
+ [
1996
+ "PageFooter",
1997
+ 1
1998
+ ],
1999
+ [
2000
+ "FigureGroup",
2001
+ 1
2002
+ ]
2003
+ ],
2004
+ "block_metadata": {
2005
+ "llm_request_count": 0,
2006
+ "llm_error_count": 0,
2007
+ "llm_tokens_used": 0,
2008
+ "previous_text": "",
2009
+ "previous_type": "",
2010
+ "previous_order": 0
2011
+ }
2012
+ },
2013
+ {
2014
+ "page_id": 21,
2015
+ "text_extraction_method": "pdftext",
2016
+ "block_counts": [
2017
+ [
2018
+ "Span",
2019
+ 148
2020
+ ],
2021
+ [
2022
+ "TableCell",
2023
+ 54
2024
+ ],
2025
+ [
2026
+ "Line",
2027
+ 45
2028
+ ],
2029
+ [
2030
+ "Caption",
2031
+ 3
2032
+ ],
2033
+ [
2034
+ "Table",
2035
+ 2
2036
+ ],
2037
+ [
2038
+ "Text",
2039
+ 2
2040
+ ],
2041
+ [
2042
+ "TableGroup",
2043
+ 2
2044
+ ],
2045
+ [
2046
+ "PageHeader",
2047
+ 1
2048
+ ],
2049
+ [
2050
+ "SectionHeader",
2051
+ 1
2052
+ ],
2053
+ [
2054
+ "Figure",
2055
+ 1
2056
+ ],
2057
+ [
2058
+ "PageFooter",
2059
+ 1
2060
+ ],
2061
+ [
2062
+ "FigureGroup",
2063
+ 1
2064
+ ],
2065
+ [
2066
+ "Reference",
2067
+ 1
2068
+ ]
2069
+ ],
2070
+ "block_metadata": {
2071
+ "llm_request_count": 0,
2072
+ "llm_error_count": 0,
2073
+ "llm_tokens_used": 0,
2074
+ "previous_text": "",
2075
+ "previous_type": "",
2076
+ "previous_order": 0
2077
+ }
2078
+ },
2079
+ {
2080
+ "page_id": 22,
2081
+ "text_extraction_method": "pdftext",
2082
+ "block_counts": [
2083
+ [
2084
+ "Span",
2085
+ 143
2086
+ ],
2087
+ [
2088
+ "Line",
2089
+ 47
2090
+ ],
2091
+ [
2092
+ "SectionHeader",
2093
+ 4
2094
+ ],
2095
+ [
2096
+ "Text",
2097
+ 4
2098
+ ],
2099
+ [
2100
+ "ListItem",
2101
+ 3
2102
+ ],
2103
+ [
2104
+ "PageHeader",
2105
+ 1
2106
+ ],
2107
+ [
2108
+ "PageFooter",
2109
+ 1
2110
+ ],
2111
+ [
2112
+ "ListGroup",
2113
+ 1
2114
+ ]
2115
+ ],
2116
+ "block_metadata": {
2117
+ "llm_request_count": 0,
2118
+ "llm_error_count": 0,
2119
+ "llm_tokens_used": 0,
2120
+ "previous_text": "",
2121
+ "previous_type": "",
2122
+ "previous_order": 0
2123
+ }
2124
+ },
2125
+ {
2126
+ "page_id": 23,
2127
+ "text_extraction_method": "pdftext",
2128
+ "block_counts": [
2129
+ [
2130
+ "Span",
2131
+ 54
2132
+ ],
2133
+ [
2134
+ "Line",
2135
+ 10
2136
+ ],
2137
+ [
2138
+ "SectionHeader",
2139
+ 2
2140
+ ],
2141
+ [
2142
+ "PageHeader",
2143
+ 1
2144
+ ],
2145
+ [
2146
+ "Figure",
2147
+ 1
2148
+ ],
2149
+ [
2150
+ "Caption",
2151
+ 1
2152
+ ],
2153
+ [
2154
+ "Text",
2155
+ 1
2156
+ ],
2157
+ [
2158
+ "PageFooter",
2159
+ 1
2160
+ ],
2161
+ [
2162
+ "FigureGroup",
2163
+ 1
2164
+ ],
2165
+ [
2166
+ "Reference",
2167
+ 1
2168
+ ]
2169
+ ],
2170
+ "block_metadata": {
2171
+ "llm_request_count": 0,
2172
+ "llm_error_count": 0,
2173
+ "llm_tokens_used": 0,
2174
+ "previous_text": "",
2175
+ "previous_type": "",
2176
+ "previous_order": 0
2177
+ }
2178
+ },
2179
+ {
2180
+ "page_id": 24,
2181
+ "text_extraction_method": "surya",
2182
+ "block_counts": [
2183
+ [
2184
+ "TableCell",
2185
+ 176
2186
+ ],
2187
+ [
2188
+ "Line",
2189
+ 44
2190
+ ],
2191
+ [
2192
+ "Span",
2193
+ 33
2194
+ ],
2195
+ [
2196
+ "Text",
2197
+ 5
2198
+ ],
2199
+ [
2200
+ "Caption",
2201
+ 3
2202
+ ],
2203
+ [
2204
+ "Table",
2205
+ 3
2206
+ ],
2207
+ [
2208
+ "SectionHeader",
2209
+ 3
2210
+ ],
2211
+ [
2212
+ "TableGroup",
2213
+ 3
2214
+ ],
2215
+ [
2216
+ "Reference",
2217
+ 2
2218
+ ],
2219
+ [
2220
+ "PageHeader",
2221
+ 1
2222
+ ],
2223
+ [
2224
+ "PageFooter",
2225
+ 1
2226
+ ]
2227
+ ],
2228
+ "block_metadata": {
2229
+ "llm_request_count": 0,
2230
+ "llm_error_count": 0,
2231
+ "llm_tokens_used": 0,
2232
+ "previous_text": "",
2233
+ "previous_type": "",
2234
+ "previous_order": 0
2235
+ }
2236
+ },
2237
+ {
2238
+ "page_id": 25,
2239
+ "text_extraction_method": "surya",
2240
+ "block_counts": [
2241
+ [
2242
+ "TableCell",
2243
+ 143
2244
+ ],
2245
+ [
2246
+ "Line",
2247
+ 38
2248
+ ],
2249
+ [
2250
+ "Span",
2251
+ 17
2252
+ ],
2253
+ [
2254
+ "Text",
2255
+ 5
2256
+ ],
2257
+ [
2258
+ "Caption",
2259
+ 2
2260
+ ],
2261
+ [
2262
+ "Table",
2263
+ 2
2264
+ ],
2265
+ [
2266
+ "SectionHeader",
2267
+ 2
2268
+ ],
2269
+ [
2270
+ "TableGroup",
2271
+ 2
2272
+ ],
2273
+ [
2274
+ "Reference",
2275
+ 2
2276
+ ],
2277
+ [
2278
+ "PageHeader",
2279
+ 1
2280
+ ],
2281
+ [
2282
+ "PageFooter",
2283
+ 1
2284
+ ]
2285
+ ],
2286
+ "block_metadata": {
2287
+ "llm_request_count": 0,
2288
+ "llm_error_count": 0,
2289
+ "llm_tokens_used": 0,
2290
+ "previous_text": "",
2291
+ "previous_type": "",
2292
+ "previous_order": 0
2293
+ }
2294
+ }
2295
+ ],
2296
+ "debug_data_path": "debug_data/3kouij8BWi"
2297
+ }
iclr26/3kouij8BWi/model_text_v3.txt ADDED
@@ -0,0 +1,173 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ [p. 1 | section: ABSTRACT | type: Text]
2
+ Although current large Vision-Language Models (VLMs) have advanced in multimodal understanding and reasoning, their fundamental perceptual and reasoning abilities remain limited. Specifically, even on simple jigsaw tasks, existing VLMs perform near randomly, revealing deficiencies in core perception and reasoning capabilities. While high-quality vision-language data can enhance these capabilities, its scarcity and limited scalability impose significant constraints. To address this, we propose AGILE, an Agentic jiGsaw Interaction Learning for Enhancing visual perception and reasoning in VLMs. AGILE formulates jigsaw solving as an interactive process, enabling the model to progressively engage with the environment. At each step, the model generates executable code to perform an action based on the current state, while the environment provides fine-grained visual feedback to guide task completion. Through this iterative cycle of observation and interaction, the model incrementally improves its perceptual and reasoning capabilities via exploration and feedback. Experimental results show that AGILE not only substantially boosts performance on jigsaw tasks of varying complexity (e.g., increasing accuracy from 9.5% to 82.8% under the 2 \times 2 setting) but also demonstrates strong generalization across 9 general vision tasks, achieving an average improvement of 3.1%. These results indicate notable enhancements in both perceptual and reasoning abilities. This work opens a new avenue for advancing reasoning and generalization in multimodal models and provides an efficient, scalable solution to the scarcity of multimodal reinforcement learning data. The code and datasets is available at
3
+
4
+ [p. 1 | section: 1 Introduction | type: Text]
5
+ Large Vision-Language Models (VLMs) have recently achieved remarkable success across a wide range of multimodal tasks, including image captioning (Chen et al., 2024a;c; Li et al., 2024b; Zeng et al., 2025), visual question answering (Bai et al., 2025; Zhu et al., 2025; Hurst et al., 2024; Comanici et al., 2025; Qi et al., 2025; Zhao et al., 2025; Huang et al., 2026b; Zeng et al., 2026; Wang et al., 2026; Pan et al., 2025), document understanding (Wang et al., 2025b;a), and complex real-world applications (Huang et al., 2025b; Han et al., 2026; Fang et al., 2025; Huang et al., 2025a; Zhang et al., 2025a). By effectively associating visual and textual information, these models exhibit strong multimodal perception and reasoning capabilities. However, their performance remains severely limited on tasks that require comprehensive visual understanding and structured reasoning. In particular, we find that current VLMs often perform near random even on relatively simple 2\times 2 jigsaw tasks (Carlucci et al., 2019; Chen et al., 2023), which demand both perceptual accuracy and
6
+
7
+ [p. 1 | section: 1 Introduction | type: Footnote]
8
+ & lt;sup>2</sup>Shanghai AI Laboratory
9
+
10
+ [p. 2 | section: 1 Introduction | type: PictureGroup]
11
+ Figure 1: Description of the action space. (a) illustrates swapping two jigsaw pieces and observing the updated jigsaw state; (b) shows cropping a specific region of the jigsaw for closer inspection; and (c) depicts zooming into a selected area to examine fine-grained details.
12
+
13
+ [p. 2 | section: 1 Introduction | type: Text]
14
+ logical inference. This suggests that existing pretraining and fine-tuning strategies are insufficient for developing robust perceptual and reasoning abilities.
15
+
16
+ [p. 2 | section: 1 Introduction | type: Text]
17
+ Recent studies have explored reinforcement learning (RL) (Schulman et al., 2017; Rafailov et al., 2023; Shao et al., 2024; Huang et al., 2026a; Ma et al., 2025; Zhang et al., 2025c; b; Ren et al., 2026) as a way to enhance these capabilities by enabling models to learn through interaction, trial-anderror, and feedback. While RL-based approaches show promise, they are fundamentally constrained by the scarcity and limited scalability of high-quality vision-language RL data. Current methods for constructing multimodal RL datasets (Huang et al., 2025c; Yang et al., 2025; Lu et al., 2023) generally fall into two categories: human expert supervision and automated synthesis. Humansupervised datasets are either prohibitively expensive or too small in scale for large-scale training, while automated approaches that rely on closed-source models suffer from limited quality, capability constraints, and substantial API costs. These challenges collectively hinder the development of VLMs with strong reasoning and generalization abilities.
18
+
19
+ [p. 2 | section: 1 Introduction | type: Text]
20
+ To address these limitations, we propose AGILE, an Agentic jiGsaw Interaction Learning framework for Enhancing visual perception and reasoning in VLMs. Our approach leverages the structured nature of the jigsaw puzzle as a proxy task for perception and reasoning, modeling the jigsawsolving process as a progressive interaction between the model and its environment. At each step, the model generates Python code to perform actions within a well-defined action space (swapping two image tiles, observing the current jigsaw state, cropping regions for detailed observation, or zooming in for fine-grained analysis). This interaction-driven process enables the model to iteratively refine its perceptual and reasoning capabilities while receiving explicit feedback at every step. By simulating the step-by-step dynamics of jigsaw solving, the model is encouraged to capture structural relationships among visual components and acquire more robust perception and reasoning skills.
21
+
22
+ [p. 2 | section: 1 Introduction | type: Text]
23
+ A key feature of our approach is the use of code and rule-based data generation, which offers two major advantages. First, the difficulty of the jigsaw task can be precisely controlled by adjusting factors such as the number of correctly placed tiles in the initial state and the overall jigsaw size. Second, because the ground-truth solution is inherently available, the synthetic dataset can be scaled to arbitrary sizes with strict supervision, overcoming the data scarcity inherent in human-annotated or closed-source datasets. The combination of interactive training and scalable data generation yields an efficient and effective framework for advancing visual perception and reasoning in VLMs.
24
+
25
+ [p. 2 | section: 1 Introduction | type: Text]
26
+ We validate the effectiveness of our approach through comprehensive experiments. Our method substantially improves performance across jigsaw tasks of varying complexity, for instance, raising accuracy from 9.5% to 82.8% on the 2 × 2 setting, while also demonstrating strong generalization to a wide range of vision tasks, including high-resolution image understanding, real-world scene analysis, fine-grained recognition, visual reasoning, and hallucination benchmarks. Moreover, we show that scaling the training data further boosts performance, and that under equal data budgets, jigsaw-based training achieves results comparable to or even surpassing those obtained with general QA data. These findings underscore the potential of jigsaw tasks in addressing the scarcity of multimodal RL data. By combining interactive training with scalable data generation, our method significantly enhances both perceptual and higher-order reasoning abilities, pointing to a promising new direction for advancing VLMs. Our main contributions are as follows:
27
+
28
+ [p. 3 | section: 1 Introduction | type: ListGroup]
29
+ We introduce AGILE, an agentic jigsaw interaction learning framework that formulates jigsaw solving as a stepwise interactive process, thereby driving incremental improvements in both visual perception and reasoning capabilities of VLMs. We present a scalable jigsaw-based data generation method that yields high-quality multimodal reinforcement learning datasets with controllable difficulty, providing an efficient solution to the current shortage of high-quality training data. Extensive experiments demonstrate that our approach substantially improves performance on jigsaw tasks of varying complexity while exhibiting strong generalization across diverse vision benchmarks, highlighting its effectiveness in enhancing both perception and reasoning in VLMs.
30
+
31
+ [p. 3 | section: 2 RELATED WORK | type: Text]
32
+ Reinforcement Learning for Vision Language Models. Reinforcement learning (RL) (Schulman et al., 2017; Rafailov et al., 2023; Shao et al., 2024) has been widely applied to improve reasoning in language models, as exemplified by the success of DeepSeek-R1 (Guo et al., 2025) in mathematical reasoning. Building on this progress, recent studies have extended RL to VLMs, with rule-based RL in multimodal domains emerging as a promising direction. For perception enhancement, R1-V (Chen et al., 2025b) applies RL to object counting, while Perception-R1 (Yu et al., 2025) leverages object matching and IoU as reward signals to improve grounding. DeepEyes (Zheng et al., 2025) shows how RL can encourage models to invoke visual tools, thereby expanding perceptual abilities. For reasoning, MMEureka (Meng et al., 2025) demonstrates the effectiveness of rule-based RL in mathematical tasks. From a data perspective, Vision-R1 (Huang et al., 2025c) and R1-OneVision (Yang et al., 2025) convert visual information into textual representations to build multimodal chainof-thought (CoT) datasets that support stronger reasoning. Despite these advances, the lack of scalable, high-quality RL datasets remains a fundamental bottleneck, severely limiting further improvements in both perception and reasoning for VLMs.
33
+
34
+ [p. 3 | section: 2 RELATED WORK | type: Text]
35
+ Enhancing Generalization via Proxy Tasks. Rule-based reinforcement learning (RL) has shown promise but typically requires large amounts of high-quality, verifiable data. Logic-RL (Xie et al., 2025a) addressed this by introducing the "Knights and Knaves" (K&K) puzzle, which offers controllable difficulty and algorithmically generated ground truth, enabling models to acquire reasoning skills transferable to mathematical tasks. Enigmata (Chen et al., 2025a) extended this approach to a broader set of text-based puzzles (e.g., cryptographic, arithmetic, logical), demonstrating that solving such tasks with RL improves general reasoning without external data. RPT (Dong et al., 2025) further reframed next-token prediction as a reasoning task, using verifiable rewards to enhance predictive ability and strengthen the basis for reinforcement fine-tuning. Inspired by these proxy-task successes in LLMs, recent work has begun exploring similar ideas for VLMs. Code2Logic (Tong et al., 2025) and ViGaL (Xie et al., 2025b) leverage code-synthesized games to improve mathematical reasoning, while ViCrit (Wang et al., 2025d) enhances perceptual robustness by reinforcing models to detect hallucinated entities via modified captions. Jigsaw-R1 (Wang et al., 2025e) proposed a puzzle-based RL paradigm, but due to training limitations, its models still performed poorly even on 2 × 2 jigsaw puzzles, failing to fully exploit the proxy-task benefits. To address this gap, we propose a agentic jigsaw interaction learning framework, which casts jigsaw solving as an interactive process between the model and environment. This enables iterative refinement of perception and reasoning with explicit stepwise feedback, allowing the model to better capture visual relationships and develop stronger perceptual and reasoning skills.
36
+
37
+ [p. 3 | section: 3 METHOD | type: Text]
38
+ In this section, we provide a comprehensive description of our proposed agentic jigsaw interaction learning framework. We first introduce the jigsaw task and describe how the model interacts with the environment to accomplish it (Sec. 3.1) , then present the construction of the training data (Sec. 3.2) . Finally, we outline the training paradigm, including both the cold-start stage and the reinforcement learning stage (Sec. 3.3) .
39
+
40
+ [p. 4 | section: 3 METHOD | type: FigureGroup]
41
+ Figure 2: Overview of the AGILE framework. (a) depicts the interaction process between the model and the external environment, together with the implementation of the GRPO algorithm; (b) shows the collection of high-quality jigsaw trajectory data; and (c) illustrates the model–environment interaction during the jigsaw rollout process.
42
+
43
+ [p. 4 | section: 3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION | type: Text]
44
+ Jigsaw Task. Given an input image, we partition it into an m × m grid of jigsaw pieces, where task difficulty can be flexibly adjusted by varying m. If the image height or width is not divisible by m, the image is resized so that its dimensions are exact multiples of the grid. The grid is then randomly shuffled, and each piece is assigned an index in row-major order ranging from 1 (top-left) to m 2 (bottom-right). The shuffled configuration is denoted as
45
+
46
+ [p. 4 | section: 3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION | type: Equation]
47
+ I_{Shuffle} = \{I_1, I_2, \dots, I_{m^2}\}, (1)
48
+
49
+ [p. 4 | section: 3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION | type: Text]
50
+ where each I k corresponds to one jigsaw block. Since the shuffling process is explicitly recorded during data generation, we can recover the ground-truth jigsaw layout as
51
+
52
+ [p. 4 | section: 3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION | type: Equation]
53
+ I_{GT} = \{I_{\pi(1)}, I_{\pi(2)}, \dots, I_{\pi(m^2)}\},\tag{2}
54
+
55
+ [p. 4 | section: 3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION | type: Text]
56
+ where π is a permutation over {1, 2, . . . , m 2 }. During jigsaw solving, the model will maintain a current state
57
+
58
+ [p. 4 | section: 3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION | type: Equation]
59
+ I_{State} = \{I_{\pi^*(1)}, I_{\pi^*(2)}, \dots, I_{\pi^*(m^2)}\},\tag{3}
60
+
61
+ [p. 4 | section: 3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION | type: Text]
62
+ where π ∗ denotes the current arrangement of pieces. At each step, the model iteratively swaps two pieces, observes the resulting configuration, and aims to reconstruct the ground-truth layout IGT .
63
+
64
+ [p. 4 | section: 3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION | type: Text]
65
+ Environment Interaction. The model interacts with the environment throughout the jigsawsolving process in an iterative manner. As illustrated in Figure 1, , we predefine a set of API for model–environment interactions in Python. The model expresses its actions by generating Python code, which is executed by the environment to produce the corresponding resulting image. The model then uses these results to reason further and decide on subsequent actions, repeating this process iteratively until the jigsaw is completed. Specifically, at each step, the model can perform the following actions:
66
+
67
+ [p. 4 | section: 3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION | type: ListGroup]
68
+ Swap: Given the current jigsaw state IState, the model calls the Swap function to exchange the positions of any two jigsaw pieces. Observe: Given IState, the model calls the Observe function to obtain the current jigsaw progress IObs, which is then used to determine the next action.
69
+
70
+ [p. 5 | section: 3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION | type: Text]
71
+ • Crop & Zoom: Given IObs, the model crops and zooms into a local region to inspect finer details and inform subsequent actions.
72
+
73
+ [p. 5 | section: 3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION | type: Text]
74
+ To better illustrate the overall procedure, the entire rollout process is presented in Algorithm 1.
75
+
76
+ [p. 5 | section: 3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION | type: Code]
77
+ Algorithm 1 Interactive Jigsaw-Solving Procedure of VLMs with the Environment
78
+
79
+ [p. 5 | section: 3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION | type: Code]
80
+ Input: Query x, IShuff le, Policy model πθ, External environment V, Maximum iteration steps T. Output: Final interaction trajectory y. 1: Initialize trajectory y ← ∅, step counter t ← 0. 2: while t < T do 3: Sample response yt ∼ πθ(· | x, IShuff le, y). 4: Append assistant response yt to trajectory: y ← y + yt. 5: if <code> </code> detected in yt then 6: Parse the Python code (e.g., Swap, Observe, Crop, Zoom), execute it in the environment V, and obtain feedback Ot. 7: else if <answer> </answer> detected in yt then 8: return final trajectory y. 9: end if 10: Append environment feedback Ot as user input: y ← y + Ot. 11: Update step counter t ← t + 1. 12: end while 13: return final trajectory y.
81
+
82
+ [p. 5 | section: 3.2 DATA CONSTRUCTION | type: Text]
83
+ In Section 3.1, we have introduced the jigsaw task and described how the model interacts with the environment to complete it. Based on this task design, we observe that the model (e.g., Qwen-2.5VL-7B) exhibits limited foundational capabilities, manifested in poor instruction-following and incorrect Python code generation, which hinders proper interaction with the environment and introduces substantial training noise. Directly applying reinforcement learning (RL) thus results in low learning efficiency. To bridge this gap and more effectively train our model, we employ Gemini 2.5 Pro 1 to collect expert trajectories for the cold-start phase, endowing Qwen-2.5VL-7B with basic interactive jigsaw-solving capabilities. For this purpose, we design structured prompts to guide Gemini 2.5 Pro in interacting with the environment to complete the jigsaw tasks (The prompt templates are provided in Appendix B. ).
84
+
85
+ [p. 5 | section: 3.2 DATA CONSTRUCTION | type: Text]
86
+ To further ensure data quality, we apply an additional filtering process: first, selecting samples where Gemini's outputs match the ground truth, and then manually verifying each interaction step in the correct samples to ensure rationality and consistency. To ensure that our model can perform diverse jigsaw reasoning actions during reinforcement learning, we carefully balance the training data. Specifically, trajectories are balanced with respect to both the number of steps (4–8) and the types of actions involved (e.g., Swap, Observe, Crop, Zoom). This design ensures that the model is sufficiently exposed to the full action space and learns to handle various interactions with the environment effectively. Overall, we curate a dataset comprising 1.6K high-quality reasoning trajectories for the jigsaw task.
87
+
88
+ [p. 5 | section: 3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING | type: Text]
89
+ Cold-start. During the cold-start phase, we leverage the 1.6K high-quality jigsaw-solving trajectories constructed in Section 3.2 to equip the model with basic instruction-following and Python code generation capabilities, ensuring effective interaction with the environment.
90
+
91
+ [p. 5 | section: 3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING | type: Text]
92
+ Reinforcement Learning. Our framework adopts Group Relative Policy Optimization (GRPO), which utilizes the average reward of multiple sampled outputs as a baseline, instead of relying on a learned value function. The policy model is optimized by maximizing the following objective:
93
+
94
+ [p. 5 | section: 3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING | type: Footnote]
95
+ 1 The version is Gemini-2.5-Pro-Preview-05-06.
96
+
97
+ [p. 6 | section: 3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING | type: Equation]
98
+ \mathcal{J}_{GRPO}(\theta) = \mathbb{E}_{x \sim \mathcal{D}, \{y_i\}_{i=1}^G \sim \pi_{\text{old}}(\cdot | x; \mathcal{V})} \left[ \frac{1}{G} \sum_{i=1}^G \frac{1}{\sum_{t=1}^{|y_i|} I(y_{i,t})} \sum_{t=1:I(y_{i,t})=1}^{|y_i|} \min \left( \frac{\pi_{\theta}(y_{i,t} \mid x, y_{i,< t}; \mathcal{V})}{\pi_{\text{old}}(y_{i,t} \mid x, y_{i,< t}; \mathcal{V})} \hat{A}_{i,t}, \right) \right] \\ \operatorname{clip} \left( \frac{\pi_{\theta}(y_{i,t} \mid x, y_{i,< t}; \mathcal{V})}{\pi_{\text{old}}(y_{i,t} \mid x, y_{i,< t}; \mathcal{V})}, 1 - \epsilon, 1 + \epsilon \right) \hat{A}_{i,t} \right) - \beta \, \mathbb{D}_{KL}(\pi_{\theta} \parallel \pi_{\text{ref}}), \tag{4}
99
+
100
+ [p. 6 | section: 3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING | type: Text]
101
+ where the rollout module samples a group of trajectories \{y_1, y_2, \dots, y_G\} from the old policy \pi_{\text{old}} for each input question x through interaction with the external environment \mathcal{V} . The advantage term \hat{A}_{i,t} is computed based on the relative rewards of outputs within each group. Our reward system comprises three components: an accuracy reward, a format reward, and a step reward. The total reward is computed as the sum of these components.
102
+
103
+ [p. 6 | section: 3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING | type: ListGroup]
104
+ Accuracy Reward: We compare the model's generated answer I_{Answer} with the ground truth I_{GT} . If all jigsaw image blocks are correctly placed, the accuracy reward is 1; otherwise, it is 0. Format Reward: The model receives a reward of 1 if its output follows the required structured format, with the reasoning process, code, and final answer correctly enclosed within the <think>, <code>, and <answer> tags, respectively. \bullet Step Reward: We encourage the model to complete the jigsaw in as few steps as possible. For a 2 \times 2 jigsaw, if each step swaps any two image blocks, at most three steps are theoretically required to place all blocks correctly. Excessive actions may lead the model to perform invalid steps, reducing the proportion of effective perception and reasoning. Furthermore, to prevent the model from prematurely hacking the step reward during early RL training, the step reward is applied only when the jigsaw is correctly completed. If the jigsaw is incorrect, the model is penalized by assigning the maximum step penalty. Formally, the step reward is defined as:
105
+
106
+ [p. 6 | section: 3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING | type: Equation]
107
+ R_{\text{step}} = \lambda \cdot \left( \mathbb{I}_{\{R_{\text{acc}}=1\}} \cdot step_{\text{num}} + \mathbb{I}_{\{R_{\text{acc}}=0\}} \cdot step_{\text{max}} \right), \tag{5}
108
+
109
+ [p. 6 | section: 3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING | type: Text]
110
+ where step_{num} is the number of steps the model actually used to complete the jigsaw, step_{max} is the maximum allowed steps, \lambda denotes the step penalty coefficient, which is set to -0.05, and \mathbb{I}_{\{\cdot\}} is the indicator function. The final reward formulation is shown in Equation 6:
111
+
112
+ [p. 6 | section: 3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING | type: Equation]
113
+ R = \alpha \cdot R_{\text{acc}} + \beta \cdot R_{\text{format}} + \gamma \cdot R_{\text{step}}, \tag{6}
114
+
115
+ [p. 6 | section: 3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING | type: Text]
116
+ where the coefficients \alpha , \beta , and \gamma weight the relative importance of accuracy, format, and step rewards, respectively. In our experimental setup, \alpha , \beta , and \gamma are set to 0.8, 0.2, and 1.0, respectively.
117
+
118
+ [p. 6 | section: 4 EXPERIMENT | type: Text]
119
+ In this section, we present a comprehensive experimental study. We first describe the implementation details, including datasets, training procedures, and inference settings (Sec. 4.1). We then evaluate the effectiveness of our agentic jigsaw interaction learning framework on both jigsaw-solving and general vision tasks (Sec. 4.2). Finally, we perform ablation studies to assess the impact of jigsaw data scale and to contrast the benefits of jigsaw data with those of general QA data (Sec. 4.3).
120
+
121
+ [p. 6 | section: 4.1 IMPLEMENTATION DETAILS | type: Text]
122
+ Datasets and Models. Our training data consist of two components corresponding to the cold-start and reinforcement learning (RL) stages. In the cold-start stage, we employ 1.6K high-quality jigsaw puzzle trajectories collected in Sec. 3.2 to endow the model with basic interactive jigsaw-solving skills. In the RL stage, we construct a dataset of 15.6K images spanning diverse domains, including high-resolution visual search, OCR-based text recognition, real-world scenes, and structured diagrams (see Appendix A for details). Each image is partitioned into 2 \times 2 patches and randomly shuffled to ensure that all patches are initially misplaced. All experiments are conducted using Qwen2.5-VL-7B (Bai et al., 2025) as the base model.
123
+
124
+ [p. 7 | section: 4.1 IMPLEMENTATION DETAILS | type: TableGroup]
125
+ Table 1: Jigsaw Acc result. LN indicates the difficulty level, where N denotes the initial number of correct pieces. A smaller N corresponds to a more scrambled jigsaw and higher difficulty. The best results are highlighted in bold, and the second-best results are underlined. Model 2 × 2 3 × 3 L0 L1 L2 Avg. L0 L1 L2 L3 L4 L5 L6 L7 Avg. Random 4.5 3.7 4.2 4.1 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 GPT-4o 38.7 37.7 47.0 41.1 1.0 1.3 2.7 3.0 3.0 7.0 7.7 13.7 4.9 Gemini-2.5-Pro 43.3 46.3 49.7 46.4 7.0 8.7 9.7 10.0 11.0 15.0 23.0 32.0 14.6 MiMo-VL-7B-RL 11.3 14.3 17.0 14.2 0.3 0.0 0.0 0.0 0.3 0.3 1.0 3.7 0.7 InternVL3-8B 3.7 3.7 5.0 4.1 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 InternVL3-78B 3.3 4.3 3.0 3.5 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 Qwen2.5VL-72B 22.7 24.3 35.3 27.4 0.3 1.3 2.3 2.7 2.0 3.0 6.7 12.7 3.9 Qwen2.5VL-7B 6.3 6.0 16.3 9.5 0.0 0.0 0.0 0.0 0.0 0.7 1.3 1.3 0.4 +Cold-Start 12.0 32.0 22.0 22.0 0.0 0.3 0.0 0.0 0.0 0.7 0.3 0.0 0.2 +RL 78.7 83.0 86.7 82.8 5.0 7.0 11.0 14.0 17.7 25.3 38.0 48.0 20.8
126
+
127
+ [p. 7 | section: 4.1 IMPLEMENTATION DETAILS | type: Text]
128
+ Training and Inference Setups. We conduct supervised fine-tuning (SFT) on llama-factory (Zheng et al., 2024) and reinforcement learning (RL) training on verl (Sheng et al., 2024) , both with fullparameter tuning. For inference and evaluation, we adopt VLMEvalKit (Duan et al., 2024) as the framework. To ensure a fair comparison, all evaluations on general downstream benchmarks are conducted in a strict single-turn setting following VLMEvalKit, fully consistent with the evaluation protocol of all baseline models. All experiments are performed on 8 NVIDIA A100 GPUs with 80GB memory each. Detailed training hyperparameters are provided in the Appendix D.
129
+
130
+ [p. 7 | section: 4.2 MAIN RESULTS | type: Text]
131
+ Significant Improvements on the Jigsaw Task. To comprehensively evaluate performance on the jigsaw task, we curate a test set of 300 images spanning diverse scenarios, including high-resolution visual search, OCR-based text recognition, and real-world scenes. Each image is partitioned into 2 × 2 and 3 × 3 grids, and the performance is measured using two metrics: Acc, which equals 1 only when all patches are correctly placed, and Score, defined as the ratio of correctly placed patches to the total number of patches. As shown in Table 1 and 2, the base model Qwen2.5-VL-7B performs poorly without training (achieving only 9.5% accuracy even under the simplest 2 × 2 setting) while the proprietary Gemini2.5-Pro and the larger Qwen2.5-VL-72B models also struggle on this task. After supervised fine-tuning (SFT) with 1.6K cold-start trajectories and reinforcement learning (RL) with 15.6K images, Qwen2.5-VL-7B achieves substantial gains: on the 2 × 2 setting, Acc improves from 9.5% to 82.8% and Score from 29.4% to 89.0%; on the more challenging 3 × 3 setting, it also generalizes well, with Acc increasing from 0.4% to 20.8% and Score from 31.1% to 62.1%, significantly surpassing Gemini2.5-Pro and Qwen2.5-VL-72B. These results demonstrate that modeling jigsaw solving as an interactive multi-turn dialogue enables the model to progressively enhance its visual perception and reasoning abilities, thereby achieving superior performance on the jigsaw task.
132
+
133
+ [p. 7 | section: 4.2 MAIN RESULTS | type: Text]
134
+ Generalization to Downstream Visual Tasks. The proposed agentic jigsaw interaction learning framework delivers substantial improvements on the jigsaw task. By leveraging explicit step-by-step feedback for iterative refinement, it enables the model to capture visual relations more effectively and to develop stronger reasoning capabilities.
135
+
136
+ [p. 7 | section: 4.2 MAIN RESULTS | type: Text]
137
+ To further assess whether jigsaw training enhances performance on general vision downstream tasks, we evaluate the model on 9 benchmarks: high-resolution image understanding (HRBench4K (Wang et al., 2025c) , HRBench8K (Wang et al., 2025c) , VStarBench (Wu & Xie, 2024) ), real-world scene understanding (MME-RealWorld (Zhang et al., 2024) , RealWorldQA (xAI, 2024) ), fine-grained visual recognition (MMVP (Tong et al., 2024) , BLINK (Fu et al., 2024) ), visual reasoning (MMMU (Yue et al., 2024) ), and hallucination evaluation (HallusionBench (Guan et al., 2024) ). As shown in Table 3, the jigsaw-trained model demonstrates strong visual generalization, achieving notable gains on HRBench4K (+4.2%), HRBench8K (+5.2%), and VStarBench (+4.2%). On average, it surpasses the base model Qwen2.5-VL-7B by 3.1% across all 9 benchmarks, providing compelling evidence
138
+
139
+ [p. 8 | section: 4.2 MAIN RESULTS | type: TableGroup]
140
+ Table 2: Jigsaw Score result. LN indicates the difficulty level, where N denotes the initial number of correct pieces. A smaller N corresponds to a more scrambled jigsaw and higher difficulty. The best results are highlighted in bold , and the second-best results are underlined. Model 2 : × 2 3 × 3 L0 L1 L2 Avg. L0 L1 L2 L3 L4 L5 L6 L7 Avg. Random 25.2 24.7 24.8 24.9 11.4 11.3 11.0 10.9 11.1 11.4 11.3 10.8 11.2 GPT-4o 54.8 59.1 63.2 59.0 25.9 27.3 34.1 36.3 42.3 48.0 54.4 64.0 41.5 Gemini-2.5-Pro 55.3 60.1 61.6 59.0 31.9 31.8 35.7 39.4 43.1 48.7 61.8 68.6 45.1 MiMo-VL-7B-RL 21.8 27.2 29.2 26.1 5.5 6.9 8.0 10.7 15.9 19.5 20.6 28.9 14.5 InternVL3-8B 24.6 24.3 25.3 24.7 7.5 10.1 15.7 16.8 20.3 25.1 28.2 31.7 19.4 InternVL3-78B 21.3 26.5 28.4 25.4 7.1 10.9 14.1 18.5 23.1 25.7 29.0 37.0 20.7 Qwen2.5VL-72B 40.7 46.1 56.1 47.6 21.7 25.6 30.8 33.4 34.7 40.0 46.3 55.2 36.0 Qwen2.5VL-7B 14.4 30.1 43.8 29.4 5.8 12.0 20.3 25.6 32.7 40.9 50.2 60.9 31.1 +Cold-Start +RL 40.6 86.4 45.6 88.7 45.3 91.9 43.8 89.0 6.5 41.1 6.9 46.8 7.8 52.6 10.2 58.6 10.4 65.3 13.2 71.0 15.7 77.9 17.0 83.6 11.0 62.1 Table 3: Main results. Performance comparison of different models on the 9 benchmarks. Abbreviations: MME-RW (MME-RealWorld-Lite), RWQA (RealWorldQA), HRB4K (HRBench4K), HRB8K (HRBench8K), Halbench (HallusionBench), MMMU (MMMU_VAL), Avg. denotes the average performance across all 9 benchmarks. \Delta represents the relative performance gain achieved by RL compared to the base model Qwen2.5-VL-7B. The best results are highlighted in bold , and the second-best results are underlined.
141
+
142
+ [p. 8 | section: 4.2 MAIN RESULTS | type: Table]
143
+ Model MME-RW RWQA HRB4K HRB8K VStar MMVP BLINK HalBench MMMU Avg. LLaVA-OV-7B 48.4 69.5 65.3 58.4 73.3 77.3 52.6 36.6 48.2 58.8 InternVL2.5-8B 48.2 69.4 68.0 63.3 71.7 75.7 54.9 49.9 53.6 61.6 InternVL2.5-78B 49.7 78.4 74.5 72.5 75.9 83.0 63.6 57.1 65.4 68.9 Qwen2.5-VL-72B 44.7 75.3 80.1 77.1 85.9 81.7 61.6 53.5 66.9 69.6 Qwen2.5-VL-7B 44.6 68.5 68.8 65.3 76.4 74.3 56.4 50.1 54.8 62.1 + Cold-Start 46.2 68.4 71.0 68.4 77.5 76.7 55.7 49.8 54.0 63.1 + RL 48.4 70.2 73.0 70.5 80.6 78.0 58.0 51.9 55.8 65.2 \Delta (vs. Qwen2.5-VL-7B) +3.8 +1.7 +4.2 +5.2 +4.2 +3.7 +1.6 +1.8 +1.0 +3.1
144
+
145
+ [p. 8 | section: 4.2 MAIN RESULTS | type: Text]
146
+ that jigsaw-based training effectively enhances the model's ability to capture visual relations and strengthen reasoning skills, thereby improving its performance on general vision downstream tasks.
147
+
148
+ [p. 8 | section: 4.3 ANALYSIS | type: Text]
149
+ Impact of Jigsaw Training Data Scale. To investigate the effect of data scale, we systematically vary the amount of training data and evaluate model performance on both jigsaw task and general vision tasks. As shown in Figure 3, scaling up the data yields substantial performance gains: jigsaw task accuracy increases from 22.0% to 82.8%, while HRBench4K and RealWorldQA see improvements of 2.0% and 1.8%, respectively. These results highlight a clear data-to-performance trend, demonstrating that larger training sets translate directly into stronger perceptual and reasoning abilities. Crucially, because jigasw data in our reinforcement learning stage are generated via scalable programmatic synthesis, AGILE can easily leverage larger datasets. This scalability not only provides richer learning signals for continual capability growth but also offers a practical and sustainable solution to the scarcity of high-quality multimodal RL data.
150
+
151
+ [p. 8 | section: 4.3 ANALYSIS | type: Text]
152
+ Performance Comparison: Jigsaw vs. General QA Data. We compare the effectiveness of jigsaw data against conventional General QA data for model training. As shown in Figure 4, models trained with jigsaw data consistently outperform those trained with QA data across multiple benchmarks. Notably, combining 10K jigsaw samples with 10K QA samples yields superior performance on general vision benchmarks compared to training with 20K QA samples alone. These results highlight the unique role of jigsaw data in enhancing fundamental visual generalization, demonstrating the efficiency and controllability of jigsaw-solving as a proxy for visual perception and reasoning. A key advantage of our approach lies in the programmatic synthesis of jigsaw data, which enables effortless construction of large-scale, high-quality datasets, a process that is otherwise costly and
153
+
154
+ [p. 9 | section: 4.3 ANALYSIS | type: FigureGroup]
155
+ Figure 3: Impact of Training Data Scale. The left y-axis denotes the accuracies on HRBench4K and RealWorldQA, while the right y-axis corresponds to the accuracy on the jigsaw task.
156
+
157
+ [p. 9 | section: 4.3 ANALYSIS | type: FigureGroup]
158
+ Figure 4: Comparison with General QA Data. The total number of samples is consistently maintained at 20K across both experimental setups.
159
+
160
+ [p. 9 | section: 4.3 ANALYSIS | type: Text]
161
+ labor-intensive for QA data. Thus, jigsaw data not only serves as an effective alternative to General QA data but, in some cases, proves to be the superior choice. This finding underscores the potential of jigsaw tasks in alleviating the scarcity of multimodal RL data and opens a promising new direction for advancing multimodal model development.
162
+
163
+ [p. 9 | section: 4.3 ANALYSIS | type: FigureGroup]
164
+ Figure 5: Case Study. Jigsaw-solving reasoning and behaviors exhibited by our model.
165
+
166
+ [p. 9 | section: 4.3 ANALYSIS | type: Text]
167
+ Case Study. In Figure 5, we showcase several jigsaw-solving reasoning patterns and behaviors exhibited by our model. These cases illustrate the emergence of high-quality perceptual and reasoning strategies in the jigsaw task, including comprehensively interpreting the visual content of individual pieces to infer their spatial relations, employing cropping and zooming to examine and validate edge alignment, and reasoning about semantic consistency across pieces. Such behaviors demon-
168
+
169
+ [p. 10 | section: 4.3 ANALYSIS | type: Text]
170
+ strate human-like reasoning, thereby effectively enhancing the model's perceptual and reasoning capabilities.
171
+
172
+ [p. 10 | section: 5 CONCLUSION | type: Text]
173
+ In this work, we propose a novel agentic jigsaw interaction learning framework that formulates jigsaw solving as an interactive process to enhance visual perception and reasoning in large Vision-Language Models (VLMs). By treating jigsaw solving as an iterative interaction, the model progressively refines its perceptual and reasoning capabilities through exploration and feedback. Our approach significantly improves performance on jigsaw tasks of varying complexity and demonstrates strong generalization to broader general visual tasks, including visual question answering and scene understanding. Furthermore, by analyzing the performance gains from increasing the scale of jigsaw data and comparing it with general QA data, we show that jigsaw serve as an effective proxy for alleviating the scarcity of high-quality RL data, highlighting the potential of task-driven proxy training for stimulating complex multimodal perception and reasoning in VLMs.
iclr26/3kouij8BWi/paper.blocks.json ADDED
The diff for this file is too large to render. See raw diff
 
iclr26/3kouij8BWi/paper.md ADDED
@@ -0,0 +1,657 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+
2
+
3
+ {0}------------------------------------------------
4
+
5
+ # AGENTIC JIGSAW INTERACTION LEARNING FOR ENHANCING VISUAL PERCEPTION AND REASONING IN VISION-LANGUAGE MODELS
6
+
7
+ Yu Zeng<sup>1\*</sup>, Wenxuan Huang<sup>3,4\*</sup>, Shiting Huang<sup>1\*</sup>, Xikun Bao<sup>1</sup>, Yukun Qi<sup>1</sup>, Yiming Zhao<sup>1</sup>, Qiuchen Wang<sup>1</sup>, Lin Chen<sup>1</sup>, Zehui Chen<sup>1</sup>, Huaian Chen<sup>1</sup>, Wanli Ouyang<sup>2,4</sup>, Feng Zhao<sup>1†</sup>
8
+
9
+ ### **ABSTRACT**
10
+
11
+ Although current large Vision-Language Models (VLMs) have advanced in multimodal understanding and reasoning, their fundamental perceptual and reasoning abilities remain limited. Specifically, even on simple jigsaw tasks, existing VLMs perform near randomly, revealing deficiencies in core perception and reasoning capabilities. While high-quality vision-language data can enhance these capabilities, its scarcity and limited scalability impose significant constraints. To address this, we propose AGILE, an Agentic jiGsaw Interaction Learning for Enhancing visual perception and reasoning in VLMs. AGILE formulates jigsaw solving as an interactive process, enabling the model to progressively engage with the environment. At each step, the model generates executable code to perform an action based on the current state, while the environment provides fine-grained visual feedback to guide task completion. Through this iterative cycle of observation and interaction, the model incrementally improves its perceptual and reasoning capabilities via exploration and feedback. Experimental results show that AGILE not only substantially boosts performance on jigsaw tasks of varying complexity (e.g., increasing accuracy from 9.5% to 82.8% under the $2 \times 2$ setting) but also demonstrates strong generalization across 9 general vision tasks, achieving an average improvement of 3.1%. These results indicate notable enhancements in both perceptual and reasoning abilities. This work opens a new avenue for advancing reasoning and generalization in multimodal models and provides an efficient, scalable solution to the scarcity of multimodal reinforcement learning data. The code and datasets is available at https://github.com/yuzeng0-0/AGILE.
12
+
13
+ ### 1 Introduction
14
+
15
+ Large Vision-Language Models (VLMs) have recently achieved remarkable success across a wide range of multimodal tasks, including image captioning (Chen et al., 2024a;c; Li et al., 2024b; Zeng et al., 2025), visual question answering (Bai et al., 2025; Zhu et al., 2025; Hurst et al., 2024; Comanici et al., 2025; Qi et al., 2025; Zhao et al., 2025; Huang et al., 2026b; Zeng et al., 2026; Wang et al., 2026; Pan et al., 2025), document understanding (Wang et al., 2025b;a), and complex real-world applications (Huang et al., 2025b; Han et al., 2026; Fang et al., 2025; Huang et al., 2025a; Zhang et al., 2025a). By effectively associating visual and textual information, these models exhibit strong multimodal perception and reasoning capabilities. However, their performance remains severely limited on tasks that require comprehensive visual understanding and structured reasoning. In particular, we find that current VLMs often perform near random even on relatively simple $2\times 2$ jigsaw tasks (Carlucci et al., 2019; Chen et al., 2023), which demand both perceptual accuracy and
16
+
17
+ <sup>&</sup>lt;sup>1</sup>University of Science and TechnolZengogy of China
18
+
19
+ <sup>&</sup>lt;sup>2</sup>Shanghai AI Laboratory
20
+
21
+ <sup>&</sup>lt;sup>3</sup>East China Normal University
22
+
23
+ <sup>&</sup>lt;sup>4</sup>The Chinese University of Hong Kong
24
+
25
+ <sup>\*</sup> Equal Contribution
26
+
27
+ <sup>†</sup> Corresponding author
28
+
29
+ {1}------------------------------------------------
30
+
31
+ ![](_page_1_Picture_1.jpeg)
32
+
33
+ ![](_page_1_Picture_2.jpeg)
34
+
35
+ <span id="page-1-0"></span>![](_page_1_Picture_3.jpeg)
36
+
37
+ Figure 1: Description of the action space. (a) illustrates swapping two jigsaw pieces and observing the updated jigsaw state; (b) shows cropping a specific region of the jigsaw for closer inspection; and (c) depicts zooming into a selected area to examine fine-grained details.
38
+
39
+ logical inference. This suggests that existing pretraining and fine-tuning strategies are insufficient for developing robust perceptual and reasoning abilities.
40
+
41
+ Recent studies have explored reinforcement learning (RL) [\(Schulman et al., 2017;](#page-12-3) [Rafailov et al.,](#page-12-4) [2023;](#page-12-4) [Shao et al., 2024;](#page-12-5) [Huang et al., 2026a;](#page-11-8) [Ma et al., 2025;](#page-11-9) [Zhang et al., 2025c;](#page-13-5)[b;](#page-13-6) [Ren et al., 2026\)](#page-12-6) as a way to enhance these capabilities by enabling models to learn through interaction, trial-anderror, and feedback. While RL-based approaches show promise, they are fundamentally constrained by the scarcity and limited scalability of high-quality vision-language RL data. Current methods for constructing multimodal RL datasets [\(Huang et al., 2025c;](#page-11-10) [Yang et al., 2025;](#page-13-7) [Lu et al., 2023\)](#page-11-11) generally fall into two categories: human expert supervision and automated synthesis. Humansupervised datasets are either prohibitively expensive or too small in scale for large-scale training, while automated approaches that rely on closed-source models suffer from limited quality, capability constraints, and substantial API costs. These challenges collectively hinder the development of VLMs with strong reasoning and generalization abilities.
42
+
43
+ To address these limitations, we propose AGILE, an Agentic jiGsaw Interaction Learning framework for Enhancing visual perception and reasoning in VLMs. Our approach leverages the structured nature of the jigsaw puzzle as a proxy task for perception and reasoning, modeling the jigsawsolving process as a progressive interaction between the model and its environment. At each step, the model generates Python code to perform actions within a well-defined action space (swapping two image tiles, observing the current jigsaw state, cropping regions for detailed observation, or zooming in for fine-grained analysis). This interaction-driven process enables the model to iteratively refine its perceptual and reasoning capabilities while receiving explicit feedback at every step. By simulating the step-by-step dynamics of jigsaw solving, the model is encouraged to capture structural relationships among visual components and acquire more robust perception and reasoning skills.
44
+
45
+ A key feature of our approach is the use of code and rule-based data generation, which offers two major advantages. First, the difficulty of the jigsaw task can be precisely controlled by adjusting factors such as the number of correctly placed tiles in the initial state and the overall jigsaw size. Second, because the ground-truth solution is inherently available, the synthetic dataset can be scaled to arbitrary sizes with strict supervision, overcoming the data scarcity inherent in human-annotated or closed-source datasets. The combination of interactive training and scalable data generation yields an efficient and effective framework for advancing visual perception and reasoning in VLMs.
46
+
47
+ We validate the effectiveness of our approach through comprehensive experiments. Our method substantially improves performance across jigsaw tasks of varying complexity, for instance, raising accuracy from 9.5% to 82.8% on the 2 × 2 setting, while also demonstrating strong generalization to a wide range of vision tasks, including high-resolution image understanding, real-world scene analysis, fine-grained recognition, visual reasoning, and hallucination benchmarks. Moreover, we show that scaling the training data further boosts performance, and that under equal data budgets, jigsaw-based training achieves results comparable to or even surpassing those obtained with general QA data. These findings underscore the potential of jigsaw tasks in addressing the scarcity of multimodal RL data. By combining interactive training with scalable data generation, our method significantly enhances both perceptual and higher-order reasoning abilities, pointing to a promising new direction for advancing VLMs. Our main contributions are as follows:
48
+
49
+ {2}------------------------------------------------
50
+
51
+ - We introduce AGILE, an agentic jigsaw interaction learning framework that formulates jigsaw solving as a stepwise interactive process, thereby driving incremental improvements in both visual perception and reasoning capabilities of VLMs.
52
+ - We present a scalable jigsaw-based data generation method that yields high-quality multimodal reinforcement learning datasets with controllable difficulty, providing an efficient solution to the current shortage of high-quality training data.
53
+ - Extensive experiments demonstrate that our approach substantially improves performance on jigsaw tasks of varying complexity while exhibiting strong generalization across diverse vision benchmarks, highlighting its effectiveness in enhancing both perception and reasoning in VLMs.
54
+
55
+ # 2 RELATED WORK
56
+
57
+ Reinforcement Learning for Vision Language Models. Reinforcement learning (RL) [\(Schulman](#page-12-3) [et al., 2017;](#page-12-3) [Rafailov et al., 2023;](#page-12-4) [Shao et al., 2024\)](#page-12-5) has been widely applied to improve reasoning in language models, as exemplified by the success of DeepSeek-R1 [\(Guo et al., 2025\)](#page-10-7) in mathematical reasoning. Building on this progress, recent studies have extended RL to VLMs, with rule-based RL in multimodal domains emerging as a promising direction. For perception enhancement, R1-V [\(Chen et al., 2025b\)](#page-10-8) applies RL to object counting, while Perception-R1 [\(Yu et al., 2025\)](#page-13-8) leverages object matching and IoU as reward signals to improve grounding. DeepEyes [\(Zheng et al., 2025\)](#page-13-9) shows how RL can encourage models to invoke visual tools, thereby expanding perceptual abilities. For reasoning, MMEureka [\(Meng et al., 2025\)](#page-11-12) demonstrates the effectiveness of rule-based RL in mathematical tasks. From a data perspective, Vision-R1 [\(Huang et al., 2025c\)](#page-11-10) and R1-OneVision [\(Yang et al., 2025\)](#page-13-7) convert visual information into textual representations to build multimodal chainof-thought (CoT) datasets that support stronger reasoning. Despite these advances, the lack of scalable, high-quality RL datasets remains a fundamental bottleneck, severely limiting further improvements in both perception and reasoning for VLMs.
58
+
59
+ Enhancing Generalization via Proxy Tasks. Rule-based reinforcement learning (RL) has shown promise but typically requires large amounts of high-quality, verifiable data. Logic-RL [\(Xie et al.,](#page-13-10) [2025a\)](#page-13-10) addressed this by introducing the "Knights and Knaves" (K&K) puzzle, which offers controllable difficulty and algorithmically generated ground truth, enabling models to acquire reasoning skills transferable to mathematical tasks. Enigmata [\(Chen et al., 2025a\)](#page-10-9) extended this approach to a broader set of text-based puzzles (e.g., cryptographic, arithmetic, logical), demonstrating that solving such tasks with RL improves general reasoning without external data. RPT [\(Dong et al., 2025\)](#page-10-10) further reframed next-token prediction as a reasoning task, using verifiable rewards to enhance predictive ability and strengthen the basis for reinforcement fine-tuning. Inspired by these proxy-task successes in LLMs, recent work has begun exploring similar ideas for VLMs. Code2Logic [\(Tong](#page-12-7) [et al., 2025\)](#page-12-7) and ViGaL [\(Xie et al., 2025b\)](#page-13-11) leverage code-synthesized games to improve mathematical reasoning, while ViCrit [\(Wang et al., 2025d\)](#page-12-8) enhances perceptual robustness by reinforcing models to detect hallucinated entities via modified captions. Jigsaw-R1 [\(Wang et al., 2025e\)](#page-12-9) proposed a puzzle-based RL paradigm, but due to training limitations, its models still performed poorly even on 2 × 2 jigsaw puzzles, failing to fully exploit the proxy-task benefits. To address this gap, we propose a agentic jigsaw interaction learning framework, which casts jigsaw solving as an interactive process between the model and environment. This enables iterative refinement of perception and reasoning with explicit stepwise feedback, allowing the model to better capture visual relationships and develop stronger perceptual and reasoning skills.
60
+
61
+ # 3 METHOD
62
+
63
+ In this section, we provide a comprehensive description of our proposed agentic jigsaw interaction learning framework. We first introduce the jigsaw task and describe how the model interacts with the environment to accomplish it (Sec. [3.1\)](#page-3-0), then present the construction of the training data (Sec. [3.2\)](#page-4-0). Finally, we outline the training paradigm, including both the cold-start stage and the reinforcement learning stage (Sec. [3.3\)](#page-4-1).
64
+
65
+ {3}------------------------------------------------
66
+
67
+ ![](_page_3_Figure_1.jpeg)
68
+
69
+ Figure 2: Overview of the AGILE framework. (a) depicts the interaction process between the model and the external environment, together with the implementation of the GRPO algorithm; (b) shows the collection of high-quality jigsaw trajectory data; and (c) illustrates the model–environment interaction during the jigsaw rollout process.
70
+
71
+ ### <span id="page-3-0"></span>3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION
72
+
73
+ Jigsaw Task. Given an input image, we partition it into an m × m grid of jigsaw pieces, where task difficulty can be flexibly adjusted by varying m. If the image height or width is not divisible by m, the image is resized so that its dimensions are exact multiples of the grid. The grid is then randomly shuffled, and each piece is assigned an index in row-major order ranging from 1 (top-left) to m<sup>2</sup> (bottom-right). The shuffled configuration is denoted as
74
+
75
+ $$I_{Shuffle} = \{I_1, I_2, \dots, I_{m^2}\},$$
76
+ (1)
77
+
78
+ where each I<sup>k</sup> corresponds to one jigsaw block. Since the shuffling process is explicitly recorded during data generation, we can recover the ground-truth jigsaw layout as
79
+
80
+ $$I_{GT} = \{I_{\pi(1)}, I_{\pi(2)}, \dots, I_{\pi(m^2)}\},\tag{2}$$
81
+
82
+ where π is a permutation over {1, 2, . . . , m<sup>2</sup>}. During jigsaw solving, the model will maintain a current state
83
+
84
+ $$I_{State} = \{I_{\pi^*(1)}, I_{\pi^*(2)}, \dots, I_{\pi^*(m^2)}\},\tag{3}$$
85
+
86
+ where π <sup>∗</sup> denotes the current arrangement of pieces. At each step, the model iteratively swaps two pieces, observes the resulting configuration, and aims to reconstruct the ground-truth layout IGT .
87
+
88
+ Environment Interaction. The model interacts with the environment throughout the jigsawsolving process in an iterative manner. As illustrated in Figure [1,](#page-1-0) , we predefine a set of API for model–environment interactions in Python. The model expresses its actions by generating Python code, which is executed by the environment to produce the corresponding resulting image. The model then uses these results to reason further and decide on subsequent actions, repeating this process iteratively until the jigsaw is completed. Specifically, at each step, the model can perform the following actions:
89
+
90
+ - Swap: Given the current jigsaw state IState, the model calls the Swap function to exchange the positions of any two jigsaw pieces.
91
+ - Observe: Given IState, the model calls the Observe function to obtain the current jigsaw progress IObs, which is then used to determine the next action.
92
+
93
+ {4}------------------------------------------------
94
+
95
+ • Crop & Zoom: Given IObs, the model crops and zooms into a local region to inspect finer details and inform subsequent actions.
96
+
97
+ To better illustrate the overall procedure, the entire rollout process is presented in Algorithm [1.](#page-4-2)
98
+
99
+ ```
100
+ Algorithm 1 Interactive Jigsaw-Solving Procedure of VLMs with the Environment
101
+ ```
102
+
103
+ ```
104
+ Input: Query x, IShuff le, Policy model πθ, External environment V, Maximum iteration steps T.
105
+ Output: Final interaction trajectory y.
106
+ 1: Initialize trajectory y ← ∅, step counter t ← 0.
107
+ 2: while t < T do
108
+ 3: Sample response yt ∼ πθ(· | x, IShuff le, y).
109
+ 4: Append assistant response yt to trajectory: y ← y + yt.
110
+ 5: if <code> </code> detected in yt then
111
+ 6: Parse the Python code (e.g., Swap, Observe, Crop, Zoom), execute it in the environment V, and obtain
112
+ feedback Ot.
113
+ 7: else if <answer> </answer> detected in yt then
114
+ 8: return final trajectory y.
115
+ 9: end if
116
+ 10: Append environment feedback Ot as user input: y ← y + Ot.
117
+ 11: Update step counter t ← t + 1.
118
+ 12: end while
119
+ 13: return final trajectory y.
120
+ ```
121
+
122
+ ### <span id="page-4-0"></span>3.2 DATA CONSTRUCTION
123
+
124
+ In Section [3.1,](#page-3-0) we have introduced the jigsaw task and described how the model interacts with the environment to complete it. Based on this task design, we observe that the model (e.g., Qwen-2.5VL-7B) exhibits limited foundational capabilities, manifested in poor instruction-following and incorrect Python code generation, which hinders proper interaction with the environment and introduces substantial training noise. Directly applying reinforcement learning (RL) thus results in low learning efficiency. To bridge this gap and more effectively train our model, we employ Gemini 2.5 Pro[1](#page-4-3) to collect expert trajectories for the cold-start phase, endowing Qwen-2.5VL-7B with basic interactive jigsaw-solving capabilities. For this purpose, we design structured prompts to guide Gemini 2.5 Pro in interacting with the environment to complete the jigsaw tasks (The prompt templates are provided in Appendix [B.](#page-14-0) ).
125
+
126
+ To further ensure data quality, we apply an additional filtering process: first, selecting samples where Gemini's outputs match the ground truth, and then manually verifying each interaction step in the correct samples to ensure rationality and consistency. To ensure that our model can perform diverse jigsaw reasoning actions during reinforcement learning, we carefully balance the training data. Specifically, trajectories are balanced with respect to both the number of steps (4–8) and the types of actions involved (e.g., Swap, Observe, Crop, Zoom). This design ensures that the model is sufficiently exposed to the full action space and learns to handle various interactions with the environment effectively. Overall, we curate a dataset comprising 1.6K high-quality reasoning trajectories for the jigsaw task.
127
+
128
+ ### <span id="page-4-1"></span>3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING
129
+
130
+ Cold-start. During the cold-start phase, we leverage the 1.6K high-quality jigsaw-solving trajectories constructed in Section [3.2](#page-4-0) to equip the model with basic instruction-following and Python code generation capabilities, ensuring effective interaction with the environment.
131
+
132
+ Reinforcement Learning. Our framework adopts Group Relative Policy Optimization (GRPO), which utilizes the average reward of multiple sampled outputs as a baseline, instead of relying on a learned value function. The policy model is optimized by maximizing the following objective:
133
+
134
+ <span id="page-4-3"></span><sup>1</sup>The version is Gemini-2.5-Pro-Preview-05-06.
135
+
136
+ {5}------------------------------------------------
137
+
138
+ $$\mathcal{J}_{GRPO}(\theta) = \mathbb{E}_{x \sim \mathcal{D}, \{y_i\}_{i=1}^G \sim \pi_{\text{old}}(\cdot | x; \mathcal{V})} \left[ \frac{1}{G} \sum_{i=1}^G \frac{1}{\sum_{t=1}^{|y_i|} I(y_{i,t})} \sum_{t=1:I(y_{i,t})=1}^{|y_i|} \min \left( \frac{\pi_{\theta}(y_{i,t} \mid x, y_{i,< t}; \mathcal{V})}{\pi_{\text{old}}(y_{i,t} \mid x, y_{i,< t}; \mathcal{V})} \hat{A}_{i,t}, \right) \right] \\
139
+ \operatorname{clip} \left( \frac{\pi_{\theta}(y_{i,t} \mid x, y_{i,< t}; \mathcal{V})}{\pi_{\text{old}}(y_{i,t} \mid x, y_{i,< t}; \mathcal{V})}, 1 - \epsilon, 1 + \epsilon \right) \hat{A}_{i,t} \right) - \beta \, \mathbb{D}_{KL}(\pi_{\theta} \parallel \pi_{\text{ref}}), \tag{4}$$
140
+
141
+ where the rollout module samples a group of trajectories $\{y_1, y_2, \dots, y_G\}$ from the old policy $\pi_{\text{old}}$ for each input question x through interaction with the external environment $\mathcal{V}$ . The advantage term $\hat{A}_{i,t}$ is computed based on the relative rewards of outputs within each group. Our reward system comprises three components: an accuracy reward, a format reward, and a step reward. The total reward is computed as the sum of these components.
142
+
143
+ - Accuracy Reward: We compare the model's generated answer $I_{Answer}$ with the ground truth $I_{GT}$ . If all jigsaw image blocks are correctly placed, the accuracy reward is 1; otherwise, it is 0.
144
+ - Format Reward: The model receives a reward of 1 if its output follows the required structured format, with the reasoning process, code, and final answer correctly enclosed within the <think>, <code>, and <answer> tags, respectively.
145
+ - $\bullet$ Step Reward: We encourage the model to complete the jigsaw in as few steps as possible. For a $2 \times 2$ jigsaw, if each step swaps any two image blocks, at most three steps are theoretically required to place all blocks correctly. Excessive actions may lead the model to perform invalid steps, reducing the proportion of effective perception and reasoning. Furthermore, to prevent the model from prematurely hacking the step reward during early RL training, the step reward is applied only when the jigsaw is correctly completed. If the jigsaw is incorrect, the model is penalized by assigning the maximum step penalty. Formally, the step reward is defined as:
146
+
147
+ <span id="page-5-2"></span>
148
+ $$R_{\text{step}} = \lambda \cdot \left( \mathbb{I}_{\{R_{\text{acc}}=1\}} \cdot step_{\text{num}} + \mathbb{I}_{\{R_{\text{acc}}=0\}} \cdot step_{\text{max}} \right), \tag{5}$$
149
+
150
+ where $step_{num}$ is the number of steps the model actually used to complete the jigsaw, $step_{max}$ is the maximum allowed steps, $\lambda$ denotes the step penalty coefficient, which is set to -0.05, and $\mathbb{I}_{\{\cdot\}}$ is the indicator function. The final reward formulation is shown in Equation 6:
151
+
152
+ <span id="page-5-0"></span>
153
+ $$R = \alpha \cdot R_{\text{acc}} + \beta \cdot R_{\text{format}} + \gamma \cdot R_{\text{step}}, \tag{6}$$
154
+
155
+ where the coefficients $\alpha$ , $\beta$ , and $\gamma$ weight the relative importance of accuracy, format, and step rewards, respectively. In our experimental setup, $\alpha$ , $\beta$ , and $\gamma$ are set to 0.8, 0.2, and 1.0, respectively.
156
+
157
+ ### 4 EXPERIMENT
158
+
159
+ In this section, we present a comprehensive experimental study. We first describe the implementation details, including datasets, training procedures, and inference settings (Sec. 4.1). We then evaluate the effectiveness of our agentic jigsaw interaction learning framework on both jigsaw-solving and general vision tasks (Sec. 4.2). Finally, we perform ablation studies to assess the impact of jigsaw data scale and to contrast the benefits of jigsaw data with those of general QA data (Sec. 4.3).
160
+
161
+ ### <span id="page-5-1"></span>4.1 IMPLEMENTATION DETAILS
162
+
163
+ **Datasets and Models.** Our training data consist of two components corresponding to the cold-start and reinforcement learning (RL) stages. In the cold-start stage, we employ 1.6K high-quality jigsaw puzzle trajectories collected in Sec. 3.2 to endow the model with basic interactive jigsaw-solving skills. In the RL stage, we construct a dataset of 15.6K images spanning diverse domains, including high-resolution visual search, OCR-based text recognition, real-world scenes, and structured diagrams (see Appendix A for details). Each image is partitioned into $2 \times 2$ patches and randomly shuffled to ensure that all patches are initially misplaced. All experiments are conducted using Qwen2.5-VL-7B (Bai et al., 2025) as the base model.
164
+
165
+ {6}------------------------------------------------
166
+
167
+ <span id="page-6-1"></span>Table 1: Jigsaw Acc result. LN indicates the difficulty level, where N denotes the initial number of correct pieces. A smaller N corresponds to a more scrambled jigsaw and higher difficulty. The best results are highlighted in bold, and the second-best results are underlined.
168
+
169
+ | Model | | | 2 × 2 | | | 3 × 3 | | | | | | | |
170
+ |----------------|------|------|-------|------|-----|-------|------|------|------|------|------|------|------|
171
+ | | L0 | L1 | L2 | Avg. | L0 | L1 | L2 | L3 | L4 | L5 | L6 | L7 | Avg. |
172
+ | Random | 4.5 | 3.7 | 4.2 | 4.1 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 |
173
+ | GPT-4o | 38.7 | 37.7 | 47.0 | 41.1 | 1.0 | 1.3 | 2.7 | 3.0 | 3.0 | 7.0 | 7.7 | 13.7 | 4.9 |
174
+ | Gemini-2.5-Pro | 43.3 | 46.3 | 49.7 | 46.4 | 7.0 | 8.7 | 9.7 | 10.0 | 11.0 | 15.0 | 23.0 | 32.0 | 14.6 |
175
+ | MiMo-VL-7B-RL | 11.3 | 14.3 | 17.0 | 14.2 | 0.3 | 0.0 | 0.0 | 0.0 | 0.3 | 0.3 | 1.0 | 3.7 | 0.7 |
176
+ | InternVL3-8B | 3.7 | 3.7 | 5.0 | 4.1 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 |
177
+ | InternVL3-78B | 3.3 | 4.3 | 3.0 | 3.5 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 |
178
+ | Qwen2.5VL-72B | 22.7 | 24.3 | 35.3 | 27.4 | 0.3 | 1.3 | 2.3 | 2.7 | 2.0 | 3.0 | 6.7 | 12.7 | 3.9 |
179
+ | Qwen2.5VL-7B | 6.3 | 6.0 | 16.3 | 9.5 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.7 | 1.3 | 1.3 | 0.4 |
180
+ | +Cold-Start | 12.0 | 32.0 | 22.0 | 22.0 | 0.0 | 0.3 | 0.0 | 0.0 | 0.0 | 0.7 | 0.3 | 0.0 | 0.2 |
181
+ | +RL | 78.7 | 83.0 | 86.7 | 82.8 | 5.0 | 7.0 | 11.0 | 14.0 | 17.7 | 25.3 | 38.0 | 48.0 | 20.8 |
182
+
183
+ Training and Inference Setups. We conduct supervised fine-tuning (SFT) on llama-factory [\(Zheng](#page-13-12) [et al., 2024\)](#page-13-12) and reinforcement learning (RL) training on verl [\(Sheng et al., 2024\)](#page-12-10), both with fullparameter tuning. For inference and evaluation, we adopt VLMEvalKit [\(Duan et al., 2024\)](#page-10-11) as the framework. To ensure a fair comparison, all evaluations on general downstream benchmarks are conducted in a strict single-turn setting following VLMEvalKit, fully consistent with the evaluation protocol of all baseline models. All experiments are performed on 8 NVIDIA A100 GPUs with 80GB memory each. Detailed training hyperparameters are provided in the Appendix [D.](#page-20-0)
184
+
185
+ ### <span id="page-6-0"></span>4.2 MAIN RESULTS
186
+
187
+ Significant Improvements on the Jigsaw Task. To comprehensively evaluate performance on the jigsaw task, we curate a test set of 300 images spanning diverse scenarios, including high-resolution visual search, OCR-based text recognition, and real-world scenes. Each image is partitioned into 2 × 2 and 3 × 3 grids, and the performance is measured using two metrics: Acc, which equals 1 only when all patches are correctly placed, and Score, defined as the ratio of correctly placed patches to the total number of patches. As shown in Table [1](#page-6-1) and [2,](#page-7-1) the base model Qwen2.5-VL-7B performs poorly without training (achieving only 9.5% accuracy even under the simplest 2 × 2 setting) while the proprietary Gemini2.5-Pro and the larger Qwen2.5-VL-72B models also struggle on this task. After supervised fine-tuning (SFT) with 1.6K cold-start trajectories and reinforcement learning (RL) with 15.6K images, Qwen2.5-VL-7B achieves substantial gains: on the 2 × 2 setting, Acc improves from 9.5% to 82.8% and Score from 29.4% to 89.0%; on the more challenging 3 × 3 setting, it also generalizes well, with Acc increasing from 0.4% to 20.8% and Score from 31.1% to 62.1%, significantly surpassing Gemini2.5-Pro and Qwen2.5-VL-72B. These results demonstrate that modeling jigsaw solving as an interactive multi-turn dialogue enables the model to progressively enhance its visual perception and reasoning abilities, thereby achieving superior performance on the jigsaw task.
188
+
189
+ Generalization to Downstream Visual Tasks. The proposed agentic jigsaw interaction learning framework delivers substantial improvements on the jigsaw task. By leveraging explicit step-by-step feedback for iterative refinement, it enables the model to capture visual relations more effectively and to develop stronger reasoning capabilities.
190
+
191
+ To further assess whether jigsaw training enhances performance on general vision downstream tasks, we evaluate the model on 9 benchmarks: high-resolution image understanding (HRBench4K [\(Wang](#page-12-11) [et al., 2025c\)](#page-12-11), HRBench8K [\(Wang et al., 2025c\)](#page-12-11), VStarBench [\(Wu & Xie, 2024\)](#page-12-12)), real-world scene understanding (MME-RealWorld [\(Zhang et al., 2024\)](#page-13-13), RealWorldQA [\(xAI, 2024\)](#page-12-13)), fine-grained visual recognition (MMVP [\(Tong et al., 2024\)](#page-12-14), BLINK [\(Fu et al., 2024\)](#page-10-12)), visual reasoning (MMMU [\(Yue et al., 2024\)](#page-13-14)), and hallucination evaluation (HallusionBench [\(Guan et al., 2024\)](#page-10-13)). As shown in Table [3,](#page-7-2) the jigsaw-trained model demonstrates strong visual generalization, achieving notable gains on HRBench4K (+4.2%), HRBench8K (+5.2%), and VStarBench (+4.2%). On average, it surpasses the base model Qwen2.5-VL-7B by 3.1% across all 9 benchmarks, providing compelling evidence
192
+
193
+ {7}------------------------------------------------
194
+
195
+ <span id="page-7-1"></span>Table 2: **Jigsaw Score result.** LN indicates the difficulty level, where N denotes the initial number of correct pieces. A smaller N corresponds to a more scrambled jigsaw and higher difficulty. The best results are highlighted in **bold**, and the second-best results are underlined.
196
+
197
+ | Model | | 2 : | × 2 | | 3 × 3 | | | | | | | | |
198
+ |--------------------|---------------------|---------------------|---------------------|---------------------|--------------------|--------------------|--------------------|---------------------|---------------------|---------------------|---------------------|---------------------|---------------------|
199
+ | | L0 | L1 | L2 | Avg. | L0 | L1 | L2 | L3 | L4 | L5 | L6 | L7 | Avg. |
200
+ | Random | 25.2 | 24.7 | 24.8 | 24.9 | 11.4 | 11.3 | 11.0 | 10.9 | 11.1 | 11.4 | 11.3 | 10.8 | 11.2 |
201
+ | GPT-4o | 54.8 | 59.1 | 63.2 | <u>59.0</u> | 25.9 | 27.3 | 34.1 | 36.3 | 42.3 | 48.0 | 54.4 | 64.0 | 41.5 |
202
+ | Gemini-2.5-Pro | <u>55.3</u> | <u>60.1</u> | 61.6 | 59.0 | <u>31.9</u> | <u>31.8</u> | <u>35.7</u> | <u>39.4</u> | <u>43.1</u> | <u>48.7</u> | <u>61.8</u> | <u>68.6</u> | <u>45.1</u> |
203
+ | MiMo-VL-7B-RL | 21.8 | 27.2 | 29.2 | 26.1 | 5.5 | 6.9 | 8.0 | 10.7 | 15.9 | 19.5 | 20.6 | 28.9 | 14.5 |
204
+ | InternVL3-8B | 24.6 | 24.3 | 25.3 | 24.7 | 7.5 | 10.1 | 15.7 | 16.8 | 20.3 | 25.1 | 28.2 | 31.7 | 19.4 |
205
+ | InternVL3-78B | 21.3 | 26.5 | 28.4 | 25.4 | 7.1 | 10.9 | 14.1 | 18.5 | 23.1 | 25.7 | 29.0 | 37.0 | 20.7 |
206
+ | Qwen2.5VL-72B | 40.7 | 46.1 | 56.1 | 47.6 | 21.7 | 25.6 | 30.8 | 33.4 | 34.7 | 40.0 | 46.3 | 55.2 | 36.0 |
207
+ | Qwen2.5VL-7B | 14.4 | 30.1 | 43.8 | 29.4 | 5.8 | 12.0 | 20.3 | 25.6 | 32.7 | 40.9 | 50.2 | 60.9 | 31.1 |
208
+ | +Cold-Start<br>+RL | 40.6<br><b>86.4</b> | 45.6<br><b>88.7</b> | 45.3<br><b>91.9</b> | 43.8<br><b>89.0</b> | 6.5<br><b>41.1</b> | 6.9<br><b>46.8</b> | 7.8<br><b>52.6</b> | 10.2<br><b>58.6</b> | 10.4<br><b>65.3</b> | 13.2<br><b>71.0</b> | 15.7<br><b>77.9</b> | 17.0<br><b>83.6</b> | 11.0<br><b>62.1</b> |
209
+
210
+ <span id="page-7-2"></span>Table 3: **Main results.** Performance comparison of different models on the 9 benchmarks. Abbreviations: MME-RW (MME-RealWorld-Lite), RWQA (RealWorldQA), HRB4K (HRBench4K), HRB8K (HRBench8K), Halbench (HallusionBench), MMMU (MMMU\_VAL), Avg. denotes the average performance across all 9 benchmarks. $\Delta$ represents the relative performance gain achieved by RL compared to the base model Qwen2.5-VL-7B. The best results are highlighted in **bold**, and the second-best results are underlined.
211
+
212
+ | Model | MME-RW | RWQA | HRB4K | HRB8K | VStar | MMVP | BLINK | HalBench | MMMU | Avg. |
213
+ |------------------------------|--------|------|-------|-------|-------------|------|-------|----------|------|------|
214
+ | LLaVA-OV-7B | 48.4 | 69.5 | 65.3 | 58.4 | 73.3 | 77.3 | 52.6 | 36.6 | 48.2 | 58.8 |
215
+ | InternVL2.5-8B | 48.2 | 69.4 | 68.0 | 63.3 | 71.7 | 75.7 | 54.9 | 49.9 | 53.6 | 61.6 |
216
+ | InternVL2.5-78B | 49.7 | 78.4 | 74.5 | 72.5 | 75.9 | 83.0 | 63.6 | 57.1 | 65.4 | 68.9 |
217
+ | Qwen2.5-VL-72B | 44.7 | 75.3 | 80.1 | 77.1 | 85.9 | 81.7 | 61.6 | 53.5 | 66.9 | 69.6 |
218
+ | Qwen2.5-VL-7B | 44.6 | 68.5 | 68.8 | 65.3 | 76.4 | 74.3 | 56.4 | 50.1 | 54.8 | 62.1 |
219
+ | + Cold-Start | 46.2 | 68.4 | 71.0 | 68.4 | <u>77.5</u> | 76.7 | 55.7 | 49.8 | 54.0 | 63.1 |
220
+ | + RL | 48.4 | 70.2 | 73.0 | 70.5 | 80.6 | 78.0 | 58.0 | 51.9 | 55.8 | 65.2 |
221
+ | $\Delta$ (vs. Qwen2.5-VL-7B) | +3.8 | +1.7 | +4.2 | +5.2 | +4.2 | +3.7 | +1.6 | +1.8 | +1.0 | +3.1 |
222
+
223
+ that jigsaw-based training effectively enhances the model's ability to capture visual relations and strengthen reasoning skills, thereby improving its performance on general vision downstream tasks.
224
+
225
+ ### <span id="page-7-0"></span>4.3 ANALYSIS
226
+
227
+ Impact of Jigsaw Training Data Scale. To investigate the effect of data scale, we systematically vary the amount of training data and evaluate model performance on both jigsaw task and general vision tasks. As shown in Figure 3, scaling up the data yields substantial performance gains: jigsaw task accuracy increases from 22.0% to 82.8%, while HRBench4K and RealWorldQA see improvements of 2.0% and 1.8%, respectively. These results highlight a clear data-to-performance trend, demonstrating that larger training sets translate directly into stronger perceptual and reasoning abilities. Crucially, because jigasw data in our reinforcement learning stage are generated via scalable programmatic synthesis, AGILE can easily leverage larger datasets. This scalability not only provides richer learning signals for continual capability growth but also offers a practical and sustainable solution to the scarcity of high-quality multimodal RL data.
228
+
229
+ Performance Comparison: Jigsaw vs. General QA Data. We compare the effectiveness of jigsaw data against conventional General QA data for model training. As shown in Figure 4, models trained with jigsaw data consistently outperform those trained with QA data across multiple benchmarks. Notably, combining 10K jigsaw samples with 10K QA samples yields superior performance on general vision benchmarks compared to training with 20K QA samples alone. These results highlight the unique role of jigsaw data in enhancing fundamental visual generalization, demonstrating the efficiency and controllability of jigsaw-solving as a proxy for visual perception and reasoning. A key advantage of our approach lies in the programmatic synthesis of jigsaw data, which enables effortless construction of large-scale, high-quality datasets, a process that is otherwise costly and
230
+
231
+ {8}------------------------------------------------
232
+
233
+ <span id="page-8-0"></span>![](_page_8_Figure_1.jpeg)
234
+
235
+ Figure 3: Impact of Training Data Scale. The left y-axis denotes the accuracies on HRBench4K and RealWorldQA, while the right y-axis corresponds to the accuracy on the jigsaw task.
236
+
237
+ ![](_page_8_Figure_3.jpeg)
238
+
239
+ Figure 4: Comparison with General QA Data. The total number of samples is consistently maintained at 20K across both experimental setups.
240
+
241
+ labor-intensive for QA data. Thus, jigsaw data not only serves as an effective alternative to General QA data but, in some cases, proves to be the superior choice. This finding underscores the potential of jigsaw tasks in alleviating the scarcity of multimodal RL data and opens a promising new direction for advancing multimodal model development.
242
+
243
+ <span id="page-8-1"></span>![](_page_8_Figure_6.jpeg)
244
+
245
+ Figure 5: Case Study. Jigsaw-solving reasoning and behaviors exhibited by our model.
246
+
247
+ Case Study. In Figure [5,](#page-8-1) we showcase several jigsaw-solving reasoning patterns and behaviors exhibited by our model. These cases illustrate the emergence of high-quality perceptual and reasoning strategies in the jigsaw task, including comprehensively interpreting the visual content of individual pieces to infer their spatial relations, employing cropping and zooming to examine and validate edge alignment, and reasoning about semantic consistency across pieces. Such behaviors demon
248
+
249
+ {9}------------------------------------------------
250
+
251
+ strate human-like reasoning, thereby effectively enhancing the model's perceptual and reasoning capabilities.
252
+
253
+ # 5 CONCLUSION
254
+
255
+ In this work, we propose a novel agentic jigsaw interaction learning framework that formulates jigsaw solving as an interactive process to enhance visual perception and reasoning in large Vision-Language Models (VLMs). By treating jigsaw solving as an iterative interaction, the model progressively refines its perceptual and reasoning capabilities through exploration and feedback. Our approach significantly improves performance on jigsaw tasks of varying complexity and demonstrates strong generalization to broader general visual tasks, including visual question answering and scene understanding. Furthermore, by analyzing the performance gains from increasing the scale of jigsaw data and comparing it with general QA data, we show that jigsaw serve as an effective proxy for alleviating the scarcity of high-quality RL data, highlighting the potential of task-driven proxy training for stimulating complex multimodal perception and reasoning in VLMs.
256
+
257
+ # 6 ACKNOWLEDGEMENTS
258
+
259
+ This work was supported by the Anhui Provincial Natural Science Foundation under Grant 2108085UD12. We acknowledge the support of GPU cluster built by MCC Lab of Information Science and Technology Institution, USTC. The AI-driven experiments, simulations and model training were performed on the robotic AI-Scientist platform of Chinese Academy of Sciences.
260
+
261
+ # 7 ETHICS STATEMENT
262
+
263
+ This work adheres to ethical research standards in data collection, model training, and evaluation. All datasets used in this study are publicly available research datasets (e.g., COCO, TextVQA, HRBench, RealWorldQA), which were collected and released under their respective licenses. No private or personally identifiable information (PII) was used.
264
+
265
+ # 8 REPRODICIBILITY STATEMENT
266
+
267
+ We are committed to ensuring the reproducibility of our results. Comprehensive implementation details, including training data and hyperparameter settings, are provided in Appendices [A](#page-14-1) and [D.](#page-20-0) To further facilitate reproducibility, we have released the training code, datasets, and evaluation scripts.
268
+
269
+ {10}------------------------------------------------
270
+
271
+ # REFERENCES
272
+
273
+ - <span id="page-10-2"></span>Shuai Bai, Keqin Chen, Xuejing Liu, Jialin Wang, Wenbin Ge, Sibo Song, Kai Dang, Peng Wang, Shijie Wang, Jun Tang, et al. Qwen2. 5-vl technical report. *arXiv preprint arXiv:2502.13923*, 2025.
274
+ - <span id="page-10-5"></span>Fabio M Carlucci, Antonio D'Innocente, Silvia Bucci, Barbara Caputo, and Tatiana Tommasi. Domain generalization by solving jigsaw puzzles. In *Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition*, pp. 2229–2238, 2019.
275
+ - <span id="page-10-9"></span>Jiangjie Chen, Qianyu He, Siyu Yuan, Aili Chen, Zhicheng Cai, Weinan Dai, Hongli Yu, Qiying Yu, Xuefeng Li, Jiaze Chen, et al. Enigmata: Scaling logical reasoning in large language models with synthetic verifiable puzzles. *arXiv preprint arXiv:2505.19914*, 2025a.
276
+ - <span id="page-10-8"></span>Liang Chen, Lei Li, Haozhe Zhao, Yifan Song, and Vinci. R1-v: Reinforcing super generalization ability in vision-language models with less than \$3. [https://github.com/Deep-Agent/](https://github.com/Deep-Agent/R1-V) [R1-V](https://github.com/Deep-Agent/R1-V), 2025b. Accessed: 2025-02-02.
277
+ - <span id="page-10-0"></span>Lin Chen, Jinsong Li, Xiaoyi Dong, Pan Zhang, Conghui He, Jiaqi Wang, Feng Zhao, and Dahua Lin. Sharegpt4v: Improving large multi-modal models with better captions. In *European Conference on Computer Vision*, pp. 370–387. Springer, 2024a.
278
+ - <span id="page-10-14"></span>Lin Chen, Jinsong Li, Xiaoyi Dong, Pan Zhang, Yuhang Zang, Zehui Chen, Haodong Duan, Jiaqi Wang, Yu Qiao, Dahua Lin, et al. Are we on the right way for evaluating large vision-language models? *Advances in Neural Information Processing Systems*, 37:27056–27087, 2024b.
279
+ - <span id="page-10-1"></span>Lin Chen, Xilin Wei, Jinsong Li, Xiaoyi Dong, Pan Zhang, Yuhang Zang, Zehui Chen, Haodong Duan, Zhenyu Tang, Li Yuan, et al. Sharegpt4video: Improving video understanding and generation with better captions. *Advances in Neural Information Processing Systems*, 37:19472–19495, 2024c.
280
+ - <span id="page-10-6"></span>Yingyi Chen, Xi Shen, Yahui Liu, Qinghua Tao, and Johan AK Suykens. Jigsaw-vit: Learning jigsaw puzzles in vision transformer. *Pattern Recognition Letters*, 166:53–60, 2023.
281
+ - <span id="page-10-3"></span>Gheorghe Comanici, Eric Bieber, Mike Schaekermann, Ice Pasupat, Noveen Sachdeva, Inderjit Dhillon, Marcel Blistein, Ori Ram, Dan Zhang, Evan Rosen, et al. Gemini 2.5: Pushing the frontier with advanced reasoning, multimodality, long context, and next generation agentic capabilities. *arXiv preprint arXiv:2507.06261*, 2025.
282
+ - <span id="page-10-10"></span>Qingxiu Dong, Li Dong, Yao Tang, Tianzhu Ye, Yutao Sun, Zhifang Sui, and Furu Wei. Reinforcement pre-training. *arXiv preprint arXiv:2506.08007*, 2025.
283
+ - <span id="page-10-11"></span>Haodong Duan, Junming Yang, Yuxuan Qiao, Xinyu Fang, Lin Chen, Yuan Liu, Xiaoyi Dong, Yuhang Zang, Pan Zhang, Jiaqi Wang, et al. Vlmevalkit: An open-source toolkit for evaluating large multi-modality models. In *Proceedings of the 32nd ACM International Conference on Multimedia*, pp. 11198–11201, 2024.
284
+ - <span id="page-10-4"></span>Zhen Fang, Zhuoyang Liu, Jiaming Liu, Hao Chen, Yu Zeng, Shiting Huang, Zehui Chen, Lin Chen, Shanghang Zhang, and Feng Zhao. Dualvla: Building a generalizable embodied agent via partial decoupling of reasoning and action. *arXiv preprint arXiv:2511.22134*, 2025.
285
+ - <span id="page-10-12"></span>Xingyu Fu, Yushi Hu, Bangzheng Li, Yu Feng, Haoyu Wang, Xudong Lin, Dan Roth, Noah A Smith, Wei-Chiu Ma, and Ranjay Krishna. Blink: Multimodal large language models can see but not perceive. In *European Conference on Computer Vision*, pp. 148–166. Springer, 2024.
286
+ - <span id="page-10-13"></span>Tianrui Guan, Fuxiao Liu, Xiyang Wu, Ruiqi Xian, Zongxia Li, Xiaoyu Liu, Xijun Wang, Lichang Chen, Furong Huang, Yaser Yacoob, 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*, pp. 14375– 14385, 2024.
287
+ - <span id="page-10-7"></span>Daya Guo, Dejian Yang, Haowei Zhang, Junxiao Song, Ruoyu Zhang, Runxin Xu, Qihao Zhu, Shirong Ma, Peiyi Wang, Xiao Bi, et al. Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning. *arXiv preprint arXiv:2501.12948*, 2025.
288
+
289
+ {11}------------------------------------------------
290
+
291
+ - <span id="page-11-6"></span>Ruiyan Han, Zhen Fang, XinYu Sun, Yuchen Ma, Ziheng Wang, Yu Zeng, Zehui Chen, Lin Chen, Wenxuan Huang, Wei-Jie Xu, et al. Unicorn: Towards self-improving unified multimodal models through self-generated supervision. *arXiv preprint arXiv:2601.03193*, 2026.
292
+ - <span id="page-11-7"></span>Shiting Huang, Zhen Fang, Zehui Chen, Siyu Yuan, Junjie Ye, Yu Zeng, Lin Chen, Qi Mao, and Feng Zhao. Critictool: Evaluating self-critique capabilities of large language models in toolcalling error scenarios. *arXiv preprint arXiv:2506.13977*, 2025a.
293
+ - <span id="page-11-8"></span>Shiting Huang, Zecheng Li, Yu Zeng, Qingnan Ren, Zhen Fang, Qisheng Su, Kou Shi, Lin Chen, Zehui Chen, and Feng Zhao. Internalizing meta-experience into memory for guided reinforcement learning in large language models. *arXiv preprint arXiv:2602.10224*, 2026a.
294
+ - <span id="page-11-5"></span>Wenxuan Huang, Shuang Chen, Zheyong Xie, Shaosheng Cao, Shixiang Tang, Yufan Shen, Qingyu Yin, Wenbo Hu, Xiaoman Wang, Yuntian Tang, et al. Interleaving reasoning for better text-toimage generation. *arXiv preprint arXiv:2509.06945*, 2025b.
295
+ - <span id="page-11-10"></span>Wenxuan Huang, Bohan Jia, Zijie Zhai, Shaosheng Cao, Zheyu Ye, Fei Zhao, Zhe Xu, Yao Hu, and Shaohui Lin. Vision-r1: Incentivizing reasoning capability in multimodal large language models. *arXiv preprint arXiv:2503.06749*, 2025c.
296
+ - <span id="page-11-3"></span>Wenxuan Huang, Yu Zeng, Qiuchen Wang, Zhen Fang, Shaosheng Cao, Zheng Chu, Qingyu Yin, Shuang Chen, Zhenfei Yin, Lin Chen, et al. Vision-deepresearch: Incentivizing deepresearch capability in multimodal large language models. *arXiv preprint arXiv:2601.22060*, 2026b.
297
+ - <span id="page-11-1"></span>Aaron Hurst, Adam Lerer, Adam P Goucher, Adam Perelman, Aditya Ramesh, Aidan Clark, AJ Ostrow, Akila Welihinda, Alan Hayes, Alec Radford, et al. Gpt-4o system card. *arXiv preprint arXiv:2410.21276*, 2024.
298
+ - <span id="page-11-14"></span>Bohao Li, Yuying Ge, Yi Chen, Yixiao Ge, Ruimao Zhang, and Ying Shan. Seed-bench-2-plus: Benchmarking multimodal large language models with text-rich visual comprehension. *arXiv preprint arXiv:2404.16790*, 2024a.
299
+ - <span id="page-11-0"></span>Xiaotong Li, Fan Zhang, Haiwen Diao, Yueze Wang, Xinlong Wang, and Lingyu Duan. Densefusion-1m: Merging vision experts for comprehensive multimodal perception. *Advances in Neural Information Processing Systems*, 37:18535–18556, 2024b.
300
+ - <span id="page-11-15"></span>Tsung-Yi Lin, Michael Maire, Serge Belongie, James Hays, Pietro Perona, Deva Ramanan, Piotr Dollar, and C Lawrence Zitnick. Microsoft coco: Common objects in context. In ´ *European Conference on Computer Vision*, pp. 740–755. Springer, 2014.
301
+ - <span id="page-11-11"></span>Pan Lu, Hritik Bansal, Tony Xia, Jiacheng Liu, Chunyuan Li, Hannaneh Hajishirzi, Hao Cheng, Kai-Wei Chang, Michel Galley, and Jianfeng Gao. Mathvista: Evaluating mathematical reasoning of foundation models in visual contexts. *arXiv preprint arXiv:2310.02255*, 2023.
302
+ - <span id="page-11-9"></span>Xiaoxiao Ma, Haibo Qiu, Guohui Zhang, Zhixiong Zeng, Siqi Yang, Lin Ma, and Feng Zhao. Stage: Stable and generalizable grpo for autoregressive image generation. *arXiv preprint arXiv:2509.25027*, 2025.
303
+ - <span id="page-11-13"></span>Minesh Mathew, Viraj Bagal, Ruben Tito, Dimosthenis Karatzas, Ernest Valveny, and CV Jawahar. ` Infographicvqa. In *Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision*, pp. 1697–1706, 2022.
304
+ - <span id="page-11-12"></span>Fanqing Meng, Lingxiao Du, Zongkai Liu, Zhixiang Zhou, Quanfeng Lu, Daocheng Fu, Botian Shi, Wenhai Wang, Junjun He, Kaipeng Zhang, et al. Mm-eureka: Exploring visual aha moment with rule-based large-scale reinforcement learning. *CoRR*, 2025.
305
+ - <span id="page-11-4"></span>Yaning Pan, Qianqian Xie, Guohui Zhang, Zekun Wang, Yongqian Wen, Yuanxing Zhang, Haoxuan Hu, Zhiyu Pan, Yibing Huang, Zhidong Gan, et al. Mt-video-bench: A holistic video understanding benchmark for evaluating multimodal llms in multi-turn dialogues. *arXiv preprint arXiv:2510.17722*, 2025.
306
+ - <span id="page-11-2"></span>Yukun Qi, Yiming Zhao, Yu Zeng, Xikun Bao, Wenxuan Huang, Lin Chen, Zehui Chen, Jie Zhao, Zhongang Qi, and Feng Zhao. Vcr-bench: A comprehensive evaluation framework for video chain-of-thought reasoning. *arXiv preprint arXiv:2504.07956*, 2025.
307
+
308
+ {12}------------------------------------------------
309
+
310
+ - <span id="page-12-4"></span>Rafael Rafailov, Archit Sharma, Eric Mitchell, Christopher D Manning, Stefano Ermon, and Chelsea Finn. Direct preference optimization: Your language model is secretly a reward model. *Advances in Neural Information Processing Systems*, 36:53728–53741, 2023.
311
+ - <span id="page-12-6"></span>Qingnan Ren, Shiting Huang, Zhen Fang, Zehui Chen, Lin Chen, Lijun Li, and Feng Zhao. Adora: Training reasoning models with dynamic advantage estimation on reinforcement learning. *arXiv preprint arXiv:2602.10019*, 2026.
312
+ - <span id="page-12-3"></span>John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. Proximal policy optimization algorithms. *arXiv preprint arXiv:1707.06347*, 2017.
313
+ - <span id="page-12-5"></span>Zhihong Shao, Peiyi Wang, Qihao Zhu, Runxin Xu, Junxiao Song, Xiao Bi, Haowei Zhang, Mingchuan Zhang, YK Li, Yang Wu, et al. Deepseekmath: Pushing the limits of mathematical reasoning in open language models. *arXiv preprint arXiv:2402.03300*, 2024.
314
+ - <span id="page-12-10"></span>Guangming Sheng, Chi Zhang, Zilingfeng Ye, Xibin Wu, Wang Zhang, Ru Zhang, Yanghua Peng, Haibin Lin, and Chuan Wu. Hybridflow: A flexible and efficient rlhf framework. *arXiv preprint arXiv: 2409.19256*, 2024.
315
+ - <span id="page-12-15"></span>Amanpreet Singh, Vivek Natarajan, Meet Shah, Yu Jiang, Xinlei Chen, Dhruv Batra, Devi Parikh, and Marcus Rohrbach. Towards vqa models that can read. In *Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition*, pp. 8317–8326, 2019.
316
+ - <span id="page-12-7"></span>Jingqi Tong, Jixin Tang, Hangcheng Li, Yurong Mou, Ming Zhang, Jun Zhao, Yanbo Wen, Fan Song, Jiahao Zhan, Yuyang Lu, et al. Code2logic: Game-code-driven data synthesis for enhancing vlms general reasoning. *arXiv preprint arXiv:2505.13886*, 2025.
317
+ - <span id="page-12-14"></span>Shengbang Tong, Zhuang Liu, Yuexiang Zhai, Yi Ma, Yann LeCun, and Saining Xie. Eyes wide shut? exploring the visual shortcomings of multimodal llms. In *Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition*, pp. 9568–9578, 2024.
318
+ - <span id="page-12-2"></span>Qiuchen Wang, Ruixue Ding, Zehui Chen, Weiqi Wu, Shihang Wang, Pengjun Xie, and Feng Zhao. Vidorag: Visual document retrieval-augmented generation via dynamic iterative reasoning agents. *arXiv preprint arXiv:2502.18017*, 2025a.
319
+ - <span id="page-12-1"></span>Qiuchen Wang, Ruixue Ding, Yu Zeng, Zehui Chen, Lin Chen, Shihang Wang, Pengjun Xie, Fei Huang, and Feng Zhao. Vrag-rl: Empower vision-perception-based rag for visually rich information understanding via iterative reasoning with reinforcement learning. *arXiv preprint arXiv:2505.22019*, 2025b.
320
+ - <span id="page-12-0"></span>Qiuchen Wang, Shihang Wang, Yu Zeng, Qiang Zhang, Fanrui Zhang, Zhuoning Guo, Bosi Zhang, Wenxuan Huang, Lin Chen, Zehui Chen, et al. Vimrag: Navigating massive visual context in retrieval-augmented generation via multimodal memory graph. *arXiv preprint arXiv:2602.12735*, 2026.
321
+ - <span id="page-12-11"></span>Wenbin Wang, Liang Ding, Minyan Zeng, Xiabin Zhou, Li Shen, Yong Luo, Wei Yu, and Dacheng Tao. Divide, conquer and combine: A training-free framework for high-resolution image perception in multimodal large language models. In *Proceedings of the AAAI Conference on Artificial Intelligence*, volume 39, pp. 7907–7915, 2025c.
322
+ - <span id="page-12-8"></span>Xiyao Wang, Zhengyuan Yang, Chao Feng, Yongyuan Liang, Yuhang Zhou, Xiaoyu Liu, Ziyi Zang, Ming Li, Chung-Ching Lin, Kevin Lin, et al. Vicrit: A verifiable reinforcement learning proxy task for visual perception in vlms. *arXiv preprint arXiv:2506.10128*, 2025d.
323
+ - <span id="page-12-9"></span>Zifu Wang, Junyi Zhu, Bo Tang, Zhiyu Li, Feiyu Xiong, Jiaqian Yu, and Matthew B Blaschko. Jigsaw-r1: A study of rule-based visual reinforcement learning with jigsaw puzzles. *arXiv preprint arXiv:2505.23590*, 2025e.
324
+ - <span id="page-12-12"></span>Penghao Wu and Saining Xie. V?: Guided visual search as a core mechanism in multimodal llms. In *Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition*, pp. 13084–13094, 2024.
325
+ - <span id="page-12-13"></span>xAI. Grok-1.5 Vision Preview. <https://x.ai/news/grok-1.5v>, 2024.
326
+
327
+ {13}------------------------------------------------
328
+
329
+ - <span id="page-13-10"></span>Tian Xie, Zitian Gao, Qingnan Ren, Haoming Luo, Yuqian Hong, Bryan Dai, Joey Zhou, Kai Qiu, Zhirong Wu, and Chong Luo. Logic-rl: Unleashing llm reasoning with rule-based reinforcement learning. *arXiv preprint arXiv:2502.14768*, 2025a.
330
+ - <span id="page-13-11"></span>Yunfei Xie, Yinsong Ma, Shiyi Lan, Alan Yuille, Junfei Xiao, and Chen Wei. Play to generalize: Learning to reason through game play. *arXiv preprint arXiv:2506.08011*, 2025b.
331
+ - <span id="page-13-7"></span>Yi Yang, Xiaoxuan He, Hongkun Pan, Xiyan Jiang, Yan Deng, Xingtao Yang, Haoyu Lu, Dacheng Yin, Fengyun Rao, Minfeng Zhu, et al. R1-onevision: Advancing generalized multimodal reasoning through cross-modal formalization. *arXiv preprint arXiv:2503.10615*, 2025.
332
+ - <span id="page-13-8"></span>En Yu, Kangheng Lin, Liang Zhao, Jisheng Yin, Yana Wei, Yuang Peng, Haoran Wei, Jianjian Sun, Chunrui Han, Zheng Ge, et al. Perception-r1: Pioneering perception policy with reinforcement learning. *arXiv preprint arXiv:2504.07954*, 2025.
333
+ - <span id="page-13-14"></span>Xiang Yue, Yuansheng Ni, Kai Zhang, Tianyu Zheng, Ruoqi Liu, Ge Zhang, Samuel Stevens, Dongfu Jiang, Weiming Ren, Yuxuan Sun, et al. Mmmu: A massive multi-discipline multimodal understanding and reasoning benchmark for expert agi. In *Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition*, pp. 9556–9567, 2024.
334
+ - <span id="page-13-0"></span>Yu Zeng, Yukun Qi, Yiming Zhao, Xikun Bao, Lin Chen, Zehui Chen, Shiting Huang, Jie Zhao, and Feng Zhao. Enhancing large vision-language models with ultra-detailed image caption generation. In *Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing*, pp. 26703–26729, 2025.
335
+ - <span id="page-13-3"></span>Yu Zeng, Wenxuan Huang, Zhen Fang, Shuang Chen, Yufan Shen, Yishuo Cai, Xiaoman Wang, Zhenfei Yin, Lin Chen, Zehui Chen, et al. Vision-deepresearch benchmark: Rethinking visual and textual search for multimodal large language models. *arXiv preprint arXiv:2602.02185*, 2026.
336
+ - <span id="page-13-4"></span>Guohui Zhang, Jiangtong Tan, Linjiang Huang, Zhonghang Yuan, Mingde Yao, Jie Huang, and Feng Zhao. Infoscale: Unleashing training-free variable-scaled image generation via effective utilization of information. *arXiv preprint arXiv:2509.01421*, 2025a.
337
+ - <span id="page-13-6"></span>Guohui Zhang, Hu Yu, Xiaoxiao Ma, Yaning Pan, Hang Xu, and Feng Zhao. Maskfocus: Focusing policy optimization on critical steps for masked image generation. *arXiv preprint arXiv:2512.18766*, 2025b.
338
+ - <span id="page-13-5"></span>Guohui Zhang, Hu Yu, Xiaoxiao Ma, JingHao Zhang, Yaning Pan, Mingde Yao, Jie Xiao, Linjiang Huang, and Feng Zhao. Group critical-token policy optimization for autoregressive image generation. *arXiv preprint arXiv:2509.22485*, 2025c.
339
+ - <span id="page-13-13"></span>Yi-Fan Zhang, Huanyu Zhang, Haochen Tian, Chaoyou Fu, Shuangqing Zhang, Junfei Wu, Feng Li, Kun Wang, Qingsong Wen, Zhang Zhang, et al. Mme-realworld: Could your multimodal llm challenge high-resolution real-world scenarios that are difficult for humans? *arXiv preprint arXiv:2408.13257*, 2024.
340
+ - <span id="page-13-2"></span>Yiming Zhao, Yu Zeng, Yukun Qi, YaoYang Liu, Lin Chen, Zehui Chen, Xikun Bao, Jie Zhao, and Feng Zhao. V2p-bench: Evaluating video-language understanding with visual prompts for better human-model interaction. *arXiv preprint arXiv:2503.17736*, 2025.
341
+ - <span id="page-13-12"></span>Yaowei Zheng, Richong Zhang, Junhao Zhang, Yanhan Ye, Zheyan Luo, Zhangchi Feng, and Yongqiang Ma. Llamafactory: Unified efficient fine-tuning of 100+ language models. *arXiv preprint arXiv:2403.13372*, 2024.
342
+ - <span id="page-13-9"></span>Ziwei Zheng, Michael Yang, Jack Hong, Chenxiao Zhao, Guohai Xu, Le Yang, Chao Shen, and Xing Yu. Deepeyes: Incentivizing" thinking with images" via reinforcement learning. *arXiv preprint arXiv:2505.14362*, 2025.
343
+ - <span id="page-13-1"></span>Jinguo Zhu, Weiyun Wang, Zhe Chen, Zhaoyang Liu, Shenglong Ye, Lixin Gu, Hao Tian, Yuchen Duan, Weijie Su, Jie Shao, et al. Internvl3: Exploring advanced training and test-time recipes for open-source multimodal models. *arXiv preprint arXiv:2504.10479*, 2025.
344
+
345
+ {14}------------------------------------------------
346
+
347
+ # APPENDIX
348
+
349
+ # <span id="page-14-1"></span>A DATA DISTRIBUTION
350
+
351
+ <span id="page-14-2"></span>As shown in Figure [6,](#page-14-2) our RL training corpus for jigsaw is derived from multiple sources, covering a diverse range of visual scenarios:
352
+
353
+ ![](_page_14_Figure_4.jpeg)
354
+
355
+ Figure 6: Distribution of jigsaw RL training data.
356
+
357
+ - High-resolution and visual search images (39.7%, 6.2K samples): To enhance the model's fine-grained perception in high-resolution images, we collect data from the VStar [\(Wu & Xie, 2024\)](#page-12-12) dataset, high-resolution natural scenes in DeepEyes [\(Zheng et al., 2025\)](#page-13-9), and selected samples from HRBench [\(Wang et al., 2025c\)](#page-12-11). This improves the model's ability to capture subtle visual cues and recognize small object attributes.
358
+ - Text recognition and structured scenes (33.3%, 5.2K samples): To strengthen the model's capacity for text perception and recognition, we include text-rich images from diverse domains, such as the TextVQA [\(Singh et al., 2019\)](#page-12-15) training set, InfoVQA [\(Mathew et al., 2022\)](#page-11-13) book covers and posters, as well as structured visual reasoning tasks involving tables and subject-specific charts [\(Yue et al., 2024;](#page-13-14) [Li et al., 2024a;](#page-11-14) [Chen et al., 2024b\)](#page-10-14).
359
+ - Dense natural and real-world scenes (26.9%, 4.2K samples): To enhance the model's recognition and understanding in complex and real-world environments, we collected images from COCO2017 [\(Lin et al., 2014\)](#page-11-15) and RealWorldQA [\(xAI, 2024\)](#page-12-13) datasets.
360
+
361
+ # <span id="page-14-0"></span>B PROMPTS
362
+
363
+ In this section, we present the prompt used to collect high-quality jigsaw trajectories, as illustrated in Figure [B.](#page-14-0) The same prompt is employed to prompt the Qwen2.5-VL-7B model during both the SFT and RL stages.
364
+
365
+ ### Prompt for Interactive Collection of High-Quality Jigsaw Trajectories
366
+
367
+ # System Prompt:
368
+
369
+ You are a skilled and experienced puzzle master. I will divide an image evenly into 2 × 2 grid, get 4 image blocks, and then shuffle them. The image blocks will be labeled A, B, C, and D. Initially, the image blocks are named and arranged in the following order:
370
+
371
+ ["A", "B", "C", "D"]
372
+
373
+ That is, the initial layout of the image blocks is as follows:
374
+
375
+ A B
376
+
377
+ C D
378
+
379
+ # Your Task:
380
+
381
+ {15}------------------------------------------------
382
+
383
+ Your goal is to reconstruct the original image by observing and analyzing the visual content between the image blocks. Pay attention to the details in each image block and establish visual connections between adjacent image blocks to achieve the goal of completing the puzzle correctly. For example:
384
+
385
+ - Continuity of text information: If the image contains text or logos, observe whether the text continues naturally between adjacent blocks (e.g., characters connect smoothly and the font direction is consistent). This is one of the key clues to determine whether the image blocks should be adjacent.
386
+ - Structure and shape consistency: Identify possible structural elements in the image (such as buildings, roads, object outlines, etc.), and infer which image blocks should be visually spliced together to form a complete and reasonable shape.
387
+ - Continuation of edge visual details: Observe the color, texture or pattern (such as sky, grass, lines or shadows) at the edge of the image block to determine whether it can be visually connected to the adjacent block naturally.
388
+ - Direction and angle consistency: Pay attention to the direction of image elements (such as human faces, object directions, text angles, etc.) to ensure the rationality of the overall visual direction of the image.
389
+
390
+ You can swap any two image blocks each time to achieve the correct layout.
391
+
392
+ ### Inference Process:
393
+
394
+ 1. State Representation: At each step, you need to maintain a "state" list representing current arrangement of image blocks.
395
+
396
+ Example:
397
+
398
+ ```
399
+ state = ["B", "C", "A", "D"]
400
+ ```
401
+
402
+ This corresponds to: Top left (index 0): B Top right (index 1): C Bottom left (index 2): A Bottom right (index 3): D
403
+
404
+ - 2. Visual Analysis: Carefully analyze the image patch content and visual details to determine the image patch location. To better complete the puzzle task, you can use additional image operations to enhance visual perception:
405
+ - Crop the image area of observation image to more closely observe the visual correlation between different regions in multiple image patches. Used to find clues during the puzzle or verify whether the puzzle is complete (For example: it looks like the puzzle is not completely fixed, maybe because of the lower left and upper right corners of observation image 2. I need to crop these two areas separately to get some visual information to further judge. First I will crop the lower left area <code>...</code>By observing the cropped lower left area, it shows that part of the text "OF H" may be related to the "appyness" text in the upper right corner. To further verify and manage, I will now crop the upper right image <code>...</code>. By observing the cropped image, I will swap image blocks B and C...)
406
+ - Zoom area to enlarge visual details (selectively observe the details of the cropped image).
407
+
408
+ These operations can help you make more informed decisions.
409
+
410
+ {16}------------------------------------------------
411
+
412
+ 3. Move Execution: After making a decision, generate a Python code snippet to swap tiles. Use the 'observation(state)' function to get the updated layout image for the next step.
413
+
414
+ ### Available Image Operations:
415
+
416
+ You can use the following Python functions to assist in inference:
417
+
418
+ 1. Crop a region from an image using normalized coordinates (from 0 to 1).
419
+
420
+ ```
421
+ crop_box = [x1, y1, x2, y2]
422
+ crop_image_{id} = crop(image, crop_box)
423
+ ```
424
+
425
+ 2. Zoom in an image by a specified factor (e.g., 1.5× zoom means 150% zoom).
426
+
427
+ ```
428
+ zoom_image_{id} = zoom(image, zoom_factor)
429
+ ```
430
+
431
+ 3. Swap tiles (e.g., top left and bottom left) and call observation function to see the jigsaw progress.
432
+
433
+ ```
434
+ state[0], state[2] = state[2], state[0]
435
+ observation_image_{id} = observation(state)
436
+ ```
437
+
438
+ Replace "id" with an integer to uniquely identify each operation result. The "image" parameter must point to an existing image (e.g., "observation image 1", "crop image 1", etc.).
439
+
440
+ ### Format:
441
+
442
+ All Python code must be enclosed in <code>...</code>tags.
443
+
444
+ All reasoning steps must be enclosed in <think>...</think>tags.
445
+
446
+ The final answer must be enclosed in <answer>...</answer>tags.
447
+
448
+ ## Important:
449
+
450
+ - 1. For both swap and image manipulation, always explain why you are doing this before generating code.
451
+ - 2. Stop as soon as you generate a code snippet. I will execute the code and return the generated image for the next step.
452
+ - 3. You can only perform one image operation or observation of the puzzle state per turn.
453
+ - 4. Final answer: When you are sure that the puzzle is fully reconstructed (all edges are aligned and the visual information is complete and continuous), return the final "state" list in the "<answer>" block.
454
+ - 5. Please pay close attention to the rationality of your cropping area and ensure that the cropped area is a reasonable criterion for completing the puzzle.
455
+
456
+ # User Prompt:
457
+
458
+ The four images are respectively labeled A, B, C, and D. Please complete the jigsaw.
459
+
460
+ Image A: <image>Image B: <image>Image C: <image>Image D: <image>
461
+
462
+ {17}------------------------------------------------
463
+
464
+ # C CASE STUDY
465
+
466
+ In Figures [7](#page-17-0) - [10,](#page-20-1) we present representative high-quality jigsaw trajectories collected to illustrate how our model performs reasoning and interacts with the environment. These cases specifically demonstrate: (1) how the model generates Python code to interact with the environment, such as swapping any two jigsaw pieces, observing jigsaw progress, and cropping/zooming in on regions for finer visual inspection; and (2) how the environment provides feedback that guides the model's subsequent reasoning.
467
+
468
+ <span id="page-17-0"></span>![](_page_17_Figure_3.jpeg)
469
+
470
+ Figure 7: Representative high-quality jigsaw trajectory case 1 (part 1).
471
+
472
+ {18}------------------------------------------------
473
+
474
+ ![](_page_18_Figure_1.jpeg)
475
+
476
+ Figure 8: Representative high-quality jigsaw trajectory case 1 (part 2).
477
+
478
+ {19}------------------------------------------------
479
+
480
+ ![](_page_19_Figure_1.jpeg)
481
+
482
+ Figure 9: Representative high-quality jigsaw trajectory case 2 (part 1).
483
+
484
+ {20}------------------------------------------------
485
+
486
+ <span id="page-20-1"></span>![](_page_20_Figure_1.jpeg)
487
+
488
+ Figure 10: Representative high-quality jigsaw trajectory case 2 (part 2).
489
+
490
+ # <span id="page-20-0"></span>D THE IMPLEMENTATION OF TRAINING
491
+
492
+ The detailed training hyperparameters are provided in Tables [4](#page-21-0) and [5,](#page-21-0) and all experiments are conducted on 8 NVIDIA A100 GPUs, each equipped with 80 GB of memory.
493
+
494
+ {21}------------------------------------------------
495
+
496
+ <span id="page-21-0"></span>Table 4: Key hyperparameters for SFT.
497
+
498
+ | Name | Value |
499
+ |------------------------------|--------|
500
+ | Finetuning type | Full |
501
+ | Freeze vision tower | True |
502
+ | Freeze multi-modal projector | True |
503
+ | Freeze language model | False |
504
+ | Cutoff len | 16384 |
505
+ | Image max pixels | 401408 |
506
+ | Epochs | 2.0 |
507
+ | Batch size | 32 |
508
+ | Gradient accumulation steps | 4 |
509
+ | Learning rate | 1.0e-5 |
510
+ | LR scheduler type | cosine |
511
+ | Warmup ratio | 0.1 |
512
+
513
+ Table 5: Key hyperparameters for RL.
514
+
515
+ | Name | Value |
516
+ |----------------------------|--------|
517
+ | Max turns | 5 |
518
+ | Rollout num | 8 |
519
+ | Train batch size | 64 |
520
+ | Mini batch size | 64 |
521
+ | Micro batch size per GPU | 2 |
522
+ | Learning rate | 2.0e-6 |
523
+ | KL loss coefficient | 0.0 |
524
+ | Total epochs | 1 |
525
+ | Max prompt length | 8192 |
526
+ | Single response max tokens | 2048 |
527
+ | Max response length | 20000 |
528
+ | GPU memory utilization | 0.7 |
529
+
530
+ # E ANALYSIS OF WANDB CURVES IN JIGSAW OPTIMIZATION
531
+
532
+ In this section, we present the training curves of our RL process and provide an analysis of the training dynamics. We monitor the evolution of rewards (including accuracy and format rewards), response length, number of interaction turns, and validation accuracy.
533
+
534
+ ![](_page_21_Figure_7.jpeg)
535
+
536
+ Figure 11: Visualization of Wandb curves in jigsaw RL optimization.
537
+
538
+ At the beginning of training, both validation accuracy and reward values are low, indicating that the model has very limited jigsaw-solving ability in the early stage. As training progresses, the number of interaction turns increases briefly, suggesting that the model explores more interactions (e.g., swapping tiles, cropping for observation) in order to achieve higher accuracy. With continued training, the reward values steadily increase, reflecting a stable improvement in jigsaw-solving capability through RL. After sufficient training, the model gradually reduces both the number of turns and response length, demonstrating enhanced perceptual and reasoning ability, such that it can solve jigsaw correctly with fewer interactions.
539
+
540
+ {22}------------------------------------------------
541
+
542
+ # F LIMITATIONS
543
+
544
+ Despite our best efforts, this work has several limitations. Multi-turn jigsaw interactions inevitably increase context length and introduce significant computational overhead. In the 3 × 3 setting, the context often exceeds the model's maximum window size, restricting our RL training to the 2 × 2 case. Future work could investigate more efficient interaction mechanisms with external environments or integrate memory modules to mitigate context length constraints, thereby enabling RL training on larger and more complex jigsaw tasks.
545
+
546
+ # G QUALITATIVE ANALYSIS ON ATTENTION PATTERNS
547
+
548
+ To further verify that AGILE brings genuine improvements in perceptual and reasoning abilities rather than merely increasing benchmark scores, we conduct additional qualitative analyses on general downstream tasks. Specifically, we visualize the attention distributions of Qwen2.5-VL-7B before and after AGILE training. As shown in attention examples (Figure [12\)](#page-23-0), the original model often exhibits scattered and unstable attention allocation, focusing on large irrelevant regions when processing complex high-resolution scenes or fine-grained recognition tasks. This dispersed attention leads to unreliable reasoning and misinterpretation of critical visual evidence. In contrast, the AGILE-trained model shows significantly more concentrated attention on key visual elements, such as small objects, text regions, and structurally important areas. This improved focus enhances the model's ability to extract fine-grained cues and supports more reliable multimodal reasoning. These qualitative findings align with our quantitative gains across HRBench, VStarBench, and Real-WorldQA, suggesting that AGILE enhances fundamental perceptual mechanisms underlying general visual understanding.
549
+
550
+ # H WHICH TASKS CAN BENEFIT MORE FROM AGILE?
551
+
552
+ Beyond overall benchmark gains, we analyze the types of perceptual and reasoning skills most enhanced by AGILE:
553
+
554
+ - Fine-grained recognition. These tasks require high precision in identifying subtle visual cues, such as detecting small objects, recognizing text, or distinguishing fine-grained visual differences. AGILE enhances the model's ability to focus on the most critical visual elements, improving its sensitivity to subtle but important features and thereby boosting fine-grained recognition performance.
555
+ - Spatial relation reasoning. Benchmarks such as VStarBench contain a substantial number of questions involving spatial positional reasoning. AGILE's interaction-driven training helps the model better attend to spatial layouts and contextual relationships within a scene, substantially improving its ability to understand and reason about complex spatial arrangements. This capability transfers effectively to real-world spatial reasoning tasks.
556
+ - Visual–textual integration. AGILE also leads to notable improvements in tasks requiring the integration of visual and textual information. Tasks involving reading product details, interpreting signs, or extracting structured information from charts benefit from AGILE's strengthened ability to jointly process textual cues grounded in visual context.
557
+
558
+ # I HANDLING INVALID CODE EXECUTIONS
559
+
560
+ During reinforcement learning, the model may generate malformed or invalid code. Instead of discarding such rollouts, the environment executes the code and returns explicit error messages to the model. These erroneous interactions increase the total number of steps required to reach the correct solution and thus naturally lead to lower step rewards under our reward formulation (Eq. [5](#page-5-2) and Eq. [6\)](#page-5-0). As a result, invalid code is implicitly penalized, encouraging the model to generate valid actions and interact more efficiently. This design stabilizes training without requiring complex filtering mechanisms.
561
+
562
+ {23}------------------------------------------------
563
+
564
+ <span id="page-23-0"></span>![](_page_23_Figure_1.jpeg)
565
+
566
+ Figure 12: Comparison of Attention Maps Before and After AGILE Training. Warm colors indicate higher attention; cool colors indicate lower attention.
567
+
568
+ # J ADDITIONAL EXPERIMENTS
569
+
570
+ ### J.1 SENSITIVITY TO REWARD COEFFICIENTS.
571
+
572
+ We further investigate the sensitivity of AGILE to the reward-weighting coefficients (α, β, and γ). As shown in Table [6,](#page-24-0) varying the values of α and β yields only minor fluctuations in performance, indicating that AGILE is robust to these parameters. In contrast, removing the step reward (γ) produces notable performance degradation, especially on VStarBench and MMVP. This finding ver
573
+
574
+ {24}------------------------------------------------
575
+
576
+ ifies that the step-penalty plays a critical role in encouraging efficient and meaningful interactions, preventing long, unfocused rollouts during RL.
577
+
578
+ <span id="page-24-0"></span>Table 6: **Ablation on Reward Coefficients.** Sensitivity analysis of the weighting coefficients $\alpha$ , $\beta$ , and $\gamma$ in the total reward.
579
+
580
+ | Model | MME-RW | RWQA | HRB4K | HRB8K | VStar | MMVP | BLINK | HalBench | MMMU | Avg. |
581
+ |---------------------------------------------|--------|------|-------|-------|-------|------|-------|----------|------|------|
582
+ | Qwen2.5-VL-7B | 44.6 | 68.5 | 68.8 | 65.3 | 76.4 | 74.3 | 56.4 | 50.1 | 54.8 | 62.1 |
583
+ | $\alpha = 0.8, \beta = 0.2, \gamma = 1.0$ | 48.4 | 70.2 | 73.0 | 70.5 | 80.6 | 78.0 | 58.0 | 51.9 | 55.8 | 65.2 |
584
+ | $\alpha = 0.8, \beta = 0.2, \gamma = 0.5$ | 49.2 | 69.7 | 72.8 | 69.8 | 78.5 | 79.0 | 57.5 | 50.8 | 55.8 | 64.8 |
585
+ | $\alpha = 0.8, \beta = 0.2, \gamma = 0.0$ | 47.4 | 71.1 | 72.4 | 69.8 | 78.5 | 75.3 | 56.7 | 52.8 | 55.6 | 64.4 |
586
+ | $\alpha = 0.9, \beta = 0.1, \gamma = 1.0$ | 48.9 | 70.8 | 73.3 | 69.6 | 79.1 | 78.0 | 57.5 | 51.4 | 55.1 | 64.9 |
587
+
588
+ ### J.2 RESULTS OF LARGER JIGSAW GRID SIZES AND CURRICULUM RL TRAINING
589
+
590
+ To further assess the scalability of AGILE beyond the $2\times 2$ jigsaw setting, we conduct an additional reinforcement learning stage on $8K\ 3\times 3$ jigsaw puzzles. This stage is applied after the initial $15.6K\ 2\times 2$ RL training, forming curriculum-style optimization principle. As shown in Table 7, training on $3\times 3$ jigsaw puzzles leads to further improvements across all 9 benchmarks. These results demonstrate that AGILE naturally generalizes to larger and more challenging jigsaw configurations when model capability allows, and further highlight that curriculum reinforcement learning on increasingly difficult grid sizes provides an effective path for continued scaling.
591
+
592
+ Table 7: Results of $3 \times 3$ Jigsaw RL Training.
593
+
594
+ <span id="page-24-1"></span>
595
+
596
+ | Model | MME-RW | RWQA | HRB4K | HRB8K | VStar | MMVP | BLINK | HalBench | MMMU | Avg. |
597
+ |-----------------------------------------------|--------|------|-------|-------|-------|------|-------|----------|------|------|
598
+ | Qwen2.5-VL-7B | 44.6 | 68.5 | 68.8 | 65.3 | 76.4 | 74.3 | 56.4 | 50.1 | 54.8 | 62.1 |
599
+ | + 15.6K 2×2 RL | 48.4 | 70.2 | 73.0 | 70.5 | 80.6 | 78.0 | 58.0 | 51.9 | 55.8 | 65.2 |
600
+ | + $15.6$ K $2 \times 2 + 8$ K $3 \times 3$ RL | 50.4 | 70.6 | 73.4 | 70.5 | 80.1 | 79.0 | 58.1 | 52.1 | 55.8 | 65.6 |
601
+
602
+ ### J.3 EXPERT TRAJECTORIES ABLATIONS
603
+
604
+ To disentangle the effect of expert cold-start trajectories and verify that AGILE's improvements are not merely due to distillation, we conducted additional experiments without any expert trajectories. Specifically, we performed RL directly on the 15.6K $2 \times 2$ jigsaw dataset under two conditions: (1) the full action space, and (2) an ablated action space with Crop/Zoom removed. The results show that even in the absence of expert supervision, AGILE still delivers a +1.8% improvement over the Qwen2.5-VL-7B baseline, demonstrating that the performance gain arises from agentic visual interaction combined with verifiable RL, rather than imitation of Gemini 2.5 Pro trajectories.
605
+
606
+ Table 8: Performance of RL without Gemini 2.5 Pro expert trajectories and with ablated action spaces.
607
+
608
+ | Model | MME-RW | RWQA | HRB4K | HRB8K | VStar | MMVP | BLINK | HalBench | MMMU | Avg. |
609
+ |-----------------------------|--------|------|-------|-------|-------|------|-------|----------|------|------|
610
+ | Qwen2.5-VL-7B | 44.6 | 68.5 | 68.8 | 65.3 | 76.4 | 74.3 | 56.4 | 50.1 | 54.8 | 62.1 |
611
+ | Cold-Start | 46.2 | 68.4 | 71.0 | 68.4 | 77.5 | 76.7 | 55.7 | 49.8 | 54.0 | 63.1 |
612
+ | Cold-Start + RL | 48.4 | 70.2 | 73.0 | 70.5 | 80.6 | 78.0 | 58.0 | 51.9 | 55.8 | 65.2 |
613
+ | Only RL (Full action space) | 46.3 | 69.5 | 71.5 | 68.1 | 78.5 | 79.0 | 56.3 | 53.2 | 53.1 | 63.9 |
614
+ | Only RL (No Crop/Zoom) | 46.2 | 69.3 | 71.9 | 68.0 | 78.0 | 78.3 | 53.7 | 52.8 | 53.3 | 63.5 |
615
+
616
+ Furthermore, removing the Crop/Zoom operations leads to a clear decline in performance, underscoring the importance of AGILE's interaction design in enabling effective fine-grained perceptual reasoning.
617
+
618
+ # J.4 GENERAL QA DATASET DETAILS AND EXTENDED COMPARISON WITH JIGSAW TRAINING
619
+
620
+ We provide additional clarification regarding the composition of the general QA dataset. Our 20K QA corpus is constructed entirely from high-resolution, real-world visual scenes, consisting of 15K samples from DeepEyes (Zheng et al., 2025) and 5K samples from MMEureka (Meng et al., 2025).
621
+
622
+ {25}------------------------------------------------
623
+
624
+ <span id="page-25-0"></span>Table 9: Comparison between General QA and Jigsaw-based RL under equal training budgets (20K).
625
+
626
+ | Model | MME-RW | RWQA | HRB4K | HRB8K | VStar | MMVP | BLINK | HalBench | MMMU | Avg. |
627
+ |-----------------------------|--------|------|-------|-------|-------|------|-------|----------|------|------|
628
+ | Qwen2.5-VL-7B | 44.6 | 68.5 | 68.8 | 65.3 | 76.4 | 74.3 | 56.4 | 50.1 | 54.8 | 62.1 |
629
+ | 20K General QA | 50.5 | 68.9 | 72.4 | 69.5 | 82.7 | 78.3 | 54.8 | 51.3 | 54.2 | 64.7 |
630
+ | 10K General QA + 10K Jigsaw | 51.6 | 69.8 | 73.0 | 70.6 | 81.7 | 79.0 | 57.3 | 51.2 | 55.7 | 65.5 |
631
+ | 20K Jigsaw-only | 48.5 | 70.5 | 73.6 | 70.5 | 80.1 | 77.3 | 57.7 | 52.1 | 53.8 | 64.9 |
632
+
633
+ These datasets span diverse perceptual and reasoning categories, including fine-grained attributes, spatial relationships, counting, and commonsense scene understanding.
634
+
635
+ Accordingly, the comparison between jigsaw training and QA training is inherently fair: both training regimes operate on high-resolution, real-world, and complex perceptual inputs. To further strengthen this comparison, we additionally include the 20K pure jigsaw setting. As shown in Table 9, jigsaw-based RL consistently outperforms high-resolution QA-based RL under the same training budget, demonstrating that AGILE's performance gains do not stem from differences in input resolution, but instead from the structured, verifiable, and spatially grounded training signal introduced by the jigsaw task.
636
+
637
+ ### J.5 IMPACT OF SCALING THE COLD-START (SFT) DATASET
638
+
639
+ To understand whether training longer or scaling up the supervised cold-start phase affects performance, we expand the cold-start dataset to $1.5 \times$ and $2 \times$ its original size and repeated all experiments. As shown in Table 10, enlarging the SFT dataset leads to only marginal differences, with no signs of overfitting or meaningful performance degradation.
640
+
641
+ <span id="page-25-1"></span>Table 10: **Effect of scaling the cold-start (SFT) dataset size.** Increasing SFT data provides only marginal differences, indicating that most performance gains come from the RL stage.
642
+
643
+ | Model | MME-RW | RWQA | HRB4K | HRB8K | VStar | MMVP | BLINK | HalBench | MMMU | Avg. |
644
+ |-------------------|--------|------|-------|-------|-------|------|-------|----------|------|------|
645
+ | Qwen2.5-VL-7B | 44.6 | 68.5 | 68.8 | 65.3 | 76.4 | 74.3 | 56.4 | 50.1 | 54.8 | 62.1 |
646
+ | Cold-start (1.6K) | 46.2 | 68.4 | 71.0 | 68.4 | 77.5 | 76.7 | 55.7 | 49.8 | 54.0 | 63.1 |
647
+ | +RL | 48.4 | 70.2 | 73.0 | 70.5 | 80.6 | 78.0 | 58.0 | 51.9 | 55.8 | 65.2 |
648
+ | Cold-start (2.4K) | 46.2 | 68.9 | 71.4 | 68.8 | 77.0 | 76.0 | 57.8 | 50.2 | 54.0 | 63.4 |
649
+ | +RL | 48.4 | 69.8 | 73.0 | 69.9 | 78.5 | 79.0 | 57.7 | 50.5 | 56.3 | 64.8 |
650
+ | Cold-start (3.2K) | 46.5 | 67.8 | 71.4 | 68.8 | 77.0 | 76.7 | 58.1 | 49.2 | 53.3 | 63.2 |
651
+ | +RL | 47.1 | 70.1 | 73.0 | 70.5 | 79.6 | 78.3 | 57.2 | 50.5 | 55.7 | 64.7 |
652
+
653
+ In practice, the cold-start stage serves a very specific purpose: teaching the model the tool-use pattern (i.e., how to invoke the predefined Python APIs). Its goal is not to solve the jigsaw task fully. Consequently, the model's performance is largely unaffected by moderate expansions of the SFT set. The primary source of generalization and performance improvement comes from the interactive RL stage, where the model learns to solve jigsaw puzzles through real environment feedback rather than through imitation.
654
+
655
+ ### K USE OF LLMS
656
+
657
+ Yes. We use LLMs solely to assist in language polishing and improving readability. All technical content, experiments, and analyses are conducted by the authors.
iclr26/3kouij8BWi/parse_report.json ADDED
@@ -0,0 +1,77 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {
2
+ "paper_id": "3kouij8BWi",
3
+ "pipeline": "marker_non_llm_v3",
4
+ "parser": "marker_single",
5
+ "formats": [
6
+ "markdown",
7
+ "chunks"
8
+ ],
9
+ "llm_enabled": false,
10
+ "pdf_path": "/network/scratch/j/jianan.zhao/ReviewAgent/data/processed_papers/iclr26_20260429_1952_all/raw/3kouij8BWi.pdf",
11
+ "pdf_sha256": "9b69b133d5de48b6322b25d006b737bdea1b997872e8616199f343fd68192a4d",
12
+ "bytes": 15328953,
13
+ "source": "https://openreview.net/pdf?id=3kouij8BWi",
14
+ "page_count": 26,
15
+ "ok": true,
16
+ "elapsed_seconds": 218.88,
17
+ "paper2markdown_v3": {
18
+ "paper_id": "3kouij8BWi",
19
+ "pipeline": "Paper2Markdown-V3",
20
+ "ok": true,
21
+ "page_count": 26,
22
+ "chunk_count": 128,
23
+ "main_body_chunk_count": 58,
24
+ "appendix_chunk_count": 66,
25
+ "reference_chunk_count": 4,
26
+ "model_text_chars": 35860,
27
+ "raw_markdown_chars": 83077,
28
+ "sanitized_chars": 77257,
29
+ "page_provenance": {
30
+ "min_page": 1,
31
+ "max_page": 26,
32
+ "invalid_count": 0
33
+ },
34
+ "marker_block_type_counts": {
35
+ "Code": 6,
36
+ "Equation": 7,
37
+ "FigureGroup": 11,
38
+ "Footnote": 7,
39
+ "ListGroup": 12,
40
+ "PageFooter": 26,
41
+ "PageHeader": 26,
42
+ "Picture": 2,
43
+ "PictureGroup": 1,
44
+ "SectionHeader": 42,
45
+ "Table": 1,
46
+ "TableGroup": 9,
47
+ "Text": 83
48
+ },
49
+ "asset_count_raw": 14,
50
+ "asset_count_model_kept": 14,
51
+ "asset_count_rejected": 0,
52
+ "asset_reject_reasons": {
53
+ "kept": 14
54
+ },
55
+ "artifact_leak_audit": {
56
+ "ok": true,
57
+ "hits": {
58
+ "Anonymous Authors": [],
59
+ "ACKNOWLEDGMENT": [],
60
+ "OpenReview": [],
61
+ "\"accept_label\"": [],
62
+ "\"decision\"": [],
63
+ "\"decision_tier\"": [],
64
+ "\"source_status\"": [],
65
+ "Meta-review": [],
66
+ "Official Review": [],
67
+ "official_reviews": [],
68
+ "meta_reviews": [],
69
+ "suggested_verdict_score": []
70
+ },
71
+ "artifact_count": 2
72
+ },
73
+ "default_model_input": "model_text_v3.txt",
74
+ "appendix_input": "appendix_text_v3.txt",
75
+ "reference_input": "reference_text_v3.txt"
76
+ }
77
+ }
iclr26/3kouij8BWi/reference_chunks.jsonl ADDED
@@ -0,0 +1,4 @@
 
 
 
 
 
1
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0058", "section": "REFERENCES", "page_start": 11, "page_end": 11, "type": "ListGroup", "text": "Shuai Bai, Keqin Chen, Xuejing Liu, Jialin Wang, Wenbin Ge, Sibo Song, Kai Dang, Peng Wang, Shijie Wang, Jun Tang, et al. Qwen2. 5-vl technical report. arXiv preprint arXiv:2502.13923 , 2025. Fabio M Carlucci, Antonio D'Innocente, Silvia Bucci, Barbara Caputo, and Tatiana Tommasi. Domain generalization by solving jigsaw puzzles. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pp. 2229–2238, 2019. Jiangjie Chen, Qianyu He, Siyu Yuan, Aili Chen, Zhicheng Cai, Weinan Dai, Hongli Yu, Qiying Yu, Xuefeng Li, Jiaze Chen, et al. Enigmata: Scaling logical reasoning in large language models with synthetic verifiable puzzles. arXiv preprint arXiv:2505.19914 , 2025a. Liang Chen, Lei Li, Haozhe Zhao, Yifan Song, and Vinci. R1-v: Reinforcing super generalization ability in vision-language models with less than $3. R1-V , 2025b. Accessed: 2025-02-02. Lin Chen, Jinsong Li, Xiaoyi Dong, Pan Zhang, Conghui He, Jiaqi Wang, Feng Zhao, and Dahua Lin. Sharegpt4v: Improving large multi-modal models with better captions. In European Confer ence on Computer Vision , pp. 370–387. Springer, 2024a. Lin Chen, Jinsong Li, Xiaoyi Dong, Pan Zhang, Yuhang Zang, Zehui Chen, Haodong Duan, Jiaqi Wang, Yu Qiao, Dahua Lin, et al. Are we on the right way for evaluating large vision-language models? Advances in Neural Information Processing Systems , 37:27056–27087, 2024b. Lin Chen, Xilin Wei, Jinsong Li, Xiaoyi Dong, Pan Zhang, Yuhang Zang, Zehui Chen, Haodong Duan, Zhenyu Tang, Li Yuan, et al. Sharegpt4video: Improving video understanding and generation with better captions. Advances in Neural Information Processing Systems , 37:19472–19495, 2024c. Yingyi Chen, Xi Shen, Yahui Liu, Qinghua Tao, and Johan AK Suykens. Jigsaw-vit: Learning jigsaw puzzles in vision transformer. Pattern Recognition Letters , 166:53–60, 2023. Gheorghe Comanici, Eric Bieber, Mike Schaekermann, Ice Pasupat, Noveen Sachdeva, Inderjit Dhillon, Marcel Blistein, Ori Ram, Dan Zhang, Evan Rosen, et al. Gemini 2.5: Pushing the frontier with advanced reasoning, multimodality, long context, and next generation agentic capabilities. arXiv preprint arXiv:2507.06261 , 2025. Qingxiu Dong, Li Dong, Yao Tang, Tianzhu Ye, Yutao Sun, Zhifang Sui, and Furu Wei. Reinforcement pre-training. arXiv preprint arXiv:2506.08007 , 2025. Haodong Duan, Junming Yang, Yuxuan Qiao, Xinyu Fang, Lin Chen, Yuan Liu, Xiaoyi Dong, Yuhang Zang, Pan Zhang, Jiaqi Wang, et al. Vlmevalkit: An open-source toolkit for evaluating large multi-modality models. In Proceedings of the 32nd ACM International Conference on Multimedia , pp. 11198–11201, 2024. Zhen Fang, Zhuoyang Liu, Jiaming Liu, Hao Chen, Yu Zeng, Shiting Huang, Zehui Chen, Lin Chen, Shanghang Zhang, and Feng Zhao. Dualvla: Building a generalizable embodied agent via partial decoupling of reasoning and action. arXiv preprint arXiv:2511.22134 , 2025. Xingyu Fu, Yushi Hu, Bangzheng Li, Yu Feng, Haoyu Wang, Xudong Lin, Dan Roth, Noah A Smith, Wei-Chiu Ma, and Ranjay Krishna. Blink: Multimodal large language models can see but not perceive. In European Conference on Computer Vision , pp. 148–166. Springer, 2024. Tianrui Guan, Fuxiao Liu, Xiyang Wu, Ruiqi Xian, Zongxia Li, Xiaoyu Liu, Xijun Wang, Lichang Chen, Furong Huang, Yaser Yacoob, et al. Hallusionbench: an advanced diagnostic suite for entangled language hallucination and visual illusion in large vision-language models. In Pro ceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pp. 14375– 14385, 2024. Daya Guo, Dejian Yang, Haowei Zhang, Junxiao Song, Ruoyu Zhang, Runxin Xu, Qihao Zhu, Shirong Ma, Peiyi Wang, Xiao Bi, et al. Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning. arXiv preprint arXiv:2501.12948 , 2025.", "source": "marker_v2", "marker_block_id": "/page/10/ListGroup/209"}
2
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0059", "section": "REFERENCES", "page_start": 12, "page_end": 12, "type": "ListGroup", "text": "Ruiyan Han, Zhen Fang, XinYu Sun, Yuchen Ma, Ziheng Wang, Yu Zeng, Zehui Chen, Lin Chen, Wenxuan Huang, Wei-Jie Xu, et al. Unicorn: Towards self-improving unified multimodal models through self-generated supervision. arXiv preprint arXiv:2601.03193 , 2026. Shiting Huang, Zhen Fang, Zehui Chen, Siyu Yuan, Junjie Ye, Yu Zeng, Lin Chen, Qi Mao, and Feng Zhao. Critictool: Evaluating self-critique capabilities of large language models in toolcalling error scenarios. arXiv preprint arXiv:2506.13977 , 2025a. Shiting Huang, Zecheng Li, Yu Zeng, Qingnan Ren, Zhen Fang, Qisheng Su, Kou Shi, Lin Chen, Zehui Chen, and Feng Zhao. Internalizing meta-experience into memory for guided reinforcement learning in large language models. arXiv preprint arXiv:2602.10224 , 2026a. Wenxuan Huang, Shuang Chen, Zheyong Xie, Shaosheng Cao, Shixiang Tang, Yufan Shen, Qingyu Yin, Wenbo Hu, Xiaoman Wang, Yuntian Tang, et al. Interleaving reasoning for better text-toimage generation. arXiv preprint arXiv:2509.06945 , 2025b. Wenxuan Huang, Bohan Jia, Zijie Zhai, Shaosheng Cao, Zheyu Ye, Fei Zhao, Zhe Xu, Yao Hu, and Shaohui Lin. Vision-r1: Incentivizing reasoning capability in multimodal large language models. arXiv preprint arXiv:2503.06749 , 2025c. Wenxuan Huang, Yu Zeng, Qiuchen Wang, Zhen Fang, Shaosheng Cao, Zheng Chu, Qingyu Yin, Shuang Chen, Zhenfei Yin, Lin Chen, et al. Vision-deepresearch: Incentivizing deepresearch capability in multimodal large language models. arXiv preprint arXiv:2601.22060 , 2026b. Aaron Hurst, Adam Lerer, Adam P Goucher, Adam Perelman, Aditya Ramesh, Aidan Clark, AJ Ostrow, Akila Welihinda, Alan Hayes, Alec Radford, et al. Gpt-4o system card. arXiv preprint arXiv:2410.21276 , 2024. Bohao Li, Yuying Ge, Yi Chen, Yixiao Ge, Ruimao Zhang, and Ying Shan. Seed-bench-2-plus: Benchmarking multimodal large language models with text-rich visual comprehension. arXiv preprint arXiv:2404.16790 , 2024a. Xiaotong Li, Fan Zhang, Haiwen Diao, Yueze Wang, Xinlong Wang, and Lingyu Duan. Densefusion-1m: Merging vision experts for comprehensive multimodal perception. Advances in Neural Information Processing Systems , 37:18535–18556, 2024b. Tsung-Yi Lin, Michael Maire, Serge Belongie, James Hays, Pietro Perona, Deva Ramanan, Piotr Dollar, and C Lawrence Zitnick. Microsoft coco: Common objects in context. In ´ European Conference on Computer Vision , pp. 740–755. Springer, 2014. Pan Lu, Hritik Bansal, Tony Xia, Jiacheng Liu, Chunyuan Li, Hannaneh Hajishirzi, Hao Cheng, Kai-Wei Chang, Michel Galley, and Jianfeng Gao. Mathvista: Evaluating mathematical reasoning of foundation models in visual contexts. arXiv preprint arXiv:2310.02255 , 2023. Xiaoxiao Ma, Haibo Qiu, Guohui Zhang, Zhixiong Zeng, Siqi Yang, Lin Ma, and Feng Zhao. Stage: Stable and generalizable grpo for autoregressive image generation. arXiv preprint arXiv:2509.25027 , 2025. Minesh Mathew, Viraj Bagal, Ruben Tito, Dimosthenis Karatzas, Ernest Valveny, and CV Jawahar. ` Infographicvqa. In Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision , pp. 1697–1706, 2022. Fanqing Meng, Lingxiao Du, Zongkai Liu, Zhixiang Zhou, Quanfeng Lu, Daocheng Fu, Botian Shi, Wenhai Wang, Junjun He, Kaipeng Zhang, et al. Mm-eureka: Exploring visual aha moment with rule-based large-scale reinforcement learning. CoRR , 2025. Yaning Pan, Qianqian Xie, Guohui Zhang, Zekun Wang, Yongqian Wen, Yuanxing Zhang, Haoxuan Hu, Zhiyu Pan, Yibing Huang, Zhidong Gan, et al. Mt-video-bench: A holistic video understanding benchmark for evaluating multimodal llms in multi-turn dialogues. arXiv preprint arXiv:2510.17722 , 2025. Yukun Qi, Yiming Zhao, Yu Zeng, Xikun Bao, Wenxuan Huang, Lin Chen, Zehui Chen, Jie Zhao, Zhongang Qi, and Feng Zhao. Vcr-bench: A comprehensive evaluation framework for video chain-of-thought reasoning. arXiv preprint arXiv:2504.07956 , 2025.", "source": "marker_v2", "marker_block_id": "/page/11/ListGroup/214"}
3
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0060", "section": "REFERENCES", "page_start": 13, "page_end": 13, "type": "ListGroup", "text": "Rafael Rafailov, Archit Sharma, Eric Mitchell, Christopher D Manning, Stefano Ermon, and Chelsea Finn. Direct preference optimization: Your language model is secretly a reward model. Advances in Neural Information Processing Systems , 36:53728–53741, 2023. Qingnan Ren, Shiting Huang, Zhen Fang, Zehui Chen, Lin Chen, Lijun Li, and Feng Zhao. Adora: Training reasoning models with dynamic advantage estimation on reinforcement learning. arXiv preprint arXiv:2602.10019 , 2026. John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347 , 2017. Zhihong Shao, Peiyi Wang, Qihao Zhu, Runxin Xu, Junxiao Song, Xiao Bi, Haowei Zhang, Mingchuan Zhang, YK Li, Yang Wu, et al. Deepseekmath: Pushing the limits of mathematical reasoning in open language models. arXiv preprint arXiv:2402.03300 , 2024. Guangming Sheng, Chi Zhang, Zilingfeng Ye, Xibin Wu, Wang Zhang, Ru Zhang, Yanghua Peng, Haibin Lin, and Chuan Wu. Hybridflow: A flexible and efficient rlhf framework. arXiv preprint arXiv: 2409.19256 , 2024. Amanpreet Singh, Vivek Natarajan, Meet Shah, Yu Jiang, Xinlei Chen, Dhruv Batra, Devi Parikh, and Marcus Rohrbach. Towards vqa models that can read. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pp. 8317–8326, 2019. Jingqi Tong, Jixin Tang, Hangcheng Li, Yurong Mou, Ming Zhang, Jun Zhao, Yanbo Wen, Fan Song, Jiahao Zhan, Yuyang Lu, et al. Code2logic: Game-code-driven data synthesis for enhancing vlms general reasoning. arXiv preprint arXiv:2505.13886 , 2025. Shengbang Tong, Zhuang Liu, Yuexiang Zhai, Yi Ma, Yann LeCun, and Saining Xie. Eyes wide shut? exploring the visual shortcomings of multimodal llms. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pp. 9568–9578, 2024. Qiuchen Wang, Ruixue Ding, Zehui Chen, Weiqi Wu, Shihang Wang, Pengjun Xie, and Feng Zhao. Vidorag: Visual document retrieval-augmented generation via dynamic iterative reasoning agents. arXiv preprint arXiv:2502.18017 , 2025a. Qiuchen Wang, Ruixue Ding, Yu Zeng, Zehui Chen, Lin Chen, Shihang Wang, Pengjun Xie, Fei Huang, and Feng Zhao. Vrag-rl: Empower vision-perception-based rag for visually rich information understanding via iterative reasoning with reinforcement learning. arXiv preprint arXiv:2505.22019 , 2025b. Qiuchen Wang, Shihang Wang, Yu Zeng, Qiang Zhang, Fanrui Zhang, Zhuoning Guo, Bosi Zhang, Wenxuan Huang, Lin Chen, Zehui Chen, et al. Vimrag: Navigating massive visual context in retrieval-augmented generation via multimodal memory graph. arXiv preprint arXiv:2602.12735 , 2026. Wenbin Wang, Liang Ding, Minyan Zeng, Xiabin Zhou, Li Shen, Yong Luo, Wei Yu, and Dacheng Tao. Divide, conquer and combine: A training-free framework for high-resolution image perception in multimodal large language models. In Proceedings of the AAAI Conference on Artificial Intelligence , volume 39, pp. 7907–7915, 2025c. Xiyao Wang, Zhengyuan Yang, Chao Feng, Yongyuan Liang, Yuhang Zhou, Xiaoyu Liu, Ziyi Zang, Ming Li, Chung-Ching Lin, Kevin Lin, et al. Vicrit: A verifiable reinforcement learning proxy task for visual perception in vlms. arXiv preprint arXiv:2506.10128 , 2025d. Zifu Wang, Junyi Zhu, Bo Tang, Zhiyu Li, Feiyu Xiong, Jiaqian Yu, and Matthew B Blaschko. Jigsaw-r1: A study of rule-based visual reinforcement learning with jigsaw puzzles. arXiv preprint arXiv:2505.23590 , 2025e. Penghao Wu and Saining Xie. V?: Guided visual search as a core mechanism in multimodal llms. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pp. 13084–13094, 2024. xAI. Grok-1.5 Vision Preview. , 2024.", "source": "marker_v2", "marker_block_id": "/page/12/ListGroup/210"}
4
+ {"paper_id": "3kouij8BWi", "chunk_id": "3kouij8BWi:0061", "section": "REFERENCES", "page_start": 14, "page_end": 14, "type": "ListGroup", "text": "Tian Xie, Zitian Gao, Qingnan Ren, Haoming Luo, Yuqian Hong, Bryan Dai, Joey Zhou, Kai Qiu, Zhirong Wu, and Chong Luo. Logic-rl: Unleashing llm reasoning with rule-based reinforcement learning. arXiv preprint arXiv:2502.14768 , 2025a. Yunfei Xie, Yinsong Ma, Shiyi Lan, Alan Yuille, Junfei Xiao, and Chen Wei. Play to generalize: Learning to reason through game play. arXiv preprint arXiv:2506.08011 , 2025b. Yi Yang, Xiaoxuan He, Hongkun Pan, Xiyan Jiang, Yan Deng, Xingtao Yang, Haoyu Lu, Dacheng Yin, Fengyun Rao, Minfeng Zhu, et al. R1-onevision: Advancing generalized multimodal reasoning through cross-modal formalization. arXiv preprint arXiv:2503.10615 , 2025. En Yu, Kangheng Lin, Liang Zhao, Jisheng Yin, Yana Wei, Yuang Peng, Haoran Wei, Jianjian Sun, Chunrui Han, Zheng Ge, et al. Perception-r1: Pioneering perception policy with reinforcement learning. arXiv preprint arXiv:2504.07954 , 2025. Xiang Yue, Yuansheng Ni, Kai Zhang, Tianyu Zheng, Ruoqi Liu, Ge Zhang, Samuel Stevens, Dongfu Jiang, Weiming Ren, Yuxuan Sun, et al. Mmmu: A massive multi-discipline multimodal understanding and reasoning benchmark for expert agi. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pp. 9556–9567, 2024. Yu Zeng, Yukun Qi, Yiming Zhao, Xikun Bao, Lin Chen, Zehui Chen, Shiting Huang, Jie Zhao, and Feng Zhao. Enhancing large vision-language models with ultra-detailed image caption generation. In Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing , pp. 26703–26729, 2025. Yu Zeng, Wenxuan Huang, Zhen Fang, Shuang Chen, Yufan Shen, Yishuo Cai, Xiaoman Wang, Zhenfei Yin, Lin Chen, Zehui Chen, et al. Vision-deepresearch benchmark: Rethinking visual and textual search for multimodal large language models. arXiv preprint arXiv:2602.02185 , 2026. Guohui Zhang, Jiangtong Tan, Linjiang Huang, Zhonghang Yuan, Mingde Yao, Jie Huang, and Feng Zhao. Infoscale: Unleashing training-free variable-scaled image generation via effective utilization of information. arXiv preprint arXiv:2509.01421 , 2025a. Guohui Zhang, Hu Yu, Xiaoxiao Ma, Yaning Pan, Hang Xu, and Feng Zhao. Maskfocus: Focusing policy optimization on critical steps for masked image generation. arXiv preprint arXiv:2512.18766 , 2025b. Guohui Zhang, Hu Yu, Xiaoxiao Ma, JingHao Zhang, Yaning Pan, Mingde Yao, Jie Xiao, Linjiang Huang, and Feng Zhao. Group critical-token policy optimization for autoregressive image generation. arXiv preprint arXiv:2509.22485 , 2025c. Yi-Fan Zhang, Huanyu Zhang, Haochen Tian, Chaoyou Fu, Shuangqing Zhang, Junfei Wu, Feng Li, Kun Wang, Qingsong Wen, Zhang Zhang, et al. Mme-realworld: Could your multimodal llm challenge high-resolution real-world scenarios that are difficult for humans? arXiv preprint arXiv:2408.13257 , 2024. Yiming Zhao, Yu Zeng, Yukun Qi, YaoYang Liu, Lin Chen, Zehui Chen, Xikun Bao, Jie Zhao, and Feng Zhao. V2p-bench: Evaluating video-language understanding with visual prompts for better human-model interaction. arXiv preprint arXiv:2503.17736 , 2025. Yaowei Zheng, Richong Zhang, Junhao Zhang, Yanhan Ye, Zheyan Luo, Zhangchi Feng, and Yongqiang Ma. Llamafactory: Unified efficient fine-tuning of 100+ language models. arXiv preprint arXiv:2403.13372 , 2024. Ziwei Zheng, Michael Yang, Jack Hong, Chenxiao Zhao, Guohai Xu, Le Yang, Chao Shen, and Xing Yu. Deepeyes: Incentivizing\" thinking with images\" via reinforcement learning. arXiv preprint arXiv:2505.14362 , 2025. Jinguo Zhu, Weiyun Wang, Zhe Chen, Zhaoyang Liu, Shenglong Ye, Lixin Gu, Hao Tian, Yuchen Duan, Weijie Su, Jie Shao, et al. Internvl3: Exploring advanced training and test-time recipes for open-source multimodal models. arXiv preprint arXiv:2504.10479 , 2025.", "source": "marker_v2", "marker_block_id": "/page/13/ListGroup/203"}
iclr26/3kouij8BWi/reference_text_v3.txt ADDED
@@ -0,0 +1,11 @@
 
 
 
 
 
 
 
 
 
 
 
 
1
+ [p. 11 | section: REFERENCES | type: ListGroup]
2
+ Shuai Bai, Keqin Chen, Xuejing Liu, Jialin Wang, Wenbin Ge, Sibo Song, Kai Dang, Peng Wang, Shijie Wang, Jun Tang, et al. Qwen2. 5-vl technical report. arXiv preprint arXiv:2502.13923 , 2025. Fabio M Carlucci, Antonio D'Innocente, Silvia Bucci, Barbara Caputo, and Tatiana Tommasi. Domain generalization by solving jigsaw puzzles. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pp. 2229–2238, 2019. Jiangjie Chen, Qianyu He, Siyu Yuan, Aili Chen, Zhicheng Cai, Weinan Dai, Hongli Yu, Qiying Yu, Xuefeng Li, Jiaze Chen, et al. Enigmata: Scaling logical reasoning in large language models with synthetic verifiable puzzles. arXiv preprint arXiv:2505.19914 , 2025a. Liang Chen, Lei Li, Haozhe Zhao, Yifan Song, and Vinci. R1-v: Reinforcing super generalization ability in vision-language models with less than $3. R1-V , 2025b. Accessed: 2025-02-02. Lin Chen, Jinsong Li, Xiaoyi Dong, Pan Zhang, Conghui He, Jiaqi Wang, Feng Zhao, and Dahua Lin. Sharegpt4v: Improving large multi-modal models with better captions. In European Confer ence on Computer Vision , pp. 370–387. Springer, 2024a. Lin Chen, Jinsong Li, Xiaoyi Dong, Pan Zhang, Yuhang Zang, Zehui Chen, Haodong Duan, Jiaqi Wang, Yu Qiao, Dahua Lin, et al. Are we on the right way for evaluating large vision-language models? Advances in Neural Information Processing Systems , 37:27056–27087, 2024b. Lin Chen, Xilin Wei, Jinsong Li, Xiaoyi Dong, Pan Zhang, Yuhang Zang, Zehui Chen, Haodong Duan, Zhenyu Tang, Li Yuan, et al. Sharegpt4video: Improving video understanding and generation with better captions. Advances in Neural Information Processing Systems , 37:19472–19495, 2024c. Yingyi Chen, Xi Shen, Yahui Liu, Qinghua Tao, and Johan AK Suykens. Jigsaw-vit: Learning jigsaw puzzles in vision transformer. Pattern Recognition Letters , 166:53–60, 2023. Gheorghe Comanici, Eric Bieber, Mike Schaekermann, Ice Pasupat, Noveen Sachdeva, Inderjit Dhillon, Marcel Blistein, Ori Ram, Dan Zhang, Evan Rosen, et al. Gemini 2.5: Pushing the frontier with advanced reasoning, multimodality, long context, and next generation agentic capabilities. arXiv preprint arXiv:2507.06261 , 2025. Qingxiu Dong, Li Dong, Yao Tang, Tianzhu Ye, Yutao Sun, Zhifang Sui, and Furu Wei. Reinforcement pre-training. arXiv preprint arXiv:2506.08007 , 2025. Haodong Duan, Junming Yang, Yuxuan Qiao, Xinyu Fang, Lin Chen, Yuan Liu, Xiaoyi Dong, Yuhang Zang, Pan Zhang, Jiaqi Wang, et al. Vlmevalkit: An open-source toolkit for evaluating large multi-modality models. In Proceedings of the 32nd ACM International Conference on Multimedia , pp. 11198–11201, 2024. Zhen Fang, Zhuoyang Liu, Jiaming Liu, Hao Chen, Yu Zeng, Shiting Huang, Zehui Chen, Lin Chen, Shanghang Zhang, and Feng Zhao. Dualvla: Building a generalizable embodied agent via partial decoupling of reasoning and action. arXiv preprint arXiv:2511.22134 , 2025. Xingyu Fu, Yushi Hu, Bangzheng Li, Yu Feng, Haoyu Wang, Xudong Lin, Dan Roth, Noah A Smith, Wei-Chiu Ma, and Ranjay Krishna. Blink: Multimodal large language models can see but not perceive. In European Conference on Computer Vision , pp. 148–166. Springer, 2024. Tianrui Guan, Fuxiao Liu, Xiyang Wu, Ruiqi Xian, Zongxia Li, Xiaoyu Liu, Xijun Wang, Lichang Chen, Furong Huang, Yaser Yacoob, et al. Hallusionbench: an advanced diagnostic suite for entangled language hallucination and visual illusion in large vision-language models. In Pro ceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pp. 14375– 14385, 2024. Daya Guo, Dejian Yang, Haowei Zhang, Junxiao Song, Ruoyu Zhang, Runxin Xu, Qihao Zhu, Shirong Ma, Peiyi Wang, Xiao Bi, et al. Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning. arXiv preprint arXiv:2501.12948 , 2025.
3
+
4
+ [p. 12 | section: REFERENCES | type: ListGroup]
5
+ Ruiyan Han, Zhen Fang, XinYu Sun, Yuchen Ma, Ziheng Wang, Yu Zeng, Zehui Chen, Lin Chen, Wenxuan Huang, Wei-Jie Xu, et al. Unicorn: Towards self-improving unified multimodal models through self-generated supervision. arXiv preprint arXiv:2601.03193 , 2026. Shiting Huang, Zhen Fang, Zehui Chen, Siyu Yuan, Junjie Ye, Yu Zeng, Lin Chen, Qi Mao, and Feng Zhao. Critictool: Evaluating self-critique capabilities of large language models in toolcalling error scenarios. arXiv preprint arXiv:2506.13977 , 2025a. Shiting Huang, Zecheng Li, Yu Zeng, Qingnan Ren, Zhen Fang, Qisheng Su, Kou Shi, Lin Chen, Zehui Chen, and Feng Zhao. Internalizing meta-experience into memory for guided reinforcement learning in large language models. arXiv preprint arXiv:2602.10224 , 2026a. Wenxuan Huang, Shuang Chen, Zheyong Xie, Shaosheng Cao, Shixiang Tang, Yufan Shen, Qingyu Yin, Wenbo Hu, Xiaoman Wang, Yuntian Tang, et al. Interleaving reasoning for better text-toimage generation. arXiv preprint arXiv:2509.06945 , 2025b. Wenxuan Huang, Bohan Jia, Zijie Zhai, Shaosheng Cao, Zheyu Ye, Fei Zhao, Zhe Xu, Yao Hu, and Shaohui Lin. Vision-r1: Incentivizing reasoning capability in multimodal large language models. arXiv preprint arXiv:2503.06749 , 2025c. Wenxuan Huang, Yu Zeng, Qiuchen Wang, Zhen Fang, Shaosheng Cao, Zheng Chu, Qingyu Yin, Shuang Chen, Zhenfei Yin, Lin Chen, et al. Vision-deepresearch: Incentivizing deepresearch capability in multimodal large language models. arXiv preprint arXiv:2601.22060 , 2026b. Aaron Hurst, Adam Lerer, Adam P Goucher, Adam Perelman, Aditya Ramesh, Aidan Clark, AJ Ostrow, Akila Welihinda, Alan Hayes, Alec Radford, et al. Gpt-4o system card. arXiv preprint arXiv:2410.21276 , 2024. Bohao Li, Yuying Ge, Yi Chen, Yixiao Ge, Ruimao Zhang, and Ying Shan. Seed-bench-2-plus: Benchmarking multimodal large language models with text-rich visual comprehension. arXiv preprint arXiv:2404.16790 , 2024a. Xiaotong Li, Fan Zhang, Haiwen Diao, Yueze Wang, Xinlong Wang, and Lingyu Duan. Densefusion-1m: Merging vision experts for comprehensive multimodal perception. Advances in Neural Information Processing Systems , 37:18535–18556, 2024b. Tsung-Yi Lin, Michael Maire, Serge Belongie, James Hays, Pietro Perona, Deva Ramanan, Piotr Dollar, and C Lawrence Zitnick. Microsoft coco: Common objects in context. In ´ European Conference on Computer Vision , pp. 740–755. Springer, 2014. Pan Lu, Hritik Bansal, Tony Xia, Jiacheng Liu, Chunyuan Li, Hannaneh Hajishirzi, Hao Cheng, Kai-Wei Chang, Michel Galley, and Jianfeng Gao. Mathvista: Evaluating mathematical reasoning of foundation models in visual contexts. arXiv preprint arXiv:2310.02255 , 2023. Xiaoxiao Ma, Haibo Qiu, Guohui Zhang, Zhixiong Zeng, Siqi Yang, Lin Ma, and Feng Zhao. Stage: Stable and generalizable grpo for autoregressive image generation. arXiv preprint arXiv:2509.25027 , 2025. Minesh Mathew, Viraj Bagal, Ruben Tito, Dimosthenis Karatzas, Ernest Valveny, and CV Jawahar. ` Infographicvqa. In Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision , pp. 1697–1706, 2022. Fanqing Meng, Lingxiao Du, Zongkai Liu, Zhixiang Zhou, Quanfeng Lu, Daocheng Fu, Botian Shi, Wenhai Wang, Junjun He, Kaipeng Zhang, et al. Mm-eureka: Exploring visual aha moment with rule-based large-scale reinforcement learning. CoRR , 2025. Yaning Pan, Qianqian Xie, Guohui Zhang, Zekun Wang, Yongqian Wen, Yuanxing Zhang, Haoxuan Hu, Zhiyu Pan, Yibing Huang, Zhidong Gan, et al. Mt-video-bench: A holistic video understanding benchmark for evaluating multimodal llms in multi-turn dialogues. arXiv preprint arXiv:2510.17722 , 2025. Yukun Qi, Yiming Zhao, Yu Zeng, Xikun Bao, Wenxuan Huang, Lin Chen, Zehui Chen, Jie Zhao, Zhongang Qi, and Feng Zhao. Vcr-bench: A comprehensive evaluation framework for video chain-of-thought reasoning. arXiv preprint arXiv:2504.07956 , 2025.
6
+
7
+ [p. 13 | section: REFERENCES | type: ListGroup]
8
+ Rafael Rafailov, Archit Sharma, Eric Mitchell, Christopher D Manning, Stefano Ermon, and Chelsea Finn. Direct preference optimization: Your language model is secretly a reward model. Advances in Neural Information Processing Systems , 36:53728–53741, 2023. Qingnan Ren, Shiting Huang, Zhen Fang, Zehui Chen, Lin Chen, Lijun Li, and Feng Zhao. Adora: Training reasoning models with dynamic advantage estimation on reinforcement learning. arXiv preprint arXiv:2602.10019 , 2026. John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347 , 2017. Zhihong Shao, Peiyi Wang, Qihao Zhu, Runxin Xu, Junxiao Song, Xiao Bi, Haowei Zhang, Mingchuan Zhang, YK Li, Yang Wu, et al. Deepseekmath: Pushing the limits of mathematical reasoning in open language models. arXiv preprint arXiv:2402.03300 , 2024. Guangming Sheng, Chi Zhang, Zilingfeng Ye, Xibin Wu, Wang Zhang, Ru Zhang, Yanghua Peng, Haibin Lin, and Chuan Wu. Hybridflow: A flexible and efficient rlhf framework. arXiv preprint arXiv: 2409.19256 , 2024. Amanpreet Singh, Vivek Natarajan, Meet Shah, Yu Jiang, Xinlei Chen, Dhruv Batra, Devi Parikh, and Marcus Rohrbach. Towards vqa models that can read. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pp. 8317–8326, 2019. Jingqi Tong, Jixin Tang, Hangcheng Li, Yurong Mou, Ming Zhang, Jun Zhao, Yanbo Wen, Fan Song, Jiahao Zhan, Yuyang Lu, et al. Code2logic: Game-code-driven data synthesis for enhancing vlms general reasoning. arXiv preprint arXiv:2505.13886 , 2025. Shengbang Tong, Zhuang Liu, Yuexiang Zhai, Yi Ma, Yann LeCun, and Saining Xie. Eyes wide shut? exploring the visual shortcomings of multimodal llms. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pp. 9568–9578, 2024. Qiuchen Wang, Ruixue Ding, Zehui Chen, Weiqi Wu, Shihang Wang, Pengjun Xie, and Feng Zhao. Vidorag: Visual document retrieval-augmented generation via dynamic iterative reasoning agents. arXiv preprint arXiv:2502.18017 , 2025a. Qiuchen Wang, Ruixue Ding, Yu Zeng, Zehui Chen, Lin Chen, Shihang Wang, Pengjun Xie, Fei Huang, and Feng Zhao. Vrag-rl: Empower vision-perception-based rag for visually rich information understanding via iterative reasoning with reinforcement learning. arXiv preprint arXiv:2505.22019 , 2025b. Qiuchen Wang, Shihang Wang, Yu Zeng, Qiang Zhang, Fanrui Zhang, Zhuoning Guo, Bosi Zhang, Wenxuan Huang, Lin Chen, Zehui Chen, et al. Vimrag: Navigating massive visual context in retrieval-augmented generation via multimodal memory graph. arXiv preprint arXiv:2602.12735 , 2026. Wenbin Wang, Liang Ding, Minyan Zeng, Xiabin Zhou, Li Shen, Yong Luo, Wei Yu, and Dacheng Tao. Divide, conquer and combine: A training-free framework for high-resolution image perception in multimodal large language models. In Proceedings of the AAAI Conference on Artificial Intelligence , volume 39, pp. 7907–7915, 2025c. Xiyao Wang, Zhengyuan Yang, Chao Feng, Yongyuan Liang, Yuhang Zhou, Xiaoyu Liu, Ziyi Zang, Ming Li, Chung-Ching Lin, Kevin Lin, et al. Vicrit: A verifiable reinforcement learning proxy task for visual perception in vlms. arXiv preprint arXiv:2506.10128 , 2025d. Zifu Wang, Junyi Zhu, Bo Tang, Zhiyu Li, Feiyu Xiong, Jiaqian Yu, and Matthew B Blaschko. Jigsaw-r1: A study of rule-based visual reinforcement learning with jigsaw puzzles. arXiv preprint arXiv:2505.23590 , 2025e. Penghao Wu and Saining Xie. V?: Guided visual search as a core mechanism in multimodal llms. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pp. 13084–13094, 2024. xAI. Grok-1.5 Vision Preview. , 2024.
9
+
10
+ [p. 14 | section: REFERENCES | type: ListGroup]
11
+ Tian Xie, Zitian Gao, Qingnan Ren, Haoming Luo, Yuqian Hong, Bryan Dai, Joey Zhou, Kai Qiu, Zhirong Wu, and Chong Luo. Logic-rl: Unleashing llm reasoning with rule-based reinforcement learning. arXiv preprint arXiv:2502.14768 , 2025a. Yunfei Xie, Yinsong Ma, Shiyi Lan, Alan Yuille, Junfei Xiao, and Chen Wei. Play to generalize: Learning to reason through game play. arXiv preprint arXiv:2506.08011 , 2025b. Yi Yang, Xiaoxuan He, Hongkun Pan, Xiyan Jiang, Yan Deng, Xingtao Yang, Haoyu Lu, Dacheng Yin, Fengyun Rao, Minfeng Zhu, et al. R1-onevision: Advancing generalized multimodal reasoning through cross-modal formalization. arXiv preprint arXiv:2503.10615 , 2025. En Yu, Kangheng Lin, Liang Zhao, Jisheng Yin, Yana Wei, Yuang Peng, Haoran Wei, Jianjian Sun, Chunrui Han, Zheng Ge, et al. Perception-r1: Pioneering perception policy with reinforcement learning. arXiv preprint arXiv:2504.07954 , 2025. Xiang Yue, Yuansheng Ni, Kai Zhang, Tianyu Zheng, Ruoqi Liu, Ge Zhang, Samuel Stevens, Dongfu Jiang, Weiming Ren, Yuxuan Sun, et al. Mmmu: A massive multi-discipline multimodal understanding and reasoning benchmark for expert agi. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pp. 9556–9567, 2024. Yu Zeng, Yukun Qi, Yiming Zhao, Xikun Bao, Lin Chen, Zehui Chen, Shiting Huang, Jie Zhao, and Feng Zhao. Enhancing large vision-language models with ultra-detailed image caption generation. In Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing , pp. 26703–26729, 2025. Yu Zeng, Wenxuan Huang, Zhen Fang, Shuang Chen, Yufan Shen, Yishuo Cai, Xiaoman Wang, Zhenfei Yin, Lin Chen, Zehui Chen, et al. Vision-deepresearch benchmark: Rethinking visual and textual search for multimodal large language models. arXiv preprint arXiv:2602.02185 , 2026. Guohui Zhang, Jiangtong Tan, Linjiang Huang, Zhonghang Yuan, Mingde Yao, Jie Huang, and Feng Zhao. Infoscale: Unleashing training-free variable-scaled image generation via effective utilization of information. arXiv preprint arXiv:2509.01421 , 2025a. Guohui Zhang, Hu Yu, Xiaoxiao Ma, Yaning Pan, Hang Xu, and Feng Zhao. Maskfocus: Focusing policy optimization on critical steps for masked image generation. arXiv preprint arXiv:2512.18766 , 2025b. Guohui Zhang, Hu Yu, Xiaoxiao Ma, JingHao Zhang, Yaning Pan, Mingde Yao, Jie Xiao, Linjiang Huang, and Feng Zhao. Group critical-token policy optimization for autoregressive image generation. arXiv preprint arXiv:2509.22485 , 2025c. Yi-Fan Zhang, Huanyu Zhang, Haochen Tian, Chaoyou Fu, Shuangqing Zhang, Junfei Wu, Feng Li, Kun Wang, Qingsong Wen, Zhang Zhang, et al. Mme-realworld: Could your multimodal llm challenge high-resolution real-world scenarios that are difficult for humans? arXiv preprint arXiv:2408.13257 , 2024. Yiming Zhao, Yu Zeng, Yukun Qi, YaoYang Liu, Lin Chen, Zehui Chen, Xikun Bao, Jie Zhao, and Feng Zhao. V2p-bench: Evaluating video-language understanding with visual prompts for better human-model interaction. arXiv preprint arXiv:2503.17736 , 2025. Yaowei Zheng, Richong Zhang, Junhao Zhang, Yanhan Ye, Zheyan Luo, Zhangchi Feng, and Yongqiang Ma. Llamafactory: Unified efficient fine-tuning of 100+ language models. arXiv preprint arXiv:2403.13372 , 2024. Ziwei Zheng, Michael Yang, Jack Hong, Chenxiao Zhao, Guohai Xu, Le Yang, Chao Shen, and Xing Yu. Deepeyes: Incentivizing" thinking with images" via reinforcement learning. arXiv preprint arXiv:2505.14362 , 2025. Jinguo Zhu, Weiyun Wang, Zhe Chen, Zhaoyang Liu, Shenglong Ye, Lixin Gu, Hao Tian, Yuchen Duan, Weijie Su, Jie Shao, et al. Internvl3: Exploring advanced training and test-time recipes for open-source multimodal models. arXiv preprint arXiv:2504.10479 , 2025.
iclr26/3kouij8BWi/sanitization_report.json ADDED
@@ -0,0 +1,60 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {
2
+ "paper_id": "3kouij8BWi",
3
+ "pipeline": "Paper2Markdown-V3",
4
+ "ok": true,
5
+ "page_count": 26,
6
+ "chunk_count": 128,
7
+ "main_body_chunk_count": 58,
8
+ "appendix_chunk_count": 66,
9
+ "reference_chunk_count": 4,
10
+ "model_text_chars": 35860,
11
+ "raw_markdown_chars": 83077,
12
+ "sanitized_chars": 77257,
13
+ "page_provenance": {
14
+ "min_page": 1,
15
+ "max_page": 26,
16
+ "invalid_count": 0
17
+ },
18
+ "marker_block_type_counts": {
19
+ "Code": 6,
20
+ "Equation": 7,
21
+ "FigureGroup": 11,
22
+ "Footnote": 7,
23
+ "ListGroup": 12,
24
+ "PageFooter": 26,
25
+ "PageHeader": 26,
26
+ "Picture": 2,
27
+ "PictureGroup": 1,
28
+ "SectionHeader": 42,
29
+ "Table": 1,
30
+ "TableGroup": 9,
31
+ "Text": 83
32
+ },
33
+ "asset_count_raw": 14,
34
+ "asset_count_model_kept": 14,
35
+ "asset_count_rejected": 0,
36
+ "asset_reject_reasons": {
37
+ "kept": 14
38
+ },
39
+ "artifact_leak_audit": {
40
+ "ok": true,
41
+ "hits": {
42
+ "Anonymous Authors": [],
43
+ "ACKNOWLEDGMENT": [],
44
+ "OpenReview": [],
45
+ "\"accept_label\"": [],
46
+ "\"decision\"": [],
47
+ "\"decision_tier\"": [],
48
+ "\"source_status\"": [],
49
+ "Meta-review": [],
50
+ "Official Review": [],
51
+ "official_reviews": [],
52
+ "meta_reviews": [],
53
+ "suggested_verdict_score": []
54
+ },
55
+ "artifact_count": 2
56
+ },
57
+ "default_model_input": "model_text_v3.txt",
58
+ "appendix_input": "appendix_text_v3.txt",
59
+ "reference_input": "reference_text_v3.txt"
60
+ }
iclr26/3kouij8BWi/sanitized_v3.txt ADDED
@@ -0,0 +1,412 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ {0}
2
+ ### **ABSTRACT**
3
+ Although current large Vision-Language Models (VLMs) have advanced in multimodal understanding and reasoning, their fundamental perceptual and reasoning abilities remain limited. Specifically, even on simple jigsaw tasks, existing VLMs perform near randomly, revealing deficiencies in core perception and reasoning capabilities. While high-quality vision-language data can enhance these capabilities, its scarcity and limited scalability impose significant constraints. To address this, we propose AGILE, an Agentic jiGsaw Interaction Learning for Enhancing visual perception and reasoning in VLMs. AGILE formulates jigsaw solving as an interactive process, enabling the model to progressively engage with the environment. At each step, the model generates executable code to perform an action based on the current state, while the environment provides fine-grained visual feedback to guide task completion. Through this iterative cycle of observation and interaction, the model incrementally improves its perceptual and reasoning capabilities via exploration and feedback. Experimental results show that AGILE not only substantially boosts performance on jigsaw tasks of varying complexity (e.g., increasing accuracy from 9.5% to 82.8% under the $2 \times 2$ setting) but also demonstrates strong generalization across 9 general vision tasks, achieving an average improvement of 3.1%. These results indicate notable enhancements in both perceptual and reasoning abilities. This work opens a new avenue for advancing reasoning and generalization in multimodal models and provides an efficient, scalable solution to the scarcity of multimodal reinforcement learning data. The code and datasets is available at
4
+ ### 1 Introduction
5
+ Large Vision-Language Models (VLMs) have recently achieved remarkable success across a wide range of multimodal tasks, including image captioning (Chen et al., 2024a;c; Li et al., 2024b; Zeng et al., 2025), visual question answering (Bai et al., 2025; Zhu et al., 2025; Hurst et al., 2024; Comanici et al., 2025; Qi et al., 2025; Zhao et al., 2025; Huang et al., 2026b; Zeng et al., 2026; Wang et al., 2026; Pan et al., 2025), document understanding (Wang et al., 2025b;a), and complex real-world applications (Huang et al., 2025b; Han et al., 2026; Fang et al., 2025; Huang et al., 2025a; Zhang et al., 2025a). By effectively associating visual and textual information, these models exhibit strong multimodal perception and reasoning capabilities. However, their performance remains severely limited on tasks that require comprehensive visual understanding and structured reasoning. In particular, we find that current VLMs often perform near random even on relatively simple $2\times 2$ jigsaw tasks (Carlucci et al., 2019; Chen et al., 2023), which demand both perceptual accuracy and
6
+ <sup>&</sup>lt;sup>2</sup>Shanghai AI Laboratory
7
+ {1}------------------------------------------------
8
+ ![](_page_1_Picture_1.jpeg)
9
+ ![](_page_1_Picture_2.jpeg)
10
+ <span id="page-1-0"></span>![](_page_1_Picture_3.jpeg)
11
+ Figure 1: Description of the action space. (a) illustrates swapping two jigsaw pieces and observing the updated jigsaw state; (b) shows cropping a specific region of the jigsaw for closer inspection; and (c) depicts zooming into a selected area to examine fine-grained details.
12
+ logical inference. This suggests that existing pretraining and fine-tuning strategies are insufficient for developing robust perceptual and reasoning abilities.
13
+ Recent studies have explored reinforcement learning (RL) [\(Schulman et al., 2017;](#page-12-3) [Rafailov et al.,](#page-12-4) [2023;](#page-12-4) [Shao et al., 2024;](#page-12-5) [Huang et al., 2026a;](#page-11-8) [Ma et al., 2025;](#page-11-9) [Zhang et al., 2025c;](#page-13-5)[b;](#page-13-6) [Ren et al., 2026\)](#page-12-6) as a way to enhance these capabilities by enabling models to learn through interaction, trial-anderror, and feedback. While RL-based approaches show promise, they are fundamentally constrained by the scarcity and limited scalability of high-quality vision-language RL data. Current methods for constructing multimodal RL datasets [\(Huang et al., 2025c;](#page-11-10) [Yang et al., 2025;](#page-13-7) [Lu et al., 2023\)](#page-11-11) generally fall into two categories: human expert supervision and automated synthesis. Humansupervised datasets are either prohibitively expensive or too small in scale for large-scale training, while automated approaches that rely on closed-source models suffer from limited quality, capability constraints, and substantial API costs. These challenges collectively hinder the development of VLMs with strong reasoning and generalization abilities.
14
+ To address these limitations, we propose AGILE, an Agentic jiGsaw Interaction Learning framework for Enhancing visual perception and reasoning in VLMs. Our approach leverages the structured nature of the jigsaw puzzle as a proxy task for perception and reasoning, modeling the jigsawsolving process as a progressive interaction between the model and its environment. At each step, the model generates Python code to perform actions within a well-defined action space (swapping two image tiles, observing the current jigsaw state, cropping regions for detailed observation, or zooming in for fine-grained analysis). This interaction-driven process enables the model to iteratively refine its perceptual and reasoning capabilities while receiving explicit feedback at every step. By simulating the step-by-step dynamics of jigsaw solving, the model is encouraged to capture structural relationships among visual components and acquire more robust perception and reasoning skills.
15
+ A key feature of our approach is the use of code and rule-based data generation, which offers two major advantages. First, the difficulty of the jigsaw task can be precisely controlled by adjusting factors such as the number of correctly placed tiles in the initial state and the overall jigsaw size. Second, because the ground-truth solution is inherently available, the synthetic dataset can be scaled to arbitrary sizes with strict supervision, overcoming the data scarcity inherent in human-annotated or closed-source datasets. The combination of interactive training and scalable data generation yields an efficient and effective framework for advancing visual perception and reasoning in VLMs.
16
+ We validate the effectiveness of our approach through comprehensive experiments. Our method substantially improves performance across jigsaw tasks of varying complexity, for instance, raising accuracy from 9.5% to 82.8% on the 2 × 2 setting, while also demonstrating strong generalization to a wide range of vision tasks, including high-resolution image understanding, real-world scene analysis, fine-grained recognition, visual reasoning, and hallucination benchmarks. Moreover, we show that scaling the training data further boosts performance, and that under equal data budgets, jigsaw-based training achieves results comparable to or even surpassing those obtained with general QA data. These findings underscore the potential of jigsaw tasks in addressing the scarcity of multimodal RL data. By combining interactive training with scalable data generation, our method significantly enhances both perceptual and higher-order reasoning abilities, pointing to a promising new direction for advancing VLMs. Our main contributions are as follows:
17
+ {2}------------------------------------------------
18
+ - We introduce AGILE, an agentic jigsaw interaction learning framework that formulates jigsaw solving as a stepwise interactive process, thereby driving incremental improvements in both visual perception and reasoning capabilities of VLMs.
19
+ - We present a scalable jigsaw-based data generation method that yields high-quality multimodal reinforcement learning datasets with controllable difficulty, providing an efficient solution to the current shortage of high-quality training data.
20
+ - Extensive experiments demonstrate that our approach substantially improves performance on jigsaw tasks of varying complexity while exhibiting strong generalization across diverse vision benchmarks, highlighting its effectiveness in enhancing both perception and reasoning in VLMs.
21
+ # 2 RELATED WORK
22
+ Reinforcement Learning for Vision Language Models. Reinforcement learning (RL) [\(Schulman](#page-12-3) [et al., 2017;](#page-12-3) [Rafailov et al., 2023;](#page-12-4) [Shao et al., 2024\)](#page-12-5) has been widely applied to improve reasoning in language models, as exemplified by the success of DeepSeek-R1 [\(Guo et al., 2025\)](#page-10-7) in mathematical reasoning. Building on this progress, recent studies have extended RL to VLMs, with rule-based RL in multimodal domains emerging as a promising direction. For perception enhancement, R1-V [\(Chen et al., 2025b\)](#page-10-8) applies RL to object counting, while Perception-R1 [\(Yu et al., 2025\)](#page-13-8) leverages object matching and IoU as reward signals to improve grounding. DeepEyes [\(Zheng et al., 2025\)](#page-13-9) shows how RL can encourage models to invoke visual tools, thereby expanding perceptual abilities. For reasoning, MMEureka [\(Meng et al., 2025\)](#page-11-12) demonstrates the effectiveness of rule-based RL in mathematical tasks. From a data perspective, Vision-R1 [\(Huang et al., 2025c\)](#page-11-10) and R1-OneVision [\(Yang et al., 2025\)](#page-13-7) convert visual information into textual representations to build multimodal chainof-thought (CoT) datasets that support stronger reasoning. Despite these advances, the lack of scalable, high-quality RL datasets remains a fundamental bottleneck, severely limiting further improvements in both perception and reasoning for VLMs.
23
+ Enhancing Generalization via Proxy Tasks. Rule-based reinforcement learning (RL) has shown promise but typically requires large amounts of high-quality, verifiable data. Logic-RL [\(Xie et al.,](#page-13-10) [2025a\)](#page-13-10) addressed this by introducing the "Knights and Knaves" (K&K) puzzle, which offers controllable difficulty and algorithmically generated ground truth, enabling models to acquire reasoning skills transferable to mathematical tasks. Enigmata [\(Chen et al., 2025a\)](#page-10-9) extended this approach to a broader set of text-based puzzles (e.g., cryptographic, arithmetic, logical), demonstrating that solving such tasks with RL improves general reasoning without external data. RPT [\(Dong et al., 2025\)](#page-10-10) further reframed next-token prediction as a reasoning task, using verifiable rewards to enhance predictive ability and strengthen the basis for reinforcement fine-tuning. Inspired by these proxy-task successes in LLMs, recent work has begun exploring similar ideas for VLMs. Code2Logic [\(Tong](#page-12-7) [et al., 2025\)](#page-12-7) and ViGaL [\(Xie et al., 2025b\)](#page-13-11) leverage code-synthesized games to improve mathematical reasoning, while ViCrit [\(Wang et al., 2025d\)](#page-12-8) enhances perceptual robustness by reinforcing models to detect hallucinated entities via modified captions. Jigsaw-R1 [\(Wang et al., 2025e\)](#page-12-9) proposed a puzzle-based RL paradigm, but due to training limitations, its models still performed poorly even on 2 × 2 jigsaw puzzles, failing to fully exploit the proxy-task benefits. To address this gap, we propose a agentic jigsaw interaction learning framework, which casts jigsaw solving as an interactive process between the model and environment. This enables iterative refinement of perception and reasoning with explicit stepwise feedback, allowing the model to better capture visual relationships and develop stronger perceptual and reasoning skills.
24
+ # 3 METHOD
25
+ In this section, we provide a comprehensive description of our proposed agentic jigsaw interaction learning framework. We first introduce the jigsaw task and describe how the model interacts with the environment to accomplish it (Sec. [3.1\)](#page-3-0), then present the construction of the training data (Sec. [3.2\)](#page-4-0). Finally, we outline the training paradigm, including both the cold-start stage and the reinforcement learning stage (Sec. [3.3\)](#page-4-1).
26
+ {3}------------------------------------------------
27
+ ![](_page_3_Figure_1.jpeg)
28
+ Figure 2: Overview of the AGILE framework. (a) depicts the interaction process between the model and the external environment, together with the implementation of the GRPO algorithm; (b) shows the collection of high-quality jigsaw trajectory data; and (c) illustrates the model–environment interaction during the jigsaw rollout process.
29
+ ### <span id="page-3-0"></span>3.1 JIGSAW TASK AND ENVIRONMENT INTERACTION
30
+ Jigsaw Task. Given an input image, we partition it into an m × m grid of jigsaw pieces, where task difficulty can be flexibly adjusted by varying m. If the image height or width is not divisible by m, the image is resized so that its dimensions are exact multiples of the grid. The grid is then randomly shuffled, and each piece is assigned an index in row-major order ranging from 1 (top-left) to m<sup>2</sup> (bottom-right). The shuffled configuration is denoted as
31
+ $$I_{Shuffle} = \{I_1, I_2, \dots, I_{m^2}\},$$
32
+ (1)
33
+ where each I<sup>k</sup> corresponds to one jigsaw block. Since the shuffling process is explicitly recorded during data generation, we can recover the ground-truth jigsaw layout as
34
+ $$I_{GT} = \{I_{\pi(1)}, I_{\pi(2)}, \dots, I_{\pi(m^2)}\},\tag{2}$$
35
+ where π is a permutation over {1, 2, . . . , m<sup>2</sup>}. During jigsaw solving, the model will maintain a current state
36
+ $$I_{State} = \{I_{\pi^*(1)}, I_{\pi^*(2)}, \dots, I_{\pi^*(m^2)}\},\tag{3}$$
37
+ where π <sup>∗</sup> denotes the current arrangement of pieces. At each step, the model iteratively swaps two pieces, observes the resulting configuration, and aims to reconstruct the ground-truth layout IGT .
38
+ Environment Interaction. The model interacts with the environment throughout the jigsawsolving process in an iterative manner. As illustrated in Figure [1,](#page-1-0) , we predefine a set of API for model–environment interactions in Python. The model expresses its actions by generating Python code, which is executed by the environment to produce the corresponding resulting image. The model then uses these results to reason further and decide on subsequent actions, repeating this process iteratively until the jigsaw is completed. Specifically, at each step, the model can perform the following actions:
39
+ - Swap: Given the current jigsaw state IState, the model calls the Swap function to exchange the positions of any two jigsaw pieces.
40
+ - Observe: Given IState, the model calls the Observe function to obtain the current jigsaw progress IObs, which is then used to determine the next action.
41
+ {4}------------------------------------------------
42
+ • Crop & Zoom: Given IObs, the model crops and zooms into a local region to inspect finer details and inform subsequent actions.
43
+ To better illustrate the overall procedure, the entire rollout process is presented in Algorithm [1.](#page-4-2)
44
+ ```
45
+ Algorithm 1 Interactive Jigsaw-Solving Procedure of VLMs with the Environment
46
+ ```
47
+ ```
48
+ Input: Query x, IShuff le, Policy model πθ, External environment V, Maximum iteration steps T.
49
+ Output: Final interaction trajectory y.
50
+ 1: Initialize trajectory y ← ∅, step counter t ← 0.
51
+ 2: while t < T do
52
+ 3: Sample response yt ∼ πθ(· | x, IShuff le, y).
53
+ 4: Append assistant response yt to trajectory: y ← y + yt.
54
+ 5: if <code> </code> detected in yt then
55
+ 6: Parse the Python code (e.g., Swap, Observe, Crop, Zoom), execute it in the environment V, and obtain
56
+ feedback Ot.
57
+ 7: else if <answer> </answer> detected in yt then
58
+ 8: return final trajectory y.
59
+ 9: end if
60
+ 10: Append environment feedback Ot as user input: y ← y + Ot.
61
+ 11: Update step counter t ← t + 1.
62
+ 12: end while
63
+ 13: return final trajectory y.
64
+ ```
65
+ ### <span id="page-4-0"></span>3.2 DATA CONSTRUCTION
66
+ In Section [3.1,](#page-3-0) we have introduced the jigsaw task and described how the model interacts with the environment to complete it. Based on this task design, we observe that the model (e.g., Qwen-2.5VL-7B) exhibits limited foundational capabilities, manifested in poor instruction-following and incorrect Python code generation, which hinders proper interaction with the environment and introduces substantial training noise. Directly applying reinforcement learning (RL) thus results in low learning efficiency. To bridge this gap and more effectively train our model, we employ Gemini 2.5 Pro[1](#page-4-3) to collect expert trajectories for the cold-start phase, endowing Qwen-2.5VL-7B with basic interactive jigsaw-solving capabilities. For this purpose, we design structured prompts to guide Gemini 2.5 Pro in interacting with the environment to complete the jigsaw tasks (The prompt templates are provided in Appendix [B.](#page-14-0) ).
67
+ To further ensure data quality, we apply an additional filtering process: first, selecting samples where Gemini's outputs match the ground truth, and then manually verifying each interaction step in the correct samples to ensure rationality and consistency. To ensure that our model can perform diverse jigsaw reasoning actions during reinforcement learning, we carefully balance the training data. Specifically, trajectories are balanced with respect to both the number of steps (4–8) and the types of actions involved (e.g., Swap, Observe, Crop, Zoom). This design ensures that the model is sufficiently exposed to the full action space and learns to handle various interactions with the environment effectively. Overall, we curate a dataset comprising 1.6K high-quality reasoning trajectories for the jigsaw task.
68
+ ### <span id="page-4-1"></span>3.3 TRAINING PARADIGM: COLD-START AND REINFORCEMENT LEARNING
69
+ Cold-start. During the cold-start phase, we leverage the 1.6K high-quality jigsaw-solving trajectories constructed in Section [3.2](#page-4-0) to equip the model with basic instruction-following and Python code generation capabilities, ensuring effective interaction with the environment.
70
+ Reinforcement Learning. Our framework adopts Group Relative Policy Optimization (GRPO), which utilizes the average reward of multiple sampled outputs as a baseline, instead of relying on a learned value function. The policy model is optimized by maximizing the following objective:
71
+ <span id="page-4-3"></span><sup>1</sup>The version is Gemini-2.5-Pro-Preview-05-06.
72
+ {5}------------------------------------------------
73
+ $$\mathcal{J}_{GRPO}(\theta) = \mathbb{E}_{x \sim \mathcal{D}, \{y_i\}_{i=1}^G \sim \pi_{\text{old}}(\cdot | x; \mathcal{V})} \left[ \frac{1}{G} \sum_{i=1}^G \frac{1}{\sum_{t=1}^{|y_i|} I(y_{i,t})} \sum_{t=1:I(y_{i,t})=1}^{|y_i|} \min \left( \frac{\pi_{\theta}(y_{i,t} \mid x, y_{i,< t}; \mathcal{V})}{\pi_{\text{old}}(y_{i,t} \mid x, y_{i,< t}; \mathcal{V})} \hat{A}_{i,t}, \right) \right] \\
74
+ \operatorname{clip} \left( \frac{\pi_{\theta}(y_{i,t} \mid x, y_{i,< t}; \mathcal{V})}{\pi_{\text{old}}(y_{i,t} \mid x, y_{i,< t}; \mathcal{V})}, 1 - \epsilon, 1 + \epsilon \right) \hat{A}_{i,t} \right) - \beta \, \mathbb{D}_{KL}(\pi_{\theta} \parallel \pi_{\text{ref}}), \tag{4}$$
75
+ where the rollout module samples a group of trajectories $\{y_1, y_2, \dots, y_G\}$ from the old policy $\pi_{\text{old}}$ for each input question x through interaction with the external environment $\mathcal{V}$ . The advantage term $\hat{A}_{i,t}$ is computed based on the relative rewards of outputs within each group. Our reward system comprises three components: an accuracy reward, a format reward, and a step reward. The total reward is computed as the sum of these components.
76
+ - Accuracy Reward: We compare the model's generated answer $I_{Answer}$ with the ground truth $I_{GT}$ . If all jigsaw image blocks are correctly placed, the accuracy reward is 1; otherwise, it is 0.
77
+ - Format Reward: The model receives a reward of 1 if its output follows the required structured format, with the reasoning process, code, and final answer correctly enclosed within the <think>, <code>, and <answer> tags, respectively.
78
+ - $\bullet$ Step Reward: We encourage the model to complete the jigsaw in as few steps as possible. For a $2 \times 2$ jigsaw, if each step swaps any two image blocks, at most three steps are theoretically required to place all blocks correctly. Excessive actions may lead the model to perform invalid steps, reducing the proportion of effective perception and reasoning. Furthermore, to prevent the model from prematurely hacking the step reward during early RL training, the step reward is applied only when the jigsaw is correctly completed. If the jigsaw is incorrect, the model is penalized by assigning the maximum step penalty. Formally, the step reward is defined as:
79
+ <span id="page-5-2"></span>
80
+ $$R_{\text{step}} = \lambda \cdot \left( \mathbb{I}_{\{R_{\text{acc}}=1\}} \cdot step_{\text{num}} + \mathbb{I}_{\{R_{\text{acc}}=0\}} \cdot step_{\text{max}} \right), \tag{5}$$
81
+ where $step_{num}$ is the number of steps the model actually used to complete the jigsaw, $step_{max}$ is the maximum allowed steps, $\lambda$ denotes the step penalty coefficient, which is set to -0.05, and $\mathbb{I}_{\{\cdot\}}$ is the indicator function. The final reward formulation is shown in Equation 6:
82
+ <span id="page-5-0"></span>
83
+ $$R = \alpha \cdot R_{\text{acc}} + \beta \cdot R_{\text{format}} + \gamma \cdot R_{\text{step}}, \tag{6}$$
84
+ where the coefficients $\alpha$ , $\beta$ , and $\gamma$ weight the relative importance of accuracy, format, and step rewards, respectively. In our experimental setup, $\alpha$ , $\beta$ , and $\gamma$ are set to 0.8, 0.2, and 1.0, respectively.
85
+ ### 4 EXPERIMENT
86
+ In this section, we present a comprehensive experimental study. We first describe the implementation details, including datasets, training procedures, and inference settings (Sec. 4.1). We then evaluate the effectiveness of our agentic jigsaw interaction learning framework on both jigsaw-solving and general vision tasks (Sec. 4.2). Finally, we perform ablation studies to assess the impact of jigsaw data scale and to contrast the benefits of jigsaw data with those of general QA data (Sec. 4.3).
87
+ ### <span id="page-5-1"></span>4.1 IMPLEMENTATION DETAILS
88
+ **Datasets and Models.** Our training data consist of two components corresponding to the cold-start and reinforcement learning (RL) stages. In the cold-start stage, we employ 1.6K high-quality jigsaw puzzle trajectories collected in Sec. 3.2 to endow the model with basic interactive jigsaw-solving skills. In the RL stage, we construct a dataset of 15.6K images spanning diverse domains, including high-resolution visual search, OCR-based text recognition, real-world scenes, and structured diagrams (see Appendix A for details). Each image is partitioned into $2 \times 2$ patches and randomly shuffled to ensure that all patches are initially misplaced. All experiments are conducted using Qwen2.5-VL-7B (Bai et al., 2025) as the base model.
89
+ {6}------------------------------------------------
90
+ <span id="page-6-1"></span>Table 1: Jigsaw Acc result. LN indicates the difficulty level, where N denotes the initial number of correct pieces. A smaller N corresponds to a more scrambled jigsaw and higher difficulty. The best results are highlighted in bold, and the second-best results are underlined.
91
+ | Model | | | 2 × 2 | | | 3 × 3 | | | | | | | |
92
+ |----------------|------|------|-------|------|-----|-------|------|------|------|------|------|------|------|
93
+ | | L0 | L1 | L2 | Avg. | L0 | L1 | L2 | L3 | L4 | L5 | L6 | L7 | Avg. |
94
+ | Random | 4.5 | 3.7 | 4.2 | 4.1 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 |
95
+ | GPT-4o | 38.7 | 37.7 | 47.0 | 41.1 | 1.0 | 1.3 | 2.7 | 3.0 | 3.0 | 7.0 | 7.7 | 13.7 | 4.9 |
96
+ | Gemini-2.5-Pro | 43.3 | 46.3 | 49.7 | 46.4 | 7.0 | 8.7 | 9.7 | 10.0 | 11.0 | 15.0 | 23.0 | 32.0 | 14.6 |
97
+ | MiMo-VL-7B-RL | 11.3 | 14.3 | 17.0 | 14.2 | 0.3 | 0.0 | 0.0 | 0.0 | 0.3 | 0.3 | 1.0 | 3.7 | 0.7 |
98
+ | InternVL3-8B | 3.7 | 3.7 | 5.0 | 4.1 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 |
99
+ | InternVL3-78B | 3.3 | 4.3 | 3.0 | 3.5 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 |
100
+ | Qwen2.5VL-72B | 22.7 | 24.3 | 35.3 | 27.4 | 0.3 | 1.3 | 2.3 | 2.7 | 2.0 | 3.0 | 6.7 | 12.7 | 3.9 |
101
+ | Qwen2.5VL-7B | 6.3 | 6.0 | 16.3 | 9.5 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.7 | 1.3 | 1.3 | 0.4 |
102
+ | +Cold-Start | 12.0 | 32.0 | 22.0 | 22.0 | 0.0 | 0.3 | 0.0 | 0.0 | 0.0 | 0.7 | 0.3 | 0.0 | 0.2 |
103
+ | +RL | 78.7 | 83.0 | 86.7 | 82.8 | 5.0 | 7.0 | 11.0 | 14.0 | 17.7 | 25.3 | 38.0 | 48.0 | 20.8 |
104
+ Training and Inference Setups. We conduct supervised fine-tuning (SFT) on llama-factory [\(Zheng](#page-13-12) [et al., 2024\)](#page-13-12) and reinforcement learning (RL) training on verl [\(Sheng et al., 2024\)](#page-12-10), both with fullparameter tuning. For inference and evaluation, we adopt VLMEvalKit [\(Duan et al., 2024\)](#page-10-11) as the framework. To ensure a fair comparison, all evaluations on general downstream benchmarks are conducted in a strict single-turn setting following VLMEvalKit, fully consistent with the evaluation protocol of all baseline models. All experiments are performed on 8 NVIDIA A100 GPUs with 80GB memory each. Detailed training hyperparameters are provided in the Appendix [D.](#page-20-0)
105
+ ### <span id="page-6-0"></span>4.2 MAIN RESULTS
106
+ Significant Improvements on the Jigsaw Task. To comprehensively evaluate performance on the jigsaw task, we curate a test set of 300 images spanning diverse scenarios, including high-resolution visual search, OCR-based text recognition, and real-world scenes. Each image is partitioned into 2 × 2 and 3 × 3 grids, and the performance is measured using two metrics: Acc, which equals 1 only when all patches are correctly placed, and Score, defined as the ratio of correctly placed patches to the total number of patches. As shown in Table [1](#page-6-1) and [2,](#page-7-1) the base model Qwen2.5-VL-7B performs poorly without training (achieving only 9.5% accuracy even under the simplest 2 × 2 setting) while the proprietary Gemini2.5-Pro and the larger Qwen2.5-VL-72B models also struggle on this task. After supervised fine-tuning (SFT) with 1.6K cold-start trajectories and reinforcement learning (RL) with 15.6K images, Qwen2.5-VL-7B achieves substantial gains: on the 2 × 2 setting, Acc improves from 9.5% to 82.8% and Score from 29.4% to 89.0%; on the more challenging 3 × 3 setting, it also generalizes well, with Acc increasing from 0.4% to 20.8% and Score from 31.1% to 62.1%, significantly surpassing Gemini2.5-Pro and Qwen2.5-VL-72B. These results demonstrate that modeling jigsaw solving as an interactive multi-turn dialogue enables the model to progressively enhance its visual perception and reasoning abilities, thereby achieving superior performance on the jigsaw task.
107
+ Generalization to Downstream Visual Tasks. The proposed agentic jigsaw interaction learning framework delivers substantial improvements on the jigsaw task. By leveraging explicit step-by-step feedback for iterative refinement, it enables the model to capture visual relations more effectively and to develop stronger reasoning capabilities.
108
+ To further assess whether jigsaw training enhances performance on general vision downstream tasks, we evaluate the model on 9 benchmarks: high-resolution image understanding (HRBench4K [\(Wang](#page-12-11) [et al., 2025c\)](#page-12-11), HRBench8K [\(Wang et al., 2025c\)](#page-12-11), VStarBench [\(Wu & Xie, 2024\)](#page-12-12)), real-world scene understanding (MME-RealWorld [\(Zhang et al., 2024\)](#page-13-13), RealWorldQA [\(xAI, 2024\)](#page-12-13)), fine-grained visual recognition (MMVP [\(Tong et al., 2024\)](#page-12-14), BLINK [\(Fu et al., 2024\)](#page-10-12)), visual reasoning (MMMU [\(Yue et al., 2024\)](#page-13-14)), and hallucination evaluation (HallusionBench [\(Guan et al., 2024\)](#page-10-13)). As shown in Table [3,](#page-7-2) the jigsaw-trained model demonstrates strong visual generalization, achieving notable gains on HRBench4K (+4.2%), HRBench8K (+5.2%), and VStarBench (+4.2%). On average, it surpasses the base model Qwen2.5-VL-7B by 3.1% across all 9 benchmarks, providing compelling evidence
109
+ {7}------------------------------------------------
110
+ <span id="page-7-1"></span>Table 2: **Jigsaw Score result.** LN indicates the difficulty level, where N denotes the initial number of correct pieces. A smaller N corresponds to a more scrambled jigsaw and higher difficulty. The best results are highlighted in **bold**, and the second-best results are underlined.
111
+ | Model | | 2 : | × 2 | | 3 × 3 | | | | | | | | |
112
+ |--------------------|---------------------|---------------------|---------------------|---------------------|--------------------|--------------------|--------------------|---------------------|---------------------|---------------------|---------------------|---------------------|---------------------|
113
+ | | L0 | L1 | L2 | Avg. | L0 | L1 | L2 | L3 | L4 | L5 | L6 | L7 | Avg. |
114
+ | Random | 25.2 | 24.7 | 24.8 | 24.9 | 11.4 | 11.3 | 11.0 | 10.9 | 11.1 | 11.4 | 11.3 | 10.8 | 11.2 |
115
+ | GPT-4o | 54.8 | 59.1 | 63.2 | <u>59.0</u> | 25.9 | 27.3 | 34.1 | 36.3 | 42.3 | 48.0 | 54.4 | 64.0 | 41.5 |
116
+ | Gemini-2.5-Pro | <u>55.3</u> | <u>60.1</u> | 61.6 | 59.0 | <u>31.9</u> | <u>31.8</u> | <u>35.7</u> | <u>39.4</u> | <u>43.1</u> | <u>48.7</u> | <u>61.8</u> | <u>68.6</u> | <u>45.1</u> |
117
+ | MiMo-VL-7B-RL | 21.8 | 27.2 | 29.2 | 26.1 | 5.5 | 6.9 | 8.0 | 10.7 | 15.9 | 19.5 | 20.6 | 28.9 | 14.5 |
118
+ | InternVL3-8B | 24.6 | 24.3 | 25.3 | 24.7 | 7.5 | 10.1 | 15.7 | 16.8 | 20.3 | 25.1 | 28.2 | 31.7 | 19.4 |
119
+ | InternVL3-78B | 21.3 | 26.5 | 28.4 | 25.4 | 7.1 | 10.9 | 14.1 | 18.5 | 23.1 | 25.7 | 29.0 | 37.0 | 20.7 |
120
+ | Qwen2.5VL-72B | 40.7 | 46.1 | 56.1 | 47.6 | 21.7 | 25.6 | 30.8 | 33.4 | 34.7 | 40.0 | 46.3 | 55.2 | 36.0 |
121
+ | Qwen2.5VL-7B | 14.4 | 30.1 | 43.8 | 29.4 | 5.8 | 12.0 | 20.3 | 25.6 | 32.7 | 40.9 | 50.2 | 60.9 | 31.1 |
122
+ | +Cold-Start<br>+RL | 40.6<br><b>86.4</b> | 45.6<br><b>88.7</b> | 45.3<br><b>91.9</b> | 43.8<br><b>89.0</b> | 6.5<br><b>41.1</b> | 6.9<br><b>46.8</b> | 7.8<br><b>52.6</b> | 10.2<br><b>58.6</b> | 10.4<br><b>65.3</b> | 13.2<br><b>71.0</b> | 15.7<br><b>77.9</b> | 17.0<br><b>83.6</b> | 11.0<br><b>62.1</b> |
123
+ <span id="page-7-2"></span>Table 3: **Main results.** Performance comparison of different models on the 9 benchmarks. Abbreviations: MME-RW (MME-RealWorld-Lite), RWQA (RealWorldQA), HRB4K (HRBench4K), HRB8K (HRBench8K), Halbench (HallusionBench), MMMU (MMMU\_VAL), Avg. denotes the average performance across all 9 benchmarks. $\Delta$ represents the relative performance gain achieved by RL compared to the base model Qwen2.5-VL-7B. The best results are highlighted in **bold**, and the second-best results are underlined.
124
+ | Model | MME-RW | RWQA | HRB4K | HRB8K | VStar | MMVP | BLINK | HalBench | MMMU | Avg. |
125
+ |------------------------------|--------|------|-------|-------|-------------|------|-------|----------|------|------|
126
+ | LLaVA-OV-7B | 48.4 | 69.5 | 65.3 | 58.4 | 73.3 | 77.3 | 52.6 | 36.6 | 48.2 | 58.8 |
127
+ | InternVL2.5-8B | 48.2 | 69.4 | 68.0 | 63.3 | 71.7 | 75.7 | 54.9 | 49.9 | 53.6 | 61.6 |
128
+ | InternVL2.5-78B | 49.7 | 78.4 | 74.5 | 72.5 | 75.9 | 83.0 | 63.6 | 57.1 | 65.4 | 68.9 |
129
+ | Qwen2.5-VL-72B | 44.7 | 75.3 | 80.1 | 77.1 | 85.9 | 81.7 | 61.6 | 53.5 | 66.9 | 69.6 |
130
+ | Qwen2.5-VL-7B | 44.6 | 68.5 | 68.8 | 65.3 | 76.4 | 74.3 | 56.4 | 50.1 | 54.8 | 62.1 |
131
+ | + Cold-Start | 46.2 | 68.4 | 71.0 | 68.4 | <u>77.5</u> | 76.7 | 55.7 | 49.8 | 54.0 | 63.1 |
132
+ | + RL | 48.4 | 70.2 | 73.0 | 70.5 | 80.6 | 78.0 | 58.0 | 51.9 | 55.8 | 65.2 |
133
+ | $\Delta$ (vs. Qwen2.5-VL-7B) | +3.8 | +1.7 | +4.2 | +5.2 | +4.2 | +3.7 | +1.6 | +1.8 | +1.0 | +3.1 |
134
+ that jigsaw-based training effectively enhances the model's ability to capture visual relations and strengthen reasoning skills, thereby improving its performance on general vision downstream tasks.
135
+ ### <span id="page-7-0"></span>4.3 ANALYSIS
136
+ Impact of Jigsaw Training Data Scale. To investigate the effect of data scale, we systematically vary the amount of training data and evaluate model performance on both jigsaw task and general vision tasks. As shown in Figure 3, scaling up the data yields substantial performance gains: jigsaw task accuracy increases from 22.0% to 82.8%, while HRBench4K and RealWorldQA see improvements of 2.0% and 1.8%, respectively. These results highlight a clear data-to-performance trend, demonstrating that larger training sets translate directly into stronger perceptual and reasoning abilities. Crucially, because jigasw data in our reinforcement learning stage are generated via scalable programmatic synthesis, AGILE can easily leverage larger datasets. This scalability not only provides richer learning signals for continual capability growth but also offers a practical and sustainable solution to the scarcity of high-quality multimodal RL data.
137
+ Performance Comparison: Jigsaw vs. General QA Data. We compare the effectiveness of jigsaw data against conventional General QA data for model training. As shown in Figure 4, models trained with jigsaw data consistently outperform those trained with QA data across multiple benchmarks. Notably, combining 10K jigsaw samples with 10K QA samples yields superior performance on general vision benchmarks compared to training with 20K QA samples alone. These results highlight the unique role of jigsaw data in enhancing fundamental visual generalization, demonstrating the efficiency and controllability of jigsaw-solving as a proxy for visual perception and reasoning. A key advantage of our approach lies in the programmatic synthesis of jigsaw data, which enables effortless construction of large-scale, high-quality datasets, a process that is otherwise costly and
138
+ {8}------------------------------------------------
139
+ <span id="page-8-0"></span>![](_page_8_Figure_1.jpeg)
140
+ Figure 3: Impact of Training Data Scale. The left y-axis denotes the accuracies on HRBench4K and RealWorldQA, while the right y-axis corresponds to the accuracy on the jigsaw task.
141
+ ![](_page_8_Figure_3.jpeg)
142
+ Figure 4: Comparison with General QA Data. The total number of samples is consistently maintained at 20K across both experimental setups.
143
+ labor-intensive for QA data. Thus, jigsaw data not only serves as an effective alternative to General QA data but, in some cases, proves to be the superior choice. This finding underscores the potential of jigsaw tasks in alleviating the scarcity of multimodal RL data and opens a promising new direction for advancing multimodal model development.
144
+ <span id="page-8-1"></span>![](_page_8_Figure_6.jpeg)
145
+ Figure 5: Case Study. Jigsaw-solving reasoning and behaviors exhibited by our model.
146
+ Case Study. In Figure [5,](#page-8-1) we showcase several jigsaw-solving reasoning patterns and behaviors exhibited by our model. These cases illustrate the emergence of high-quality perceptual and reasoning strategies in the jigsaw task, including comprehensively interpreting the visual content of individual pieces to infer their spatial relations, employing cropping and zooming to examine and validate edge alignment, and reasoning about semantic consistency across pieces. Such behaviors demon
147
+ {9}------------------------------------------------
148
+ strate human-like reasoning, thereby effectively enhancing the model's perceptual and reasoning capabilities.
149
+ # 5 CONCLUSION
150
+ In this work, we propose a novel agentic jigsaw interaction learning framework that formulates jigsaw solving as an interactive process to enhance visual perception and reasoning in large Vision-Language Models (VLMs). By treating jigsaw solving as an iterative interaction, the model progressively refines its perceptual and reasoning capabilities through exploration and feedback. Our approach significantly improves performance on jigsaw tasks of varying complexity and demonstrates strong generalization to broader general visual tasks, including visual question answering and scene understanding. Furthermore, by analyzing the performance gains from increasing the scale of jigsaw data and comparing it with general QA data, we show that jigsaw serve as an effective proxy for alleviating the scarcity of high-quality RL data, highlighting the potential of task-driven proxy training for stimulating complex multimodal perception and reasoning in VLMs.
151
+ # REFERENCES
152
+ - <span id="page-10-2"></span>Shuai Bai, Keqin Chen, Xuejing Liu, Jialin Wang, Wenbin Ge, Sibo Song, Kai Dang, Peng Wang, Shijie Wang, Jun Tang, et al. Qwen2. 5-vl technical report. *arXiv preprint arXiv:2502.13923*, 2025.
153
+ - <span id="page-10-5"></span>Fabio M Carlucci, Antonio D'Innocente, Silvia Bucci, Barbara Caputo, and Tatiana Tommasi. Domain generalization by solving jigsaw puzzles. In *Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition*, pp. 2229–2238, 2019.
154
+ - <span id="page-10-9"></span>Jiangjie Chen, Qianyu He, Siyu Yuan, Aili Chen, Zhicheng Cai, Weinan Dai, Hongli Yu, Qiying Yu, Xuefeng Li, Jiaze Chen, et al. Enigmata: Scaling logical reasoning in large language models with synthetic verifiable puzzles. *arXiv preprint arXiv:2505.19914*, 2025a.
155
+ - <span id="page-10-8"></span>Liang Chen, Lei Li, Haozhe Zhao, Yifan Song, and Vinci. R1-v: Reinforcing super generalization ability in vision-language models with less than \$3. [ [R1-V]( 2025b. Accessed: 2025-02-02.
156
+ - <span id="page-10-0"></span>Lin Chen, Jinsong Li, Xiaoyi Dong, Pan Zhang, Conghui He, Jiaqi Wang, Feng Zhao, and Dahua Lin. Sharegpt4v: Improving large multi-modal models with better captions. In *European Conference on Computer Vision*, pp. 370–387. Springer, 2024a.
157
+ - <span id="page-10-14"></span>Lin Chen, Jinsong Li, Xiaoyi Dong, Pan Zhang, Yuhang Zang, Zehui Chen, Haodong Duan, Jiaqi Wang, Yu Qiao, Dahua Lin, et al. Are we on the right way for evaluating large vision-language models? *Advances in Neural Information Processing Systems*, 37:27056–27087, 2024b.
158
+ - <span id="page-10-1"></span>Lin Chen, Xilin Wei, Jinsong Li, Xiaoyi Dong, Pan Zhang, Yuhang Zang, Zehui Chen, Haodong Duan, Zhenyu Tang, Li Yuan, et al. Sharegpt4video: Improving video understanding and generation with better captions. *Advances in Neural Information Processing Systems*, 37:19472–19495, 2024c.
159
+ - <span id="page-10-6"></span>Yingyi Chen, Xi Shen, Yahui Liu, Qinghua Tao, and Johan AK Suykens. Jigsaw-vit: Learning jigsaw puzzles in vision transformer. *Pattern Recognition Letters*, 166:53–60, 2023.
160
+ - <span id="page-10-3"></span>Gheorghe Comanici, Eric Bieber, Mike Schaekermann, Ice Pasupat, Noveen Sachdeva, Inderjit Dhillon, Marcel Blistein, Ori Ram, Dan Zhang, Evan Rosen, et al. Gemini 2.5: Pushing the frontier with advanced reasoning, multimodality, long context, and next generation agentic capabilities. *arXiv preprint arXiv:2507.06261*, 2025.
161
+ - <span id="page-10-10"></span>Qingxiu Dong, Li Dong, Yao Tang, Tianzhu Ye, Yutao Sun, Zhifang Sui, and Furu Wei. Reinforcement pre-training. *arXiv preprint arXiv:2506.08007*, 2025.
162
+ - <span id="page-10-11"></span>Haodong Duan, Junming Yang, Yuxuan Qiao, Xinyu Fang, Lin Chen, Yuan Liu, Xiaoyi Dong, Yuhang Zang, Pan Zhang, Jiaqi Wang, et al. Vlmevalkit: An open-source toolkit for evaluating large multi-modality models. In *Proceedings of the 32nd ACM International Conference on Multimedia*, pp. 11198–11201, 2024.
163
+ - <span id="page-10-4"></span>Zhen Fang, Zhuoyang Liu, Jiaming Liu, Hao Chen, Yu Zeng, Shiting Huang, Zehui Chen, Lin Chen, Shanghang Zhang, and Feng Zhao. Dualvla: Building a generalizable embodied agent via partial decoupling of reasoning and action. *arXiv preprint arXiv:2511.22134*, 2025.
164
+ - <span id="page-10-12"></span>Xingyu Fu, Yushi Hu, Bangzheng Li, Yu Feng, Haoyu Wang, Xudong Lin, Dan Roth, Noah A Smith, Wei-Chiu Ma, and Ranjay Krishna. Blink: Multimodal large language models can see but not perceive. In *European Conference on Computer Vision*, pp. 148–166. Springer, 2024.
165
+ - <span id="page-10-13"></span>Tianrui Guan, Fuxiao Liu, Xiyang Wu, Ruiqi Xian, Zongxia Li, Xiaoyu Liu, Xijun Wang, Lichang Chen, Furong Huang, Yaser Yacoob, 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*, pp. 14375– 14385, 2024.
166
+ - <span id="page-10-7"></span>Daya Guo, Dejian Yang, Haowei Zhang, Junxiao Song, Ruoyu Zhang, Runxin Xu, Qihao Zhu, Shirong Ma, Peiyi Wang, Xiao Bi, et al. Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning. *arXiv preprint arXiv:2501.12948*, 2025.
167
+ {11}------------------------------------------------
168
+ - <span id="page-11-6"></span>Ruiyan Han, Zhen Fang, XinYu Sun, Yuchen Ma, Ziheng Wang, Yu Zeng, Zehui Chen, Lin Chen, Wenxuan Huang, Wei-Jie Xu, et al. Unicorn: Towards self-improving unified multimodal models through self-generated supervision. *arXiv preprint arXiv:2601.03193*, 2026.
169
+ - <span id="page-11-7"></span>Shiting Huang, Zhen Fang, Zehui Chen, Siyu Yuan, Junjie Ye, Yu Zeng, Lin Chen, Qi Mao, and Feng Zhao. Critictool: Evaluating self-critique capabilities of large language models in toolcalling error scenarios. *arXiv preprint arXiv:2506.13977*, 2025a.
170
+ - <span id="page-11-8"></span>Shiting Huang, Zecheng Li, Yu Zeng, Qingnan Ren, Zhen Fang, Qisheng Su, Kou Shi, Lin Chen, Zehui Chen, and Feng Zhao. Internalizing meta-experience into memory for guided reinforcement learning in large language models. *arXiv preprint arXiv:2602.10224*, 2026a.
171
+ - <span id="page-11-5"></span>Wenxuan Huang, Shuang Chen, Zheyong Xie, Shaosheng Cao, Shixiang Tang, Yufan Shen, Qingyu Yin, Wenbo Hu, Xiaoman Wang, Yuntian Tang, et al. Interleaving reasoning for better text-toimage generation. *arXiv preprint arXiv:2509.06945*, 2025b.
172
+ - <span id="page-11-10"></span>Wenxuan Huang, Bohan Jia, Zijie Zhai, Shaosheng Cao, Zheyu Ye, Fei Zhao, Zhe Xu, Yao Hu, and Shaohui Lin. Vision-r1: Incentivizing reasoning capability in multimodal large language models. *arXiv preprint arXiv:2503.06749*, 2025c.
173
+ - <span id="page-11-3"></span>Wenxuan Huang, Yu Zeng, Qiuchen Wang, Zhen Fang, Shaosheng Cao, Zheng Chu, Qingyu Yin, Shuang Chen, Zhenfei Yin, Lin Chen, et al. Vision-deepresearch: Incentivizing deepresearch capability in multimodal large language models. *arXiv preprint arXiv:2601.22060*, 2026b.
174
+ - <span id="page-11-1"></span>Aaron Hurst, Adam Lerer, Adam P Goucher, Adam Perelman, Aditya Ramesh, Aidan Clark, AJ Ostrow, Akila Welihinda, Alan Hayes, Alec Radford, et al. Gpt-4o system card. *arXiv preprint arXiv:2410.21276*, 2024.
175
+ - <span id="page-11-14"></span>Bohao Li, Yuying Ge, Yi Chen, Yixiao Ge, Ruimao Zhang, and Ying Shan. Seed-bench-2-plus: Benchmarking multimodal large language models with text-rich visual comprehension. *arXiv preprint arXiv:2404.16790*, 2024a.
176
+ - <span id="page-11-0"></span>Xiaotong Li, Fan Zhang, Haiwen Diao, Yueze Wang, Xinlong Wang, and Lingyu Duan. Densefusion-1m: Merging vision experts for comprehensive multimodal perception. *Advances in Neural Information Processing Systems*, 37:18535–18556, 2024b.
177
+ - <span id="page-11-15"></span>Tsung-Yi Lin, Michael Maire, Serge Belongie, James Hays, Pietro Perona, Deva Ramanan, Piotr Dollar, and C Lawrence Zitnick. Microsoft coco: Common objects in context. In ´ *European Conference on Computer Vision*, pp. 740–755. Springer, 2014.
178
+ - <span id="page-11-11"></span>Pan Lu, Hritik Bansal, Tony Xia, Jiacheng Liu, Chunyuan Li, Hannaneh Hajishirzi, Hao Cheng, Kai-Wei Chang, Michel Galley, and Jianfeng Gao. Mathvista: Evaluating mathematical reasoning of foundation models in visual contexts. *arXiv preprint arXiv:2310.02255*, 2023.
179
+ - <span id="page-11-9"></span>Xiaoxiao Ma, Haibo Qiu, Guohui Zhang, Zhixiong Zeng, Siqi Yang, Lin Ma, and Feng Zhao. Stage: Stable and generalizable grpo for autoregressive image generation. *arXiv preprint arXiv:2509.25027*, 2025.
180
+ - <span id="page-11-13"></span>Minesh Mathew, Viraj Bagal, Ruben Tito, Dimosthenis Karatzas, Ernest Valveny, and CV Jawahar. ` Infographicvqa. In *Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision*, pp. 1697–1706, 2022.
181
+ - <span id="page-11-12"></span>Fanqing Meng, Lingxiao Du, Zongkai Liu, Zhixiang Zhou, Quanfeng Lu, Daocheng Fu, Botian Shi, Wenhai Wang, Junjun He, Kaipeng Zhang, et al. Mm-eureka: Exploring visual aha moment with rule-based large-scale reinforcement learning. *CoRR*, 2025.
182
+ - <span id="page-11-4"></span>Yaning Pan, Qianqian Xie, Guohui Zhang, Zekun Wang, Yongqian Wen, Yuanxing Zhang, Haoxuan Hu, Zhiyu Pan, Yibing Huang, Zhidong Gan, et al. Mt-video-bench: A holistic video understanding benchmark for evaluating multimodal llms in multi-turn dialogues. *arXiv preprint arXiv:2510.17722*, 2025.
183
+ - <span id="page-11-2"></span>Yukun Qi, Yiming Zhao, Yu Zeng, Xikun Bao, Wenxuan Huang, Lin Chen, Zehui Chen, Jie Zhao, Zhongang Qi, and Feng Zhao. Vcr-bench: A comprehensive evaluation framework for video chain-of-thought reasoning. *arXiv preprint arXiv:2504.07956*, 2025.
184
+ {12}------------------------------------------------
185
+ - <span id="page-12-4"></span>Rafael Rafailov, Archit Sharma, Eric Mitchell, Christopher D Manning, Stefano Ermon, and Chelsea Finn. Direct preference optimization: Your language model is secretly a reward model. *Advances in Neural Information Processing Systems*, 36:53728–53741, 2023.
186
+ - <span id="page-12-6"></span>Qingnan Ren, Shiting Huang, Zhen Fang, Zehui Chen, Lin Chen, Lijun Li, and Feng Zhao. Adora: Training reasoning models with dynamic advantage estimation on reinforcement learning. *arXiv preprint arXiv:2602.10019*, 2026.
187
+ - <span id="page-12-3"></span>John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. Proximal policy optimization algorithms. *arXiv preprint arXiv:1707.06347*, 2017.
188
+ - <span id="page-12-5"></span>Zhihong Shao, Peiyi Wang, Qihao Zhu, Runxin Xu, Junxiao Song, Xiao Bi, Haowei Zhang, Mingchuan Zhang, YK Li, Yang Wu, et al. Deepseekmath: Pushing the limits of mathematical reasoning in open language models. *arXiv preprint arXiv:2402.03300*, 2024.
189
+ - <span id="page-12-10"></span>Guangming Sheng, Chi Zhang, Zilingfeng Ye, Xibin Wu, Wang Zhang, Ru Zhang, Yanghua Peng, Haibin Lin, and Chuan Wu. Hybridflow: A flexible and efficient rlhf framework. *arXiv preprint arXiv: 2409.19256*, 2024.
190
+ - <span id="page-12-15"></span>Amanpreet Singh, Vivek Natarajan, Meet Shah, Yu Jiang, Xinlei Chen, Dhruv Batra, Devi Parikh, and Marcus Rohrbach. Towards vqa models that can read. In *Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition*, pp. 8317–8326, 2019.
191
+ - <span id="page-12-7"></span>Jingqi Tong, Jixin Tang, Hangcheng Li, Yurong Mou, Ming Zhang, Jun Zhao, Yanbo Wen, Fan Song, Jiahao Zhan, Yuyang Lu, et al. Code2logic: Game-code-driven data synthesis for enhancing vlms general reasoning. *arXiv preprint arXiv:2505.13886*, 2025.
192
+ - <span id="page-12-14"></span>Shengbang Tong, Zhuang Liu, Yuexiang Zhai, Yi Ma, Yann LeCun, and Saining Xie. Eyes wide shut? exploring the visual shortcomings of multimodal llms. In *Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition*, pp. 9568–9578, 2024.
193
+ - <span id="page-12-2"></span>Qiuchen Wang, Ruixue Ding, Zehui Chen, Weiqi Wu, Shihang Wang, Pengjun Xie, and Feng Zhao. Vidorag: Visual document retrieval-augmented generation via dynamic iterative reasoning agents. *arXiv preprint arXiv:2502.18017*, 2025a.
194
+ - <span id="page-12-1"></span>Qiuchen Wang, Ruixue Ding, Yu Zeng, Zehui Chen, Lin Chen, Shihang Wang, Pengjun Xie, Fei Huang, and Feng Zhao. Vrag-rl: Empower vision-perception-based rag for visually rich information understanding via iterative reasoning with reinforcement learning. *arXiv preprint arXiv:2505.22019*, 2025b.
195
+ - <span id="page-12-0"></span>Qiuchen Wang, Shihang Wang, Yu Zeng, Qiang Zhang, Fanrui Zhang, Zhuoning Guo, Bosi Zhang, Wenxuan Huang, Lin Chen, Zehui Chen, et al. Vimrag: Navigating massive visual context in retrieval-augmented generation via multimodal memory graph. *arXiv preprint arXiv:2602.12735*, 2026.
196
+ - <span id="page-12-11"></span>Wenbin Wang, Liang Ding, Minyan Zeng, Xiabin Zhou, Li Shen, Yong Luo, Wei Yu, and Dacheng Tao. Divide, conquer and combine: A training-free framework for high-resolution image perception in multimodal large language models. In *Proceedings of the AAAI Conference on Artificial Intelligence*, volume 39, pp. 7907–7915, 2025c.
197
+ - <span id="page-12-8"></span>Xiyao Wang, Zhengyuan Yang, Chao Feng, Yongyuan Liang, Yuhang Zhou, Xiaoyu Liu, Ziyi Zang, Ming Li, Chung-Ching Lin, Kevin Lin, et al. Vicrit: A verifiable reinforcement learning proxy task for visual perception in vlms. *arXiv preprint arXiv:2506.10128*, 2025d.
198
+ - <span id="page-12-9"></span>Zifu Wang, Junyi Zhu, Bo Tang, Zhiyu Li, Feiyu Xiong, Jiaqian Yu, and Matthew B Blaschko. Jigsaw-r1: A study of rule-based visual reinforcement learning with jigsaw puzzles. *arXiv preprint arXiv:2505.23590*, 2025e.
199
+ - <span id="page-12-12"></span>Penghao Wu and Saining Xie. V?: Guided visual search as a core mechanism in multimodal llms. In *Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition*, pp. 13084–13094, 2024.
200
+ - <span id="page-12-13"></span>xAI. Grok-1.5 Vision Preview. < 2024.
201
+ {13}------------------------------------------------
202
+ - <span id="page-13-10"></span>Tian Xie, Zitian Gao, Qingnan Ren, Haoming Luo, Yuqian Hong, Bryan Dai, Joey Zhou, Kai Qiu, Zhirong Wu, and Chong Luo. Logic-rl: Unleashing llm reasoning with rule-based reinforcement learning. *arXiv preprint arXiv:2502.14768*, 2025a.
203
+ - <span id="page-13-11"></span>Yunfei Xie, Yinsong Ma, Shiyi Lan, Alan Yuille, Junfei Xiao, and Chen Wei. Play to generalize: Learning to reason through game play. *arXiv preprint arXiv:2506.08011*, 2025b.
204
+ - <span id="page-13-7"></span>Yi Yang, Xiaoxuan He, Hongkun Pan, Xiyan Jiang, Yan Deng, Xingtao Yang, Haoyu Lu, Dacheng Yin, Fengyun Rao, Minfeng Zhu, et al. R1-onevision: Advancing generalized multimodal reasoning through cross-modal formalization. *arXiv preprint arXiv:2503.10615*, 2025.
205
+ - <span id="page-13-8"></span>En Yu, Kangheng Lin, Liang Zhao, Jisheng Yin, Yana Wei, Yuang Peng, Haoran Wei, Jianjian Sun, Chunrui Han, Zheng Ge, et al. Perception-r1: Pioneering perception policy with reinforcement learning. *arXiv preprint arXiv:2504.07954*, 2025.
206
+ - <span id="page-13-14"></span>Xiang Yue, Yuansheng Ni, Kai Zhang, Tianyu Zheng, Ruoqi Liu, Ge Zhang, Samuel Stevens, Dongfu Jiang, Weiming Ren, Yuxuan Sun, et al. Mmmu: A massive multi-discipline multimodal understanding and reasoning benchmark for expert agi. In *Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition*, pp. 9556–9567, 2024.
207
+ - <span id="page-13-0"></span>Yu Zeng, Yukun Qi, Yiming Zhao, Xikun Bao, Lin Chen, Zehui Chen, Shiting Huang, Jie Zhao, and Feng Zhao. Enhancing large vision-language models with ultra-detailed image caption generation. In *Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing*, pp. 26703–26729, 2025.
208
+ - <span id="page-13-3"></span>Yu Zeng, Wenxuan Huang, Zhen Fang, Shuang Chen, Yufan Shen, Yishuo Cai, Xiaoman Wang, Zhenfei Yin, Lin Chen, Zehui Chen, et al. Vision-deepresearch benchmark: Rethinking visual and textual search for multimodal large language models. *arXiv preprint arXiv:2602.02185*, 2026.
209
+ - <span id="page-13-4"></span>Guohui Zhang, Jiangtong Tan, Linjiang Huang, Zhonghang Yuan, Mingde Yao, Jie Huang, and Feng Zhao. Infoscale: Unleashing training-free variable-scaled image generation via effective utilization of information. *arXiv preprint arXiv:2509.01421*, 2025a.
210
+ - <span id="page-13-6"></span>Guohui Zhang, Hu Yu, Xiaoxiao Ma, Yaning Pan, Hang Xu, and Feng Zhao. Maskfocus: Focusing policy optimization on critical steps for masked image generation. *arXiv preprint arXiv:2512.18766*, 2025b.
211
+ - <span id="page-13-5"></span>Guohui Zhang, Hu Yu, Xiaoxiao Ma, JingHao Zhang, Yaning Pan, Mingde Yao, Jie Xiao, Linjiang Huang, and Feng Zhao. Group critical-token policy optimization for autoregressive image generation. *arXiv preprint arXiv:2509.22485*, 2025c.
212
+ - <span id="page-13-13"></span>Yi-Fan Zhang, Huanyu Zhang, Haochen Tian, Chaoyou Fu, Shuangqing Zhang, Junfei Wu, Feng Li, Kun Wang, Qingsong Wen, Zhang Zhang, et al. Mme-realworld: Could your multimodal llm challenge high-resolution real-world scenarios that are difficult for humans? *arXiv preprint arXiv:2408.13257*, 2024.
213
+ - <span id="page-13-2"></span>Yiming Zhao, Yu Zeng, Yukun Qi, YaoYang Liu, Lin Chen, Zehui Chen, Xikun Bao, Jie Zhao, and Feng Zhao. V2p-bench: Evaluating video-language understanding with visual prompts for better human-model interaction. *arXiv preprint arXiv:2503.17736*, 2025.
214
+ - <span id="page-13-12"></span>Yaowei Zheng, Richong Zhang, Junhao Zhang, Yanhan Ye, Zheyan Luo, Zhangchi Feng, and Yongqiang Ma. Llamafactory: Unified efficient fine-tuning of 100+ language models. *arXiv preprint arXiv:2403.13372*, 2024.
215
+ - <span id="page-13-9"></span>Ziwei Zheng, Michael Yang, Jack Hong, Chenxiao Zhao, Guohai Xu, Le Yang, Chao Shen, and Xing Yu. Deepeyes: Incentivizing" thinking with images" via reinforcement learning. *arXiv preprint arXiv:2505.14362*, 2025.
216
+ - <span id="page-13-1"></span>Jinguo Zhu, Weiyun Wang, Zhe Chen, Zhaoyang Liu, Shenglong Ye, Lixin Gu, Hao Tian, Yuchen Duan, Weijie Su, Jie Shao, et al. Internvl3: Exploring advanced training and test-time recipes for open-source multimodal models. *arXiv preprint arXiv:2504.10479*, 2025.
217
+ {14}------------------------------------------------
218
+ # APPENDIX
219
+ # <span id="page-14-1"></span>A DATA DISTRIBUTION
220
+ <span id="page-14-2"></span>As shown in Figure [6,](#page-14-2) our RL training corpus for jigsaw is derived from multiple sources, covering a diverse range of visual scenarios:
221
+ ![](_page_14_Figure_4.jpeg)
222
+ Figure 6: Distribution of jigsaw RL training data.
223
+ - High-resolution and visual search images (39.7%, 6.2K samples): To enhance the model's fine-grained perception in high-resolution images, we collect data from the VStar [\(Wu & Xie, 2024\)](#page-12-12) dataset, high-resolution natural scenes in DeepEyes [\(Zheng et al., 2025\)](#page-13-9), and selected samples from HRBench [\(Wang et al., 2025c\)](#page-12-11). This improves the model's ability to capture subtle visual cues and recognize small object attributes.
224
+ - Text recognition and structured scenes (33.3%, 5.2K samples): To strengthen the model's capacity for text perception and recognition, we include text-rich images from diverse domains, such as the TextVQA [\(Singh et al., 2019\)](#page-12-15) training set, InfoVQA [\(Mathew et al., 2022\)](#page-11-13) book covers and posters, as well as structured visual reasoning tasks involving tables and subject-specific charts [\(Yue et al., 2024;](#page-13-14) [Li et al., 2024a;](#page-11-14) [Chen et al., 2024b\)](#page-10-14).
225
+ - Dense natural and real-world scenes (26.9%, 4.2K samples): To enhance the model's recognition and understanding in complex and real-world environments, we collected images from COCO2017 [\(Lin et al., 2014\)](#page-11-15) and RealWorldQA [\(xAI, 2024\)](#page-12-13) datasets.
226
+ # <span id="page-14-0"></span>B PROMPTS
227
+ In this section, we present the prompt used to collect high-quality jigsaw trajectories, as illustrated in Figure [B.](#page-14-0) The same prompt is employed to prompt the Qwen2.5-VL-7B model during both the SFT and RL stages.
228
+ ### Prompt for Interactive Collection of High-Quality Jigsaw Trajectories
229
+ # System Prompt:
230
+ You are a skilled and experienced puzzle master. I will divide an image evenly into 2 × 2 grid, get 4 image blocks, and then shuffle them. The image blocks will be labeled A, B, C, and D. Initially, the image blocks are named and arranged in the following order:
231
+ ["A", "B", "C", "D"]
232
+ That is, the initial layout of the image blocks is as follows:
233
+ A B
234
+ C D
235
+ # Your Task:
236
+ {15}------------------------------------------------
237
+ Your goal is to reconstruct the original image by observing and analyzing the visual content between the image blocks. Pay attention to the details in each image block and establish visual connections between adjacent image blocks to achieve the goal of completing the puzzle correctly. For example:
238
+ - Continuity of text information: If the image contains text or logos, observe whether the text continues naturally between adjacent blocks (e.g., characters connect smoothly and the font direction is consistent). This is one of the key clues to determine whether the image blocks should be adjacent.
239
+ - Structure and shape consistency: Identify possible structural elements in the image (such as buildings, roads, object outlines, etc.), and infer which image blocks should be visually spliced together to form a complete and reasonable shape.
240
+ - Continuation of edge visual details: Observe the color, texture or pattern (such as sky, grass, lines or shadows) at the edge of the image block to determine whether it can be visually connected to the adjacent block naturally.
241
+ - Direction and angle consistency: Pay attention to the direction of image elements (such as human faces, object directions, text angles, etc.) to ensure the rationality of the overall visual direction of the image.
242
+ You can swap any two image blocks each time to achieve the correct layout.
243
+ ### Inference Process:
244
+ 1. State Representation: At each step, you need to maintain a "state" list representing current arrangement of image blocks.
245
+ Example:
246
+ ```
247
+ state = ["B", "C", "A", "D"]
248
+ ```
249
+ This corresponds to: Top left (index 0): B Top right (index 1): C Bottom left (index 2): A Bottom right (index 3): D
250
+ - 2. Visual Analysis: Carefully analyze the image patch content and visual details to determine the image patch location. To better complete the puzzle task, you can use additional image operations to enhance visual perception:
251
+ - Crop the image area of observation image to more closely observe the visual correlation between different regions in multiple image patches. Used to find clues during the puzzle or verify whether the puzzle is complete (For example: it looks like the puzzle is not completely fixed, maybe because of the lower left and upper right corners of observation image 2. I need to crop these two areas separately to get some visual information to further judge. First I will crop the lower left area <code>...</code>By observing the cropped lower left area, it shows that part of the text "OF H" may be related to the "appyness" text in the upper right corner. To further verify and manage, I will now crop the upper right image <code>...</code>. By observing the cropped image, I will swap image blocks B and C...)
252
+ - Zoom area to enlarge visual details (selectively observe the details of the cropped image).
253
+ These operations can help you make more informed decisions.
254
+ {16}------------------------------------------------
255
+ 3. Move Execution: After making a decision, generate a Python code snippet to swap tiles. Use the 'observation(state)' function to get the updated layout image for the next step.
256
+ ### Available Image Operations:
257
+ You can use the following Python functions to assist in inference:
258
+ 1. Crop a region from an image using normalized coordinates (from 0 to 1).
259
+ ```
260
+ crop_box = [x1, y1, x2, y2]
261
+ crop_image_{id} = crop(image, crop_box)
262
+ ```
263
+ 2. Zoom in an image by a specified factor (e.g., 1.5× zoom means 150% zoom).
264
+ ```
265
+ zoom_image_{id} = zoom(image, zoom_factor)
266
+ ```
267
+ 3. Swap tiles (e.g., top left and bottom left) and call observation function to see the jigsaw progress.
268
+ ```
269
+ state[0], state[2] = state[2], state[0]
270
+ observation_image_{id} = observation(state)
271
+ ```
272
+ Replace "id" with an integer to uniquely identify each operation result. The "image" parameter must point to an existing image (e.g., "observation image 1", "crop image 1", etc.).
273
+ ### Format:
274
+ All Python code must be enclosed in <code>...</code>tags.
275
+ All reasoning steps must be enclosed in <think>...</think>tags.
276
+ The final answer must be enclosed in <answer>...</answer>tags.
277
+ ## Important:
278
+ - 1. For both swap and image manipulation, always explain why you are doing this before generating code.
279
+ - 2. Stop as soon as you generate a code snippet. I will execute the code and return the generated image for the next step.
280
+ - 3. You can only perform one image operation or observation of the puzzle state per turn.
281
+ - 4. Final answer: When you are sure that the puzzle is fully reconstructed (all edges are aligned and the visual information is complete and continuous), return the final "state" list in the "<answer>" block.
282
+ - 5. Please pay close attention to the rationality of your cropping area and ensure that the cropped area is a reasonable criterion for completing the puzzle.
283
+ # User Prompt:
284
+ The four images are respectively labeled A, B, C, and D. Please complete the jigsaw.
285
+ Image A: <image>Image B: <image>Image C: <image>Image D: <image>
286
+ {17}------------------------------------------------
287
+ # C CASE STUDY
288
+ In Figures [7](#page-17-0) - [10,](#page-20-1) we present representative high-quality jigsaw trajectories collected to illustrate how our model performs reasoning and interacts with the environment. These cases specifically demonstrate: (1) how the model generates Python code to interact with the environment, such as swapping any two jigsaw pieces, observing jigsaw progress, and cropping/zooming in on regions for finer visual inspection; and (2) how the environment provides feedback that guides the model's subsequent reasoning.
289
+ <span id="page-17-0"></span>![](_page_17_Figure_3.jpeg)
290
+ Figure 7: Representative high-quality jigsaw trajectory case 1 (part 1).
291
+ {18}------------------------------------------------
292
+ ![](_page_18_Figure_1.jpeg)
293
+ Figure 8: Representative high-quality jigsaw trajectory case 1 (part 2).
294
+ {19}------------------------------------------------
295
+ ![](_page_19_Figure_1.jpeg)
296
+ Figure 9: Representative high-quality jigsaw trajectory case 2 (part 1).
297
+ {20}------------------------------------------------
298
+ <span id="page-20-1"></span>![](_page_20_Figure_1.jpeg)
299
+ Figure 10: Representative high-quality jigsaw trajectory case 2 (part 2).
300
+ # <span id="page-20-0"></span>D THE IMPLEMENTATION OF TRAINING
301
+ The detailed training hyperparameters are provided in Tables [4](#page-21-0) and [5,](#page-21-0) and all experiments are conducted on 8 NVIDIA A100 GPUs, each equipped with 80 GB of memory.
302
+ {21}------------------------------------------------
303
+ <span id="page-21-0"></span>Table 4: Key hyperparameters for SFT.
304
+ | Name | Value |
305
+ |------------------------------|--------|
306
+ | Finetuning type | Full |
307
+ | Freeze vision tower | True |
308
+ | Freeze multi-modal projector | True |
309
+ | Freeze language model | False |
310
+ | Cutoff len | 16384 |
311
+ | Image max pixels | 401408 |
312
+ | Epochs | 2.0 |
313
+ | Batch size | 32 |
314
+ | Gradient accumulation steps | 4 |
315
+ | Learning rate | 1.0e-5 |
316
+ | LR scheduler type | cosine |
317
+ | Warmup ratio | 0.1 |
318
+ Table 5: Key hyperparameters for RL.
319
+ | Name | Value |
320
+ |----------------------------|--------|
321
+ | Max turns | 5 |
322
+ | Rollout num | 8 |
323
+ | Train batch size | 64 |
324
+ | Mini batch size | 64 |
325
+ | Micro batch size per GPU | 2 |
326
+ | Learning rate | 2.0e-6 |
327
+ | KL loss coefficient | 0.0 |
328
+ | Total epochs | 1 |
329
+ | Max prompt length | 8192 |
330
+ | Single response max tokens | 2048 |
331
+ | Max response length | 20000 |
332
+ | GPU memory utilization | 0.7 |
333
+ # E ANALYSIS OF WANDB CURVES IN JIGSAW OPTIMIZATION
334
+ In this section, we present the training curves of our RL process and provide an analysis of the training dynamics. We monitor the evolution of rewards (including accuracy and format rewards), response length, number of interaction turns, and validation accuracy.
335
+ ![](_page_21_Figure_7.jpeg)
336
+ Figure 11: Visualization of Wandb curves in jigsaw RL optimization.
337
+ At the beginning of training, both validation accuracy and reward values are low, indicating that the model has very limited jigsaw-solving ability in the early stage. As training progresses, the number of interaction turns increases briefly, suggesting that the model explores more interactions (e.g., swapping tiles, cropping for observation) in order to achieve higher accuracy. With continued training, the reward values steadily increase, reflecting a stable improvement in jigsaw-solving capability through RL. After sufficient training, the model gradually reduces both the number of turns and response length, demonstrating enhanced perceptual and reasoning ability, such that it can solve jigsaw correctly with fewer interactions.
338
+ {22}------------------------------------------------
339
+ # F LIMITATIONS
340
+ Despite our best efforts, this work has several limitations. Multi-turn jigsaw interactions inevitably increase context length and introduce significant computational overhead. In the 3 × 3 setting, the context often exceeds the model's maximum window size, restricting our RL training to the 2 × 2 case. Future work could investigate more efficient interaction mechanisms with external environments or integrate memory modules to mitigate context length constraints, thereby enabling RL training on larger and more complex jigsaw tasks.
341
+ # G QUALITATIVE ANALYSIS ON ATTENTION PATTERNS
342
+ To further verify that AGILE brings genuine improvements in perceptual and reasoning abilities rather than merely increasing benchmark scores, we conduct additional qualitative analyses on general downstream tasks. Specifically, we visualize the attention distributions of Qwen2.5-VL-7B before and after AGILE training. As shown in attention examples (Figure [12\)](#page-23-0), the original model often exhibits scattered and unstable attention allocation, focusing on large irrelevant regions when processing complex high-resolution scenes or fine-grained recognition tasks. This dispersed attention leads to unreliable reasoning and misinterpretation of critical visual evidence. In contrast, the AGILE-trained model shows significantly more concentrated attention on key visual elements, such as small objects, text regions, and structurally important areas. This improved focus enhances the model's ability to extract fine-grained cues and supports more reliable multimodal reasoning. These qualitative findings align with our quantitative gains across HRBench, VStarBench, and Real-WorldQA, suggesting that AGILE enhances fundamental perceptual mechanisms underlying general visual understanding.
343
+ # H WHICH TASKS CAN BENEFIT MORE FROM AGILE?
344
+ Beyond overall benchmark gains, we analyze the types of perceptual and reasoning skills most enhanced by AGILE:
345
+ - Fine-grained recognition. These tasks require high precision in identifying subtle visual cues, such as detecting small objects, recognizing text, or distinguishing fine-grained visual differences. AGILE enhances the model's ability to focus on the most critical visual elements, improving its sensitivity to subtle but important features and thereby boosting fine-grained recognition performance.
346
+ - Spatial relation reasoning. Benchmarks such as VStarBench contain a substantial number of questions involving spatial positional reasoning. AGILE's interaction-driven training helps the model better attend to spatial layouts and contextual relationships within a scene, substantially improving its ability to understand and reason about complex spatial arrangements. This capability transfers effectively to real-world spatial reasoning tasks.
347
+ - Visual–textual integration. AGILE also leads to notable improvements in tasks requiring the integration of visual and textual information. Tasks involving reading product details, interpreting signs, or extracting structured information from charts benefit from AGILE's strengthened ability to jointly process textual cues grounded in visual context.
348
+ # I HANDLING INVALID CODE EXECUTIONS
349
+ During reinforcement learning, the model may generate malformed or invalid code. Instead of discarding such rollouts, the environment executes the code and returns explicit error messages to the model. These erroneous interactions increase the total number of steps required to reach the correct solution and thus naturally lead to lower step rewards under our reward formulation (Eq. [5](#page-5-2) and Eq. [6\)](#page-5-0). As a result, invalid code is implicitly penalized, encouraging the model to generate valid actions and interact more efficiently. This design stabilizes training without requiring complex filtering mechanisms.
350
+ {23}------------------------------------------------
351
+ <span id="page-23-0"></span>![](_page_23_Figure_1.jpeg)
352
+ Figure 12: Comparison of Attention Maps Before and After AGILE Training. Warm colors indicate higher attention; cool colors indicate lower attention.
353
+ # J ADDITIONAL EXPERIMENTS
354
+ ### J.1 SENSITIVITY TO REWARD COEFFICIENTS.
355
+ We further investigate the sensitivity of AGILE to the reward-weighting coefficients (α, β, and γ). As shown in Table [6,](#page-24-0) varying the values of α and β yields only minor fluctuations in performance, indicating that AGILE is robust to these parameters. In contrast, removing the step reward (γ) produces notable performance degradation, especially on VStarBench and MMVP. This finding ver
356
+ {24}------------------------------------------------
357
+ ifies that the step-penalty plays a critical role in encouraging efficient and meaningful interactions, preventing long, unfocused rollouts during RL.
358
+ <span id="page-24-0"></span>Table 6: **Ablation on Reward Coefficients.** Sensitivity analysis of the weighting coefficients $\alpha$ , $\beta$ , and $\gamma$ in the total reward.
359
+ | Model | MME-RW | RWQA | HRB4K | HRB8K | VStar | MMVP | BLINK | HalBench | MMMU | Avg. |
360
+ |---------------------------------------------|--------|------|-------|-------|-------|------|-------|----------|------|------|
361
+ | Qwen2.5-VL-7B | 44.6 | 68.5 | 68.8 | 65.3 | 76.4 | 74.3 | 56.4 | 50.1 | 54.8 | 62.1 |
362
+ | $\alpha = 0.8, \beta = 0.2, \gamma = 1.0$ | 48.4 | 70.2 | 73.0 | 70.5 | 80.6 | 78.0 | 58.0 | 51.9 | 55.8 | 65.2 |
363
+ | $\alpha = 0.8, \beta = 0.2, \gamma = 0.5$ | 49.2 | 69.7 | 72.8 | 69.8 | 78.5 | 79.0 | 57.5 | 50.8 | 55.8 | 64.8 |
364
+ | $\alpha = 0.8, \beta = 0.2, \gamma = 0.0$ | 47.4 | 71.1 | 72.4 | 69.8 | 78.5 | 75.3 | 56.7 | 52.8 | 55.6 | 64.4 |
365
+ | $\alpha = 0.9, \beta = 0.1, \gamma = 1.0$ | 48.9 | 70.8 | 73.3 | 69.6 | 79.1 | 78.0 | 57.5 | 51.4 | 55.1 | 64.9 |
366
+ ### J.2 RESULTS OF LARGER JIGSAW GRID SIZES AND CURRICULUM RL TRAINING
367
+ To further assess the scalability of AGILE beyond the $2\times 2$ jigsaw setting, we conduct an additional reinforcement learning stage on $8K\ 3\times 3$ jigsaw puzzles. This stage is applied after the initial $15.6K\ 2\times 2$ RL training, forming curriculum-style optimization principle. As shown in Table 7, training on $3\times 3$ jigsaw puzzles leads to further improvements across all 9 benchmarks. These results demonstrate that AGILE naturally generalizes to larger and more challenging jigsaw configurations when model capability allows, and further highlight that curriculum reinforcement learning on increasingly difficult grid sizes provides an effective path for continued scaling.
368
+ Table 7: Results of $3 \times 3$ Jigsaw RL Training.
369
+ <span id="page-24-1"></span>
370
+ | Model | MME-RW | RWQA | HRB4K | HRB8K | VStar | MMVP | BLINK | HalBench | MMMU | Avg. |
371
+ |-----------------------------------------------|--------|------|-------|-------|-------|------|-------|----------|------|------|
372
+ | Qwen2.5-VL-7B | 44.6 | 68.5 | 68.8 | 65.3 | 76.4 | 74.3 | 56.4 | 50.1 | 54.8 | 62.1 |
373
+ | + 15.6K 2×2 RL | 48.4 | 70.2 | 73.0 | 70.5 | 80.6 | 78.0 | 58.0 | 51.9 | 55.8 | 65.2 |
374
+ | + $15.6$ K $2 \times 2 + 8$ K $3 \times 3$ RL | 50.4 | 70.6 | 73.4 | 70.5 | 80.1 | 79.0 | 58.1 | 52.1 | 55.8 | 65.6 |
375
+ ### J.3 EXPERT TRAJECTORIES ABLATIONS
376
+ To disentangle the effect of expert cold-start trajectories and verify that AGILE's improvements are not merely due to distillation, we conducted additional experiments without any expert trajectories. Specifically, we performed RL directly on the 15.6K $2 \times 2$ jigsaw dataset under two conditions: (1) the full action space, and (2) an ablated action space with Crop/Zoom removed. The results show that even in the absence of expert supervision, AGILE still delivers a +1.8% improvement over the Qwen2.5-VL-7B baseline, demonstrating that the performance gain arises from agentic visual interaction combined with verifiable RL, rather than imitation of Gemini 2.5 Pro trajectories.
377
+ Table 8: Performance of RL without Gemini 2.5 Pro expert trajectories and with ablated action spaces.
378
+ | Model | MME-RW | RWQA | HRB4K | HRB8K | VStar | MMVP | BLINK | HalBench | MMMU | Avg. |
379
+ |-----------------------------|--------|------|-------|-------|-------|------|-------|----------|------|------|
380
+ | Qwen2.5-VL-7B | 44.6 | 68.5 | 68.8 | 65.3 | 76.4 | 74.3 | 56.4 | 50.1 | 54.8 | 62.1 |
381
+ | Cold-Start | 46.2 | 68.4 | 71.0 | 68.4 | 77.5 | 76.7 | 55.7 | 49.8 | 54.0 | 63.1 |
382
+ | Cold-Start + RL | 48.4 | 70.2 | 73.0 | 70.5 | 80.6 | 78.0 | 58.0 | 51.9 | 55.8 | 65.2 |
383
+ | Only RL (Full action space) | 46.3 | 69.5 | 71.5 | 68.1 | 78.5 | 79.0 | 56.3 | 53.2 | 53.1 | 63.9 |
384
+ | Only RL (No Crop/Zoom) | 46.2 | 69.3 | 71.9 | 68.0 | 78.0 | 78.3 | 53.7 | 52.8 | 53.3 | 63.5 |
385
+ Furthermore, removing the Crop/Zoom operations leads to a clear decline in performance, underscoring the importance of AGILE's interaction design in enabling effective fine-grained perceptual reasoning.
386
+ # J.4 GENERAL QA DATASET DETAILS AND EXTENDED COMPARISON WITH JIGSAW TRAINING
387
+ We provide additional clarification regarding the composition of the general QA dataset. Our 20K QA corpus is constructed entirely from high-resolution, real-world visual scenes, consisting of 15K samples from DeepEyes (Zheng et al., 2025) and 5K samples from MMEureka (Meng et al., 2025).
388
+ {25}------------------------------------------------
389
+ <span id="page-25-0"></span>Table 9: Comparison between General QA and Jigsaw-based RL under equal training budgets (20K).
390
+ | Model | MME-RW | RWQA | HRB4K | HRB8K | VStar | MMVP | BLINK | HalBench | MMMU | Avg. |
391
+ |-----------------------------|--------|------|-------|-------|-------|------|-------|----------|------|------|
392
+ | Qwen2.5-VL-7B | 44.6 | 68.5 | 68.8 | 65.3 | 76.4 | 74.3 | 56.4 | 50.1 | 54.8 | 62.1 |
393
+ | 20K General QA | 50.5 | 68.9 | 72.4 | 69.5 | 82.7 | 78.3 | 54.8 | 51.3 | 54.2 | 64.7 |
394
+ | 10K General QA + 10K Jigsaw | 51.6 | 69.8 | 73.0 | 70.6 | 81.7 | 79.0 | 57.3 | 51.2 | 55.7 | 65.5 |
395
+ | 20K Jigsaw-only | 48.5 | 70.5 | 73.6 | 70.5 | 80.1 | 77.3 | 57.7 | 52.1 | 53.8 | 64.9 |
396
+ These datasets span diverse perceptual and reasoning categories, including fine-grained attributes, spatial relationships, counting, and commonsense scene understanding.
397
+ Accordingly, the comparison between jigsaw training and QA training is inherently fair: both training regimes operate on high-resolution, real-world, and complex perceptual inputs. To further strengthen this comparison, we additionally include the 20K pure jigsaw setting. As shown in Table 9, jigsaw-based RL consistently outperforms high-resolution QA-based RL under the same training budget, demonstrating that AGILE's performance gains do not stem from differences in input resolution, but instead from the structured, verifiable, and spatially grounded training signal introduced by the jigsaw task.
398
+ ### J.5 IMPACT OF SCALING THE COLD-START (SFT) DATASET
399
+ To understand whether training longer or scaling up the supervised cold-start phase affects performance, we expand the cold-start dataset to $1.5 \times$ and $2 \times$ its original size and repeated all experiments. As shown in Table 10, enlarging the SFT dataset leads to only marginal differences, with no signs of overfitting or meaningful performance degradation.
400
+ <span id="page-25-1"></span>Table 10: **Effect of scaling the cold-start (SFT) dataset size.** Increasing SFT data provides only marginal differences, indicating that most performance gains come from the RL stage.
401
+ | Model | MME-RW | RWQA | HRB4K | HRB8K | VStar | MMVP | BLINK | HalBench | MMMU | Avg. |
402
+ |-------------------|--------|------|-------|-------|-------|------|-------|----------|------|------|
403
+ | Qwen2.5-VL-7B | 44.6 | 68.5 | 68.8 | 65.3 | 76.4 | 74.3 | 56.4 | 50.1 | 54.8 | 62.1 |
404
+ | Cold-start (1.6K) | 46.2 | 68.4 | 71.0 | 68.4 | 77.5 | 76.7 | 55.7 | 49.8 | 54.0 | 63.1 |
405
+ | +RL | 48.4 | 70.2 | 73.0 | 70.5 | 80.6 | 78.0 | 58.0 | 51.9 | 55.8 | 65.2 |
406
+ | Cold-start (2.4K) | 46.2 | 68.9 | 71.4 | 68.8 | 77.0 | 76.0 | 57.8 | 50.2 | 54.0 | 63.4 |
407
+ | +RL | 48.4 | 69.8 | 73.0 | 69.9 | 78.5 | 79.0 | 57.7 | 50.5 | 56.3 | 64.8 |
408
+ | Cold-start (3.2K) | 46.5 | 67.8 | 71.4 | 68.8 | 77.0 | 76.7 | 58.1 | 49.2 | 53.3 | 63.2 |
409
+ | +RL | 47.1 | 70.1 | 73.0 | 70.5 | 79.6 | 78.3 | 57.2 | 50.5 | 55.7 | 64.7 |
410
+ In practice, the cold-start stage serves a very specific purpose: teaching the model the tool-use pattern (i.e., how to invoke the predefined Python APIs). Its goal is not to solve the jigsaw task fully. Consequently, the model's performance is largely unaffected by moderate expansions of the SFT set. The primary source of generalization and performance improvement comes from the interactive RL stage, where the model learns to solve jigsaw puzzles through real environment feedback rather than through imitation.
411
+ ### K USE OF LLMS
412
+ Yes. We use LLMs solely to assist in language polishing and improving readability. All technical content, experiments, and analyses are conducted by the authors.