- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper studies the estimation of the optimal transport maps in the Wasserstein barycenter problem. The authors design an objective function based on a known potential-minimization characterization of such maps [1]. They introduce an interpolation regime between the unconstrained case and the Poincaré inequality-constrained case, and then provide a stability bound and convergence rates.
[1] Korotin et al. Continuous Wasserstein-2 Barycenter Estimation without Minimax Optimization. ICLR2021
Critical strengths
This paper is trying to address a real gap for barycenter estimation on the continuous multi-dimensional measures and aims for a rather general set of measures.
Critical weaknesses
-
This paper seems rather incremental to me compared to Fukuchi (2025). The main change is the scope from 1D to multi-dimensional measures, but the extra mechanism needed for the extension is standard. The estimator, the potential construction and the stability bound carry over from the 1D case with little change, and the truncation used to handle unbounded supports is also a standard technique. (See Fukuchi (2025) Remark 4.1, Proposition 5.6)
-
The authors motivate the estimation of barycenter maps through applications such as image interpolation and fair regression, but never show such applications. It is also unclear how the optimization is carried out. This is not a deal breaker, but it makes the paper appear incomplete, especially since the theoretical contribution is incremental.
-
The paper claims its estimator accommodates the deep neural network parametrizations widely used in practice. However, Def. 2 requires bijective gradient maps that are monotone, L-Lipschitz, and exactly congruent everywhere, and standard architectures do not satisfy this. For instance, Korotin et al. (2021) enforce congruence only approximately, through a regularizing term.
Questions for authors
- What is the motivation for the intermediate regime ? are both well-motivated. For measures that satisfies the Poincaré-inequality, intermediate gives no improvement. The usual Poincaré inequality with constant implies the order- inequality with for every . For measures with disconnected support, especially heavy-tailed measures, the tail term decays slowly. Can you give me some examples of measures in such a regime with the estimation rates?
- How do you address the case where for ?
3 comments
I thank the authors for the response. My concern about the intermediate regime of α has been addressed. To clarify my first point, I understand the differences between the result itself and Fukuchi (2025). However, my take is that although this is a first rate for the problem, it is obtained largely by combining existing ingredients: the stability bound that avoids Lipschitz assumptions on the true maps, which comes from Korotin et al. (2021), and standard truncation to handle unbounded supports. I do give credit for bringing the order-α Poincaré inequality into this analysis. I also still do not see how the result applies in practice. The ReQu class in Section 4.1 is a special construction for which no empirical evidence is given. Without experiments or a computable estimator, it is unclear how the guarantee can be useful. For these reasons, I will keep my score.
Edit: The reason behind my Q2 is that Def1 is vacuous for unbounded when , while for measures with unbounded support the potential differences that the analysis needs to control are unbounded. As I understand it, this is handled correctly, since Def. 1 is applied only after truncation. For heavy-tailed measures, which are the motivation for , the rate in Prop. 2 is much slower than in the light-tailed case. This is a minor point, and I have no remaining concern here.
We thank the reviewer for the follow-up and the clarification.
Combination of existing ingredients
We respectfully but strongly disagree, as explained in the general response. In particular, the stability bound of Korotin et al. (2021) provides no convergence rate, and the truncation used in existing analyses cannot be applied as it is, because it breaks the congruency and the local Lipschitz continuity required by the generalized Poincaré inequality. In addition, the revised paper now establishes a new stability bound (Theorem 3), which requires congruency only on a ball.
Practical usefulness
Theoretical analyses of transport map estimation, such as Divol et al. (2025), also establish statistical guarantees without experiments, and their value lies in clarifying which rates are achievable and under which conditions. Our paper provides such a guarantee for the barycenter problem, for which no convergence rate in multidimensional spaces was available. The guarantee is not tied to the ReQU class: Theorem 2 applies to any class satisfying Definition 2, and to approximate minimizers with replaced by , where is the optimization error.
We thank the reviewer for the careful reading and the insightful comments. We address the concerns and questions one by one.
W1. Novelty relative to Fukuchi (2025)
We would like to highlight that our analysis goes significantly beyond Fukuchi (2025) in three respects. First, Fukuchi (2025) assumes a bounded domain in R, whereas our analysis allows unbounded and heavy-tailed measures through the clipping argument and the tail term ΞR. Second, Proposition 5.6 of Fukuchi (2025) requires the true maps to be bi-Lipschitz, whereas Theorem 3 requires regularity only of the candidate maps. Hence, Theorem 2 imposes no regularity on the true maps, which affect the rate only through the approximation error A. Third, we bring the Poincaré inequality of order α to the analysis of transport map estimation, which is a significant technical contribution. It bridges the fast-rate analysis under the usual Poincaré inequality and the slow-rate analysis without it, which have been developed separately, and it extends the analysis to heavy-tailed measures that fail the usual Poincaré inequality, as demonstrated in Section 4.1.
W2. Applications and optimization
Several algorithms estimate the transport maps to the barycenter in multidimensional spaces, but their convergence rates have been unknown, and our paper fills this gap. In particular, our estimator is the empirical counterpart of the potential minimization of Korotin et al. (2021), whose neural-network implementation is evaluated empirically in their paper. Hence, our result also offers insight into the statistical performance of this practical approach, although their implementation enforces congruency only approximately. Regarding the optimization, the minimality of the estimator is used only to make the second term of the decomposition in Section 5.2 non-positive. Consequently, for any approximate minimizer with optimization error η, the same analysis gives the bound in Theorem 2 with A replaced by A+η, which cleanly separates the statistical and optimization errors.
W3. Neural networks and exact congruency
We agree that standard architectures do not satisfy Definition 2 as they are. Our claim is that classes satisfying Definition 2 can be built from neural networks. Section 4.1 provides such a class from sparse ReQU networks, for which Prop. 1 verifies all the requirements of Definition 2, including exact congruency everywhere without a regularizing term.
Q1. Motivation for α∈(0,1)
We agree that α=1 is preferable when the usual Poincaré inequality holds. The intermediate regime targets measures that do not satisfy it, such as polynomially tailed ones, since the usual Poincaré inequality implies sub-exponential tails. For example, the density proportional to (1+∥x∥2)−(p+κ)/2 satisfies the inequality of order α=κ/(2κ+p+2). For sufficiently large κ, Prop. 2 gives the resulting rate, which accounts for the polynomial decay of ΞR.
Q2. The case ∥f∥∞=∞
In this case, the right-hand side of Definition 1 is infinite for α<1 unless ∇f=0, and the inequality imposes no constraint.