summaries: The paper proposes a new slice-based approach to efficiently compute the Wasserstein distance between two distributions $\nu$ and $\mu$. The method termed ASWD (augmented sliced Wasserstein Distance) first  projects the samples from $\nu$ and $\mu$ onto a higher dimensional space using a non linear injective mapping function and then uses the classical random linear projections onto 1D to compute the sliced Wasserstein Distance. Overall, the procedure amounts to applied a spatial Radon Transform to perform the slicing. Theoretical results establish conditions  under which ASWD is a metric. A numerical algorithm is given along with the design of the injective mapping using NN. Empirical evaluations on simulation datasets and on generative modeling highlight the potential of the proposed method over existing approaches. This manuscript introduces the concept of augmented sliced Wasserstein distances. The main idea is to extend the sliced Wasserstein distance based on mapping samples to higher -dimensional hypersurfaces. The proposed distance is shown to be a metric. Moreover, given that the optimal choice of the nonlinear maps is rather computationally intensive to obtain, an approximation based on neural networks is proposed. Several experiments are shown where a better performance is obtained with respect to existing methods. This paper introduces the augmented sliced Wasserstein distance (ASWD), a new variety of sliced Wasserstein distance (SWD), that allows comparing two probability distributions by combining a nonlinear embedding of the sample data points to a higher-dimensional space with a slicing scheme to calculate 1D Wasserstein distances between uniformly projection directions. The authors introduce the spatial Radon transform, which includes the standard Radon transform and the special case of polynomial generalized Random transform (introduced in Kolouri et al. 2019). They further prove that ASWD is a valid metric if and only if the mapping is injective. Several experiments are conducted on generative modelling (CIFAR10, CelebA,  MNIST, color transferring). This paper proposes a variant of sliced Wasserstein distance, named augmented sliced Wasserstein distance. ASWD maps input data points to hypersurfaces using neural networks, then calculates SWD on the hypersurfaces. ASWD alleviates the low efficiency problem of SWD for high-dimensional data. Various tasks including flow, generative modeling, and barycenters show the advantage of AWSD against some existing methods.
abstractText: While theoretically appealing, the application of the Wasserstein distance to large-scale machine learning problems has been hampered by its prohibitive computational cost. The sliced Wasserstein distance and its variants improve the computational efficiency through the random projection, yet they suffer from low accuracy if the number of projections is not sufficiently large, because the majority of projections result in trivially small values. In this work, we propose a new family of distance metrics, called augmented sliced Wasserstein distances (ASWDs), constructed by first mapping samples to higher-dimensional hypersurfaces parameterized by neural networks. It is derived from a key observation that (random) linear projections of samples residing on these hypersurfaces would translate to much more flexible nonlinear projections in the original sample space, so they can capture complex structures of the data distribution. We show that the hypersurfaces can be optimized by gradient ascent efficiently. We provide the condition under which the ASWD is a valid metric and show that this can be obtained by an injective neural network architecture. Numerical results demonstrate that the ASWD significantly outperforms other Wasserstein variants for both synthetic and real-world problems.
references.authors: J. Altschuler J. Niles-Weed P. Rigollet
references.title: Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
references.venue: In Proc. Advances in Neural Information Processing Systems (NeurIPS),
references.authors: M. Arjovsky S. Chintala L. Bottou
references.title: Wasserstein generative adversarial networks
references.venue: In Proc. International Conference on Machine Learning (ICML),
references.authors: J. Behrmann W. Grathwohl R.T.Q. Chen D. Duvenaud J. Jacobsen
references.title: Invertible residual networks
references.venue: In Proc. International Conference on Machine Learning (ICML),
references.authors: E. Bernton P.E. Jacob M. Gerber C.P. Robert
references.title: On parameter estimation with the wasserstein distance
references.venue: Information and Inference: A Journal of the IMA,
references.authors: G. Beylkin
references.title: The inversion problem and applications of the generalized Radon transform
references.venue: Communications on Pure and Applied Mathematics,
references.authors: N. Bonneel J. Rabin G. Peyré H. Pfister
references.title: Sliced and Radon Wasserstein barycenters of measures
references.venue: Journal of Mathematical Imaging and Vision,
references.authors: N. Bonnotte
references.title: Unidimensional and evolution methods for optimal transportation
references.venue: PhD thesis, Paris
references.authors: N. Courty R. Flamary D. Tuia A. Rakotomamonjy
references.title: Optimal transport for domain adaptation
references.venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (IPAMI),
references.authors: M. Cuturi
references.title: Sinkhorn distances: Lightspeed computation of optimal transport
references.venue: In Proc. Advances in Neural Information Processing Systems (NeurIPS),
references.authors: M. Cuturi A. Doucet
references.title: Fast computation of Wasserstein barycenters
references.venue: In Proc. International Conference on Machine Learning (ICML),
references.authors: I. Deshpande Y. Hu R. Sun A. Pyrros
references.title: Max-sliced Wasserstein distance and its use for GANs
references.venue: In Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR),
references.authors: A. Dessein N. Papadakis J. Rouas
references.title: Regularized optimal transport and the rot mover’s distance
references.venue: The Journal of Machine Learning Research (JMLR),
references.authors: L. Ehrenpreis
references.title: The universality of the Radon transform, chapter 5, pages 299–363
references.authors: S. Ferradans N. Papadakis G. Peyré J. Aujol
references.title: Regularized discrete optimal transport
references.venue: SIAM Journal on Imaging Sciences,
references.authors: A. Genevay L. Chizat F. Bach M. Cuturi G. Peyré
references.title: Sample complexity of Sinkhorn divergences
references.venue: In International Conference on Artificial Intelligence and Statistics (AISTATS),
references.authors: I. Goodfellow A.J. Pouget M. Mirza B. Xu F.D. Warde
references.title: Generative adversarial nets
references.venue: In Proc. Advances in Neural Information Processing Systems (NeurIPS),
references.authors: I. Gulrajani F. Ahmed M. Arjovsky V. Dumoulin A. Courville
references.title: Improved training of Wasserstein GANs
references.venue: In Proc. Advances in neural information processing systems (NeurIPS),
references.authors: M. Heusel H. Ramsauer T. Unterthiner B. Nessler S. Hochreiter
references.title: GANs trained by a two time-scale update rule converge to a local Nash equilibrium
references.venue: In Proc. Advances in neural information processing systems (NeurIPS),
references.authors: A. Homan H. Zhou
references.title: Injectivity and stability for a generic class of generalized Radon transforms
references.venue: The Journal of Geometric Analysis,
references.authors: G. Huang Z. Liu L. Van Der Maaten K.Q. Weinberger
references.title: Densely connected convolutional networks
references.venue: In Proc. IEEE Conference on Computer Vision and Pattern Recognition (CVPR),
references.authors: M. Karami D. Schuurmans J. Sohl-Dickstein L. Dinh D. Duckworth
references.title: Invertible convolutional flow
references.venue: In Proc. Advances in Neural Information Processing Systems (NeurIPS),
references.authors: S. Kolouri K. Nadjahi U. Simsekli R. Badeau G. Rohde
references.title: Generalized sliced Wasserstein distances
references.venue: In Proc. Advances in Neural Information Processing Systems (NeurIPS),
references.authors: S. Kolouri P.E. Pope C.E. Martin G.K. Rohde
references.title: Sliced-Wasserstein autoencoders
references.venue: In Proc. International Conference on Learning Representations (ICLR),
references.authors: A. Krizhevsky
references.title: Learning multiple layers of features from tiny images
references.venue: Tech Report,
references.authors: Y. LeCun L. Bottou Y. Bengio P. Haffner
references.title: Gradient-based learning applied to document recognition
references.venue: Proceedings of the IEEE,
references.authors: Z. Liu P. Luo X. Wang X. Tang
references.title: Deep learning face attributes in the wild
references.venue: In Proc. IEEE International Conference on Computer Vision (ICCV),
references.authors: B. Muzellec M. Cuturi
references.title: Subspace detours: Building transport plans that are optimal on subspace projections
references.venue: Proc. Advances in Neural Information Processing Systems (NeurIPS),
references.authors: K. Nadjahi
references.title: Statistical and topological properties of sliced probability divergences
references.venue: Proc. Advances in Neural Information Processing Systems (NeurIPS),
references.authors: K. Nguyen N. Ho T. Pham H. Bui
references.title: Distributional sliced-Wasserstein and applications to generative modeling
references.venue: In Proc. International Conference on Learning Representations (ICLR), Vienna,
references.authors: F. Paty M. Cuturi
references.title: Subspace robust Wasserstein distances
references.venue: In Proc. International Conference on Machine Learning (ICML),
references.authors: G. Peyré M. Cuturi
references.title: Computational optimal transport
references.venue: Foundations and Trends® in Machine Learning,
references.authors: J. Radon
references.title: Uber die bestimmung von funktionen durch ihre integralwerte laengs gewisser mannigfaltigkeiten
references.venue: Ber. Verh. Saechs. Akad. Wiss. Leipzig Math. Phys. Kl.,
references.authors: D. Rezende S. Mohamed
references.title: Variational inference with normalizing flows
references.venue: In International Conference on Machine Learning (ICML),
references.authors: T. Salimans H. Zhang A. Radford D. Metaxas
references.title: Improving GANs using optimal transport
references.venue: In Proc. International Conference on Learning Representations (ICLR),
references.authors: C. Villani
references.title: Optimal Transport: old and new, volume 338
references.venue: Berlin, Germany: Springer Science & Business Media,
sections.heading: 1 INTRODUCTION
sections.text: Comparing samples from two probability distributions is a fundamental problem in statistics and machine learning. The optimal transport (OT) theory (Villani, 2008) provides a powerful and flexible theoretical tool to compare degenerative distributions by accounting for the metric in the underlying spaces. The Wasserstein distance, which arises from the optimal transport theory, has become an increasingly popular choice in various machine learning domains ranging from generative models to transfer learning (Gulrajani et al., 2017; Arjovsky et al., 2017; Kolouri et al., 2019b; Cuturi and Doucet, 2014; Courty et al., 2016).
  Despite its favorable properties, such as robustness to disjoint supports and numerical stability (Arjovsky et al., 2017), the Wasserstein distance suffers from high computational complexity especially when the sample size is large. Besides, the Wasserstein distance itself is the result of an optimization problem — it is non-trivial to be integrated into an end-to-end training pipeline of deep neural networks, unless one can make the solver for the optimization problem differentiable. Recent advances in computational optimal transport methods focus on alternative OT-based metrics that are computationally efficient and solvable via a differentiable optimizer (Peyré and Cuturi, 2019). Entropy regularization is introduced in the Sinkhorn distance (Cuturi, 2013) and its variants (Altschuler et al., 2017; Dessein et al., 2018) to smooth the optimal transport problem; as a result, iterative matrix scaling algorithms can be applied to provide significantly faster solutions with improved sample complexity (Genevay et al., 2019).
  An alternative approach is to approximate the Wasserstein distance through slicing, i.e. linearly projecting, the distributions to be compared. The sliced Wasserstein distance (SWD) (Bonneel et al., 2015) is defined as the expected value of Wasserstein distances between one-dimensional random projections of high-dimensional distributions. The SWD shares similar theoretical properties with the Wasserstein distance (Bonnotte, 2013) and is computationally efficient since the Wasserstein distance in one-dimensional space has a closed-form solution based on sorting. (Deshpande et al., 2019) extends the sliced Wasserstein distance to the max-sliced Wasserstein distance (Max-SWD), by finding a single projection direction with the maximal distance between projected samples. The subspace robust Wasserstein distance extends the idea of slicing to projecting distributions on linear subspaces (Paty and Cuturi, 2019). However, the linear nature of these projections usually leads to low projection efficiency of the resulted metrics in high-dimensional spaces (Deshpande et al., 2019; Kolouri et al., 2019a).
  Different variants of the SWD have been proposed to improve the projection efficiency of the SWD, either by introducing nonlinear projections or by optimizing the distribution of random projections. Specifically, (Kolouri et al., 2019a) extends the connection between the sliced Wasserstein distance and the Radon transform (Radon, 1917) to introduce generalized sliced Wasserstein distances (GSWDs) by utilizing generalized Radon transforms (GRTs), which are defined by nonlinear defining functions and lead to nonlinear projections. A variant named the GSWD-NN was proposed in (Kolouri et al., 2019a) to generate nonlinear projections directly with neural network outputs, but it does not fit into the theoretical framework of the GSWD and does not guarantee a valid metric. In contrast, the distributional sliced Wasserstein distance (DSWD) and its nonlinear version, the distributional generalized sliced Wasserstein distance (DGSWD), improve their projection efficiency by finding a distribution of projections that maximizes the expected distances over these projections. The GSWD and the DGSWD exhibit higher projection efficiency than the SWD in the experiment evaluation, yet they require the specification of the particular form of defining functions from a limited class of candidates. However, the selection of defining functions is usually a task-dependent problem and requires domain knowledge, and the impact on performance from different defining functions is still unclear.
  In this paper, we present the augmented sliced Wasserstein distance (ASWD), a distance metric constructed by first mapping samples to hypersurfaces in an augmented space, which enables flexible nonlinear slicing of data distributions for improved projection efficiency (See Figure 1). Our main contributions include: (i) We exploit the capacity of nonlinear projections employed in the ASWD by constructing injective mapping with arbitrary neural networks; (ii) We prove that the ASWD is a valid distance metric; (iii) We provide a mechanism in which the hypersurface where high-dimensional distributions are projected onto can be optimized and show that the optimization of hypersurfaces can help improve the projection efficiency of slice-based Wasserstein distances. Hence, the ASWD is data-adaptive, i.e. the hypersurfaces can be learned from data. This implies one does not need to manually design a function from the limited class of candidates; (iv) We demonstrate superior performance of the ASWD in numerical experiments for both synthetic and real-world datasets.
  The remainder of the paper is organized as follows. Section 2 reviews the necessary background. We present the proposed method and its numerical implementation in Section 3. Related work are discussed in Section 4. Numerical experiment results are presented and discussed in Section 5. We conclude the paper in Section 6.
sections.heading: 2 BACKGROUND
sections.text: In this section, we provide a brief review of concepts related to the proposed work, including the Wasserstein distance, (generalized) Radon transform and (generalized) sliced Wasserstein distances.
  Wasserstein distance: Let Pk(Ω) be a set of Borel probability measures with finite k-th moment on a Polish metric space (Ω,d) (Villani, 2008). Given two probability measures µ, ν ∈ Pk(Ω), the Wasserstein distance of order k∈ [1,+∞) between µ and ν is defined as:
  Wk(µ,ν)=
  ( inf
  γ∈Γ(µ,ν) ∫ Ω×Ω d(x,y)kdγ(x,y) ) 1 k , (1)
  where d(·,·)k is the cost function, Γ(µ,ν) represents the set of all transportation plans γ, i.e. joint distributions whose marginals are µ and ν, respectively.
  While the Wasserstein distance is generally intractable for high-dimensional distributions, there are several favorable cases where the optimal transport problem can be efficiently solved. If µ and ν are continuous one-dimensional measures defined on a linear space equipped with theLk norm, the Wasserstein distance between µ and ν has a closed-form solution (Peyré and Cuturi, 2019):
  Wk(µ,ν)= (∫ 1 0 |F−1µ (z)−F−1ν (z)|kdz ) 1 k , (2)
  where F−1µ and F −1 ν are inverse cumulative distribution functions (CDFs) of µ and ν, respectively. In practice, Wasserstein distances Wk(µ̃, ν̃) between one-dimensional empirical distributions µ̃= 1N ∑N n=1δxn and ν̃ = 1 N ∑N n=1δyn can be computed by sorting one-dimensional samples from empirical distributions, and evaluating the distances between sorted samples (Kolouri et al., 2019b):
  Wk(µ̃,ν̃)=
  ( 1
  N N∑ n=1 |xIx[n]−yIy [n]| k ) 1 k , (3)
  where N is the number of samples, Ix[n] and Iy[n] are the indices of sorted samples satisfying xIx[n]≤xIx[n+1] and yIy [n]≤yIy [n+1], respectively. Radon transform and generalized Radon transform: The Radon transform (Radon, 1917) maps a function f(·)∈L1(Rd) to the space of functions defined over spaces of hyperplanes in Rd. The Radon transform of f(·) is defined by line integrals of f(·) along all possible hyperplanes in Rd:
  Rf(t,θ)= ∫ Rd f(x)δ(t−〈x,θ〉)dx, (4)
  where t∈R and θ ∈ Sd−1 represent the parameters of hyperplanes {x∈Rd | 〈x,θ〉= t}, δ(·) is the one-dimensional Dirac delta function, and 〈·,·〉 refers to the Euclidean inner product. By replacing the inner product 〈x,θ〉 in Equation (4) with β(x,θ), a specific family of functions named as defining function in (Kolouri et al., 2019a), the generalized Radon transform (GRT) (Beylkin, 1984) is defined as integrals of f(·) along hypersurfaces defined by {x∈Rd | β(x,θ)= t}:
  Gf(t,θ)= ∫ Rd f(x)δ(t−β(x,θ))dx, (5)
  where t∈R, θ∈Ωθ and Ωθ is a compact set of all feasible θ, e.g. Ωθ =Sd−1 for β(x,θ) = 〈x,θ〉. In particular, a function β(x,θ) defined on X ×(Rd\{0}) with X ⊆Rd is called a defining function of GRTs if it satisfies conditions H.1 – H.4 given in (Kolouri et al., 2019a).
  For probability measures µ ∈ Pk(Rd), the Radon transform and the GRT can be employed as push-forward operators, and the generated push-forward measuresRµ=R#µ, Gµ=G#µ are defined as follows (Bonneel et al., 2015):
  Rµ(t,θ)= ∫ Rd δ(t−〈x,θ〉)dµ, (6)
  Gµ(t,θ)= ∫ Rd δ(t−β(x,θ))dµ. (7)
  Notably, the Radon transform is a linear bijection (Helgason, 1980), and the sufficient conditions for GRTs to be bijective are provided in (Homan and Zhou, 2017).
  Sliced Wasserstein distance and generalized sliced Wasserstein distance: By applying the Radon transform to µ and ν to obtain multiple projections, the sliced Wasserstein distance (SWD) decomposes the high-dimensional Wasserstein distance into multiple one-dimensional Wasserstein distances which can be efficiently evaluated (Bonneel et al., 2015). The k-SWD between µ and ν is defined by:
  SWDk(µ,ν)= (∫ Sd−1 W kk ( Rµ(·,θ),Rν(·,θ) ) dθ ) 1 k , (8)
  where the Radon transformR defined by Equation (6) is adopted as the measure push-forward operator. The GSWD generalizes the idea of SWD by slicing distributions with hypersurfaces rather than hyperplanes (Kolouri et al., 2019a). The GSWD is defined as:
  GSWDk(µ,ν)= (∫
  Ωθ
  W kk ( Gµ(·,θ),Gν(·,θ) ) dθ
  ) 1 k
  , (9)
  where the GRT G defined by Equation (7) is used as the measure push-forward operator. From Equation (3), withL random projections andN samples, the SWD and GSWD between µ and ν can be approximated by:
  SWDk(µ,ν)≈ ( 1
  NL L∑ l=1 N∑ n=1 |〈xIlx[n],θl〉−〈yIly [n],θl〉| k ) 1 k , (10)
  GSWDk(µ,ν)≈ ( 1
  NL L∑ l=1 N∑ n=1 |β(xIlx[n],θl)−β(yIly [n],θl)| k ) 1 k , (11)
  where I lx and I l y are sequences consisting of the indices of sorted samples which satisfy 〈xIlx[n],θl〉≤ 〈xIlx[n+1], θl〉, 〈yIly [n], θl〉 ≤ 〈yIly [n+1], θl〉 in the SWD, and β(xIlx[n], θl) ≤ β(xIlx[n+1], θl), β(yIly [n],θl) ≤ β(yIly [n+1],θl) in the GSWD. The approximation error in estimating SWDs using Equation (10) is derived in (Nadjahi et al., 2020). It is proved in (Bonnotte, 2013) that the SWD is a valid distance metric. The GSWD is a valid metric except for its neural network variant (Kolouri et al., 2019a).
sections.heading: 3 AUGMENTED SLICED WASSERSTEIN DISTANCES
sections.text: In this section, we propose a new distance metric called the augmented sliced Wasserstein distance (ASWD), which embeds flexible nonlinear projections in its construction. We also provide an implementation recipe for the ASWD.
sections.heading: 3.1 SPATIAL RADON TRANSFORM AND AUGMENTED SLICED WASSERSTEIN DISTANCE
sections.text: In the definitions of the SWD and GSWD, the Radon transform (Radon, 1917) and the generalized Radon transform (GRT) (Beylkin, 1984) are used as the push-forward operator for projecting distributions to a one-dimensional space. However, it is not straightforward to design defining functions β(x,θ) for the GRT, since one needs to first check if β(x,θ) satisfies the conditions to be a defining function (Kolouri et al., 2019a; Beylkin, 1984), and then whether the corresponding GRT is bijective or not (Homan and Zhou, 2017). In practice, the assumption of the transform can be relaxed, as Theorem 1 shows that as long as the transform is injective, the corresponding ASWD metric is a valid distance metric.
  To help us define the augmented sliced Wasserstein distance, we first introduce the spatial Radon transform which includes the Radon transform and the polynomial GRT as special cases (See Remark 5). Definition 1. Given a measurable injective mapping g(·) :Rd→Rdθ and a function f(·)∈L1(Rd), the spatial Radon transform of f(·) is defined as
  Hf(t,θ;g)= ∫ Rd f(x)δ(t−〈g(x),θ)〉dx, (12)
  where t∈R and θ∈Sdθ−1 are the parameters of hypersurfaces {x∈Rd | 〈g(x),θ〉= t}.
  Similar to the Radon transform and the GRT, the spatial Radon transform can also be used to generate push-forward measureHµ=H#µ for µ∈Pk(Rd) as in Equations (6) and (7):
  Hµ(t,θ;g)= ∫ Rd δ(t−〈g(x),θ〉)dµ. (13)
  Remark 1. Note that the spatial Radon transform can be interpreted as applying the vanilla Radon transform to µ̂g, where µ̂g refers to the push-forward measure g#µ, i.e given a measurable injective mapping g(·) :Rd→Rdθ , the spatial Radon transform defined by Equation (13) can be rewritten as:
  Hµ(t,θ;g)=Ex∼µ[δ(t−〈g(x),θ〉)], =Ex̂∼µ̂g [δ(t−〈x̂,θ〉)]
  = ∫ δ(t−〈x̂,θ〉)dµ̂g
  =Rµ̂g (t,θ). (14) Hence the spatial Radon transform inherits the theoretical properties of the Radon transform and incorporates nonlinear projections through g(·).
  In what follows, we use µ≡ν to denote probability measures µ,ν∈Pk(Rd) that satisfy µ(X )=ν(X ) for ∀X ⊆Rd. Lemma 1. Given an injective mapping g(·) :Rd→Rdθ and two probability measures µ,ν∈P (Rd), for all t∈R and θ∈Sdθ−1,Hµ(t,θ;g)≡Hν(t,θ;g) if and only if µ≡ν, i.e. the spatial Radon transform is an injection on Pk(Rd). Moreover, the spatial Radon transform is an injection on Pk(Rd) if and only if the mapping g(·) is an injection.
  See Appendix A for the proof of Lemma 1.
  We now introduce the augmented sliced Wasserstein distance, by utilizing the spatial Radon transform as the measure push-forward operator: Definition 2. Given two probability measuresµ,ν∈Pk(Rd) and an injective mapping g(·) :Rd→Rdθ , the augmented sliced Wasserstein distance (ASWD) of order k∈ [1,+∞) is defined as:
  ASWDk(µ,ν;g)= (∫ Sdθ−1 W kk ( Hµ(·,θ;g),Hν(·,θ;g) ) dθ ) 1 k , (15)
  where θ∈Sdθ−1,Wk is the k-Wasserstein distance defined by Equation (1), andH refers to the spatial Radon transform defined by Equation (13). Remark 2. Following the connection between the spatial Radon transform and the vanilla Radon transform as shown in Equation (14), the ASWD can be rewritten as:
  ASWDk(µ,ν;g)= (∫ Sdθ−1 W kk ( Rµ̂g (·,θ),Rν̂g (·,θ) ) dθ ) 1 k
  =SWDk(µ̂g,ν̂g), (16)
  where µ̂g and ν̂g are probability measures on Rdθ which satisfy g(x)∼ µ̂g for x∼µ and g(y)∼ ν̂g for y∼ν. Theorem 1. The augmented sliced Wasserstein distance (ASWD) of order k ∈ [1,+∞) defined by Equation (15) with a mapping g(·) :Rd→Rdθ is a metric on Pk(Rd) if and only if g(·) is injective.
  The proof of Theorem 1 is provided in Appendix C. Theorem 1 shows that the ASWD is a metric given a fixed injective mapping g(·). In practical applications, the mapping g(·) needs to be optimized to project samples onto discriminating hypersurfaces. We show in Corollary 1.1 that the ASWD between µ and ν with the optimized g(·) is also a metric under mild conditions. Corollary 1.1. The augmented sliced Wasserstein distance (ASWD) of order k ∈ [1,+∞) between two probability measures µ,ν∈Pk(Rd) defined by Equation (15) with the optimal mapping
  g∗(·)=argmax g {ASWDk(µ,ν;g)−L(µ,ν,λ;g)} (17)
  is a metric on Pk(Rd), whereL(µ,ν,λ;g)=λ(E 1 k x∼µ [ ||g(x)||k2 ] +E 1 k y∼ν [ ||g(y)||k2 ] ) for λ∈(1,+∞).
  The proof of Corollary 1.1 is provided in Appendix D.
  Remark 3. Corollary 1.1 shows that given measures µ1,µ2,µ3∈Pk(Rd), the triangle inequality holds for the ASWD when g(·) is optimized for each pair of measures, as shown in Appendix D. It is worth noting thatλ>1 is a sufficient condition for the ASWD to be a metric – as further discussed in Remark 6, 0<λ≤1 can also lead to finite ||g(x)||2 in various scenarios, resulting in valid metrics. The discussion on the impact of λ on the performance of the ASWD in practice can be found in Appendix G.2.
sections.heading: 3.2 NUMERICAL IMPLEMENTATION
sections.text: We discuss in this section how to realize injective mapping g(·) with neural networks due to their expressiveness and optimize it with gradient based methods.
  Injective neural networks: As stated in Lemma 1 and Theorem 1, the injectivity of g(·) is the sufficient and necessary condition for the ASWD being a valid metric. Thus we need specific architecture designs on implementing g(·) by neural networks. One option is the family of invertible neural networks (Behrmann et al., 2019; Karami et al., 2019), which are both injective and surjective. However, the running cost of those models is usually much higher than that of vanilla neural networks. We propose an alternative approach by concatenating the input x of an arbitrary neural network to its output φω(x):
  gω(x)=[x,φω(x)]. (18)
  It is trivial to show that gω(x) is injective, since different inputs will lead to different outputs. Although embarrassingly simple, this idea of concatenating the input and output of neural networks has found success in preserving information with dense blocks in the DenseNet (Huang et al., 2017), where the input of each layer is injective to the output of all preceding layers.
  Optimization objective: We aim to slice distributions with maximally discriminating hypersurfaces between two distributions while avoiding the projected samples being arbitrarily large, so that the projected samples between the compared distributions are finite and most dissimilar regarding the ASWD, as shown in Figure 1. Similar ideas have been employed to identify important projection directions (Deshpande et al., 2019; Kolouri et al., 2019a; Paty and Cuturi, 2019) or a discriminative ground metric (Salimans et al., 2018) in optimal transport metrics. For the ASWD, the parameterized injective neural network gω(·) is optimized by maximizing the following objective:
  L(µ,ν;gω,λ)= (∫ Sdθ−1 W kk ( Hµ(·,θ;gω),Hν(·,θ;gω) ) dθ ) 1 k −L(µ,ν,λ;gω), (19)
  where λ>0 and the regularization term L(µ,ν,λ;gω)=λ(E 1 k x∼µ [ ||gω(x)||k2 ] +E 1 k y∼ν [ ||gω(y)||k2 ] ) on the magnitude of the neural network’s output is used, otherwise the projections may be arbitrarily large.
  Remark 4. The regularization coefficient λ adjusts the introduced non-linearity in the evaluation of the ASWD by controlling the norm of φω(·) in Equation (18). In particular, when λ→∞, the nonlinear term φω(·) shrinks to 0. The intrinsic dimension of the augmented space, i.e. the number of non-zero dimensions in the augmented space, is hence explicitly controlled by the flexible choice of φω(·) and implicitly regularized byL(µ,ν,λ;gω).
  By plugging the optimized g∗ω,λ(·) = argmax gω (L(µ, ν; gω, λ)) into Equation (15), we obtain the empirical version of the ASWD. Pseudocode is provided in Appendix E.
sections.heading: 4 RELATED WORK
sections.text: Recent work on slice-based Wasserstein distances mainly focused on improving their projection efficiency, leading to a reduced number of projections needed to capture the structure of data distributions (Kolouri et al., 2019a; Nguyen et al., 2021). The GSWD proposes using nonlinear projections to achieve this goal, and it has been proved to be a valid distance metric if and only if they adopt injective GRTs, which only include the circular functions and a finite number of harmonic polynomial functions with odd degrees as their feasible defining functions (Ehrenpreis, 2003). While the GSWD has shown impressive performance in various applications (Kolouri et al., 2019a), its defining function is restricted to the aforementioned limited class of candidates. In addition, the
  selection of defining function is usually task-dependent and needs domain knowledge, and the impact on performance from different defining functions is still unclear.
  To tackle those limitations, (Kolouri et al., 2019a) proposed the GSWD-NN, which directly takes the outputs of a neural network as its projection results without using the standard Radon transform or GRTs. However, this brings three side effects: 1) The number of projections, which equals the number of nodes in the neural network’s output layer, is fixed, thus new neural networks are needed if one wants to change the number of projections. 2) There is no random projections involved in the GSWD-NN, as the projection results are determined by the inputs and weights of the neural network. 3) The GSWD-NN is a pseudo-metric since it uses a vanilla neural network, rather than Radon transform or GRTs, as its push-forward operator. Therefore, the GSWD-NN does not fit into the theoretical framework of GSWD and does not inherit its geometric properties.
  Another notable variant of the SWD is the distributional sliced Wasserstein distance (DSWD) (Nguyen et al., 2021). By finding a distribution of projections that maximizes the expected distances over these projections, the DSWD can slice distributions from multiple directions while having high projection efficiency. Injective GRTs are also used to extend the DSWD to the distributional generalized sliced Wasserstein distance (DGSWD) (Nguyen et al., 2021). Experiment results show that the DSWD and the DGSWD have superior performance in generative modelling tasks (Nguyen et al., 2021). However, neither the DSWD nor the DGSWD have solved the problem with the GSWD, i.e. they are still not able to produce nonlinear projections adaptively.
  Our contribution differs from previous work in three ways: 1) The ASWD is data-adaptive, i.e. the hypersurfaces where high-dimensional distributions are projected onto can be learned from data. This implies one does not need to specify a defining function from limited choices. 2) Unlike GSWD-NN, the ASWD takes a novel direction to incorporate neural networks into the framework of sliced-based Wasserstein distances while maintaining the properties of sliced Wasserstein distances. 3) Previous work on introducing nonlinear projections into Radon transform either is restricted to only a few candidates of defining functions (GRTs) or breaks the framework of Radon transforms (neural networks in GSWD-NN), in contrast, the spatial Radon transform provides a novel way of defining nonlinear Radon-type transforms.
sections.heading: 5 EXPERIMENTS
sections.text: In this section, we describe the experiments that we have conducted to evaluate performance of the proposed distance metric. The GSWD leads to the best performance in a sliced Wasserstein flow problem reported in (Kolouri et al., 2019a) and the DSWD outperforms the compared methods in the generative modeling task examined in (Nguyen et al., 2021) on CIFAR 10 (Krizhevsky, 2009), CelebA (Liu et al., 2015), and MNIST (LeCun et al., 1998) datasets (Appendix H.2). Hence, we compare performance of the ASWD with the state-of-the-art distance metrics in the same examples and report results as below1. We provide additional experiment results in the appendices, including a sliced Wasserstein autoencoder (SWAE) (Kolouri et al., 2019b) using the ASWD (Appendix I), image color transferring (Appendix J) and sliced Wasserstein barycenters (Appendix K).
  To examine the robustness of the ASWD, throughout the experiments, we adopt the injective network architecture given in Equation (18) and set φω to be a single fully-connected layer neural network whose output dimension equals its input dimension, with a ReLU layer as its activation function. The order k is set to be 2 in all experiments.
sections.heading: 5.1 SLICED WASSERSTEIN FLOWS
sections.text: We first consider the problem of evolving a source distributionµ to a target distribution ν by minimizing slice-based Wasserstein distances between µ and ν in the sliced Wasserstein flow task reported in (Kolouri et al., 2019a).
  ∂tµt=−∇SWD(µt,ν), (20) where µt refers to the updated source distribution at each iteration t. The SWD in Equation (20) can be replaced by other sliced-Wasserstein distances to be evaluated. As in (Kolouri et al., 2019a), the 2-Wasserstein distance was used as the metric for evaluating performance of different distance metrics in this task. The set of hyperparameter values used in this experiment can be found in Appendix F.1.
  1Code to reproduce experiment results is available at : https://bit.ly/2Y23wOz.
  Without loss of generality, we initialize µ0 to be the standard normal distributionN (0,I). We repeat each experiment 50 times and record the 2-Wasserstein distance between µ and ν at every iteration. In Figure 2, we plot the 2-Wasserstein distances between the source and target distributions as a function of the training epochs and the 8-Gaussian, the Knot, the Moon, and the Swiss roll distributions are respective target distributions. For clarity, Figure 2 displays the experiment results from the 6 best performing distance metrics, including the ASWD, the DSWD, the SWD, the GSWD-NN 1, which directly generates projections through a one layer MLP, as well as the GSWD with the polynomial of degree 3, circular defining functions, out of the 12 distance metrics we compared.
  We observe from Figure 2 that the ASWD not only leads to smaller 2-Wasserstein distances, but also converges faster by achieving better results with fewer iterations than the other methods in these four target distributions. A complete set of experimental results with 12 compared distance metrics and 8 target distributions are included in Appendix G.1. The ASWD outperforms the compared state-of-the-art sliced-based Wasserstein distance metrics with 7 out of the 8 target distributions except for the 25-Gaussian. This is achieved through the simple injective network architecture given in Equation (18) and a one layer fully-connected neural network with equal input and output dimensions throughout the experiments. In addition, ablation study is conducted to study the effect of injective neural networks, the regularization coefficient λ, the choice of the dimensionality dθ of the augmented space, and the optimization of hypersurfaces in the ASWD. Details can be found in Appendix G.2.
sections.heading: 5.2 GENERATIVE MODELING
sections.text: In this experiment, we use sliced-based Wasserstein distances for a generative modeling task described in (Nguyen et al., 2021). The task is to generate images using generative adversarial networks (GANs) (Goodfellow et al., 2014) trained on either the CIFAR10 dataset (64×64 resolution) (Krizhevsky, 2009) or the CelebA dataset (64×64 resolution) (Liu et al., 2015). Denote the hidden layer and the output layer of the discriminator by hψ andDΨ, and the generator byGΦ, we train GAN models with the following objectives:
  min Φ SWD(hψ(pr),hψ(GΦ(pz))), (21)
  max Ψ,ψ Ex∼pr [log(DΨ(hψ(x)))]+Ez∼pz [log(1−DΨ(hψ(GΦ(z))))], (22)
  where pz is the prior of latent variable z and pr is the distribution of real data. The SWD in Equation (21) is replaced by the ASWD and other variants of the SWD to compare their performance. The
  GSWD with the polynomial defining function and the DGSWD is not included in this experiment due to its excessively high computational cost in high-dimensional space. The Fréchet Inception Distance (FID score) (Heusel et al., 2017) is used to assess the quality of generated images. More details on the network structures and the parameter setup used in this experiment are available in Appendix F.2.
  We run 200 and 100 training epochs to train the GAN models on the CIFAR10 and the CelebA dataset, respectively. Each experiment is repeated for 10 times and results are reported in Table 1. With the same number of projections and a similar computation cost, the ASWD leads to significantly improved FID scores among all evaluated distances metrics on both datasets, which implies that images generated with the ASWD are of higher qualities. Figure 3 plots the FID scores recorded during the training process. The GAN model trained with the ASWD exhibits a faster convergence as it reaches smaller FID scores with fewer epochs. Randomly selected samples of generated images are presented in Appendix H.1.
sections.heading: 6 CONCLUSION
sections.text: We proposed a novel variant of the sliced Wasserstein distance, namely the augmented sliced Wasserstein distance (ASWD), which is flexible, has a high projection efficiency, and generalizes well. The ASWD adaptively updates the hypersurfaces used to slice compared distributions by learning from data. We proved that the ASWD is a valid distance metric and presented its numerical implementation. We reported empirical performance of the ASWD over state-of-the-art sliced Wasserstein metrics in various numerical experiments. We showed that ASWD with a simple injective neural network architecture can lead to the smallest distance errors over the majority of datasets in a sliced Wasserstein flow task and superior performance in generative modeling tasks involving GANs and VAEs. We have also evaluated the applications of the ASWD in downstream tasks including color transferring and Wasserstein barycenters. What remains to be explored includes the topological properties of the ASWD. We leave this topic as an interesting future research direction.
sections.heading: APPENDIX A PROOF OF THE LEMMA 1
sections.text: We prove that the spatial Radon transform defined with a measurable mapping g(·) :Rd→Rdθ is an injection onPk(Rd) if and only if g(·) is injective. In the following contents, we usePk(Rd) to denote a set of Borel probability measures with finite k-th moment onRd, and f1≡f2 is used to denote functions f1(·) :X→R and f2(·) :X→R that satisfy f1(x)=f2(x) for ∀x∈X , and f1 6≡f2 is used to denote functions f1(·) :X→R and f2(·) :X→R that satisfy f1(x) 6= f2(x) for certain x∈X . In addition, for probability measures µ and ν, we use µ≡ν to denote µ,ν∈Pk(Rd) that satisfy µ(X )=ν(X ) for ∀X ⊆Rd, and µ 6≡ν to denote µ,ν∈Pk(Rd) that satisfy µ(X ) 6=ν(X ) for certainX ⊆Rd.
  Proof. By using proof by contradiction, we first prove that if g(·) is injective, the corresponding spatial Radon transform is injective. If the spatial Radon transform defined with an injective mapping g(·) :Rd→Rdθ is not injective, there exist µ, ν ∈Pk(Rd), µ 6≡ ν, such thatHµ(t,θ;g)≡Hν(t,θ;g) for ∀t∈R and ∀θ∈Sdθ−1. From Equation (14), for ∀t∈R and ∀θ∈Sdθ−1, the spatial Radon transform of µ can be written as:
  Hµ(t,θ;g)=Rµ̂g (t,θ), (23) Hν(t,θ;g)=Rν̂g (t,θ), (24)
  where µ̂g and ν̂g refer to the push-forward measures g#µ and g#ν, respectively. From the assumption Hµ(t,θ;g)≡Hν(t,θ;g) and Equations (23) and (24), we knowRµ̂g (t,θ)≡Rν̂g (t,θ) for ∀t∈R and ∀θ∈Sdθ−1, which implies µ̂g≡ ν̂g since the Radon transform is injective.
  Since g(·) is injective, for all measurableX ⊆Rd, x∈X if and only if x̂=g(x)∈g(X ), which implies P (x∈X )=P (x̂∈g(X )), P (y∈X )=P (ŷ∈g(X )). Therefore,∫
  g(X ) dµ̂g= ∫ X dµ, (25)∫
  g(X ) dν̂g= ∫ X dν. (26)
  Since µ̂g≡ ν̂g , from Equations (25) and (26) we have: ∫ Xdµ= ∫ Xdν for∀X ⊆R
  d. Hence, for∀X ⊆Rd:∫ X d(µ−ν)=0, (27)
  which implies µ≡ ν, contradicting with the assumption µ 6≡ ν. Therefore, if Hµ ≡Hν , µ≡ ν. In addition, from the definition of the spatial Radon transform in Equation (13), it is trivial to show that if µ≡ ν, Hµ(t,θ;g)≡Hν(t,θ;g). Therefore, Hµ ≡Hν if and only if µ≡ ν, i.e. the spatial Radon transformH defined with an injective mapping g(·) :Rd→Rdθ is injective. We now prove that if the spatial Radon transform defined with a mapping g(·) : Rd → Rdθ is injective, g(·) must be injective. Again, we use proof by contradiction. If g(·) is not injective, there exist x0,y0 ∈ Rd such that x0 6= y0 and g(x0) = g(y0). For Dirac measures µ1 and ν1 defined by µ1(X )= ∫ X δ(x−x0)dx and ν1(Y)= ∫ Yδ(y−y0)dy, whereX ,Y⊆R d, we know µ1 6≡ν1 as x0 6=y0.
  We define variables x∼µ1 and y∼ ν1. Then for variables x̂= g(x)∼µ2 and ŷ= g(y)∼ ν2, where µ2 and ν2 are push-forward measures g#µ1 and g#ν1, it is trivial to derive for ∀X ,Y⊆Rd
  µ2(g(X ))= ∫ g(X ) δ(x̂−g(x0))dx̂, (28)
  ν2(g(Y))= ∫ g(Y) δ(ŷ−g(y0))dŷ, (29)
  which implies µ2≡ν2 as g(x0)=g(y0). From Equations (23), (24), (28) and (29), for ∀t∈R and ∀θ∈Sdθ−1:
  Hµ1(t,θ;g)=Rµ2(t,θ), =Rν2(t,θ), =Hν1(t,θ;g), (30)
  contradicting with the assumption that the spatial Radon transform is injective. Therefore, if the spatial Radon transform is injective, g(·) must be injective. We conclude that the spatial Radon transform is injective if and only if the mapping g(·) is an injection on Pk(Rd).
sections.heading: APPENDIX B SPECIAL CASES OF SPATIAL RADON TRANSFORMS
sections.text: Remark 5. The spatial Radon transform degenerates to the vanilla Radon transform when the mapping g(·) is an identity mapping. In addition, the spatial Radon transform is equivalent to the polynomial GRT (Ehrenpreis, 2003) when g(x)=(xα1 ,...,xαdα ), where α is multi-indices αi=(ηi,1,...,ηi,d)∈Nd
  satisfying |αi|= ∑d j=1ηi,j=m. m is the degree of the polynomial function, x αi = ∏d j=1x ηi,j j given an input x=(x1,...,xd)∈Rd, and dα is the number of all possible multi-indicesαi that satisfies |αi|=m.
  We provide a proof for the claim in Remark 5.
  Proof. Given a probability measure µ∈P (Rd), the spatial Radon transform of µ is defined as: Hµ(t,θ;g)= ∫ Rd δ(t−〈g(x),θ〉)dµ, (31)
  where t∈R and θ∈Sdθ−1 are the parameters of hypersurfaces in Rd. When the mapping g(·) is an identity mapping, i.e. g(x) =x for ∀x∈Rd, the spatial Radon transform degenerates to the vanilla Radon transform:
  Hµ(t,θ;g)= ∫ Rd δ(t−〈x,θ〉)dµ
  =Rµ(t,θ). (32)
  For GRTs, (Ehrenpreis, 2003) provides a class of injective GRTs named polynomial GRTs by adopting homogeneous polynomial functions with an odd degreem as the defining function:
  Gµ(t,θ)= ∫ Rd δ(t− dα∑ i=1 θix αi)dµ,
  s.t.|αi|=m, (33)
  where αi=(ηi,1,...,ηi,d)∈Nd, |αi|= ∑d j=1ηi,j , x αi = ∏d j=1x ηi,j j for x=(x1,...,xd)∈Rd, dα is the number of all possible multi-indices αi that satisfies |αi|=m, and θ=(θ1,...,θdα)∈Sdα−1. In spatial Radon transform, for ∀x∈Rd, when the mapping g(·) is defined as:
  g(x)=(xα1 ,...,xαdα ), (34)
  the spatial Radon transform is equivalent to the polynomial GRT defined in Equation (33): Hµ(t,θ;g)= ∫ Rd δ(t−〈g(x),θ〉)dµ
  = ∫ Rd δ(t− dα∑ i=1 θix αi)dµ. (35)
sections.heading: APPENDIX C PROOF OF THEOREM 1
sections.text: We provide a proof that the ASWD defined with a mapping g(·) :Rd→Rdθ is a metric onPk(Rd), if and only if g(·) is injective. In what follows, we denote a set of Borel probability measures with finite k-th moment on Rd by Pk(Rd), and use µ,ν∈Pk(Rd) to refer to two probability measures defined on Rd.
  Proof. Symmetry: Since the k-Wasserstein distance is a metric thus symmetric (Villani, 2008): Wk ( Hµ(·,θ;g),Hν(·,θ;g) ) =Wk ( Hν(·,θ;g),Hµ(·,θ;g) ) . (36)
  Therefore, ASWDk(µ,ν;g)= (∫ Sdθ−1 W kk ( Hµ(·,θ;g),Hν(·,θ;g) ) dθ ) 1 k
  = (∫ Sdθ−1 W kk ( Hν(·,θ;g),Hµ(·,θ;g) ) dθ ) 1 k =ASWDk(ν,µ;g).
  Triangle inequality: Given an injective mapping g(·) : Rd → Rdθ and probability measures µ1, µ2, µ3∈Pk(Rd), since the k-Wasserstein distance satisfies the triangle inequality (Villani, 2008), the following inequality holds:
  ASWDk(µ1,µ3;g)= (∫ Sdθ−1 W kk ( Hµ1(·,θ;g),Hµ3(·,θ;g) ) dθ ) 1 k
  ≤ (∫
  Sdθ−1
  ( Wk(Hµ1(·,θ;g),Hµ2(·,θ;g))
  +Wk(Hµ2(·,θ;g),Hµ3(·,θ;g)) )k dθ
  ) 1 k
  ≤ (∫ Sdθ−1 W kk ( Hµ1(·,θ;g),Hµ2(·,θ;g) ) dθ ) 1 k
  + (∫ Sdθ−1 W kk ( Hµ2(·,θ;g),Hµ3(·,θ;g) ) dθ ) 1 k
  =ASWDk(µ1,µ2;g)+ASWDk(µ2,µ3;g),
  where the second inequality is due to the Minkowski inequality inLk(Sdθ−1).
  Identity of indiscernibles: SinceWk(µ,µ)=0 for ∀µ∈Pk(Rd),we have
  ASWDk(µ,µ;g)= (∫ Sdθ−1 W kk ( Hµ(·,θ;g),Hµ(·,θ;g) ) dθ ) 1 k =0, (37)
  for ∀µ∈Pk(Rd). Conversely, for ∀µ,ν ∈Pk(Rd), if ASWDk(µ,ν;g) = 0, from the definition of the ASWD:
  ASWDk(µ,ν;g)= (∫ Sdθ−1 W kk ( Hµ(·,θ;g),Hν(·,θ;g) ) dθ ) 1 k =0, (38)
  Due to the non-negativity of k-th Wasserstein distance as it is a metric on Pk(Rd) and the continuity ofWk(·,·) on Pk(Rd) (Villani, 2008),Wk ( Hµ(·,θ;g),Hν(·,θ;g) ) =0 holds for ∀θ∈Sdθ−1 if and only ifHµ(·,θ;g)≡Hν(·,θ;g). Again, given the spatial Radon transform is injective when g(·) is injective (see the proof in Appendix A),Hµ(·,θ;g)≡Hν(·,θ;g) implies µ≡ν if g(·) is injective. In addition, if g(·) is not injective, the spatial Radon transform is not injective (see the proof in Appendix A), then ∃µ, ν∈Pk(Rd), µ 6≡ν such thatHµ(·,θ;g)≡Hν (·,θ;g), which implies ASWDk(µ,ν;g)=0 for µ 6≡ν. Therefore, the ASWD satisfies the identity of indiscernibles if and only if g(·) is injective. Non-negativity: The three axioms of a distance metric, i.e. symmetry, triangle inequality, and identity of indiscernibles imply the non-negativity of the ASWD. Since the Wasserstein distance is non-negative,
  for ∀µ ,ν∈Pk(Rd), it can also be straightforwardly proved the ASWD betweenµ and ν is non-negative:
  ASWDk(µ,ν;g)= (∫ Sdθ−1 W kk ( Hµ(·,θ;g),Hν(·,θ;g) ) dθ ) 1 k
  ≥ (∫
  Sdθ−1 0kdθ
  ) 1 k
  =0. (39)
  Therefore, the ASWD is a metric on Pk(Rd) if and only if g(·) is injective.
sections.heading: APPENDIX D PROOF OF COROLLARY 1.1
sections.text: We first introduce Lemma 2 to support the proof of Corollary 1.1. Lemma 2. For λ ∈ (1, +∞), the optimal mapping g∗(·) defined by Equation (17) satisfies ||g∗(x)||2<∞ for ∀x∈Rd∼µ and ∀x∈Rd∼ν.
  Proof. Recall that in Equation (16) the ASWD can be rewritten as:
  ASWDk(µ,ν;g)=SWDk(µ̂g,ν̂g)
  = (∫ Sdθ−1 W kk ( Rµ̂g (·,θ),Rν̂g (·,θ) ) dθ ) 1 k , (40)
  where transformed variables x̂ = g(x) ∼ µ̂g for x ∼ µ and ŷ = g(y) ∼ ν̂g for y ∼ ν, respectively. Combining the equation above with Equation (2):
  ASWDk(µ,ν;g)= (∫ Sdθ−1 W kk ( Rµ̂g (·,θ),Rν̂g (·,θ) ) dθ ) 1 k
  = (∫ Sdθ−1 ∫ 1 0 |F−1Pθ#µ̂g (z)−F −1 Pθ#ν̂g (z)|kdzdθ ) 1 k
  ≤ (∫
  Sdθ−1 ∫ 1 0 ( |F−1Rθ(µ̂g)(z)|+|F −1 Rθ(ν̂g) (z)| )k dzdθ ) 1 k , (41)
  where # denotes the push forward operator,Pθ :x∈Rdθ→〈x,θ〉∈R, andRθ(µ̂g)=Pθ#µ̂g ,Rθ(ν̂g)= Pθ#ν̂g refer to one-dimensional measures obtained by slicing µ̂g , ν̂g with a unit vector θ, F−1Rθ(µ̂g) and F−1Rθ(ν̂g) are inverse cumulative distribution functions (CDFs) ofRθ(µ̂g) andRθ(ν̂g), respectively.
  By repeatedly applying the Minkowski’s inequality to Equation (41), we obtain the following inequalities:
  ASWDk(µ,ν;g)≤ (∫
  Sdθ−1 ∫ 1 0 ( |F−1Rθ(µ̂g)(z)|+|F −1 Rθ(ν̂g) (z)| )k dzdθ ) 1 k
  ≤ (∫
  Sdθ−1 [(∫ 1 0 |F−1Rθ(µ̂g)(z)| kdz ) 1 k + (∫ 1 0 |F−1Rθ(ν̂g)(z)| kdz ) 1 k ]k dθ ) 1 k ,
  ≤ [∫
  Sdθ−1 ∫ 1 0 |F−1Rθ(µ̂g)(z)| kdzdθ ] 1 k + [∫ Sdθ−1 ∫ 1 0 |F−1Rθ(ν̂g)(z)| kdzdθ ] 1 k . (42)
  Let s=〈x̂,θ〉, then z=FRθ(µ̂g)(s), dz=dFRθ(µ̂g)(s):∫ 1 0 |F−1Rθ(µ̂g)(z)| kdz= ∫ R |s|kdFRθ(µ̂g)(s)
  = ∫ Rdθ |〈x̂,θ〉|kdµ̂g
  = ∫ Rd |〈g(x),θ〉|kdµ, (43)
  where the last two equations are obtained through the definitions of the push-forward operators. Therefore, the following inequalities hold:
  ASWDk(µ,ν;g)≤ [∫
  Sdθ−1 ∫ 1 0 |F−1Rθ(µ̂g)(z)| kdzdθ ] 1 k + [∫ Sdθ−1 ∫ 1 0 |F−1Rθ(ν̂g)(z)| kdzdθ ] 1 k
  = [∫ Sdθ−1 ∫ Rd |〈g(x),θ〉|kdµdθ ] 1 k + [∫ Sdθ−1 ∫ Rd |〈g(y),θ〉|kdνdθ ] 1 k ≤E 1 k x∼µ [ ||g(x)||k2 ] +E 1 k y∼ν [ ||g(y)||k2 ] . (44)
  Then we obtain the following inequalities for the optimization objective:
  ASWDk(µ,ν;g)−L(µ,ν,λ;g) ≤ ( E 1 k x∼µ [ ||g(x)||k2 ] +E 1 k y∼ν [ ||g(y)||k2 ]) −λ(E 1 k x∼µ [ ||g(x)||k2 ] +E 1 k y∼ν [ ||g(y)||k2 ] )
  = ( 1−λ )( E 1 k x∼µ [ ||g(x)||k2 ] +E 1 k y∼ν [ ||g(y)||k2 ]) . (45)
  When we set λ∈ (1,+∞), if ∃x∈Rd∼ µ or y ∈Rd∼ ν such that ||g(x)||2→∞ or ||g(y)||2→∞, the optimization objective approaches negative infinity, implying g(·) is not the optimal mapping. Therefore, by adopting Equation (17) as the optimization objective, the optimal mapping g∗(·) satisfies ||g∗(x)||2<∞ for ∀x∈Rd∼µ and ∀x∈Rd∼ν.
  Remark 6. It is worth noting that λ> 1 in Corollary 1.1 is a sufficient condition for the supremum of the optimization objective to be non-positive and ||g∗(x)||2<∞ for ∀x∈Rd∼µ and ∀x∈Rd∼ν. 0<λ≤ 1 can also lead to finite ||g(x)||2 in various scenarios. Specifically, the upper bound of the optimization objective given in Equation (44) is obtained by applying:
  |〈g(x),θ〉|= ||g(x)||2|cos(α)|≤||g(x)||2, (46)
  where α is the angle between θ and g(x). In high-dimensional spaces, Equation (46) gives a very loose bound since in high-dimensional spaces the majority of sampled θ would be nearly orthogonal to g(x) and cos(α) is nearly zero with high probability (Kolouri et al., 2019a). Empirically we found that across all the experiment results, λ in a candidate set of {0.01,0.05,0.1,0.5,1,10,100} all lead to finite g∗(·).
  We now prove Corollary 1.1, i.e ASWDk(µ,ν;g∗) is a metric on Pk(Rd) , where g∗(·) is the optimal mapping defined by Equation (17) for λ∈(1,+∞).
  Proof. Symmetry: Since the k-Wasserstein distance is a metric thus symmetric (Villani, 2008): Wk ( Hµ(·,θ;g∗),Hν(·,θ;g∗) ) =Wk ( Hν(·,θ;g∗),Hµ(·,θ;g∗) ) . (47)
  Therefore,
  ASWDk(µ,ν;g∗)= (∫ Sdθ−1 W kk ( Hµ(·,θ;g∗),Hν(·,θ;g∗) ) dθ ) 1 k
  = (∫ Sdθ−1 W kk ( Hν(·,θ;g∗),Hµ(·,θ;g∗) ) dθ ) 1 k =ASWDk(ν,µ;g∗).
  Triangle inequality: From Lemma 2, when λ ∈ (1,+∞), the optimal mapping g∗(·) satisfies ||g∗(x)||2<∞ for ∀x∈Rd∼µ and ∀x∈Rd∼ν, hence ASWDk(ν,µ;g∗) is finite due to Equation (16). We then prove that ASWDk(ν,µ;g∗) satisfies the triangle inequality.
  Denote by g∗1 , g ∗ 2 , and g ∗ 3 optimal mappings that result in the supremum of Equation (19) between µ1 and µ2, µ1 and µ3, µ2 and µ3, respectively, since ASWDk(µ1,µ2;g∗1), ASWDk(µ1,µ3;g ∗ 2), and ASWDk(µ2,µ3;g∗3) are finite, the following equations hold:
  ASWDk(µ1,µ2;g∗1)≤ASWDk(µ1,µ3;g∗1)+ASWDk(µ2,µ3;g∗1) (48) ≤sup
  g {ASWDk(µ1,µ3;g)}+sup g {ASWDk(µ2,µ3;g)} (49) =ASWDk(µ1,µ3;g∗2)+ASWDk(µ2,µ3;g ∗ 3), (50)
  where the first inequality are from the metric property of the ASWD.
  Identity of indiscernibles: SinceWk(µ,µ)=0 for ∀µ∈Pk(Rd),we have
  ASWDk(µ,µ;g∗)= (∫ Sdθ−1 W kk ( Hµ(·,θ;g∗),Hµ(·,θ;g∗) ) dθ ) 1 k =0, (51)
  for ∀µ∈Pk(Rd). Conversely, for ∀µ,ν∈Pk(Rd), if ASWDk(µ,ν;g∗)=0, from Equation (15):
  ASWDk(µ,ν;g∗)= (∫ Sdθ−1 W kk ( Hµ(·,θ;g∗),Hν(·,θ;g∗) ) dθ ) 1 k =0. (52)
  Due to the non-negativity of k-th Wasserstein distance as it is a metric on Pk(Rd) and the continuity ofWk(·,·) on Pk(Rd) (Villani, 2008),Wk ( Hµ(·,θ;g∗),Hν(·,θ;g∗) ) =0 holds for ∀θ∈Sdθ−1, which impliesHµ(·,θ;g∗)≡Hν(·,θ;g∗) for ∀θ ∈ Sdθ−1. Therefore, given the spatial Radon transform is injective when g∗(·) is injective,Hµ(·,θ;g∗)≡Hν(·,θ;g∗) implies µ≡ν.
  Non-negativity: Since the Wasserstein distance is non-negative, for ∀µ ,ν ∈ Pk(Rd), the ASWD defined with optimal mappings g(·) between µ and ν is also non-negative:
  ASWDk(µ,ν;g∗)= (∫ Sdθ−1 W kk ( Hµ(·,θ;g∗),Hν(·,θ;g∗) ) dθ ) 1 k
  ≥ (∫
  Sdθ−1 0kdθ
  ) 1 k
  =0. (53)
  Therefore, the ASWD defined with the optimal mapping g∗(·) is non-negative, symmetric, and satisfies the triangle inequality and the identity of indiscernibles, i.e. the ASWD defined with optimal mappings g∗(·) is also a metric.
sections.heading: APPENDIX E PSEUDOCODE FOR THE EMPIRICAL VERSION OF THE ASWD
sections.text: Algorithm 1 The augmented sliced Wasserstein distance. All of the for loops can be parallelized.
  Require: Sets of samples {xn∈Rd}Nn=1, {yn∈Rd}Nn=1; Require: Randomly initialized injective neural network gω(·) :Rd→Rdθ ; Require: Number of projectionsL, hyperparameter λ, learning rate , number of iterationsM ;
  1: InitializeD=0,Lλ=0,m=1; 2: while ω has not converged andm≤M do 3: Draw a set of samples {θl}Ll=1 from ∈Sdθ−1; 4: for n=1 toN do 5: Compute gω(xn) and gω(yn);
  6: Calculate the regularization termLλ←Lλ+λ [ ( ||gω(xn)||k2 N ) 1 k +( ||gω(yn)||k2 N ) 1 k ] ; 7: end for 8: for l=1 toL do 9: Compute β(xn,θl)=〈gω(xn),θl〉, β(yn,θl)=〈gω(yn),θl〉 for each n;
  10: Sort β(xn,θl) and β(yn,θl) in ascending order s.t. β(xIlx[n],θl) ≤ β(xIlx[n+1],θl) and β(yIly [n],θl)≤β(yIly [n+1],θl);
  11: Calculate the ASWD:D←D+( 1L ∑N n=1|β(xIlx[n],θl)−β(yIly [n],θl)| k) 1 k ; 12: end for 13: L←D−Lλ; 14: Update ω by gradient ascent ω←ω+ ·∇ωL; 15: ResetD=0,Lλ=0, updatem←m+1; 16: end while 17: Draw a set of samples {θl}Ll=1 from ∈Sdθ−1; 18: for n=1 toN do 19: Compute gω(xn) and gω(yn); 20: end for 21: for l=1 toL do 22: Compute β(xn,θl)=〈gω(xn),θl〉, β(yn,θl)=〈gω(yn),θl〉 for each n; 23: Sort β(xn, θl) and β(yn, θl) in ascending order s.t. β(xIlx[n], θl) ≤ β(xIlx[n+1], θl) and β(yIly [n],θl)≤β(yIly [n+1],θl); 24: Calculate the ASWD:D←D+( 1L ∑N n=1|β(xIlx[n],θl)−β(yIly [n],θl)| k) 1 k ; 25: end for 26: Output: Augmented sliced Wasserstein distanceD.
  In Algorithm 1, Equation (17) is used as the optimization objective, where the regularization term L(µ,ν,λ;gω) =λ(E 1 k x∼µ [ ||gω(x)||k2 ] +E 1 k y∼ν [ ||gω(y)||k2 ] ) is used. This particular choice of the regularization term facilitates the proofs to Lemma 2 and subsequently to Corollary 1.1 with details in Appendix D. In fact, we have also examined other types of regularization terms such as theL2 norm of the output of g(·), and empirically they produce similar numerical results as the current regularization term.
sections.heading: APPENDIX F EXPERIMENTAL SETUPS
sections.text: F.1 HYPERPARAMETERS IN THE SLICED WASSERSTEIN FLOW EXPERIMENT
  We randomly generate 500 samples both for target distributions and source distributions. We initialize the source distributions µ0 as standard normal distributions N (0, I), where I is a 2-dimensional identity matrix. We update source distributions using Adam optimizer, and set the learning rate=0.002. For all methods, we set the order k = 2. When testing the ASWD, the number of iterations M in Algorithm 1 is set to 10.
  In the sliced Wasserstein flow experiment the mapping g∗(·) optimized by maximizing Equation (17) was found to be finite for all values of λ in the set of {0.01, 0.05, 0.1, 0.5, 1, 10, 100}, which is a sufficient condition for the ASWD to be a valid metric as shown in the proof of corollary 1.1 provided in Appendix D. In addition, numerical results presented in Appendix G.2 indicate that empirical errors in the experiment are not sensitive to the choice of λ in the candidate set {0.01, 0.05, 0.1, 0.5}. The reported results in the main paper are produced with λ=0.1.
  F.2 NETWORK ARCHITECTURE IN THE GENERATIVE MODELING EXPERIMENT
  Denote a convolutional layer whose kernel size is s with C kernels by ConvC(s × s), and a fully-connected layer whose input and output layer have s1 and s2 neurons by FC(s1× s2). The network structure used in the generative modeling experiment is configured to be the same as described in (Nguyen et al., 2021):
  hψ : (64×64×3)→Conv64(4×4)→LeakyReLU(0.2)→ Conv128(4×4)→BatchNormalization→LeakyReLU(0.2)→ Conv256(4×4)→BatchNormalization→LeakyReLU(0.2)→
  Conv512(4×4)→BatchNormalization→Tanh Output−−−→(512×4×4)
  DΨ :Conv1(4×4)→Sigmoid Output−−−→(1×1×1)
  GΦ :z∈R100→ConvTranspose512(4×4)→ BatchNormalization→ReLU→ConvTranspose256(4×4)→ BatchNormalization→ReLU→ConvTranspose128(4×4)→ BatchNormalization→ReLU→ConvTranspose64(4×4)→ BatchNormalization→ConvTranspose3(4×4)→Tanh
  Ouput−−−→(64×64×3)
  φ :FC(8192×8192) Output−−−→(8192)-dimensional vector
  We train the models with the Adam optimizer, and set the batch size to 512. Following the setup in (Nguyen et al., 2021), the learning rate is set to 0.0005 and beta=(0.5, 0.999) for both CIFAR10 dataset and CelebA dataset. For all methods, we set the order k to 2. For the ASWD, the number of iterationsM in Algorithm 1 is set to 5. The hyperparameter λ is set to 1.01 to guarantee that the ASWD being a valid metric and introduce slightly larger regularization of the optimization objective due to the small output values from the feature layer hψ .
sections.heading: APPENDIX G ADDITIONAL
sections.text: RESULTS IN THE SLICED WASSERSTEIN FLOW EXPERIMENT
  G.1 FULL EXPERIMENTAL RESULTS ON THE SLICED WASSERSTEIN EXPERIMENT
  Figure 4 shows the full experimental results on the sliced Wasserstein flow experiment.
  G.2 ABLATION STUDY
  Impact of the injectivity and optimization of the mapping
  In this ablation study, we compare ASWDs constructed by different mappings to GSWDs with different predefined defining functions, and investigate the effects of the optimization and injectivity of the adopted mapping gω(·) used in the ASWDs. In what follows, “ASWD-vanilla" is used to denote ASWDs that employ randomly initialized neural network φω(·) to parameterize the injective mapping gω(·) = [·,φω(·)], i.e. the mapping gω(·) is not optimized in the ASWD-vanilla and the results of ASWD-vanilla reported in Figure 5 are obtained by slicing with random hypersurfaces. Furthermore, the “ASWD-non-injective" refers to ASWDs that do not use the injectivity trick, i.e. the mapping gω(·)=φω(·) is not guaranteed to be injective. In addition, the “ASWD-vanilla-non-injective" adopts both setups in the “ASWD-vanilla" and "ASWD-non-injective", resulting in a random non-injective mapping gω(·). The reported experiment results in this ablation study is calculated over 50 runs, and the neural network φω(·) is reinitialized randomly in each run. From Figure 5, it can be observed that the ASWD-vanilla shows comparable performance to GSWDs defined by polynomial and circular defining functions, which implies GSWDs with predefined defining functions are as uninformative as slicing distributions with random hypersurfaces constructed by the ASWD. In GSWDs, the hypersurfaces are predefined and cannot be optimized since they are determined by the functional forms of the defining functions. On the contrary, we found that the optimization of hypersurfaces in the ASWD framework can help improve the performance of the slice-based Wasserstein distance. As in Figure 5, the ASWD and the ASWD-non-injective present significantly better performance than methods that do not optimize their hypersurfaces (ASWD-vanilla, ASWDvanilla-non-injective, and GSWDs). In terms of the impact of the injectivity of the mapping gω , in this experiment, the ASWD-vanilla exhibits smaller 2-Wasserstein distances than the ASWD-vanilla-noninjective in all tested distributions, and the ASWD leads to more stable training than the ASWD-noninjective. Therefore, the injectivity of the mapping gω(·) does not only guarantee the ASWD to be a valid distance metric as proved in Section 3, but also better empirical performance in this experiment setup.
  Impact of the regularization coefficient
  We also evaluated the sensitivity of performance of the ASWD with respect to the regularization coefficient λ. The ASWD is evaluated with different values of λ and compared with other slice-based Wasserstein metrics in this ablation study. The numerical results presented in Figure 6 indicates that different values of λ in the candidate set {0.01, 0.05, 0.1, 0.5} lead similar performance of the ASWD, i.e the performance of the ASWD is not sensitive to λ. Additionally, the ASWDs with different values of λ in the candidate set outperform the other evaluated slice-based Wasserstein metrics.
  We have also evaluated the performance of the ASWD when the range of λ is much larger than in the candidate set. Specifically, as presented in Figure 7, when λ is set to be large values, e.g 10 or 100, the resulted ASWD leads to decreased performance on par with the SWD. This is consistent with our expectation that excessive regularization will eliminate nonlinearity as discussed in Remark 2, leading to similar performance with the SWD.
  In addition, the effect of the regularization term on the performance of Max-GSWD-NN was also investigated in this ablation study. The performance of the Max-GSWD-NN and the Max-GSWD-NN trained with the regularization term used in the ASWD are compared in Figure 8. From the numerical results presented in Figure 8, the Max-GSWD-NN 1 with regularization leads to performance similar to the Max-GSWD-NN 1 without regularization, implying that the performance gap between the ASWD and the Max-GSWD-NN is not due to the introduction of the regularization term.
  Choice of injective mapping
  We reported in Figure 9 the performance of the ASWD defined with other types of injective mappings other than Equation (18). In particular, we examined two invertible mappings, including the planar flow and radial flow (Rezende and Mohamed, 2015), as alternatives to the injective mapping defined by Equation (18). The numerical results presented in Figure 9 show that the ASWD defined with planar flow and radial flow produced better performance than GSWD variants in most setups. They exhibit slightly worse performance compared with the ASWD with injective mapping defined in Equation (18), possibly due to the additional restriction in invertible mapping imposed by the planar flow and radial flow.
  Choice of the dimensionality dθ of the augmented space
  To investigate how the dimensionality dθ of the augmented space affects the performance of the ASWD, different choices of dθ are employed in the ASWD. Specifically, the injective network architecture gω(x) = [x,φω(x)] : Rd → Rdθ given in Equation (18) is adopted and φω is set to be single fully-connected neural networks whose output dimension equals {1, 2, 3, 4} times its input dimension, i.e dθ ={2d,3d,4d,5d}, respectively, where d is the dimensionality of x. The numerical results are presented in Figure 10, and it can be found that the ASWDs present similar results across different choices of dθ. It can also be observed in Figure 10 that the ASWDs with different choices of dθ consistently produce better performance than the other evaluated slice-based Wasserstein metrics.
sections.heading: APPENDIX H ADDITIONAL
sections.text: RESULTS IN THE GENERATIVE MODELING EXPERIMENT
  H.1 SAMPLES OF GENERATED IMAGES OF CIFAR10 AND CELEBA DATASETS
  H.2 EXPERIMENT RESULTS ON MNIST DATASET
  In the generative modelling experiment on the MNIST dataset, we train a generator by minimizing different slice-based Wasserstein metrics, including the ASWD, the DSWD, the GSWD (circular), and the SWD. Denote byGΦ the generator, the training objective of the experiment can be formulated as (Bernton et al., 2019):
  min Φ Ex∼pr,z∼pz [SWD(x,GΦ(z))], (54)
  where pz and pr are the prior of latent variable z and the real data distribution, respectively. In other words, the SWD, or other slice-based Wasserstein metrics, can be considered as a discriminator in this framework. By replacing the SWD with the ASWD, the DSWD, and the GSWD, we compare the performance of learned generative models trained with different metrics. In this experiment, different methods are compared using different number of projectionsL={10,1000}. The 2-Wasserstein distance and the SWD between generated images and real images are used as metrics for evaluating performances of different generative models. The experiment results are presented in Figure 12. Quality of generated images and convergence rate: It can be observed from Figure 12 that the ASWD outperforms all the other methods regarding both the 2-Wasserstein distance and the SWD between generated and real images. In particular, the generative model trained with the ASWD produces smaller 2-Wasserstein distances within less iteration, which implies the generated images are of higher quality and the ASWD leads to higher convergence rates of generative models. In addition, the ASWD shows that it is able to generate higher quality images than the SWD and the GSWD with 1000 projections using only as less
  as 10 projections. In other words, the ASWD has higher projection efficiency than the other slice-based Wasserstein metrics. The ASWD also has the smallest SWD distance as shown in Figure 12. Although the SWD converges slightly faster than the ASWD in terms of the SWD between fake and real images, this is due to the training objective and the evaluated metric are the same for the SWD. Randomly selected images generated by different slice-based Wasserstein metrics are presented in Figure 13.
  Computation cost of the ASWD: The execution time per mini-batch (512 samples) of different methods are compared in Figure 14a. We evaluate the SWD by varying the number of projections in the set {10, 1000, 10000} and all the other methods in the set {10, 1000}. We found that although the SWD requires much fewer computational time than the DSWD and the ASWD, the quality of generated data is poor even when the number of projections L increases to 10000. The GSWD is also computationally efficient when using a 10 projections, but it requires the highest execution time and generates the highest 2-Wasserstein distance among all compared methods when the number of projections increases to 1000. The huge difference in the execution time of the GSWD with 10 and 1000 projections is due to the GSWD needs to calculate distance matrices of shapeN×L, where N and L are the number of samples and projections respectively, which is more computationally expensive than calculating inner products when the number of projectionsL increases. The DSWD requires a similar computational time as the ASWD in this example, while the ASWD generates higher quality images in terms of 2-Wasserstein distances.
  Besides, we have also evaluated the effect of batch size on the computation cost of different slice-based Wasserstein metrics. Due to the out-of-memory error caused by the excessively high computation cost of the GSWDs in high-dimensional space, the GSWD is not included in this comparison. Specifically, the ASWD, the DSWD, and the SWD are compared in this experiment, and the computation time of the evaluated methods with L = 10,1000 projections and N = {213,214,215,216} samples are reported in Figure 14b. From the results presented in Figure 14b, it can be observed that, similar to the computational complexity of the DSWD and the SWD, the computational complexity of the ASWD empirically tends to scale inO(N logN).
  APPENDIX I SLICED WASSERSTEIN AUTOENCODERS
  We train an autoencoder using the framework proposed in (Kolouri et al., 2019b), where an encoder and a decoder are jointly trained by minimizing the following objective:
  min φ,ψ BCE(ψ(φ(x)),x)+L1(ψ(φ(x)),x)+SWD(pz,φ(x)), (55)
  where φ is the encoder, ψ is the decoder, pz is the prior distribution of latent variable, BCE(·,·) is the binary cross entropy loss between reconstructed images and real images, and L1(·,·) is the L1 loss between reconstructed images and real images. We train this model using different slice-based Wasserstein metrics, including the ASWD, the DSWD, the SWD, and the GSWD. Here we use the ring distribution as the prior distribution as shown in Figure 16. We report the binary cross entropy loss during test time and the 2-Wasserstein distance between prior and the encoded latent variable φ(x) in Figure 15. The slice-based Wasserstein metrics used as the third term in Equation (55) is also recorded at each iteration and presented in Figure 15 in order to analyze the factors that causes the differences in the performance of models trained with different slice-based Wasserstein metrics.
  It can be observed from the first two columns of Figure 15 that while the model trained with the ASWD, SWD, and DSWD lead to similar 2-Wassertein distance between the encoded latent variable distribution and the prior distribution, which implies that they have similar coverage of the prior distribution as shown in Figure 16, the model trained with the ASWD converges slightly faster to smaller binary cross entropy loss than the others. As shown in Figure 15(b) and 15(c), since the obtained GSWDs are trivially small compared with the other metrics, models trained with GSWDs only focuses on the reconstruction loss and therefore produce reconstructed images of higher qualities in terms of the binary cross entropy. However, although models trained with the GSWD polynomial and the GSWD circular lead to smaller binary cross entropy loss than the ASWD, their latent distributions present very different data structures from the specified prior distribution, which can be problematic in certain applications where the support of the latent distribution is required to be within a particular range.
  Some MNIST images randomly generated by SWAEs trained with different metrics are given in Figure 17.
sections.heading: APPENDIX J COLOR TRANSFERRING
sections.text: Color transferring can be formulated as an optimal transport problem (Bonneel et al., 2015; Radon, 1917). In this task, the color palette of a source image is transferred to that of a target image, while keeping the content of source image unchanged. To achieve this, the optimal transport can be used to find the alignment between image pixels by calculating the optimal mapping of color palettes. In this experiment, instead of solving the optimal mapping in the original space, we first project the distribution onto one-dimensional spaces and average the alignment between one-dimensional samples as an approximation of the optimal mapping in the original space. After obtaining the approximation, we replace pixels of the source image with the averaged corresponding pixels in the target image. To reduce the computational cost, we utilize the approach proposed in (Muzellec and Cuturi, 2019), where the K-means algorithm is used to cluster the pixels of both source and target images, and then we implement color transfer for the quantized images whose pixels are consist of the centers of 3000 clusters rather than the original source and target images.
  We present the results of color transferring in Figure 18. It can be observed that the ASWD and the DSWD produce sharper images than the SWD and the GSWD (polynomial), we conjecture that is because the ASWD and the DSWD can generate better alignment of pixels. The GSWD (circular) tends to generate high contrast images, but sometimes produces images with low color diversity as in Figure 18(a).The Max-SWD has the highest contrast among all methods, but this is due to it only uses a single projection to obtain the transport mapping, thus there is no need to average different pixels from the target image. A disadvantage of the Max-SWD is that the transferred images generated by Max-SWD is not smooth enough and do not look realistic. The ASWD can generate smooth and realistic images than the SWD and the Max-SWD, even when the number of projections is as small as 10. Transferred images obtained by transferring colors from the source to target using standard optimal transport maps is also presented in Figure 18 for reference (Ferradans et al., 2014).
  Source Target
sections.heading: SW n=10 SW n=100 ASW n=10 ASW n=100 MaxSW DSW n=10
sections.heading: SW n=10 SW n=100 ASW n=10 ASW n=100 MaxSW DSW n=10
sections.heading: SW n=10 SW n=100 ASW n=10 ASW n=100 MaxSW DSW n=10
sections.heading: SW n=10 SW n=100 ASW n=10 ASW n=100 MaxSW DSW n=10
sections.heading: APPENDIX K SLICED WASSERSTEIN BARYCENTER
sections.text: Sliced Wasserstein distances can also be applied in the barycenter calculation and shape interpolation (Bonneel et al., 2015). Here we compare barycenters produced by different slice-based Wasserstein metrics, including the GSWD (circular and polynomial), the ASWD, the SWD, and the DSWD. Specifically, we compute barycenters of different shapes consisting of point clouds, as shown in Figure 19. Each object in Figure 19 corresponds to a specific barycenter with different weights. The Wasserstein barycenters are also presented in Figure 19 for reference, which provide geometrically meaningful barycenters at the expense of significantly higher computational cost .
  Formally, a sliced-Wasserstein barycenter of objects µ= {µ1,µ2,··· ,µN ∈ Pk(Rd)} assigned with weightsw=[w1,w2,···,wN ∈R] is defined as:
  Bar(µ,w)= argmin µ∈Pk(Rd) N∑ i=1 wiSWD(µ,µi). (56)
  In this experiment, we setN = 3 and compute barycenters corresponding to different weights. The results are given in Figure 19.
  From Figure 19, it can be observed that the ASWD produces similar barycenters as that of the SWD, which are sharper than the DSWD, and more meaningful than the GSWD (polynomial). The flexibility of the injective neural networks g(·) and its optimization in the ASWD can be potentially combined with specific requirements in particular tasks to generate calibrated barycenters - we leave this as a future research direction.