- Rating
- 2
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes the Distributional robust Schrödinger bridge (DRSB), which trains a controller U_t that minimizes the worst-case sum of energy and a KL term for terminal states, over an ambiguity set of initial distributions around the empirical distribution of training examples. The terminal KL is represented in its Donsker-Varadhan variational form with the maximizing function g estimated by a binary classifier. For fixed g, the objective is linear in the initialization distribution, so the standard DRO duality applies to the inner maximization. Training is done in alternative manner. Experiments on 2D Gaussian and GMM transport and on FFHQ latent image translation show the effectiveness of DRSB.
Critical strengths
- This paper addresses the robustness of a learned transport map to test-time shifts in the initial distribution, without retraining, is important and not well-studied for SB models.
- the variational form of the KL makes the subproblem linear in the initial distribution. This is the key insight: without it, the KL is a nonlinear function of the initial distribution and standandard DRO duality cannot be applied.
- The experiments could show the effectiveness of DRSB.
Critical weaknesses
- Theoretical contributions are limited. Theorem 3.4 (main contribution of this paper?) is a direct substitution of the Donsker-Varadhan formula. It should be better presented as a proposition. The convergence guarantees are not provided. The derived optimization problem is a min-max-sup problem, which is complex and not guaranteed to converge.
- There is no sensitivity analysis over eps and \rho?
- Eq 12 should use argmin/argmax
- Problem 3.1 minimizers over u while the integrand uses u^\theta
- proposition (3.3) should read Proposition 3.3
Questions for authors
See weaknesses.