- Rating
- 3
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper proposes MintFlow, a training-free method for imposing constraints on samples from a pretrained flow-matching model. It perturbs an intermediate state, then continues generation using the original velocity field. For a chosen intervention time, it linearizes the terminal constraint and computes the minimum-norm correction satisfying the linearized constraint via the adjoint method. MintFlow then selects an intervention time by balancing correction magnitude against remaining integration time, and optionally repeats the correction. On downstream tasks including image reconstruction, image editing, and physical systems, MintFlow consistently improves performance while maintaining low sampling cost.
Critical strengths
- The paper provides a clear and useful formulation for general constrained generative modeling. The method directly addresses the contention between satisfying constraints and retaining plausible samples. Reusing a frozen model makes the approach practically attractive.
- The proposed approach enjoys a coherent theoretical justification. Under some assumptions, the residual bound and Wasserstein stability bound appear sound. These explain why small, sensitivity-aware corrections can be useful.
- Experiments covered in this paper span multiple domains with consistent reported gains. The evaluation covers image restoration, editing, learned image constraints, and two PDE systems. Cost comparison also makes this work competitive compared to existing gradient-based approaches.
Critical weaknesses
One practical assumption that the model adopts is that the base model is "rectified" enough for direct one-step extrapolation. However, this is not always available:
- Even the most rectified model still requires tens of sampling steps for decent image generation quality. One-step generation remains harder unless the model is distilled.
- Not all generative base models have been rectified. Additionally, diffusion models may adopt non-OT paths. The paper must consider accommodating these base models.
This will impact both the theoretical guarantees and practical performance.
Questions for authors
- Is it possible to adopt the same approach to different flow/diffusion probability paths? Specifically, can you accommodate diffusion paths like those used in EDM that achieve strong image-generation performance?
- Should one-step extrapolation still be used for these probability paths, how much will it affect the theoretical results?
- The proposed approach applies to differentiable constraints pretty well. Can it be extended to non-differentiable rewards?
4 comments
I thank the authors for their response. One of my concerns remains.
For rectified paths, the authors' interpretation is incorrect. The OT path in the forward noising process never guarantees a straight path during sampling due to marginalization. Additionally, one-step extrapolation is not limited to flow models, as a curved diffusion path also enjoys an exact posterior. Therefore, my question is regarding the validity of one-step extrapolation, as there is no guarantee that such extrapolation will lead to decent predictions, especially in the early generation stages. I'd suggest the authors further justify the practical and theoretical validity in this sense.
Since the authors proposed an erroneous theoretical argument in their rebuttal that may undermine the overall correctness of the proposed method, I revised my score to 2 unless the authors justify the theoretical gap.
Author Response to Reviewer R9HL
We appreciate your prompt response and would like to address the remaining concerns point by point.
The OT path in the forward process never guarantees a straight path during sampling.
Dear Reviewer, thank you for your feedback. It appears there may be a slight misunderstanding regarding our proposed method. Our method does not assume that the RF sampling trajectory is exactly straight. Rather, the straight-path assumption is introduced only to simplify the computation of the minimal correction. Importantly, we do not use a single extrapolation to generate the final sample. Instead, the sampling process iteratively applies the estimated correction at each Euler step :
- Compute the minimal correction under the single-step extrapolation approximation.
- Apply the correction to obtain .
- Advance the corrected state by one Euler step with step size : .
- Repeat the procedure using as the reference state for computing the next correction.
Thus, the single-step extrapolation is used only to approximate the correction at each step, not to approximate the entire sampling trajectory as a straight path.
One-step extrapolation is not limited to flow models:
We do not claim that one-step extrapolation is a mathematical property exclusive to RF. MintFlow is applicable to general differentiable flow models, and its applicability is not restricted to RF or straight trajectories. In the RF setting, we utilize the one-step extrapolation solely to efficiently approximate the minimum-norm correction (see step 1 above). The same framework can also be applied to diffusion paths.
Validity of one-step extrapolation:
We agree that one-step extrapolation does not necessarily yield an exact correction for the terminal constraint. However, our algorithm does not use this approximation to directly generate the final sample. Instead, it uses the extrapolated endpoint only to estimate the correction (Step 2), applies this correction to the current state, and advances one Euler step before recomputing the correction from the updated state. Thus, the approximation is refined throughout the sampling process rather than being used only once.
Crucially, this iterative procedure can compensate for the error introduced by the correction obtained via one-step extrapolation. Since is computed from the updated state , it can account for the error left by . Moreover, the extrapolation becomes increasingly accurate as the remaining sampling time decreases, and coincides exactly with the final discrete Euler transition at the last step. We further characterize the propagation of approximation errors through this iterative procedure in Theorem A.4 of the revised manuscript. Under appropriate regularity and local convergence assumptions, we establish a bound on the final constraint residual, showing that finer Euler discretization (smaller ) reduces terminal constraint violation. This theoretical result is also supported by our experiments in Appendix H.3, where increasing the number of RF sampling steps improves image editing performance.
We have clarified these distinctions and strengthen the discussion of the theoretical and practical validity of one-step extrapolation in the revised manuscript.
Theoretical gap:
We thank the reviewer for raising this concern. However, we are not entirely sure which specific theoretical argument in our previous rebuttal is considered erroneous. Based on the preceding comments, we understood the main concern to be the validity of one-step extrapolation.
To address this concern, we have further developed our theoretical analysis and introduced a new convergence result in Theorem A.4. This result explicitly characterizes the propagation of approximation errors through successive corrections and establishes a bound on the final constraint residual, without assuming straight marginal sampling trajectories.
We acknowledge that a more comprehensive theoretical justification of our RF-specific formulation remains an important direction for future work. Nevertheless, our theoretical analysis, together with the experimental results, provides evidence that using one-step extrapolation to estimate perturbations can lead to an effective iterative correction procedure in practice, despite the approximation involved.
We hope this additional analysis addresses the reviewer's concern. If a different theoretical gap was intended, we would greatly appreciate further clarification so that we can address it directly.
Response to Reviewer R9HL
We thank the reviewer for raising this concern. We would like to clarify that MintFlow does not require the base generative model to exhibit rectified or approximately linear trajectories. Both our methodological formulation and theoretical analysis are developed for general differentiable flow models, including nonlinear flows, and compute intervention sensitivities through the adjoint-based formulation without assuming linear transport.
A key advantage of MintFlow is its applicability across diverse flow models. This broader applicability is also demonstrated in our experiments (Table 4): we apply MintFlow to conventional flow matching models for image generation (Appendix D) and functional flow matching models for physics-informed generation (Section 4.3), neither of which relies on the one-step approximation.
When the model is rectified flow (RF) which were used in image inverse problems (Section 4.1) and image editing (Section 4.2), its linear structure provides an additional computational advantage, rather than restricting the applicability of MintFlow to rectified flows. The one-step endpoint approximation discussed in Appendix A.4 is a computational simplification specific to RF models, exploiting their approximately linear transport property. It is not an assumption required by the general MintFlow framework, and thus does not restrict its applicability to other flow models.
In the revised manuscript, we have elaborated on the RF-specific computational simplification in Appendix A.4 and Algorithm 3. We have also clarified which experiments use RF and which use other flow models at the beginning of Appendix B.
MintFlow is formulated for general ODE-based generative models and does not rely on a specific probability path or rectified transport. We have demonstrated its applicability across diverse flow models, including conventional flow matching, functional flow matching, rectified flow, and latent text-guided rectified flow. In particular, our experiments with conventional and functional flow matching demonstrate that MintFlow also applies effectively to nonlinear flow trajectories.
In principle, the same framework can be extended to diffusion models through their probability flow ODEs, including those associated with EDM, by computing the corresponding flow sensitivities using our adjoint-based formulation. While a systematic evaluation across additional diffusion backbones and probability paths is beyond the scope of this work, our extensive experiments across diverse models, datasets, and tasks (see Table 4) already demonstrate the broad applicability of MintFlow. We consider further extending its evaluation to a wider range of diffusion-based generative models an interesting direction for future work.
We would like to clarify that the methodology and theoretical analysis in the main manuscript are developed for general ODE-based flow models and do not assume one-step extrapolation. In particular, all theoretical guarantees are derived based on the general flow dynamics, without imposing any one-step approximation.
We thank the reviewer for this question. Our current theoretical formulation assumes that the constraint function H is differentiable, as the minimum-norm correction is derived through a first-order Taylor expansion of the terminal constraint. However, the framework can also accommodate piecewise-differentiable constraints when the terminal state lies in a differentiable region. At points of nondifferentiability, using subgradients may provide a practical extension, but the validity of the resulting linearization and theoretical guarantees requires further investigation. More generally, techniques from constrained optimal control that accommodate nonsmooth constraints may provide another promising direction for extending our framework. A systematic extension to nonsmooth constraints is already identified as an important direction for future research in our Conclusion.
In this work, we focus on differentiable constraints, a setting that already encompasses a broad range of important applications, including image generation, image inverse problems, image editing, and physics-informed generation. We demonstrate the applicability of MintFlow across all these settings in our experiments.