- Rating
- 2
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
The paper studies the sliced orlicz Wasserstein distance, an extension of the sliced Wasserstein distance in which the cost function is determined by an orlicz function \phi (i.e. a function from the positive values into the positive values that is strictly increasing, convex and null at zero).
After introducing the sliced version of such metrics, the authors delve into a study of the properties of such metric, establishing an almost one-to-one extension of the classic properties for the sliced wasserstein distance to this specific case.
Owing to the one dimensional nature of the sliced distances, the writing of the orlicz Wasserstein simplifies and takes an easier to handle formula that exploit the standard difference between the pseudo inverse function to simplify the solution of a minimization problem (which is done via a bisection algorithm).
To conclude, the authors provide some experiments to justify the adoption of this metric.
Critical strengths
The paper is well-written and easy to follow. I have found no major presentation issues, making it pleasant to read.
The theoretical results presented are comprehensive and easy to follow/believe: most of the proven properties are straight up generalisation of the standard properties that are known for the sliced Wasserstein distance.
Critical weaknesses
The paper has several issues that I think are not easy to address, however a compelling reply could make me upgrade the score.
The main concern I have is the justification of the paper. The main argument put forward to consider an Orlicz-based Wasserstein over a standard Wasserstein one is to allow for more aggressive costs that penalize the tails of the distributions. To support this claim, the authors point at theoretical applications e.g. "theoretical guarantees for parameter estimation" and "convergence of hypoercive differential equations".
While this can be a theoretical benefit, it comes with an additional computational cost. In my opinion this point is overlooked in the introduction as the authors hide the need to solve the minimization problem that each Orlicz-Wasserstein (OW) distance entails in the landau term of the complexity. In other words, it should be made clear that unless the phi function has a specific form, the sliced Orlicz-Wasserstein (SOW) is always more expansive than a Sliced Wasserstein (SW). Moreover, the cases presented in the paper that are easy to handle are the ones associated to polynomial functions, which are connected to standard Wasserstein distances. This aspect also feels overlooked in the paper.
Indeed, the experiments presented only consider the W_2 distance, never taking into account other exponents (e.g. p=4,6,8,...), the W_\infty nor costs induced by more generic convex functions to make the comparison fair.
Moreover, in the experimental section, the figures show that the computational cost of the SOW is much larger than the standard SW when the Orlicz function is not polynomial. As already said, the case in which phi is not polynomial would be the main case of interest, as the polynomial case can be reconduced to the standard Wasserstein distance, thus this increased computational cost cannot be considered as collateral damage.
On the more theoretical side, while I appreciate the detailed analysis proposed on the SOW, most of the presented results read as an extension of the classic properties known for the SW. While these properties are nice to have and I do understand that going from SW to SOW is not mathematically trivial (especially the statistical properties which I assume are based on a generalisation of the techniques proposed by Bobkov and Ledoux), I do not think that these technicalities are deep enough to justify the paper without a strong experimental section.
Questions for authors
-
Aside penalizing more aggresively the tails of the distributions, is there any explicit benefit that may outweight the need to solve a minimization problem for each slice? The theoretical properties presented are closely related to the ones that the standard SW possesses, what makes the proposal new?
-
why the experimental results consider only the W_2 distance and not a W_6 distance, the W_\infty distance or a distance induced by h(|x-y|) with h convex, increasing and null at zero? These metrics have a closed formula solution for one dimensional problems, see Santambrogio, F. (2015). Optimal Transport for Applied Mathematicians: Calculus of Variations
-
how is the SOW or OW induced by (x^2+x^4)/2 connected to W_2, W_4 or to the Wasserstein distance induced by the cost (x-y)^2+(x-y)^4?
-
why in the second picture of figure 1 there is no SW in the comparison?
minor comments
in the first picture of figure 1 the legend is covering the graphs of the OWs
6 comments
Reponses to Reviewer's Questions (Part 1)
Q1: Aside penalizing more aggresively the tails of the distributions, is there any explicit benefit that may outweight the need to solve a minimization problem for each slice? The theoretical properties presented are closely related to the ones that the standard SW possesses, what makes the proposal new?
We first thank the reviewer for this very insightful question! In our work, we propose SOW as a generalization of SW. The properties established for general SOW also hold for SW under the corresponding assumptions. Therefore, it is natural that some of their theoretical properties are closely related. Hence, from a theoretical point of view, an interesting question is: under this generalization, how do the properties of SW change? For example, in our work, we have shown that the minimax convergence rates for estimating SOW under the compact support assumption depend on the choice of the Orlicz function .
Moreover, in our study beyond compact support (Appendix H), we observe another interesting difference. For classical SW, suitable moment conditions can ensure empirical convergence (R2, theorem 1). However, for SOW, we provide a counterexample showing that, for some choices of , even finite moments of all polynomial orders are not sufficient to guarantee convergence. In general, we believe that understanding how the choice of affects the theoretical properties is itself an interesting research question.
From a practical point of view, we are particularly interested in two-sample testing. Among the existing approaches, MMD has been widely studied, but its performance can depend on the choice of kernel and its parameters. Recently, R1 studied two-sample testing using SW, showing that it can achieve good performance without kernel tuning while preserving the geometric structure of optimal transport. However, we believe that the possibility of choosing a suitable function can sometimes be useful. In fact, as shown in Figure 2 of R1, increasing the number of projections improves testing power, but the improvement becomes smaller when the number of projections is already large.
Inspired by this observation, we ask whether we can improve testing power by changing the distance itself, rather than only increasing the number of projections. This is one of our motivations for considering the larger family of SOW distances. Our experimental results suggest that the flexibility provided by the choice of can be useful in certain situations. More specifically, in our new experiments, we use the Huber function (see its definition in our response to Q1 from reviewer 9EGC), which is piecewise quadratic and linear. This choice allows us to control transport costs over different ranges of quantile gaps.
Of course, we are still far from fully understanding how the choice of affects testing power. We believe this opens an interesting direction for future research, similar to the question of how the choice of kernel affects the performance of MMD-based tests.
Finally, SOW is different from sliced convex transport costs (see our response to Q3). Besides, unlike SOW, sliced convex transport costs do not necessarily define a metric. Therefore, they cannot be considered as a general family of metrics extending SW
Reference:
R1: Tran et Schreuder (AISTATS 2026): Minimax-Optimal Two-Sample Test with Sliced Wasserstein
R2: Fournier and Guillin (2014) On the rate of convergence in Wasserstein distance of the empirical measure
Responses to Reviewer's Questions (Part 2)
Q2 Why the experimental results consider only the distance and not a distance, the distance or a distance induced by $h(|x-y|) $with h convex, increasing and null at zero? These metrics have a closed formula solution for one dimensional problems, see Santambrogio, F. (2015). Optimal Transport for Applied Mathematicians: Calculus of Variations.
Answer: We thank the reviewer for this very interesting suggestion, especially the suggestion to consider transport costs induced by a convex function , as these may be confused with Orlicz-Wasserstein distances, although the two constructions are different.
Taking into account the reviewer's suggestion, we have added several baselines to our previous experiments. More specifically, we now compare SOW with and , in addition to . We also consider sliced convex transport costs, denoted by and , where the transport costs are induced by the same Orlicz functions used for SOW. Moreover, thanks to the feedback from Reviewer 9EGC, we extended the number of replications from to and also reported the error bars.
The results in Figure 4 show that, with a suitable choice of Orlicz function, SOW can still achieve higher empirical power than the considered baselines, including SW with larger values of .
On the other hand, to further demonstrate that the flexible choice of can lead to better practical results, we have designed two new experiments: a synthetic two-sample testing experiment, where we also explain the intuition behind the choice of the Orlicz function, and a K-nearest neighbor classification experiment for distributions. We invite the reviewer to see the revised experimental section for more details.
Our goal is to demonstrate that the flexibility in choosing can improve performance in certain situations. We do not claim that SOW always outperforms SW since SW is itself a special case of SOW.
We thank the reviewer again for their suggestions, which has helped us improve our experimental comparisons!
Q3: How is the SOW or OW induced by connected to , or to the Wasserstein distance induced by the cost ?
Answer:
Regarding the first part, the connection with and , we have already provided the detailed computation in Appendix G.1. Briefly, in the one-dimensional setting, we set and . Consequently, .
Regarding the second part, the connection with the optimal transport cost induced by , let us denote this cost by .
Clearly, in the one-dimensional setting,
$C_\phi=\inf_{\pi\in\Pi(\mu,\nu)} \int\left(|x-y|^2+|x-y|^4\right)d\pi(x,y)=A+B.$
Consequently, we can see that, in general, is completely different from .
Q4: Why in the second picture of figure 1 there is no SW in the comparison?
Answer:
The reason comes from the observation that, when we choose an Orlicz function for which a closed-form expression exists, the bisection process is not necessary. Therefore, the computation time can be very close to that of . For this reason, we originally compared only (without bisection) and (with bisection).
However, to avoid any misunderstanding, we have added to the second panel of Figure 1. The results are consistent with our explanation above. Besides, we would like to take this opportunity to thank the reviewer for the minor comment regarding the legend in the first panel of Figure 1. We have fixed it in the revised version!
We hope that our responses and modifications have addressed the reviewer's concerns. We would be happy to discuss these points further and answer any additional questions.
Responses to Reviewer's Main Concerns
We would like to thank the reviewer for the time and the willingness to discuss our work. Based on your constructive feedback, we provide our detailed responses below.
W1 The main concern I have is the justification of the paper. The main argument put forward to consider an Orlicz-based Wasserstein over a standard Wasserstein one is to allow for more aggressive costs that penalize the tails of the distributions. To support this claim, the authors point at theoretical applications e.g. "theoretical guarantees for parameter estimation" and "convergence of hypoercive differential equations".
Answer
We would like to clarify one point regarding the motivation of our paper. In the previous version, we explicitly stated that
Therefore, the mathematical motivation for this flexibility is directly illustrated by Equation (5), which shows how the choice of ϕ affects the sensitivity to a small amount of transported mass.
Then, we continue state
Therefore, the two works by R1 and R2 were cited to provide examples of previous theoretical applications of Orlicz-Wasserstein distances, rather than to justify the mathematical statement above. In particular, the use of Orlicz-Wasserstein distances is explicitly mentioned in the abstract of R1.
Reference:
R1: Altschuler and Chewi (2024): Faster high-accuracy log-concave sampling via algorithmic warm starts
R2: On Excess Mass Behavior in Gaussian Mixture Models with Orlicz-Wasserstein Distances
W2:
Answer
We acknowledge that our use of the term "quasi-linear" in the Introduction was not sufficiently clear. We have therefore revised this part of the Introduction to make the computational complexity more explicit. We thank the reviewer again for this suggestion!
However, we respectfully disagree with the reviewer's comment that we overlooked the computational cost of SOW and only considered cases that are easy to handle. We would like to clarify the following points.
Moreover, we explicitly include the number of bisection iterations T in our computational complexity analysis. It is worth noting that the error is reduced exponentially with T. In practice, we observe that we just need at most 30−40 iterations for bisection in general to achieve machine precision error. Appendix G.1 also provides the detailed computation for a case where bisection is not needed.
Therefore, the need for bisection and its additional computational cost were already taken into account in our experiments.
On the other hand, the final concern relates to the experimental section. Since it overlaps with the questions section, we would like to postpone our responses to this section.