- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper proposes diffeomorphic optimization: optimizing differentiable objectives through the latent space of a pretrained flow or diffusion model. The authors interpret latent-space gradient descent as Riemannian gradient descent under a transported metric, develop backpropagation methods for matrix Lie-group ODEs, and demonstrate applications to protein design, docking, Rosetta relaxation, and lattice gauge theory.
Critical strengths
- The numerical results are broad and impressive, with potentially useful improvements over guidance, optimal control, sampling, and relaxation baselines.
- The work provides practical technical contributions, including autograd-compatible gradients for SO(3) and adjoint-state methods for differentiating through generative ODEs on matrix Lie groups.
- The method operates on frozen pretrained models without retraining, making it potentially useful independently of the theoretical framing.
- The authors acknowledge several important limitations: computational cost, dependence on the generative model’s support, and the fact that latent updates are not constrained to high-density base-space regions.
- The experiments include multiple samples, test-set evaluations, and some seed studies, which supports the reported empirical trends.
Critical weaknesses
- Manifold terminology is imprecise. Calling D=g(Z) a “data manifold” is not fully correct: Z is the full latent space and a diffeomorphism preserves dimension. The paper should qualify this as an approximate or learned representation of data concentration, rather than a rigorous low-dimensional manifold.
- Optimization claims are too strong. A unimodal base density does not imply a smoother loss landscape or easier mode switching; the reparameterized problem can be highly non-convex and poorly conditioned. These concerns have been considered in the optimization literature, see for example recent work like Diepeveen and Weber, Iso-Riemannian optimization on learned data manifolds (arXiv:2510.21033). Figure 1 is misleading because it suggests that latent reparameterization makes the problem convex, which it does not.
- Theorem 1 is weaker than necessary. Under the transported metric, g is an isometry, so the exponential-map correspondence should hold exactly where defined, not merely up to O(\lambda^2). This is related to the \mathbb{R}^d \to M case in Diepeveen, Pulling back symmetric Riemannian geometry for data analysis (arXiv:2403.06612); the more general N \to M case follows similarly for the exponential map. The theorem also does not establish that the Riemannian gradient is a desirable search direction. It merely tells that is an easy to compute one. In fact, the optimization paper mentioned in 2 discusses why the Riemannian gradient is not what we want.
- Novelty should be stated more modestly. Given that the paper is primarily an empirical extension of existing ideas for differentiating through flows, and given the theoretical gaps above, it should present itself as such and focus on what is genuinely new: the Lie-group extensions, implementation, and applications.
- Initialization robustness is insufficiently studied. Figure 3 shows one trajectory rather than a systematic initialization study. Since the problem is generally non-convex, results across random and difficult initializations, including failure rates, are needed to assess whether the displayed behavior is representative.
- Step-size selection is not justified. The appendix reports particular learning rates, but does not explain how they were chosen or how sensitive the method is to them. Unwanted stretching in the transported geometry can make the problem ill-conditioned and require small steps.
- Comparative claims are overstated. Guidance, reward fine-tuning, and optimal control have limitations, but so does the proposed method. The paper should present these as complementary approaches with distinct tradeoffs rather than implying that its caveats do not apply.
Questions for authors
- What is the authors’ motivation for claiming that the base-space reparameterization improves conditioning along the manifold, given that the reparameterized problem can be highly non-convex and poorly conditioned? Is there some structure being encoded in the models used that is not disclosed in the paper?