- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes Entropic Riemannian Neural Optimal Transport, which learns a target-side Schrödinger potential through a neural feature parameterization and reconstructs the corresponding Gibbs conditionals. These conditionals are used to obtain barycentric or smoothed transport surrogates. Under compact-support and universal-approximation assumptions, the paper establishes recovery of the entropic optimal coupling and derives convergence or stability results for the associated surrogates. Experiments cover several manifold geometries and an application to protein–ligand pose refinement.
Critical strengths
- The combination of intrinsic entropic OT and a reusable neural potential is well motivated. The formulation provides a good way to construct conditional transport outputs for new source points.
- The theoretical development distinguishes coupling recovery, barycentric projection, and smoothing of conditional laws. In particular, the KL identity gives a useful connection between potential approximation and recovery of the optimal coupling.
- The experiments span several geometries, including compact and noncompact manifolds, and investigate both transport quality and computational efficiency. The pose-refinement application provides an additional practical motivation.
Critical weaknesses
- This is a suggestion about the quantitative strength of the result. Proposition G.7, Eq. (22), bounds the squared barycentric error by a quantity linear in the joint total variation distance. The pointwise estimate already established in its proof yields a stronger bound. Let denote the squared barycentric error:
The pointwise barycenter contraction estimate gives
Applying Pinsker's inequality to each conditional law and then using the KL chain rule yields
Finally, the semidual-gap identity implies
- The theoretical guarantees seems to not cover the implemented minibatch training procedure. Theorem 4.1 establishes the existence of an approximating sequence in the hypothesis class. It does not show that the optimization procedure in Section 3 produces such a sequence. The authors replace a minibatch average by the target integral inside the logarithm, which introduces an additional issue beyond neural-network optimization.
For a fixed potential and source point , define
\qquad Y_j\sim\nu.$$ Jensen's inequality gives $$\mathbb{E}\left[-\varepsilon\log\left(\frac{1}{B}\sum_{j=1}^{B}U_j\right)\right] \ge -\varepsilon\log\mathbb{E}[U_1].$$ Consequently, the minibatch objective is generally a biased estimator of the population semidual. This bias depends on the potential, so it can change the optimization problem. As an illustrative limiting case, when $B=1$, the empirical objective reduces to $c(X,Y)$ and contains no learning signal for the potential. 3. The implemented smoothing kernel and extracted point predictions are not covered directly by Proposition 4.3. Proposition 4.3 concerns smoothing with the actual Riemannian heat kernel. Appendix C.1 instead implements the geodesic Gaussian kernel $$k_t(y,z)=\exp\left(-\frac{d(y,z)^2}{4t}\right).$$ The appendix acknowledges that this surrogate omits heat-kernel normalization factors, curvature corrections, and volume-distortion terms. On curved manifolds, it is generally not the heat kernel. The leading short-time logarithmic asymptotic alone does not provide an approximation-error guarantee at the bandwidths used in the experiments. Moreorver, the geodeisc Gaussian may fail to be positive defined in many curved manifolds, that would be another issues that may raise cocerns.Questions for authors
How should the large tangent-space plan error on the log-Euclidean SPD benchmark be reconciled with the exact Euclidean representation of that geometry?
This is my main concern about the interpretation of the synthetic comparisons. Appendix C.2 defines the log-Euclidean distance as
Thus, the matrix logarithm is a global isometry to the Euclidean space of symmetric matrices. Entropic OT computed in matrix-logarithm coordinates should therefore reproduce the intrinsic LE reference plan, up to numerical error, when the supports, marginal weights, regularization, and solver settings are matched. More generally, a correctly metric-weighted tangent representation at any base point satisfies
= d_{\mathrm{LE}}(X,Y).$$ There is no curvature-induced single-chart approximation error in this geometry. Nevertheless, Table 3 reports a plan KL of $1.5911\pm0.0384$ for the tangent-space baseline on SPD(3) (LE), compared with $0.0280\pm0.0030$ for Entropic RNOT.Could the authors clarify the following? 1. Which Riemannian logarithm and tangent-space inner product were used for the LE row? 2. Were the evaluation supports, marginal weights, cost scaling, regularization, and Sinkhorn settings identical to those used for the LE reference? 3. Could the authors include an explicit Euclidean Sinkhorn baseline on the matrix logarithms, verify equality of its cost matrix with the intrinsic LE cost matrix, and report the resulting plan KL?