- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper proposes ConicFlow, an inference-time optimal control framework for guiding pretrained flow matching models toward high-reward samples while satisfying hard terminal constraints. The method introduces two receding-horizon strategies, RH-H and RH-T, and employs primal-dual optimization to balance reward maximization, constraint satisfaction, and control energy. The authors provide theoretical analyses of discretization, horizon approximation, and convergence, along with experiments on 2D synthetic data and FLUX.1-dev image editing.
Critical strengths
- The paper addresses an important problem in controllable generation by jointly considering reward optimization, hard terminal constraints, and minimal intervention in pretrained flow matching models.
- The proposed receding-horizon framework provides a structured approach to inference-time control, while the RH-T strategy leverages terminal flow-map predictions to incorporate information beyond the truncated optimization horizon.
- The experiments demonstrate improvements in reward–control energy trade-offs and report high feasibility rates under the specified constraints, suggesting the potential of optimal control for guiding pretrained generative models.
Critical weaknesses
- The theoretical guarantees rely on strong assumptions that are not established in practice:
- Assumption 2 requires affine flow dynamics, whereas FLUX.1-dev employs a nonlinear neural velocity field.
- Assumption 3 requires concave rewards and convex constraints, but these properties are not guaranteed for CLIP Score, ImageReward, or PickScore-based constraints.
While such assumptions do not necessarily invalidate the method, more extensive experiments and failure-case analyses are needed to demonstrate its practical effectiveness. The paper devotes substantial attention to idealized theoretical guarantees but provides comparatively limited empirical validation.
- Much of the analysis builds on established techniques from numerical optimal control, model predictive control, and convex optimization. The paper would benefit from deeper theoretical insights specific to the proposed framework, such as:
- Does RH-T retain its advantages under nonlinear flow dynamics?
- How do learned flow-map approximation errors affect feasibility?
- Does convergence hold under inexact primal optimization?
- How does constraint feasibility affect dual convergence?
- High inference-time computational cost. Backpropagation through a large generative model such as FLUX is computationally expensive. ConicFlow requires over five minutes per image, approximately 7–14× slower than HardFlow, limiting its practical scalability.
- The experiments focus on generated-image editing without evaluating real-image editing. The authors could extend the framework through image inversion and compare against FlowEdit [1], FlowAlign [2], and ChordEdit [3] on MagicBrush [4] and PIE-Bench [5], considering editing accuracy, content preservation, and computational cost.
- Limited experimental scale. The unconstrained image-editing experiments evaluate only four prompt–seed pairs per reward, which is insufficient to establish robust performance across diverse prompts and generation settings.
Suggestion: Improve the balance between theory and experiments. Consider moving detailed theoretical derivations to the appendix, retaining concise theorem statements and key insights in the main paper, and allocating more space to empirical validation.
[1] https://arxiv.org/abs/2412.08629
[2] https://arxiv.org/abs/2505.23145
[3] https://arxiv.org/abs/2602.19083
[4] https://arxiv.org/abs/2306.10012
[5] https://arxiv.org/abs/2310.01506
Questions for authors
- Can the authors provide independent evaluation metrics to distinguish genuine improvements in generation quality and semantic constraint satisfaction from potential reward overoptimization?
- Could the authors consider additional applications, such as image restoration with comparisons to gradient-based methods (e.g., PnP-Flow [1], FlowDPS [2]), or robotic control tasks, where the proposed framework may offer practical advantages?
[1] https://arxiv.org/abs/2410.02423
[2] https://arxiv.org/abs/2503.08136
3 comments
Thank you for the detailed rebuttal and additional experiments. I appreciate the authors' efforts in addressing my concerns. I will adjust my score.
We thank the reviewer for reading and responding to our rebuttal. We hope that our responses have addressed the main concerns and would appreciate it if the reviewer could reconsider their assessment accordingly.
Response to Reviewer MfB8
We thank the reviewer for recognizing the paper's strengths. We expanded our results to over 3× the original experimental instances, harder constraints, additional baselines, and independent evaluation. All new results appear on rebuttal p. 10 (Figs. 4–6), with protocols and examples at the beginning of Appendix A. Tables R1–R5 refer to our general response to all reviewers and the AC.
We expanded to 54 constrained prompt pairs, jointly imposing PickScore, CLIP, and ImageReward constraints at three increasing thresholds (Table R1; Fig. 5). ConicFlow's advantage persists across this substantially larger and harder evaluation: higher joint feasibility, lower violation of each constraint, and 4.5×–54.5× less mean control energy than HardFlow. Appendix A.1 reports lower violation in all 162 paired comparisons. At the hardest threshold ConicFlow's feasibility drops, but it keeps lower violation at far less energy.
We further evaluate 24 unconstrained PIE-Bench prompt pairs against five baselines (Table R2; Fig. 6), with ConicFlow leading in both optimized reward and independent evaluation by Skywork-VL-Reward-7B. The trends from the original submission results thus persist at a greater scale.
Every edit in both studies is now evaluated by Skywork-VL-Reward-7B, which none of the methods optimizes. ConicFlow achieves the highest independent Skywork gain at every constrained threshold (Table R1) and among all unconstrained baselines (Table R2) supporting gains beyond the optimized metrics.
We agree the guarantees should not be read as certificates for FLUX. Lemma 1 permits nonlinear dynamics under regularity and repairability; sharper horizon and primal–dual bounds assume convex-affine structure and exact primal responses. The analysis offers terminal-feasibility-specific insights: Lemmas 2–3 separate RH-H's nominal-drift dependence from RH-T's perturbation amplification; Slater-based repair quantifies dependence on the feasibility margin; and replanning bounds terminal violation from the actual final-window state, without an explicit accumulated trajectory-amplification factor.
Importantly, the new nonlinear FLUX horizon ablation (Table R4; Fig. 4b) tests the design insight directly. RH-T wins 94/96 and 91/96 equal-penalty comparisons to RH-H at H=1,2, with the gap closing near the full horizon. This supports RH-T empirically outside the sharper assumptions.
The practical method uses 24 Adam steps, one dual update per window, detached drift gradients, and a learned terminal map. Under additional local strong convexity, primal suboptimality δj gives response error at most 2δj/σj and a Lipschitz constraint-error bound; terminal-map error similarly affects constraint evaluation. These conditional bounds do not certify detached nonlinear Adam. Our new constrained optimizer ablation (Table R5; Fig. 4c) shows constraint violation falling markedly through 24 steps, achieving 6/6 feasible pairs, with much lower energy than HardFlow on the same problem.
We agree runtime matters. A new matched wall-clock study (Table R3; Fig. 4a) compares methods at ~35, 120, and 230 s. ConicFlow leads at every budget: relative reward is 0.64 versus HardFlow's 0.34 at ~35 s, and 0.81 versus 0.40 at ~120 s. Thus its advantage persists at matched compute. ConicFlow, and to a lesser extent FMRG, improves with more budget, while HardFlow stays flat. In all the expanded experiments the runtime of ConicFlow never exceeded ~300 seconds and could be cut in half with taking a small hit in performance (See Table R5).
We appreciate the suggested references and have added a paragraph discussing them in Related Work. We also expanded the baselines to include the gradient-based approaches gradient guidance, FlowChef, and FlowDPS, alongside HardFlow and FMRG (Table R2), addressing the request for stronger comparisons with guidance methods. ConicFlow leads all five in optimized reward and independent Skywork gain. Real-image inversion approaches target a different source-preservation protocol from our generated-image, terminal-constraint setting; Adapting ConicFlow to these settings is a future direction we are exploring.
We will also foreground the theoretical assumptions and main insights, moving derivations to the appendix and bolstering the empirical section with the new and expanded results we have provided for the rebuttal. We hope the larger evaluation, independent judging, new baselines, and compute-controlled comparisons address the reviewer's key concerns.