- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes LightSBB-M, an alternating solver for the Schrödinger–Bass bridge problem, which controls both drift and volatility. It uses the SBB representation as a transformed constant-volatility Schrödinger bridge. An inner LightSB-M-style procedure learns a Gaussian-mixture potential, while a separate regression learns the inverse endpoint maps. Sampling uses the learned endpoint coupling and a deterministic transformation rather than numerical integration of the full stochastic-volatility SDE.
Experiments include a Gaussian problem with known optimal coupling and controls, three two-dimensional transport benchmarks, and adult-to-child translation in a pretrained ALAE latent space.
Critical strengths
The Gaussian validation is well motivated. Evaluating the joint plan, cross-covariance, drift, and volatility goes beyond terminal-marginal matching and addresses what an SBB solver is supposed to recover. The five-seed comparisons provide useful evidence that the added flexibility can improve control recovery.
The computational construction is promising. Solving a constant-volatility bridge in transformed coordinates avoids explicitly learning a large matrix-valued volatility field, and endpoint sampling avoids SDE discretization at inference. The paper also reports the additional training cost rather than presenting the method as uniformly cheaper than LightSB-M.
Critical weaknesses
The claim of computing the optimal SBB plan is not established for the implemented alternating procedure. Exact solution of each SB subproblem does not establish convergence or optimality of the changing outer problem. The authors acknowledge the missing convergence proof, but marginal Wasserstein plateaus are not an optimality certificate. Moreover, the theoretical invertibility conditions are not enforced by the learned potential and inverse network. The main image result uses beta*T=1, outside the strict condition used in the stated guarantees. Numerical inverse residuals, curvature diagnostics, SBB-system residuals, and primal–dual gaps would substantially strengthen the solver claim.
The mathematical justification contains issues that affect the admissibility and control interpretation. Proposition A.1 is stated for every continuous quadratic-growth potential, but this class does not ensure finite Moreau transforms: in one dimension, phi(y)=-beta*y^2 belongs to the stated class while T_beta^+phi=-infinity. The proposition requires a proper domain and additional finiteness conditions.
The displayed identity dX_t=D²Phi_t(Y_t)dY_t also omits time and Itô correction terms; Appendix C.3 gives a fuller expression that should be reconciled with the main text. Finally, the explanation for replacing the full SBB objective with a drift-only gap is not convincing. An endpoint-feasible SB with constant reference volatility is an admissible SBB candidate with zero volatility penalty, so its full cost cannot be below the true SBB optimum. The full objective and endpoint feasibility should be the primary optimality diagnostics.
Questions for authors
What numerical evidence establishes that the outer iteration approaches an SBB optimum rather than merely stabilizing its marginal error? Can you report SBB-system residuals or primal–dual gaps, together with sensitivity to initialization?
What is the correct admissible domain for Proposition A.1? Does the implemented algorithm perform an envelope projection, or otherwise ensure the required curvature and invertibility? Please report inverse-map residuals and minimum-Jacobian-eigenvalue statistics, particularly for the image experiment at beta*T=1.
Please reconcile the main-text dynamics with the Itô expressions in Appendix C.3. Which controls were used to obtain Table 1, and how are learned and exact states coupled when computing the drift recovery error?
Please clarify the full-objective comparison. If a negative gap occurs, what marginal infeasibility, truncation, or estimation error explains it? Can the complete SBB objective and marginal residuals be reported together for all Gaussian comparisons?
Can image identity preservation be evaluated with an independent face-recognition representation rather than cosine similarity of ALAE latent codes? Please also report uncertainty for FID and clarify the contributions of evaluation seeds versus variation across individual faces.
How is the terminal approximation implemented? Are samples drawn at T or at T-delta, and how sensitive are endpoint accuracy and objective estimates to delta?
We thank the reviewer for reading our rebuttal and for the follow-up. Please let us add the following clarifications.
Gaussian-mixture parameterization. LightSBB-M uses the same parameterization as LightSB (Korotin et al., ICLR 2024) and LightSB-M (Gushchin et al., ICML 2024). Korotin et al. (2024, Thm. 3.4) prove that Gaussian-mixture potentials are universal approximators of Schrödinger bridges, and that the training objective equals, up to a constant, the KL divergence to the true bridge. Since LightSBB-M solves a Schrödinger bridge in transformed coordinates, both properties carry over to that step.
We chose this form because the SBB relies on the derivatives of h more than the SB does. Beyond the drift, the volatility σ=ε(I+εβ−1D2logh) requires the full Hessian, and the Bass map XT=YT+εβ−1∇loghT(YT) requires the gradient. With a mixture, all of them are exact and available in closed form, at a cost linear in d and J thanks to diagonal covariances. A neural potential could replace the mixture, since the construction only uses h, ∇logh and D2logh, but each Hessian would then cost d backward passes per sample. In other words, it is this mixture representation that makes the method light.
Evaluation setting. The 512-dimensional ALAE latent translation is the high-dimensional benchmark used by LightSB and LightSB-M. We evaluate on the same task, with additional baselines from four method families (Appendix C).
We hope these points clarify that the mixture is a deliberate solver choice, while the contribution of the paper is the Schrödinger–Bass bridge, which learns the volatility jointly with the drift.