- Rating
- 2
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes SkiLa, a framework for training interleaved latent visual reasoning with segments of continuous "latent sketch tokens". Training follows the SFT -> masked GRPO, which only supervises the discrete tokens.
Critical strengths
I don't particularly feel there are critical strengths. The idea of latent visual reasoning is already explored in previous works like LVR, Monet, ILVR etc. This paper is quite similar to prior works without notable novelty.
Critical weaknesses
- I think the novelty is quite constrained compared to previous LVR works. One contribution that the paper claims is the multi-segment text and visual reasoning, which is also present in prior work (ILVR). The masked GRPO is also not new. Therefore, I am not clear about the actual novelty of the paper.
- The main comparisons in Table 1 may not be fair: the previous works (LVR, Monet, CoVT) primarily adopt Qwen2.5-VL, whereas Skila uses Qwen3VL.
- Some ablations are missing: the effect on the number of text / visual segments, the latency/throughput comparisons (as efficiency is a main advantage proposed by the paper), the design choices over the supervision of visual tokens, etc.
Questions for authors
Please see weaknesses.
3 comments
Dear Reviewer XWQo,
Thank you again for your time and valuable feedback. As the discussion deadline approaches, we would like to follow up on our responses. If any concerns remain, or if we have misunderstood any aspect of your comments, please let us know. We would be glad to provide further clarification.
Sincerely,
The Authors
Dear Reviewer XWQo,
As the discussion period draws to a close, we would welcome any further feedback on our rebuttal and would be glad to address any remaining concerns. Thank you again for your time.
Sincerely,
The Authors
1. Contribution and Relation to Previous Latent Reasoning (W1)
The specific differences between SkiLa and prior methods are as follows.
1) Compared with LVR: different reasoning patterns and supervision targets. LVR's intermediate reasoning during SFT is supervised as latent-only visual reconstruction. SkiLa instead uses interleaved hybrid autoregressive reasoning, alternating discrete textual thoughts with continuous latent hidden states. Moreover, LVR reconstructs crop/ROI regions, whereas SkiLa supervises intermediate thinking images, such as maze paths and board states, extending region reconstruction to multi-step visual-state modeling.
2) Compared with Monet: direct joint supervision versus multi-stage distillation. Monet uses three-stage SFT (warm-up, observation-guided alignment, and latent distillation), followed by explicit latent optimization with VLPO. SkiLa uses external-encoder semantic reconstruction jointly with textual SFT, without a separate distillation stage, then implicitly constrains latent hidden states through final-answer rewards with masked GRPO.
3) Compared with ILVR: SFT + RL versus two-stage SFT. ILVR first uses a momentum teacher for visual-feature alignment, then performs latent relaxation under textual supervision; both stages are SFT. SkiLa first establishes semantic grounding through external-encoder supervision, then performs RL refinement using final-answer rewards.
In summary, SkiLa combines multi-step text–vision interleaved reasoning, explicit semantic supervision from intermediate thinking images, and implicit latent optimization through final-answer rewards, making visual thoughts both semantically grounded and useful for solving tasks.
2. Backbone Comparability (W2)
We add reproductions of LVR and Monet on Qwen3-VL-8B to directly compare different methods on the same backbone.
1) LVR with matched data and backbone. LVR and SkiLa use the same training data and Qwen3-VL-8B backbone. SkiLa already outperforms LVR on all four benchmarks after SFT, and leads by 2.7/3.6/4.0/4.3 percentage points after RL. Its supervision and reasoning design thus remain effective when data and backbone are controlled.
2) Monet with a matched backbone. Monet uses three-stage SFT with a different supervision construction from SkiLa; this reproduction therefore does not use SkiLa's training data. We reproduce Monet on the same Qwen3-VL-8B backbone. SkiLa leads by 1.1/3.0/2.2/3.2 percentage points across the four benchmarks, showing that its advantage is not solely due to a newer backbone.
3. Segments, Efficiency, and Visual Supervision (W3)
1) Visual-segment distribution. We count the visual reasoning turns in responses on HR8K and MMStar. On HR8K, 94.7% of examples use one turn; on MMStar, 88.33% use one or two turns, while other examples use zero or more turns. These distributions demonstrate variable visual reasoning depth across queries.
2) End-to-end inference efficiency. We compare end-to-end inference time over the complete evaluation sets on the same A100-80GB GPU. SkiLa reduces runtime by 40.3% and 45.7% on HR8K and MMStar, respectively. By directly feeding back continuous hidden states for visual reasoning rather than verbalizing intermediate visual thoughts step by step, SkiLa achieves practical efficiency gains.
3) Visual supervision design. The main text separately evaluates the sketch encoder, target-token count, and reconstruction weight. SigLIP2, 27 target tokens, and a reconstruction weight of 0.1 perform best among the tested settings, supporting the combination of semantic features, a moderate reconstruction length, and a small reconstruction weight.