- Rating
- 2(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2(+1)
Read review
Paper summary
This paper proposes Thinking with Comics (TwC), a generate-then-reason pipeline in which an image generator converts a question (and, for visually grounded tasks, its visual premise) into a single composite image containing a sequence of comic panels. The original question and generated comic are then provided to a multimodal language model to produce the final answer. The authors position comics between single images and videos: compared with a single image, comics can encode multiple states and temporal or causal structure; compared with video, they are intended to be less redundant and less expensive. The paper also introduces GutterBench, a 300-item benchmark with 200 text-centric and 100 vision-centric items spanning paper folding, die tipping, egocentric navigation, tile transformation, and gossip propagation. Items cover reasoning depths 2, 4, 6, and 8 and include final-state, counterfactual, and process-tally questions. In addition to final-answer accuracy, the benchmark uses gold storyboards and process metrics intended to measure state matching, order, and textual anchors. The main implementation uses Gemini-3 Pro Image to generate comics and Gemini-3 Pro to answer from them. The paper reports results on GutterBench and a broad collection of mathematical, document, cultural, spatial, and visual-puzzle benchmarks, as well as analyses of narrative style, panel count and order, generator choice, cross-model transfer, global versus incremental generation, and generation cost. The reported results show sizable gains over the paper's single-image and video baselines on several tasks, although TwC remains weak on pixel-precise tasks such as ARC-AGI-2 and non-square mazes.
Critical strengths
-
The paper identifies a novel and intuitively useful intermediate representation. Comics can combine discrete state transitions, spatial layout, and text in a compact artifact. This is a meaningful design space between a single generated image and a full video, and the paper explores it across an unusually broad set of tasks and analysis dimensions.
-
GutterBench is potentially a useful process-oriented contribution. The benchmark covers five controlled state-transition families, two input tracks, four depths, and multiple query types, and it includes gold storyboards rather than evaluating only final answers. The reported human verification, inter-annotator agreement, human ceiling, and template/leakage controls are valuable. If the benchmark, generator, prompts, and scoring code are released as promised, this component could support future work independently of the current TwC claims.
Critical weaknesses
-
The method presupposes the difficult reasoning capability that it claims to provide. Generating a correct comic requires selecting the right intermediate states, arranging them causally, maintaining their consistency, and often displaying the final answer. If the generator succeeds, the downstream VLM is effectively reading a compact worked solution; if it fails, the representation can propagate or amplify the error. The paper does not measure this upstream faithfulness or compare against the generator's direct answer. Thus, the experiments demonstrate the usefulness of an already-correct intermediate solution, not comics as a general method for improving VLM reasoning.
-
The paper does not identify what is essential about the representation, so the claim of a general comic-based reasoning paradigm is too strong. Comics simultaneously add discrete state decomposition, ordering, textual anchors, visual grouping, narrative cues, and often the answer itself. The existing ablations do not hold semantic content fixed across media, so they cannot show that the comic format is responsible for the gain. The more fundamental hypothesis may be that a sparse, ordered, multimodal state representation helps certain tasks. Establishing that hypothesis would require content-matched comparisons with numbered text, tables or state graphs, diagrams, and image sequences, plus a characterization of which task structures admit faithful compression. The current theory assumes rather than explains this compression and contains invalid derivational steps.
Questions for authors
-
Before invoking the downstream VLM, how often does the generated comic already contain a correct final answer and a faithful sequence of intermediate states? Please report comic-level state/answer correctness and downstream accuracy conditioned on comic correctness. How does the same generator perform when asked to return a direct answer or a concise structured textual state trace instead of a comic?
-
Can the authors compare content-matched representations by first fixing one intermediate trace and then rendering exactly that trace as (i) numbered text, (ii) a table or state graph, (iii) an unstructured image sequence, and (iv) a comic? What remains of the gain when the final answer and answer-bearing text are masked in every condition?
-
What is the intended task class for which generating a faithful comic is easier or more reliable than directly solving the task? Can the authors formulate the relevant structural property—for example, a small number of discrete state transitions—and report results stratified by whether tasks satisfy it? The current failures on pixel-precise tasks suggest an important limitation to the claimed generality.
-
Can the authors reformulate the theory around the actual bottleneck, the construction of a faithful compressed state representation, rather than assuming that the comic generator selects the relevant states? Please also correct Equation (6), justify any conclusion drawn from the domain-adaptation bounds, and reconcile the efficiency factors reported in Figure 5 with the underlying TFLOPs, latency, and prices.