- Rating
- 3
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper analyzes sequential computation in flow-matching samplers. Under boundedness, Lipschitz, precision, and acceptance-margin assumptions, it simulates vanilla sampling with a constant number of parallel evaluation rounds. Feeding endpoint predictions back into subsequent calls removes this restriction in a constructive expressivity result. Experiments compare vanilla and self-conditioned models on synthetic tasks and structured visual reasoning.
Critical strengths
The paper gives a substantive computational interpretation of self-conditioning. An explicit prediction state can change substantially between calls, whereas the ordinary sampler state evolves through small integration increments. The Picard simulation and Turing-machine construction formalize this distinction under stated assumptions. This contributes a useful theoretical perspective on an existing mechanism.
The controlled empirical gains are substantial and account for important compute differences. The five-task average rises from 65.9% to 76.7%; three-seed line-tracing and multiplication results support the trend. Training comparisons account for the extra self-conditioning pass and longer inputs, and the appendix includes inference-FLOP comparisons (Tables 1–2; Appendices D.1–D.3). This makes the practical contribution credible beyond equal-NFE comparisons.
Critical weaknesses
The upper bound does not quantitatively explain saturation at the tested small sampling budgets. Lemma 1 requires O(L) parallel rounds, while empirical Lipschitz estimates are around 400, reaching 580, and are local search estimates rather than certified global bounds. The asymptotic result remains interesting, but its constants and assumptions limit its use as a finite-budget explanation. This distinction should be maintained consistently in the introductory and concluding claims.
The connection between complexity classes and learned behavior needs a narrower interpretation. Long multiplication and text rendering are TC0-complete, so success on them does not demonstrate computation beyond a TC0 upper bound. The relevant TC0 separation for line tracing is conjectural, and finite-size accuracy does not establish asymptotic separation. Likewise, an existence construction for self-conditioned models does not establish that training learns that mechanism. These qualifications affect the explanatory claims, although they do not negate the empirical advantage.
Questions for authors
Given the measured magnitude of L, what finite-budget prediction follows from the theorem, if any? Can the distinction between an asymptotic expressivity result and an explanation of low-NFE saturation be made explicit?
Which task results are intended to test the AC0 barrier and which the conjectured TC0 barrier, given the actual backbone implementations? Please avoid treating TC0-complete arithmetic or text rendering as evidence of surpassing TC0.
Do the trained models retain the advantage on held-out longer line-tracing instances? If existing results only cover m = 50, please state that scope explicitly rather than equating interpolation accuracy with scaling of sequential complexity.
Response to 7Mx9
Thank you for your careful reading and constructive feedback. Below we address your concerns point by point.
W1&Q1 (Asymptotic upper bound vs. low-NFE saturation) Thanks. Regarding local search estimates versus certified global bounds, we acknowledge this limitation in Section 6 (lines 501–502). Meanwhile, simulating a trajectory x0,…,xK in our theory only requires Lipschitzness with respect to the trajectory: ∥u(xi′,ti;w)−u(xi,ti;w)∥∞≤L∥xi′−xi∥∞ for all xi′∈Fbn, or more specifically, only at the Picard iterates xi′=yi(r). We state global Lipschitzness in Theorem 1 for conciseness. Probing L across multiple scales around the real trajectories in Appendix D.5.2 thus provides a useful estimate of this requirement (Appendix A.2.4, lines 1247–1255).
Regarding Q1, Theorem 1 bounds worst-case error accumulation, which rarely occurs in trained models. Thus, L≈400 supports the asymptotic separation (as L levels off with m) rather than yielding a finite-budget prediction for VanillaFM's low-NFE saturation. We have made this distinction between our asymptotic expressivity result and low-NFE saturation explicit in Section 6 (lines 502–506) and Appendix D.5.2, and maintained it in our introductory and concluding claims in Section 1 (line 041) and Section 7 (line 515).
Moreover, in an empirical Picard simulation on line tracing, the Lipschitz constant between the Picard iterates and the trajectory, LPicard:=maxi,r∥u(yi(r),ti;w)−u(xi,ti;w)∥∞/∥yi(r)−xi∥∞, is only 17.9, and 12 rounds suffice to reproduce the line coloring of 100-NFE VanillaFM. Taken together, LPicard≈18, the 12 Picard rounds needed to simulate VanillaFM, and VanillaFM's early saturation (around NFE=6 with an LCP of ~8) are all of a similar order of magnitude.
W2 (Narrower interpretation of complexity classes and learned behavior) Thanks. We agree with these qualifications: the TC⁰ versus NC¹ separation remains conjectural (Section 3.3, lines 297–298), finite-size accuracy provides empirical support rather than an asymptotic proof, and Theorem 2 is an existential construction rather than a guarantee on what gradient training learns. We have made these points explicit in Section 4.2 (lines 342–347) and Section 6 (lines 508–510).
Q2 (Correspondence between task complexity, backbones, and learned behavior) Thanks. Multiplication and text rendering are TC⁰-complete and test the AC⁰ barrier, whereas line tracing is NC¹-complete and tests the conjectured TC⁰ barrier. We do not treat the TC⁰-complete tasks as evidence of surpassing TC⁰, and we have clarified this in Section 4.2 (lines 342–347) and Appendix D.1 (lines 2172–2189).
Since practical implementations use fixed hardware precision (in our experiments, BF16 activations and FP32 accumulation/reduction) on finite problem sizes, it is hard to say whether this precision should be treated as constant or logarithmic relative to the problem size, and thus whether a practical backbone strictly corresponds to AC⁰ (constant precision) or TC⁰ (logarithmic precision). Instead, our theoretical result serves as a mathematical modeling of practical flow matching. This modeling yields useful insights: it suggests that in many cases, SelfCondFM can enable deeper sequential reasoning than VanillaFM. We use this insight to guide our experimental design and empirically validate this advantage.
Prior works have similarly modeled constant-depth Transformers as both AC⁰ (Li et al., 2024; Svete et al., 2026) and TC⁰ (Merrill & Sabharwal, 2023; Chiang, 2025; Chen et al., 2025). In general, lower precision is regarded as closer to AC⁰ and higher precision as closer to TC⁰. This modeling has yielded useful conclusions, such as Chain-of-Thought enabling constant-depth Transformers to solve inherently serial problems (Feng et al., 2023; Merrill & Sabharwal, 2024; Li et al., 2024). Following Li et al. (2024), our experiments therefore include tasks for both barriers.
Q3 (Held-out longer line-tracing instances) Thanks. In Figure 3 of Section 4.2, we intended to test the in-distribution capability of the two models at m=50 by varying NFE, rather than OOD generalization to longer instances. For NFE > 10, the flat curve reflects the m=50 instance ceiling, and we have explicitly stated this m=50 scope in Section 4.2 (lines 371–387).
Nevertheless, we also added an evaluation on held-out longer line-tracing instances in Section 4.2 (lines 387–390) and Appendix D.3 (Figure 12 of the latest version). Although trained only on m=50, SelfCondFM retains its advantage and generalizes to a mean LCP of ~65 when evaluated on m>50, which demonstrates an interesting OOD scaling capability of SelfCondFM.
Thank you again for your thoughtful feedback. We look forward to our further discussions!