Asymptotics of smoothed Wasserstein distances in the small noise regime
Abstract
We study the behavior of the Wasserstein- 2 distance between discrete measures µ and ν in R d when both measures are smoothed by small amounts of Gaussian noise.
This procedure, known as Gaussian-smoothed optimal transport , has recently attracted attention as a statistically attractive alternative to the unregularized
Wasserstein distance.
We give precise bounds on the approximation properties of this proposal in the small noise regime, and establish the existence of a phase transition: we show that, if the optimal transport plan from µ to ν is unique and a perfect matching, there exists a critical threshold such that the difference between
W 2 ( µ, ν ) and the Gaussian-smoothed OT distance W 2 ( µ ∗ N σ , ν ∗ N σ ) scales like exp( − c/σ 2 ) for σ below the threshold, and scales like σ above it.
These results establish that for σ sufﬁciently small, the smoothed Wasserstein distance approximates the unregularized distance exponentially well.
Introduction: optimal transport
Optimal Transport (OT) has seen a recent surge of applications in machine learning, in areas such as generative modeling [2, 16], image processing [13, 27, 31] and domain adaptation [7, 8].
A natural statistical question raised by these applications is to estimate the OT distances with samples.
These distances, known as the Wasserstein distances, are deﬁned by
[Equation]
where Π( µ, ν ) denotes the set of joint measures with marginals µ and ν , known as transport plans .
It is well known that plug-in estimators for this quantity, obtained by replacing µ and ν with empirical measures consisting of i.i.d.
samples, have performance in high dimensions, with rates of convergence typically of order n − 2 /d
[3, 11, 12, 15, 22] when d > 2 p .
Moreover, minimax lower bounds show that this curse of dimensionality is unavoidable in general [25, 32].
The existence of the curse of dimensionality for OT has led to a series of proposals to obtain better rates of convergence by imposing additional structural assumptions—such as latent lowdimensionality [25] or smoothness [24, 33]—or by replacing W p by a better-behaved surrogate, such as an entropy-regularized version with much better statistical and computational properties [1, 9, 17, 23, 28].
A particularly intriguing option, developed by [18], consists in smoothing the Wasserstein distance by adding Gaussian noise.
The following result shows the statistical beneﬁts of this approach.
Proposition 1.1 ([21]) .
For d > 1 and σ > 0 , denote by N σ the centered Gaussian measure on R d with covariance σ 2 I d .
For any compactly supported probability measure µ in R d , let x 1 , x 2 , . . .
, x n be i.i.d.
samples from µ , and deﬁne the empirical measure
[Equation]
Then there exists a constant c
= c ( µ, σ, d ) such that
[Equation]
[18] call this framework Gaussian-smoothed optimal transport (GOT), and follow up work has shown that it possesses signiﬁcant statistical beneﬁts, with fast rates of convergence and clean limit laws [19, 20, 38].
To leverage the beneﬁcial properties of the GOT framework, it is necessary to understand how well the smoothed distance W 2 ( µ ∗N σ , ν ∗N σ ) approximates the standard Wasserstein distance W 2 ( µ, ν ) .
An application of the triangle inequality [18, Lemma 1] shows that
[Equation]
Indeed, the triangle inequality implies | W 2 ( µ ∗N σ , ν
[Equation]
σ ) − W 2 ( µ, ν
[Equation]
| ≤ W 2 ( µ, µ ∗N σ )+ W 2 ( ν, ν ∗
N σ ) and the latter two terms are of order at most σ .
In general, this upper bound is unimprovable, as we show below.
On the other hand, it can also be very loose: if µ is a translation of ν , then
W 2 ( µ ∗ N σ , ν ∗ N σ )
=
W 2 ( µ, ν ) for all σ ≥ 0 .
These examples raise a natural question: how well does W 2 ( µ ∗ N σ , ν ∗ N σ ) approximate W 2 ( µ, ν ) when σ is small, and how does the answer to this question depend on the measures µ
and ν ?
The main goal if this paper is to give a sharp answer to this question for ﬁnitely supported measures.
We focus on the ﬁnite support case for two reasons.
First, when µ and ν are ﬁnitely supported, µ ∗ N σ and ν ∗ N σ are each ﬁnite mixtures of Gaussians, and the behavior of Wasserstein distances for such measures is a topic of active research [6, 10].
Second, as our results indicate, the behavior of this quantity for ﬁnitely supported measures is unexpectedly rich, with a sharp dichotomy in rates depending on the structure of the optimal transport plan between µ and ν : we show that when the unique optimal transport plan between µ and ν is a perfect matching , then there exist positive σ ∗ and c such that
[Equation]
In other words, for sufﬁciently small σ , the GOT distance approximates the standard W 2 distance exponentially well, substantially sharpening (1).
More strikingly, we establish the existence of a phase transition: for σ < σ ∗ , the gap is exponentially small, whereas for σ > σ ∗ , the gap scales linearly.
By contrast, if the optimal transport plan between µ and ν is not unique or is not a perfect matching, then no phase transition appears: the upper bound of (1) is tight even in a neighborhood of σ = 0 .
Our work provides a precise understanding on how GOT resembles vanilla OT in the vanishing noise ( σ ↓ 0 ) regime.
These results complement those recently obtained by [5] in the large noise regime, who show that if µ and ν have n matching moments, n ≥ 1 , then W 2 ( µ ∗ N σ , ν ∗ N σ ) =
O ( σ − n ) as σ → ∞ .
Along with results in [5], our work completes the limiting picture of the Euclidean heat semigroup acting on atomic measures under the Wasserstein distance.
All the relevant rates are presented in Table 1.
We note that our work leaves open the question of characterizing the rates for non-atomic measures.
It is possible to show that, for general measures, there are measures exhibiting polynomial rates intermediate between σ and e − c/σ 2 ; however, these rates appear to depend delicately on the geometry of the measures and their support.
Giving a full characterization of the rate for general probability measures is an attractive open question.
Preliminaries and main results
We are concerned with the optimal transport problem between discrete measures µ =
[Equation] [Equation] [Equation] [Table]
and
[Table]
agree
[Table] n th moment [Table] in the space R d , equipped with the squared Euclidean cost function c ( x, y ) = (cid:107) x − y (cid:107) 2 .
Here { α i } ki =1 and { β j } (cid:96)j =1 are positive numbers such that (cid:80) ki
=1 α i = (cid:80) (cid:96)j =1 β j = 1 , and the sets X :=
{ x i } and Y :
= { y j } consist of distinct elements of R d .
(Note that we do not require that X ∩Y = ∅ .)
Explicitly, we may write
[Equation]
[Table]
[Equation]
[Table]
[Equation] [Table] [Equation] We call a minimizer in (2) an optimal coupling .
We shall show that the behavior of the quantity W 2 ( µ ∗ N σ , ν ∗ N σ ) as σ → 0 depends strongly on the structure of the optimal couplings between µ and ν .
We rely on the following deﬁnition.
Deﬁnition 2.1.
The measures µ
and ν possess a unique perfect matching if there exists a unique solution π ∗ to (2) , and if the support of this unique solution is a perfect matching, i.e., the set { x ∈
X , y ∈ Y : π ∗ ( x, y ) > 0 } is a bijection between X and Y .
Our main results (Theorems 4.1 and 5.1) show that the GOT distance approximates the Wasserstein distance exponentially well for small σ
if and only if the measures possess a unique perfect matching.
To obtain these bounds, we show that if σ is small and µ and ν possess a unique perfect matching, then the optimal plan for µ and ν is also approximately optimal, in an appropriate sense, for the convolved measures µ ∗ N σ and ν ∗ N σ .
By contrast, if µ and ν do not possess a unique perfect matching, then we explicitly exhibit an alternate coupling between µ ∗ N σ and ν ∗ N σ with signiﬁcantly smaller cost, therefore showing that W 2 ( µ ∗ N σ , ν ∗ N σ ) is smaller than W 2 ( µ, ν ) by an amount that scales linearly in σ .
To identify the range of σ for which the exponential error bound holds, we introduce a robust version of optimality for π ∗ in the perfect matching case.
This deﬁnition, strong cyclical monotonicity , extends the classical cyclical monotonicity criterion from optimal transport [see, e.g. 37], and captures how sensitive the optimal plan is to perturbations of the source and target measure.
We show that this notion is closely related to the strong convexity and smoothness of the dual optimal solutions to the optimal transport problem, known as “potentials.”
The strong convexity of these potentials has previously been explored in computational and statistical contexts [26, 36], but to our knowledge its connection to the stability of discrete optimal tranport plans is new.
Strong cyclical monotonicity
In this section, we consider transport plans in the form of a perfect matching between { x i } and { y i } .
By relabeling the points, we may assume without loss of generality that the optimal transport plan between µ and ν is the matching given by
[Equation]
In this section, we develop a robust notion of optimality for Γ .
This notion is based on a strengthening of the classic optimality condition for optimal transport, based on cyclical monotonicity.
We recall the following deﬁnition.
Deﬁnition 3.1 (See, e.g., 30) .
A set S ⊆ R d × R d is cyclically monotone if for any ( a 1 , b 1 ) , . . .
, ( a n , b n ) ∈ S , we have
[Equation]
where we set b n +1 :=
b 1 .
The signiﬁcance of this notion is the following fundamental result.
Theorem 3.2 (See 37, Theorem 5.10) .
If π ∈ Π( µ, ν ) has cyclically monotone support, then it is an optimal transport plan between µ and ν .
Our main deﬁnition strengthens this characterization by requiring the inequalities in the deﬁnition of cyclical monotonicity to be strict.
Deﬁnition 3.3.
We say f : [ k ] × [ k ] → R ≥ 0 is a positive residual function on [ k ] , if f ( i, i ) = 0 , f
( i, j ) > [-
-]0 for i (cid:54) =
j , and f ( i, j ) =
f ( j, i ) for all i, j ∈ [ k ] .
Deﬁnition 3.4 (Strong cyclical monotonicity) .
For a positive residual function f on [ k ] , we say that Γ is f -strongly cyclically monotone, if for any 1 ≤ n ≤ k and distinct τ (1) , τ (2) , . . .
, τ ( n ) ∈
[ k ] (with the convention τ ( n + 1) =
τ (1) ), we have
[Equation]
or equivalently,
[Equation]
Strong cyclical monotonicity indicates that the optimal plan with support Γ is superior to any other plan by a positive margin in its transport cost.
The importance of Deﬁnition 3.4 is that is equivalent to robustness of the optimality of Γ under small perturbations of the points { x i } and { y i } .
To make this connection precise, we make the following deﬁnition.
Deﬁnition 3.5.
For (cid:15) ≥ 0 , we say Γ is (cid:15) -robust, if for any distinct τ (1) , τ (2) , . .
, τ ( n ) ∈ [ k ] , and any α τ (1) , α τ (2) , . . . , α τ ( n ) ∈ R d such that
[Equation]
there holds
[Equation]
We write
[Equation]
The quantity R (Γ) , which we call “robustness of optimality,” captures the behavior of the optimal plan when the supports of µ and ν are slightly perturbed.
As the following proposition indicates, robustness in this sense is equivalent to strong cyclical monotonicity.
Proposition 3.6.
Γ is strongly cyclically monotone
if and only if R (Γ) > 0 .
Proposition 3.6 may be viewed as a robust analogue to Theorem 3.2—if π ∈ Π( µ, ν ) has strong cyclically monotone support, then it is a robustly optimal transport plan between µ and ν , in the sense that it remains an optimal plan even when µ and ν are corrupted by noise.
As we establish in
Section 4, this observation is central to the analysis of GOT.
3.1 Implementability and explicit bounds on R (Γ)
Despite the mathematical simplicity of Deﬁnition 3.4, it is not clear how to verify it for a particular set Γ , nor how to establish that this property holds for an optimal plan between µ and ν .
To this end, we propose another condition, strong implementability , which is equivalent to strong cyclical monotonicity but is more amenable to analysis.
We also show that both conditions are equivalent to µ and ν possessing a unique perfect matching. [29] introduced the notion implementability and established it as an equivalent condition of cyclical monotonicity.
In parallel to the results in [29], we also introduce the following stronger condition of implementability.
Deﬁnition 3.7 (Strong implementability) .
For a positive residual function f on [ k ] , we say that Γ is f -strongly implementable, if there exists a potential function ϕ , such that for any i, j ∈ [ k ] , we have (cid:104) x i , y i − y j (cid:105) ≥ ϕ ( y i ) − ϕ
( y j )
+ f ( i, j ) . Analogous to the equivalence result in [29], we show that strong cyclical monotonicity and strong implementability are both equivalent to the uniqueness and optimality of Γ .
Proposition 3.8.
The following three statements are equivalent:
(i) Γ is f -strongly cyclically monotone for some f ; (ii) Γ is f -strongly implementable; (iii) Γ is the unique optimal transport plan from { x i } to { y i } .
Remark 3.9.
We can imply from the direction (i) to (iii) of Proposition 3.8 that, if the directed bipartite graph with vertex set { x 1 , x 2 , . . .
, x k , y 1 , y 2 , . .
. , y k } and arcs between x i and y j with weight (cid:107) x i − y j (cid:107) 2 does not possess an alternating cycle of zero total cost, then Γ is the unique optimal transport plan from { x i } to { y i } .
One may use this sufﬁcient condition to verify uniqueness of an optimal transport plan Γ in practice.
The equivalence in Proposition 3.8 holds for any positive residual function f ; however, in the context of optimal transport with the squared Euclidean cost, it is most natural to focus on the quadratic case.
The positive residual function constructed in the equivalence between (iii) and (i) in Proposition 3. is of the form f
( i, j ) =
λ 2 (cid:107) y
i − y j (cid:107) 2 for some λ > 0 , in which case the implementability condition reads
[Equation]
Quadratic residual functions are closely connected to convex analysis and to the theory of optimal transport.
This condition is equivalent to the existence of a λ -strongly convex potential ϕ satisfying ∇ ϕ ( y i ) =
x i for all i ∈
[ k ] [35], or, equivalently, the existence of a Lipschitz Brenier map from µ to ν [4].
The regularity of Brenier maps is a deep question in analysis [see, e.g. 14].
Proposition 3. establishes that, in the ﬁnite-support case, this question is equivalent to the uniqueness of the optimal transport plan for µ and ν .
More generally, we have the following theorem characterizing the properties of strongly implementable plans with residual functions of quadratic type.
Theorem 3.10.
The following conditions are equivalent:
(i)
For some 0 ≤ α < β , there exists a potential function ϕ : R d → R d which is α -strongly convex and β -smooth, such that x i = ∇ ϕ ( y i ) for all i ∈ [ k ] .
(ii) Γ is strongly implementable for
[Equation]
or equivalently, there exists { ˜ ϕ
( y i ) } ki =1 ⊂ R d , such that for all i, j ∈ [ k ] ( i (cid:54) = j ), (cid:104) x i
[Equation]
y
i
[Equation]
Proof.
This is a direct application of Theorem 4 in [35].
The condition (i) in Theorem 3.10 is equivalent to the set { ( y i , x i , ϕ ( y i )) } being F α,β -interpolable in Deﬁnition 2 of [35], and the condition (ii) is equivalent to equation (4) in Theorem 4 of [35].
Theorem 3.10 also formally encompasses the choice β = + ∞ when ϕ is strongly convex but not smooth, in which case (3) reads
[Equation]
which recovers the positive residual function used in the proof of Proposition 3.6.
Remark 3.11.
We should emphasize that the f deﬁned in Theorem 3.10 is indeed a positive residual function given α < β , since Cauchy-Schwartz gives
[Equation]
As a direct consequence of the direction (ii) to (i) in Theorem 3.10, if Γ is strongly implementable for a positive residual function f which is quadratic in y i − y j and x i − x j , there exists a smooth and strongly convex potential function verifying implementability.
Corollary 3.12.
Suppose Γ is strongly implementable for
[Equation]
where λ xx , λ xy and λ yy are nonnegative numbers which satisfy λ 2 xy + λ xy
= λ
xx λ yy .
Then there exists a potential function ϕ : R d → R d which is λ
xy λ xx -strongly convex
and λ yy λ xy -smooth, such that x i = ∇ ϕ ( y i ) for all i ∈ [ k ] .
By the Smith–Knott optimality criterion for optimal transport [34], the conclusion that x i = ∇ ϕ ( y i ) for all i ∈ [ k ] is equivalent to the potential function ϕ solving the following dual version of (2):
[Equation]
where φ ∗ denotes the Legendre conjugate.
Finally, we show that the above characterizations give rise to lower bounds on R (Γ) , which are easy to compute in O ( k 2 ) time.
The following bound gives a quantitative link between robustness of optimality and the residual function f .
Proposition 3.13.
Suppose Γ is strongly implementable for a positive residual function f .
Then Γ is (cid:15) -robust for
[Equation]
This implies that
[Equation]
By combining this bound with Theorem 3.10, we obtain a simple lower bound when f is of quadratic type.
Proposition 3.14.
When the equivalence in Theorem 3.10 holds, Γ is (cid:15) -robust for
[Equation]
This implies that
[Equation]
Remark 3.15.
When condition (i) in Theorem 3.10 holds, α -strong convexity and β -smoothness implies
[Equation]
Thus the condition (8) may be replaced by the bound
[Equation]
which is more interpretable.
We should emphasize that, to check the (cid:15) -robustness of T with either (8) or (9) requires prior knowledge on the parameters α and β , which are inherent to the optimal transport plan Γ .
Exponential rates for unique perfect matchings
Our main results show that the robustness of optimality R (Γ) controls the gap between W 2 ( µ, ν ) and W 2 ( µ ∗ N σ , ν ∗ N σ ) .
Theorem 4.1.
If σ ∗ =
R (Γ) > 0 , then for σ ∈ (0 , σ ∗ ) ,
[Equation]
The proof depends on the following simple lemma, which shows that robustness to optimality implies that the Wasserstein distance is unchanged when µ and ν are corrupted by small noise.
Lemma 4.2.
If σ ∗ =
R (Γ) > 0 , then for any measure Q in R d supported on B (0 , σ ∗ ) ,
[Equation]
Proofs of these results appear in the supplementary material.
In the regime where σ does not exceed R (Γ) , the above theorem tells that the GOT distance is an excellent approximation of the OT distance.
Our second main result is a converse to that statement, showing that if σ goes beyond R (Γ) , the loss W 2 ( µ, ν ) − W 2 ( µ ∗ N σ , ν ∗ N σ ) is bounded below by a linear function of σ .
We start with the following proposition, which quantiﬁes a “violation of cyclical monotonicity” under possibly large perturbations in the sources and targets.
Proposition 4.3.
If Γ is an optimal transport plan, for any M ≥ 0 , denote
G ( M ) := sup
[Equation]
Then G ( M ) is a concave function of M for M ∈ [0 , + ∞ ) .
Note that G ( M ) vanishes for M < σ ∗ .
The next theorem shows that as long as G ( M ) is not negligible for M (cid:38) σ ∗ , the approximation loss for σ ≥ σ ∗ is linear in σ .
Theorem 4.4.
If σ ∗ =
R (Γ) > 0 , then
[Equation]
Here G ( M ) is deﬁned as in Proposition 4.3.
In particular, if G (3 σ ∗ ) ≥ c 0 σ ∗ for an absolute constant c 0 > 0 , then there exists a constant C = C ( c 0 ) > 0 such that for σ ∈ (0 , 2 σ ∗ ) ,
[Equation]
The proof of Theorem 4.1, Lemma 4.2, Proposition 4.3, and Theorem 4.4 can be found in the supplementary material.
Beyond perfect matchings
In the case that R (Γ) = 0 , or equivalently by Proposition 3.8 and Proposition 3.6 that the optimal transport map between µ and ν is not a perfect matching, Theorems 4.1 and 4.4 are not applicable.
In this situation, we are able to show that the approximation error is linear, even in a neighborhood of zero.
In fact, this holds whenever there exists an optimal transport plan between µ and ν which is not a perfect matching.
To analyze this case, we return to the setting of general discrete measures:
[Equation]
Theorem 5.1.
Let µ and ν be as in (10) .
If µ and ν do not possess a unique perfect matching, then there exists c 0 > 0 such that for σ ∈ (0 , c 0 ) ,
[Equation]
( µ ∗ N σ , ν ∗ N σ )
[Equation]
σ. Theorem 5.1 tells that, unless the optimal transport plan between µ and ν is unique and a perfect matching, the loss from approximating the OT distance with the GOT distance is at least linear in σ .
We derive Theorem 5.1 from the following lemma, which shows that Theorem 5.1 holds in the special case where µ is a single point mass, and ν is uniform on two points.
Lemma 5.2.
Let x, y 1 and y 2 be different points in R d .
For µ 0 :
=
δ ( x ) and ν 0 :
= 12 δ ( y 1 )+ 12 δ
( y 2 ) , there exists c 0 > 0 , such that for σ ∈ (0 , c 0 ) , we have
[Equation]
We obtain the full strength of Theorem 5.1 by reducing to the special case of Lemma 5.2 on a particular subset of the support of µ and ν .
Full details appear in the supplementary material.
Numerical example
In this section, we present a numerical example to demonstrate different regimes of the rate
W 2 ( µ, ν ) − W 2 ( µ ∗ N σ , ν ∗ N σ ) , in respect of Theorem 4.1 and Theorem 4.4.
For the sake of clarity, we consider atomic measures µ and ν both deﬁned on R 2 .
One of the simplest cases where a coupling Γ has R (Γ) = 0 is
[Equation]
It is easy to see that the optimal transport plan from µ to ν is not unique, which is also a consequence of Proposition 3.8, Proposition 3.6 and the fact that R (Γ)
=
for the map
[Equation]
} that achieves the optimal cost.
We also consider the family of perturbed measures
[Equation]
The source and target distributions corresponding to p = k/ 10 for k = 1 , 2 , 3 , 4 are depicted in
Figure 1.
For each k , the unique optimal transport plan from µ k = µ ( k/ 10) to ν is given by
[Equation]
For each of these GOT tasks, we draw 200 samples from the source distribution µ k ∗ N σ and target distribution ν ∗ N σ , and use the empirical W 2 distance as an estimate of the true
W 2 ( µ k ∗ N σ , ν ∗ N σ ) .
We repeat the process 100 times and report the mean, as shown in the following ﬁgures.
By Theorem 4.1 and Theorem 4.4, we expect W 22 ( µ k , ν )
− W 22 ( µ k ∗ N σ , ν ∗ N σ ) to be of scale e − c/σ 2 for σ ∈ (0 , R (Γ k )) , and W 22 ( µ k , ν ) − W 22 ( µ k ∗ N σ , ν ∗ N σ ) (cid:38) σ for σ ≥ R
(Γ k ) .
This transition from exponential to linear is visible in Figure 2.
Using Proposition 3.14, we obtain a lower bound on R (Γ k ) , which we plot with a vertical dashed line in Figure 2.
Exponential decay is visible to the left of the dashed lines, as anticipated.
Figure 3 shows this behavior more clearly on a logarithmic scale, where we observe that log( − log ( W 2 ( µ, ν ) −
W 2 ( µ ∗ N σ , ν ∗ N σ ))) is linear in log( σ ) for small σ .
Conclusion
This paper develops approximation results for Gaussian-smoothed optimal transport, showing that
GOT approximates the Wasserstein distance exponentially well for small σ when µ and ν possess a unique perfect matching.
By contrast, if µ and ν do not possess a unique perfect matching, then the gap between W 2 ( µ, ν ) and W 2 ( µ ∗ N σ , ν ∗ N σ ) is linear in σ as σ → 0 .
The difference between these two behaviors can be traced to the fact that if µ and ν possess a unique perfect matching, then G σ
[Equation]
the optimal transport plan between them is stable under small perturbations of µ and ν .
In particular, for noise distributions Q with sufﬁciently small support, W 2 ( µ, ν ) = W 2 ( µ ∗ Q, ν ∗ Q ) .
On the other hand, if µ and ν do not possess a unique perfect matching, then their optimal plan is not stable, and can change even under inﬁnitesimal perturbation.
Our techniques are based on a new notion of stability for discrete optimal transport plans, which we call robustness of optimality and characterize by developing strong variants of the classic notions of cyclical monotonicity and implementability for optimal transport plans.
Just as cyclical monotonicity is closely connected to the convexity of the dual potentials for the optimal transport problem, we show that strong cyclical montonicity is equivalent to strong convexity.
This characterization shows that a discrete optimal transport plan is robust to perturbations of the source and target measures if and only if its support lies in the subdifferential of a strongly convex function.
We anticipate that this characterization will have statistical and computational implications for the estimation of optimal transport plans between discrete measures. Checklist
For all authors... (a) Do the main claims made in the abstract and introduction accurately reﬂect the paper’s contributions and scope?
[Yes] (b) Did you describe the limitations of your work?
[Yes] (c) Did you discuss any potential negative societal impacts of your work?
[N/A] (d) Have you read the ethics review guidelines and ensured that your paper conforms to them?
[Yes] 2.
If you are including theoretical results... (a) Did you state the full set of assumptions of all theoretical results?
[Yes] (b) Did you include complete proofs of all theoretical results?
[Yes] 3.
If you ran experiments... (a) Did you include the code, data, and instructions needed to reproduce the main experimental results (either in the supplemental material or as a URL)?
[No] (b) Did you specify all the training details (e
g., data splits, hyperparameters, how they were chosen)?
[Yes] (c) Did you report error bars (e
g., with respect to the random seed after running experiments multiple times)?
[Yes] (d) Did you include the total amount of compute and the type of resources used (e
g., type of GPUs, internal cluster, or cloud provider)?
[No] 4.
If you are using existing assets (e
g., code, data, models) or curating/releasing new assets... (a) If your work uses existing assets, did you cite the creators?
[N/A] (b) Did you mention the license of the assets?
[N/A] (c) Did you include any new assets either in the supplemental material or as a URL?
[N/A] (d) Did you discuss whether
and how consent was obtained from people whose data you’re using/curating?
[N/A] (e) Did you discuss whether the data you are using/curating contains personally identiﬁable information or offensive content?
[N/A] 5.
If you used crowdsourcing or conducted research with human subjects... (a) Did you include the full text of instructions given to participants and screenshots, if applicable?
[N/A] (b) Did you describe any potential participant risks, with links to Institutional Review Board (IRB) approvals, if applicable?
[N/A] (c) Did you include the estimated hourly wage paid to participants and the total amount spent on participant compensation?
[N/A]