Pith. sign in

REVIEW 2 major objections 8 minor 300 references

Distributional Determinantal Point Process for Repulsive Clustering of Distributions

T0 review · 2 major / 8 minor · reviewed 2026-08-01 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read The paper introduces the distributional determinantal point process (dDPP), a repulsive point process whose atoms are probability distributions, and shows it yields well-separated, interpretable clusters of distribution-valued data.

desk verdict A useful repulsive point-process prior for distribution-valued data with a real but fixable gap in the posterior-consistency proof. read the letter →

arxiv 2607.21847 v1 pith:IFG6SQWB submitted 2026-07-23 stat.ME cs.LGstat.APstat.COstat.ML

Khai Nguyen , Yang Ni , Elizabeth Juarez-Colunga , Peter Mueller This is my paper · ORCID
classification stat.MEcs.LGstat.APstat.COstat.ML MSC 62F1560G5562H30
keywords distributionaldeterminantalpointprocessrepulsivepriorslicedWassersteinkernelgeneralizedBayesrandompartitionsposteriorconsistencyclusteringempiricalconcentration
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper's central aim is to make repulsive clustering work directly on probability distributions, not just on points. It defines the dDPP through an L-ensemble with a sliced-Wasserstein kernel, proves this is a well-defined point process on a compact space of distributions, and shows plug-in estimates from i.i.d. samples converge at a parametric rate. The dDPP is then used as a prior over atoms in a generalized Bayesian mixture model, with a proof that the posterior concentrates on the best mixing measure as data size grows. This matters because distribution-valued data (gene-expression profiles, seizure diaries) often need clusters that are separated and interpretable, and previous nonparametric Bayesian methods tend to over-fragment. On two real datasets, the dDPP yields fewer, better-separated clusters than a Dirichlet-process baseline with essentially no loss of likelihood.

What carries the argument

The load-bearing object is the sliced-Wasserstein kernel L(ν,ν') = exp(-γ SW2^2(ν,ν')), whose positive definiteness follows from the Hilbertian property SW2^2(ν,ν') = ||Ψ(ν)-Ψ(ν')||^2 with an explicit feature map Ψ into L^2(S^{d-1}×[0,1]). This kernel defines an L-ensemble whose Janossy density det(L(ν_i,ν_j)) penalizes configurations containing close atoms. The correlation kernel K = L(I+L)^{-1} and its Schur complement ∆K(θ*,θ_new) quantify how strongly a candidate atom is penalized for being near occupied atoms. Trace-class of the integral operator T_L (via spectral decomposition) ensures the Fredholm determinant is finite, making the point process well-defined.

What would settle it

Compute the eigenvalues of the sliced-Wasserstein Gram matrix for a finite set of distinct distributions that are close in SW distance but not identical—for example, several Gaussians with different means and variances. If any eigenvalue is zero to numerical precision, the strict positive definiteness needed for the full-support argument in the proof of Theorem 3 fails. More decisively, find a configuration {ν_1,...,ν_k} of distinct distributions with det(L(ν_i,ν_j))=0; then the dDPP assigns zero probability to that configuration, contradicting the full-support assertion.

Watch

Extended reading notes

Core claim

The central claim is that the distributional determinantal point process (dDPP), defined by the Janossy density j_k(ν_1,...,ν_k) ∝ det(L(ν_i,ν_j)) with L(ν,ν') = exp(-γ SW2^2(ν,ν')), is a valid repulsive point process on a compact set of probability distributions equipped with the sliced-Wasserstein topology. Because sliced-Wasserstein distance is Hilbertian, the kernel is positive definite, and the associated integral operator is trace-class, so the normalization constant is finite and the process is well-defined. In the discrete setting the paper derives dimension-free O(m^{-1/2}) concentration bounds for plug-in estimators of the L-ensemble, correlation kernel, and their determinants. In

Load-bearing premise

The posterior-concentration proof requires that every configuration of distinct distributions has a strictly positive definite sliced-Wasserstein kernel matrix; the paper proves positive definiteness of the kernel but not strictness on distinct points.

Editorial extensions

If this is right

  • Provides a principled repulsive prior for mixture models over distribution-valued data, addressing over-fragmentation in nonparametric Bayesian clustering.
  • Justifies replacing true distributions by empirical measures in practice: the concentration bounds guarantee the DPP probabilities are estimated at a parametric rate.
  • Guarantees statistical consistency: the posterior of the mixing weights converges to the population risk minimizer, so inferences are anchored as data accumulate.
  • Gives a practical MCMC scheme: the marginal sampler uses precomputed SW kernel matrices and rank-one Cholesky updates, with computational cost polynomial in the number of atoms.
  • On single-cell and epilepsy data, dDPP partitions are more parsimonious and better separated than DP partitions, with near-identical generalized likelihood.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The proof of posterior consistency assumes strict positive definiteness of the SW kernel on distinct distributions, but the paper only proves positive definiteness; verifying strict positive definiteness (or finding a counterexample) would settle whether the full-support step in the proof is sound.
  • The same L-ensemble construction could be applied to other Hilbertian divergences, such as the energy distance, to obtain different repulsive structure on distribution spaces.
  • The finite discrete atom set Θ simplifies computation and theory; extending to a continuous base measure with slice sampling could allow inference over an infinite space of distributions, at the cost of revisiting the trace-class and consistency arguments.
  • The paper's own limitation note that generalized likelihood may deviate from fully model-based Bayesian inference suggests a natural next step: building a generative likelihood for distribution-valued atoms that preserves the SW repulsion.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 8 minor

Summary. The paper introduces the distributional determinantal point process (dDPP), a repulsive point process whose atoms are probability distributions, constructed via an L-ensemble with a sliced Wasserstein (SW) kernel. It proves well-definedness of the dDPP on a compact space of distributions (Theorem 1), derives O(m^{-1/2}) concentration bounds for plug-in estimators of the L and correlation kernels using empirical measures (Theorem 2 and Corollary 1), and proposes a generalized Bayesian mixture model with a dDPP prior over atoms and an SW-based generalized likelihood. A posterior consistency theorem for the mixing weights (Theorem 3) is stated and proved in the supplement. The paper also develops marginal MCMC inference, a decision-theoretic posterior summarization using sliced Wasserstein barycenters, and applies the method to single-cell and epilepsy data.

Significance. If the results are correct, this is a useful extension of DPP priors to distribution-valued data, with theoretical guarantees that go beyond existing repulsive mixture models. The concentration bounds are dimension-free, the computational strategy exploits the SW distance effectively, and the applications address relevant scientific problems. The posterior consistency theorem is a central contribution, as it provides a misspecified-Bayes justification for the proposed loss-based inference. However, the proof of Theorem 3 contains an unsupported strict positive definiteness claim that is load-bearing; the gap is likely repairable but must be fixed before the result can be accepted.

major comments (2)
  1. [Supplementary A.4, Eq. (75)] The full-support argument for the dDPP prior asserts that 'the SW kernel matrix is strictly positive definite on distinct points', so that det(L(ν_p,ν_q))>0 for every subconfiguration. Theorem 1 (Supplementary A.1) proves only positive definiteness (non-negativity of the quadratic form) via a power-series expansion; it does not rule out zero eigenvalues for distinct distributions. This strictness is essential: Eq. (82) requires Π(U*_ρ)>0 for every ρ, and if some distinct subconfiguration had a singular SW Gram matrix, the dDPP could assign zero probability to that subconfiguration, potentially zero mass to open subsets of Δ^{Q-1}. Thus the proof of Theorem 3 is incomplete. The gap is likely fixable by adding a lemma that the feature map Ψ(ν)=F^{-1}_{P_v♯ν}(·) is injective (by Cramér-Wold) and that the Gaussian RBF kernel exp(-γ||Ψ(ν)-Ψ(ν')||^2) on L^2(S^{d-1}×[0,1]) is strictly positive
  2. [Assumption 1, Section 3.1] The two sufficient conditions listed under Assumption 1 (uniform tightness and uniform integrability of second moments) imply relative compactness of Θ in W2, not compactness; closedness of Θ in the relevant topology is also required. Since the assumption itself states that Θ is compact, this is not fatal to Theorem 1, which proceeds under that assumption, but the phrasing 'This holds if...' is technically inaccurate. Please either add closedness as a third condition or explicitly state that the conditions are meant to establish relative compactness and that Θ is taken to be its own closure.
minor comments (8)
  1. [Section 1, notation] In the notation paragraph, 'A vector (π_1,...,π_k)∈Δ_k satisfies π_k≥0 for each k = 1,...,k' uses the same symbol k for both the dimension and the index. It should be something like 'π_j≥0 for each j=1,...,k'.
  2. [Section 6.1, first paragraph] Typo: 'we used the D2PP for inference' should be 'dDPP'.
  3. [Supplementary A.2, equations (32)-(36)] There are OCR-like typographical errors: 'ˆθo,(m)' appears instead of 'ˆν_i^{(m)}' in several equations, and the subscript 'i' is missing in 'P_v♯ˆθo,(m)' and similar expressions. These make the proof harder to follow.
  4. [Section 5.2, update assignments] The sentence 'For new atoms, we propose naux (is later set to 1) candidates...' is awkward; consider rewriting to 'we propose naux candidates, with naux later set to 1' or similar.
  5. [Section 4, Eq. (6)] The parameter w is called a 'bandwidth parameter'. In a generalized likelihood, w is better described as an inverse-temperature/scale parameter; 'bandwidth' is usually reserved for kernels such as γ in the SW kernel. Please adjust the terminology for clarity.
  6. [Section 5.1, discussion after Eq. (10)] The statement 'Since SW2(θ_new,θ_new)=0, we have ΔK∈[0,1]' is imprecise. The fact that ΔK is a Schur complement of a positive definite kernel matrix implies ΔK∈[0,1] because K(θ_new,θ_new)=1 and the subtracted term is nonnegative; the SW2(θ_new,θ_new)=0 observation alone is not the reason. Please clarify.
  7. [References] The references 'Peyré & Cuturi (2019)' and 'Peyré, G., Cuturi, M. et al. (2019)' are duplicated and should be merged into a single entry.
  8. [Section 7, Conclusion] The authors note two limitations: the generalized-Bayes nature and the finite discrete base measure. These are appropriately acknowledged, but the strict positive definiteness gap in Theorem 3 is not mentioned there; it should be addressed in the main text or supplement.

Circularity Check

0 steps flagged · score 2.0 of 10

No significant circularity: the dDPP construction, plug-in concentration bounds, and posterior-consistency theorem are self-contained; only a minor non-load-bearing self-citation and an unproven strict-positive-definiteness assertion in Theorem 3's proof.

full rationale

The dDPP is defined directly as a DPP with an SW kernel (Def. 1, Eq. 3); Theorem 1 is a standard positive-definiteness plus trace-class argument and does not assume its conclusion. Theorem 2 derives plug-in concentration from DKW and McDiarmid inequalities; the bounds are not fitted to the quantities they bound, and Corollary 1 is a determinant perturbation bound with explicit constants. Theorem 3 is a misspecified-Bayes consistency theorem: it defines M* as the minimizer of the population risk of the same SW generalized likelihood used in the model, and proves posterior concentration on M* via a uniform law of large numbers and prior full support. This is a self-contained mathematical statement, not an external validation of the model; targeting the same loss as the likelihood is not circular because the theorem does not claim the loss-minimizer equals some external truth. The only notable concern is Eq. (75) in the proof of Theorem 3, where the proof asserts that 'the SW kernel matrix is strictly positive definite on distinct points' to establish full support of the dDPP prior; Theorem 1 proves only positive definiteness, so this is an omitted proof (a correctness risk), not a circular reduction. The self-citation to Nguyen & Mueller (2026) in Sec. 5.3 underlies the posterior-summarization framework, but the hierarchical optimal-transport utility and the Bayes-rule estimator (11) are new; the citation is not load-bearing. Overall, no derivation step reduces to its own input by construction.

Assumptions & free parameters 3 free parameters · 6 assumptions · 0 invented entities

The dDPP is a new stochastic model, not a new physical entity. The central claim depends on the hand-chosen hyperparameters gamma, w, and alpha, plus the compactness and exponential-moment assumptions that make the theorems go through. No particles, forces, or new conserved quantities are introduced.

free parameters (3)
  • gamma (SW kernel bandwidth) = 10^3, 10^4, 10^5 (single-cell); 10, 100, 1000 (HEP)
    Controls the prior repulsion strength in L(nu,nu') = exp(-gamma * SW2^2); chosen by hand over a grid, not estimated.
  • w (generalized likelihood bandwidth) = 5e5, 7e5, 1e6 (single-cell); 100, 200, 500 (HEP)
    Controls concentration of l(F|theta) = exp(-w * SW2^2); chosen relative to the median pairwise SW2^2 distance; grid reported.
  • alpha (Gamma mark shape) = Not stated in experiments
    Shape of s_h ~ Gamma(alpha,1) in model (7); affects cluster sizes and prior weight distribution; no value or sensitivity analysis is given in the main text.
assumptions (6)
  • domain assumption Assumption 1: Theta is compact under SW2
    Required for Theorem 1 to apply Mercer's theorem and show trace-class; trivial in the finite-discrete setting used in applications, but excludes unbounded supports in the general formulation.
  • standard math Mercer's theorem on compact metric spaces
    Used to spectrally decompose L and to identify det(I + T_L) with prod(1 + lambda_i) in the proof of Theorem 1.
  • domain assumption SW2 metrizes weak convergence on P2(Rd)
    Invoked to establish continuity of the SW kernel and empirical convergence; cited to Nadjahi et al. (2020).
  • standard math DPP existence theory for L-ensembles with trace-class kernels
    Definition 1 and Theorem 1 rely on the standard result that a symmetric positive definite trace-class kernel defines a DPP; the paper does not verify Janossy consistency directly.
  • domain assumption Strict positive definiteness of the SW Gram matrix on distinct distributions
    Asserted in Supplementary A.4 for full support of the dDPP prior; not proved, load-bearing for Theorem 3.
  • domain assumption Exponential moment condition (8)
    Assumed for finiteness of the population risk and the proof of the uniform strong law in Theorem 3.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Distributional Determinantal Point Process for Repulsive Clustering of Distributions." pith.science (2026). https://pith.science/paper/IFG6SQWB

@misc{pith2026260721847,
  author       = {Pith},
  title        = {Pith review of: Distributional Determinantal Point Process for Repulsive Clustering of Distributions},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/IFG6SQWB}},
  note         = {Machine review of arXiv:2607.21847}
}
read the original abstract

We introduce the distributional determinantal point process (dDPP) as a novel repulsive point process whose atoms are probability distributions rather than points in a real space. The dDPP is constructed via an L-ensemble with a sliced Wasserstein (SW) kernel between distributions. We show its validity as a well-defined point process. In the discrete setting, we derive concentration results for plug-in estimators of the L-ensemble, the correlation kernel, and their determinants given i.i.d. samples from the distributional atoms. Leveraging this framework, we propose a distribution-valued random partition model by way of a repulsive generalized Bayesian mixture model. The model places a dDPP prior over the atoms of the mixing measure and defines a generalized likelihood based on SW distance. To summarize posterior inference, we develop a decision-theoretic approach to report a point estimate of the mixing measure as a Bayes rule under a hierarchical optimal transport utility function. The latter is a natural choice given that the mixing measure is itself a distribution over distributions. We use the proposed framework for inference with single-cell gene expression data and human epilepsy data, producing interpretable and well-separated clusters that reflect meaningful structure in the data.

Figures

Figures reproduced from arXiv: 2607.21847 by the authors.

Figure 1
Figure 1. Single cell data. UMAP visualization based on point estimates [PITH_FULL_IMAGE:figures/full_fig_p023_1.png] view at source ↗
Figure 2
Figure 2. Singe cell data - PCA visualization of the atoms of the mixing measure. The [PITH_FULL_IMAGE:figures/full_fig_p024_2.png] view at source ↗
Figure 3
Figure 3. HEP data. Same as Figure [PITH_FULL_IMAGE:figures/full_fig_p026_3.png] view at source ↗
Figures from the paper (12 more)
Figure 4
Figure 4. Figure 4: HEP data. The atoms of the point estimate [PITH_FULL_IMAGE:figures/full_fig_p027_4.png]
Figure 5
Figure 5. Figure 5: HEP data. Visualization of all patients with corresponding clusters label. Similar [PITH_FULL_IMAGE:figures/full_fig_p028_5.png]
Figure 6
Figure 6. Figure 6: Same as Figure [PITH_FULL_IMAGE:figures/full_fig_p049_6.png]
Figure 7
Figure 7. Figure 7: PCA visualization of some donors in clusters the dDPP model ( [PITH_FULL_IMAGE:figures/full_fig_p052_7.png]
Figure 8
Figure 8. Figure 8: PCA visualization of some donors in clusters the dDPP model ( [PITH_FULL_IMAGE:figures/full_fig_p053_8.png]
Figure 9
Figure 9. Figure 9: PCA visualization of some donors in clusters the dDPP model ( [PITH_FULL_IMAGE:figures/full_fig_p054_9.png]
Figure 10
Figure 10. Figure 10: PCA visualization of some donors in clusters the dDPP model ( [PITH_FULL_IMAGE:figures/full_fig_p055_10.png]
Figure 11
Figure 11. Figure 11: Same as Figure [PITH_FULL_IMAGE:figures/full_fig_p056_11.png]
Figure 12
Figure 12. Figure 12: Same as Figure [PITH_FULL_IMAGE:figures/full_fig_p057_12.png]
Figure 13
Figure 13. Figure 13: Same as Figure [PITH_FULL_IMAGE:figures/full_fig_p058_13.png]
Figure 14
Figure 14. Figure 14: Same as Figure [PITH_FULL_IMAGE:figures/full_fig_p059_14.png]
Figure 15
Figure 15. Figure 15: Same as Figure [PITH_FULL_IMAGE:figures/full_fig_p060_15.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

300 extracted references · 21 linked inside Pith

  1. [1]

    Single-cell

    Yazar, Seyhan and Alquicira-Hernandez, Jose and Wing, Kristof and Senabouth, Anne and Gordon, M Grace and Andersen, Stacey and Lu, Qinyi and Rowson, Antonia and Taylor, Thomas RP and Clarke, Linda and others , journal=. Single-cell. 2022 , publisher=

    2022

  2. [2]

    Summarizing Nonparametric

    Nguyen, Khai and Mueller, Peter , journal=. Summarizing Nonparametric. 2026 , publisher=

    2026

  3. [3]

    Bayesian Analysis , volume=

    Robust probabilistic inference via a constrained transport metric , author=. Bayesian Analysis , volume=. 2025 , publisher=

    2025

  4. [4]

    Reversible jump

    Green, Peter J , journal=. Reversible jump. 1995 , publisher=

    1995

  5. [5]

    Journal of Computational and Graphical Statistics , volume=

    Search algorithms and loss functions for Bayesian clustering , author=. Journal of Computational and Graphical Statistics , volume=. 2022 , publisher=

    2022

  6. [6]

    2017 , publisher=

    Fundamentals of nonparametric Bayesian inference , author=. 2017 , publisher=

    2017

  7. [7]

    Journal of the Royal Statistical Society: Series B (Methodological) , volume=

    A general class of coefficients of divergence of one distribution from another , author=. Journal of the Royal Statistical Society: Series B (Methodological) , volume=. 1966 , publisher=

    1966

  8. [8]

    2021 , publisher=

    Introduction to linear regression analysis , author=. 2021 , publisher=

    2021

Show all 300 references
  1. [9]

    Scalar-on-image regression via the soft-thresholded

    Kang, Jian and Reich, Brian J and Staicu, Ana-Maria , journal=. Scalar-on-image regression via the soft-thresholded. 2018 , publisher=

    2018

  2. [10]

    Annual Review of Statistics and Its Application , volume=

    Functional regression , author=. Annual Review of Statistics and Its Application , volume=. 2015 , publisher=

    2015

  3. [11]

    Bernoulli , pages=

    Adaptive Bayesian density regression for high-dimensional data , author=. Bernoulli , pages=. 2016 , publisher=

    2016

  4. [12]

    Biometrika , volume=

    Distribution-on-distribution regression via optimal transport maps , author=. Biometrika , volume=. 2022 , publisher=

    2022

  5. [13]

    Journal of the American Statistical Association , volume=

    Wasserstein regression , author=. Journal of the American Statistical Association , volume=. 2023 , publisher=

    2023

  6. [14]

    Journal of the American Statistical Association , volume=

    Optimal sample size for multiple testing: the case of gene expression microarrays , author=. Journal of the American Statistical Association , volume=. 2004 , publisher=

    2004

  7. [15]

    Generalized

    Sturm, Karl-Theodor , journal=. Generalized. 2011 , publisher=

    2011

  8. [16]

    Journal of the American Statistical Association , volume=

    Practical Bayesian density estimation using mixtures of normals , author=. Journal of the American Statistical Association , volume=. 1997 , publisher=

    1997

  9. [17]

    Properties of discrete sliced

    Tanguy, Eloi and Flamary, R. Properties of discrete sliced. Mathematics of Computation , volume=

  10. [18]

    A Wasserstein-type distance in the space of

    Delon, Julie and Desolneux, Agnes , journal=. A Wasserstein-type distance in the space of. 2020 , publisher=

    2020

  11. [19]

    Journal of the Royal Statistical Society: Series C (Applied Statistics) , volume=

    A look at some data on the Old Faithful geyser , author=. Journal of the Royal Statistical Society: Series C (Applied Statistics) , volume=. 1990 , publisher=

    1990

  12. [20]

    Statistics and Computing , volume=

    Optimal Bayesian estimators for latent variable cluster models , author=. Statistics and Computing , volume=. 2018 , publisher=

    2018

  13. [21]

    Journal of Computational and Graphical Statistics , volume=

    Bayesian model-based clustering procedures , author=. Journal of Computational and Graphical Statistics , volume=. 2007 , publisher=

    2007

  14. [22]

    Scale Space and Variational Methods in Computer Vision: Third International Conference, SSVM 2011, Ein-Gedi, Israel, May 29--June 2, 2011, Revised Selected Papers 3 , pages=

    Wasserstein barycenter and its application to texture mixing , author=. Scale Space and Variational Methods in Computer Vision: Third International Conference, SSVM 2011, Ein-Gedi, Israel, May 29--June 2, 2011, Revised Selected Papers 3 , pages=. 2012 , organization=

    2011

  15. [23]

    Proceedings of the 26th annual international conference on machine learning , pages=

    Information theoretic measures for clusterings comparison: is a correction for chance necessary? , author=. Proceedings of the 26th annual international conference on machine learning , pages=

  16. [24]

    Journal of multivariate analysis , volume=

    Comparing clusterings—an information based distance , author=. Journal of multivariate analysis , volume=. 2007 , publisher=

    2007

  17. [25]

    Biometrika , volume=

    Bayesian cluster analysis , author=. Biometrika , volume=. 1978 , publisher=

    1978

  18. [26]

    Bayesian Analysis , volume=

    Bayesian Cluster Analysis: Point Estimation and Credible Balls (with Discussion) , author=. Bayesian Analysis , volume=

  19. [27]

    Learning with minibatch

    Fatras, Kilian and Zine, Younes and Flamary, R. Learning with minibatch. AISTATS 2020-23nd International Conference on Artificial Intelligence and Statistics , volume=

    2020

  20. [28]

    Journal of Machine Learning Research (JMLR) , Pages =

    On the efficiency of entropic regularized algorithms for optimal transport , Author =. Journal of Machine Learning Research (JMLR) , Pages =

  21. [29]

    Foundations and Trends in Machine Learning , volume=

    Convex Optimization: Algorithms and Complexity , author=. Foundations and Trends in Machine Learning , volume=. 2015 , publisher=

    2015

  22. [30]

    Proceedings of the 38th International Conference on Machine Learning , pages =

    Unbalanced minibatch Optimal Transport; applications to Domain Adaptation , author =. Proceedings of the 38th International Conference on Machine Learning , pages =. 2021 , editor =

    2021

  23. [31]

    2009 , publisher=

    Optimal transport: old and new , author=. 2009 , publisher=

    2009

  24. [32]

    Mathematics of Computation , volume=

    Scaling algorithms for unbalanced optimal transport problems , author=. Mathematics of Computation , volume=

  25. [33]

    arXiv preprint arXiv:1910.12958 , year=

    Sinkhorn divergences for unbalanced optimal transport , author=. arXiv preprint arXiv:1910.12958 , year=

    1910 arXiv

  26. [34]

    Archive for rational mechanics and analysis , volume=

    The optimal partial transport problem , author=. Archive for rational mechanics and analysis , volume=. 2010 , publisher=

    2010

  27. [35]

    Advances in Neural Information Processing Systems 33 (NeurIPS 2020) , year=

    Partial Optimal Transport with Applications on Positive-Unlabeled Learning , author=. Advances in Neural Information Processing Systems 33 (NeurIPS 2020) , year=

    2020

  28. [36]

    Learning generative models with

    Genevay, Aude and Peyr. Learning generative models with. International Conference on Artificial Intelligence and Statistics , pages=. 2018 , organization=

    2018

  29. [37]

    Proceedings of the European Conference on Computer Vision (ECCV) , pages=

    Deepjdot: Deep joint distribution optimal transport for unsupervised domain adaptation , author=. Proceedings of the European Conference on Computer Vision (ECCV) , pages=

  30. [38]

    Optimal Transport:

    Sommerfeld, Max and Schrieber, J. Optimal Transport:. Journal of Machine Learning Research , volume=

  31. [39]

    On Transportation of Mini-batches:

    Nguyen, Khai and Nguyen, Dang and Nguyen, Quoc and Pham, Tung and Bui, Hung and Phung, Dinh and Le, Trung and Ho, Nhat , journal=. On Transportation of Mini-batches:

  32. [40]

    Unbalanced optimal transport: Dynamic and

    Chizat, Lenaic and Peyr. Unbalanced optimal transport: Dynamic and. Journal of Functional Analysis , volume=. 2018 , publisher=

    2018

  33. [41]

    On parameter estimation with the

    Bernton, Espen and Jacob, Pierre E and Gerber, Mathieu and Robert, Christian P , journal=. On parameter estimation with the. 2019 , publisher=

    2019

  34. [42]

    The Annals of Statistics , Volume =

    Vector quantile regression: An optimal transport approach , Author =. The Annals of Statistics , Volume =

  35. [43]

    Journal of the American Statistical association , volume=

    Objective criteria for the evaluation of clustering methods , author=. Journal of the American Statistical association , volume=. 1971 , publisher=

    1971

  36. [44]

    Leluc, R. Sliced-. International Conference on Machine Learning , pages=. 2024 , organization=

    2024

  37. [45]

    Journal of the American statistical Association , volume=

    Gibbs sampling methods for stick-breaking priors , author=. Journal of the American statistical Association , volume=. 2001 , publisher=

    2001

  38. [46]

    Advances in neural information processing systems , volume=

    Bayesian deep learning and a probabilistic perspective of generalization , author=. Advances in neural information processing systems , volume=

  39. [47]

    Schwartz, Lorraine , journal=. On. 1965 , publisher=

    1965

  40. [48]

    Approximate

    Ishwaran, Hemant and James, Lancelot F , journal=. Approximate. 2002 , publisher=

    2002

  41. [49]

    2019 , publisher=

    Riemannian geometric statistics in medical image analysis , author=. 2019 , publisher=

    2019

  42. [50]

    Annals of Statistics , pages=

    Convergence rates of posterior distributions , author=. Annals of Statistics , pages=. 2000 , publisher=

    2000

  43. [51]

    International conference on learning representations , volume=

    Learning mixed-curvature representations in products of model spaces , author=. International conference on learning representations , volume=

  44. [52]

    Max-Sliced

    Deshpande, Ishan and Hu, Yuan-Ting and Sun, Ruoyu and Pyrros, Ayis and Siddiqui, Nasir and Koyejo, Sanmi and Zhao, Zhizhen and Forsyth, David and Schwing, Alexander G , booktitle=. Max-Sliced

  45. [53]

    Generative modeling using the sliced

    Deshpande, Ishan and Zhang, Ziyu and Schwing, Alexander G , booktitle=. Generative modeling using the sliced

  46. [54]

    Wu, Jiqing and Huang, Zhiwu and Acharya, Dinesh and Li, Wen and Thoma, Janine and Paudel, Danda Pani and Gool, Luc Van , booktitle=. Sliced

  47. [55]

    The Annals of Mathematical Statistics , volume=

    On the identifiability of finite mixtures , author=. The Annals of Mathematical Statistics , volume=. 1968 , publisher=

    1968

  48. [56]

    Subspace Robust

    Paty, Fran. Subspace Robust. International Conference on Machine Learning , pages=

  49. [57]

    Strong equivalence between metrics of

    Bayraktar, Erhan and Guo, Gaoyue , journal=. Strong equivalence between metrics of

  50. [58]

    Asymptotic guarantees for learning generative models with the sliced-

    Nadjahi, Kimia and Durmus, Alain and Simsekli, Umut and Badeau, Roland , booktitle=. Asymptotic guarantees for learning generative models with the sliced-

  51. [59]

    arXiv preprint arXiv:1506.03365 , Year =

    Yu, Fisher and Zhang, Yinda and Song, Shuran and Seff, Ari and Xiao, Jianxiong , Title =. arXiv preprint arXiv:1506.03365 , Year =

    arXiv

  52. [60]

    High-dimensional statistics: A non-asymptotic viewpoint , author=

  53. [61]

    Advances in Neural Information Processing Systems , year=

    Hierarchical Hybrid Sliced Wasserstein: A Scalable Metric for Heterogeneous Joint Distributions , author=. Advances in Neural Information Processing Systems , year=

  54. [62]

    International Conference on Machine Learning , pages=

    Arjovsky, Martin and Chintala, Soumith and Bottou, L. International Conference on Machine Learning , pages=

  55. [63]

    International Conference on Machine Learning , pages=

    On Efficient Optimal Transport: An Analysis of Greedy and Accelerated Mirror Descent Algorithms , author=. International Conference on Machine Learning , pages=

  56. [64]

    Tolstikhin, Ilya and Bousquet, Olivier and Gelly, Sylvain and Schoelkopf, Bernhard , booktitle=

  57. [65]

    Master's thesis, Department of Computer Science, University of Toronto , year=

    Learning multiple layers of features from tiny images , author=. Master's thesis, Department of Computer Science, University of Toronto , year=

  58. [66]

    Augmented Sliced

    Chen, Xiongjie and Yang, Yongxin and Li, Yunpeng , journal=. Augmented Sliced

  59. [67]

    Amortized Optimization

    Shu, Rui , booktitle=. Amortized Optimization

  60. [68]

    2020 , eprint=

    Geoopt: Riemannian Optimization in PyTorch , author=. 2020 , eprint=

    2020

  61. [69]

    International Conference on Artificial Intelligence and Statistics , pages=

    On projection robust optimal transport: Sample complexity and model misspecification , author=. International Conference on Artificial Intelligence and Statistics , pages=. 2021 , organization=

    2021

  62. [70]

    Near-linear time approximation algorithms for optimal transport via

    Altschuler, Jason and Niles-Weed, Jonathan and Rigollet, Philippe , booktitle=. Near-linear time approximation algorithms for optimal transport via

  63. [71]

    Advances in Neural Information Processing Systems , pages=

    Joint distribution optimal transportation for domain adaptation , author=. Advances in Neural Information Processing Systems , pages=

  64. [72]

    Advances in Neural Information Processing Systems , pages=

    Sinkhorn distances: Lightspeed computation of optimal transport , author=. Advances in Neural Information Processing Systems , pages=

  65. [73]

    The American Mathematical Monthly , volume=

    Diagonal equivalence to matrices with prescribed row and column sums , author=. The American Mathematical Monthly , volume=. 1967 , publisher=

    1967

  66. [74]

    Sliced and

    Bonneel, Nicolas and Rabin, Julien and Peyr. Sliced and. Journal of Mathematical Imaging and Vision , volume=

  67. [75]

    2014 IEEE International Conference on Image Processing (ICIP) , pages=

    Adaptive color transfer with relaxed optimal transport , author=. 2014 IEEE International Conference on Image Processing (ICIP) , pages=. 2014 , organization=

    2014

  68. [76]

    Advances in Neural Information Processing Systems , pages=

    Subspace detours: Building transport plans that are optimal on subspace projections , author=. Advances in Neural Information Processing Systems , pages=

  69. [77]

    2010 IEEE International Conference on Image Processing , pages=

    Regularization of transportation maps for color and contrast transfer , author=. 2010 IEEE International Conference on Image Processing , pages=. 2010 , organization=

    2010

  70. [78]

    Advances in Neural Information Processing Systems , pages=

    Large-scale optimal transport map estimation using projection pursuit , author=. Advances in Neural Information Processing Systems , pages=

  71. [79]

    Journal of the American Statistical Association , volume=

    Sliced inverse regression for dimension reduction , author=. Journal of the American Statistical Association , volume=. 1991 , publisher=

    1991

  72. [80]

    Journal of the American Statistical Association , volume=

    On Directional Regression for Dimension Reduction , author=. Journal of the American Statistical Association , volume=. 2007 , publisher=

    2007

  73. [81]

    IEEE Computer graphics and applications , volume=

    Color transfer between images , author=. IEEE Computer graphics and applications , volume=. 2001 , publisher=

    2001

  74. [82]

    ACM Transactions on Graphics (TOG) , volume=

    SPOT: sliced partial optimal transport , author=. ACM Transactions on Graphics (TOG) , volume=. 2019 , publisher=

    2019

  75. [83]

    POT Python Optimal Transport library , author=

  76. [84]

    Advances in Neural Information Processing Systems , volume=

    Mapping estimation for discrete optimal transport , author=. Advances in Neural Information Processing Systems , volume=

  77. [85]

    The dependent

    Quintana, Fernando A and M. The dependent. Statistical Science , volume=. 2022 , publisher=

    2022

  78. [86]

    Foundations and Trends in Machine Learning , volume=

    Computational optimal transport: With applications to data science , author=. Foundations and Trends in Machine Learning , volume=. 2019 , publisher=

    2019

  79. [87]

    Optimal transport: Old and New , Year =

    C\'edric Villani , Publisher =. Optimal transport: Old and New , Year =

  80. [88]

    2008 , publisher=

    Optimal transport: old and new , author=. 2008 , publisher=

    2008

  81. [89]

    On minimum

    Bassetti, Federico and Bodini, Antonella and Regazzini, Eugenio , journal=. On minimum. 2006 , publisher=

    2006

  82. [90]

    Foundations and Trends in Machine Learning , volume=

    Computational Optimal Transport: With Applications to Data Science , author=. Foundations and Trends in Machine Learning , volume=. 2019 , publisher=

    2019

  83. [91]

    The Annals of Mathematical Statistics , pages=

    The minimum distance method , author=. The Annals of Mathematical Statistics , pages=. 1957 , publisher=

    1957

  84. [92]

    2011 , publisher=

    Statistical inference: the minimum distance approach , author=. 2011 , publisher=

    2011

  85. [93]

    Bellemare, Marc G and Danihelka, Ivo and Dabney, Will and Mohamed, Shakir and Lakshminarayanan, Balaji and Hoyer, Stephan and Munos, R. The. arXiv preprint arXiv:1705.10743 , year=

    arXiv

  86. [94]

    2003 , publisher=

    Topics in optimal transportation , author=. 2003 , publisher=

    2003

  87. [95]

    Improving

    Salimans, Tim and Zhang, Han and Radford, Alec and Metaxas, Dimitris , booktitle=. Improving

  88. [96]

    Liutkus, Antoine and Simsekli, Umut and Majewski, Szymon and Durmus, Alain and St. Sliced-. International Conference on Machine Learning , pages=. 2019 , organization=

    2019

  89. [97]

    IEEE transactions on pattern analysis and machine intelligence , volume=

    Optimal transport for domain adaptation , author=. IEEE transactions on pattern analysis and machine intelligence , volume=. 2016 , publisher=

    2016

  90. [98]

    SIAM Journal on Imaging Sciences , volume=

    Regularized discrete optimal transport , author=. SIAM Journal on Imaging Sciences , volume=. 2014 , publisher=

    2014

  91. [99]

    Continuous regularized

    Li, Lingxiao and Genevay, Aude and Yurochkin, Mikhail and Solomon, Justin M , journal=. Continuous regularized

  92. [100]

    Advances in Neural Information Processing Systems , volume=

    CO-Optimal Transport , author=. Advances in Neural Information Processing Systems , volume=

  93. [101]

    International Conference on Machine Learning , pages=

    Optimal Transport for structured data with application on graphs , author=. International Conference on Machine Learning , pages=

  94. [102]

    International Conference on Machine Learning , pages=

    Graph optimal transport for cross-domain alignment , author=. International Conference on Machine Learning , pages=. 2020 , organization=

    2020

  95. [103]

    Scalable

    Xu, Hongteng and Luo, Dixin and Carin, Lawrence , booktitle=. Scalable

  96. [104]

    Generalized sliced

    Kolouri, Soheil and Nadjahi, Kimia and Simsekli, Umut and Badeau, Roland and Rohde, Gustavo , booktitle=. Generalized sliced

  97. [105]

    Distributional Sliced-

    Khai Nguyen and Nhat Ho and Tung Pham and Hung Bui , booktitle=. Distributional Sliced-

  98. [106]

    Improving relational regularized autoencoders with spherical sliced fused

    Khai Nguyen and Son Nguyen and Nhat Ho and Tung Pham and Hung Bui , booktitle=. Improving relational regularized autoencoders with spherical sliced fused

  99. [107]

    Kolouri, Soheil and Pope, Phillip E and Martin, Charles E and Rohde, Gustavo K , booktitle=. Sliced

  100. [108]

    The Journal of Machine Learning Research , volume=

    Multiscale strategies for computing optimal transport , author=. The Journal of Machine Learning Research , volume=. 2017 , publisher=

    2017

  101. [109]

    arXiv preprint arXiv:2307.03642 , year=

    Density-on-Density Regression , author=. arXiv preprint arXiv:2307.03642 , year=

    arXiv

  102. [110]

    Distributional data analysis of accelerometer data from the

    Matabuena, Marcos and Petersen, Alexander , journal=. Distributional data analysis of accelerometer data from the. 2023 , publisher=

    2023

  103. [111]

    arXiv preprint arXiv:2006.12301 , year=

    On projection robust optimal transport: Sample complexity and model misspecification , author=. arXiv preprint arXiv:2006.12301 , year=

    2006 arXiv

  104. [112]

    Uncertainty in Artificial Intelligence , pages=

    Sinkhorn autoencoders , author=. Uncertainty in Artificial Intelligence , pages=. 2020 , organization=

    2020

  105. [113]

    International Conference on Machine Learning , pages=

    Learning Generative Models across Incomparable Spaces , author=. International Conference on Machine Learning , pages=

  106. [114]

    Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=

    Bayesian mixture models with repulsive and attractive atoms , author=. Journal of the Royal Statistical Society Series B: Statistical Methodology , volume=. 2025 , publisher=

    2025

  107. [115]

    Mercer’s theorem on general domains: On the interaction between measures, kernels, and

    Steinwart, Ingo and Scovel, Clint , journal=. Mercer’s theorem on general domains: On the interaction between measures, kernels, and. 2012 , publisher=

    2012

  108. [116]

    Unbiased Sliced

    Manh Luong and Khai Nguyen and Dinh Phung and Gholamreza Haffari and Lizhen Qu , booktitle=. Unbiased Sliced. 2025 , url=

    2025

  109. [117]

    The Annals of Statistics , volume=

    Distributional results for means of normalized random measures with independent increments , author=. The Annals of Statistics , volume=. 2003 , publisher=

    2003

  110. [118]

    2013 , school =

    Unidimensional and evolution methods for optimal transportation , author =. 2013 , school =

    2013

  111. [119]

    Carri. Sliced. Proceedings of the 34th International Conference on Machine Learning-Volume 70 , pages=

  112. [120]

    Distribution regression with sliced

    Meunier, Dimitri and Pontil, Massimiliano and Ciliberto, Carlo , booktitle=. Distribution regression with sliced. 2022 , organization=

    2022

  113. [121]

    Advances in Neural Information Processing Systems , pages=

    Hierarchical optimal transport for document representation , author=. Advances in Neural Information Processing Systems , pages=

  114. [122]

    arXiv preprint arXiv:2006.03160 , year=

    Hierarchical Optimal Transport for Robust Multi-View Learning , author=. arXiv preprint arXiv:2006.03160 , year=

    2006 arXiv

  115. [123]

    Advances in Neural Information Processing Systems , pages=

    Hierarchical optimal transport for multimodal distribution alignment , author=. Advances in Neural Information Processing Systems , pages=

  116. [124]

    International Conference on Scale Space and Variational Methods in Computer Vision , pages=

    A hierarchical approach to optimal transport , author=. International Conference on Scale Space and Variational Methods in Computer Vision , pages=. 2013 , organization=

    2013

  117. [125]

    Advances in Neural Information Processing Systems , pages=

    Generative adversarial nets , author=. Advances in Neural Information Processing Systems , pages=

  118. [126]

    Proceedings of International Conference on Computer Vision (ICCV) , month =

    Deep Learning Face Attributes in the Wild , author =. Proceedings of International Conference on Computer Vision (ICCV) , month =

  119. [127]

    Heusel, Martin and Ramsauer, Hubert and Unterthiner, Thomas and Nessler, Bernhard and Hochreiter, Sepp , booktitle=

  120. [128]

    Zeitschrift f

    An almost sure invariance principle for the empirical distribution function of mixing random variables , author=. Zeitschrift f. 1977 , publisher=

    1977

  121. [129]

    The Annals of Probability , pages=

    Invariance principles in probability for triangular arrays of B-valued random vectors and some applications , author=. The Annals of Probability , pages=. 1982 , publisher=

    1982

  122. [130]

    Claici, Sebastian and Genevay, Aude and Solomon, Justin , journal=

  123. [131]

    Genetics , volume=

    Inferring coalescence times from DNA sequence data , author=. Genetics , volume=. 1997 , publisher=

    1997

  124. [132]

    Approximate

    Bernton, Espen and Jacob, Pierre E and Gerber, Mathieu and Robert, Christian P , journal=. Approximate. 2019 , publisher=

    2019

  125. [133]

    Approximate

    Nadjahi, Kimia and De Bortoli, Valentin and Durmus, Alain and Badeau, Roland and. Approximate. ICASSP 2020-2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) , pages=. 2020 , organization=

    2020

  126. [134]

    Approximate

    Toni, Tina and Welch, David and Strelkowa, Natalja and Ipsen, Andreas and Stumpf, Michael PH , journal=. Approximate. 2009 , publisher=

    2009

  127. [135]

    Approximate

    Beaumont, Mark A and Zhang, Wenyang and Balding, David J , journal=. Approximate. 2002 , publisher=

    2002

  128. [136]

    Approximate

    Jiang, Bai , booktitle=. Approximate

  129. [137]

    K2-ABC: Approximate

    Park, Mijung and Jitkrittum, Wittawat and Sejdinovic, Dino , booktitle=. K2-ABC: Approximate. 2016 , organization=

    2016

  130. [138]

    arXiv preprint arXiv:2101.01792 , year=

    Minibatch optimal transport distances; analysis and applications , author=. arXiv preprint arXiv:2101.01792 , year=

    arXiv

  131. [139]

    Entropic approximation of

    Peyr. Entropic approximation of. SIAM Journal on Imaging Sciences , volume=. 2015 , publisher=

    2015

  132. [140]

    \ Euclidean, metric, and

    Santambrogio, Filippo , journal=. \ Euclidean, metric, and. 2017 , publisher=

    2017

  133. [141]

    Interpolating between Optimal Transport and

    Feydy, Jean and S. Interpolating between Optimal Transport and. The 22nd International Conference on Artificial Intelligence and Statistics , pages=

  134. [142]

    2009 IEEE 12th International Conference on Computer Vision , pages=

    Fast and robust earth mover's distances , author=. 2009 IEEE 12th International Conference on Computer Vision , pages=. 2009 , month=

    2009

  135. [143]

    Advances in Neural Information Processing Systems , year=

    Statistical bounds for entropic optimal transport: sample complexity and the central limit theorem , author=. Advances in Neural Information Processing Systems , year=

  136. [144]

    Journal of Theoretical Probability , volume=

    Asymptotics for transportation cost in high dimensions , author=. Journal of Theoretical Probability , volume=

  137. [145]

    R. M. Dudley , journal=. The Speed of Mean

  138. [146]

    and Guillin, A

    Fournier, N. and Guillin, A. , journal=. On the rate of convergence in

  139. [147]

    and Ledoux, M

    Bobkov, S. and Ledoux, M. , journal=. ‘

  140. [148]

    ACM Transactions on Intelligent Systems and Technology (TIST) , volume=

    Federated machine learning: Concept and applications , author=. ACM Transactions on Intelligent Systems and Technology (TIST) , volume=. 2019 , publisher=

    2019

  141. [149]

    Hierarchical Optimal Transport for Document Representation , url =

    Yurochkin, Mikhail and Claici, Sebastian and Chien, Edward and Mirzazadeh, Farzaneh and Solomon, Justin M , booktitle =. Hierarchical Optimal Transport for Document Representation , url =

  142. [150]

    POT: Python Optimal Transport , journal =

    R. POT: Python Optimal Transport , journal =. 2021 , volume =

    2021

  143. [151]

    2018 , publisher=

    Klinger, Emmanuel and Rickert, Dennis and Hasenauer, Jan , journal=. 2018 , publisher=

    2018

  144. [152]

    On Efficient Multilevel Clustering via

    Huynh, Viet and Ho, Nhat and Dam, Nhan and Nguyen, Long and Yurochkin, Mikhail and Bui, Hung and Phung, Dinh , journal=. On Efficient Multilevel Clustering via

  145. [153]

    Le, Trung and Nguyen, Tuan and Ho, Nhat and Bui, Hung and Phung, Dinh , booktitle=. Lamda:. 2021 , organization=

    2021

  146. [154]

    Nguyen and Q.-H

    T. Nguyen and Q.-H. Pham and T. Le and T. Pham and N. Ho and B.-S. Hua , booktitle=. Point-set Distances for Learning Representations of

  147. [155]

    ACM Transactions on Graphics (TOG) , volume=

    Entropic metric alignment for correspondence problems , author=. ACM Transactions on Graphics (TOG) , volume=. 2016 , publisher=

    2016

  148. [156]

    and Gasnikov, A

    Dvurechensky, P. and Gasnikov, A. and Kroshnin, A. , Booktitle =. Computational Optimal Transport:

  149. [157]

    The Journal of Machine Learning Research , volume=

    Domain-adversarial training of neural networks , author=. The Journal of Machine Learning Research , volume=. 2016 , publisher=

    2016

  150. [158]

    IEEE Transactions on pattern analysis and machine intelligence , volume=

    A database for handwritten text recognition research , author=. IEEE Transactions on pattern analysis and machine intelligence , volume=. 1994 , publisher=

    1994

  151. [159]

    Proceedings of the IEEE , volume=

    Gradient-based learning applied to document recognition , author=. Proceedings of the IEEE , volume=. 1998 , publisher=

    1998

  152. [160]

    NIPS Workshop on Deep Learning and Unsupervised Feature Learning , year=

    Reading digits in natural images with unsupervised feature learning , author=. NIPS Workshop on Deep Learning and Unsupervised Feature Learning , year=

  153. [161]

    Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , pages=

    Deep hashing network for unsupervised domain adaptation , author=. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , pages=

  154. [162]

    Peng, Xingchao and Usman, Ben and Kaushik, Neela and Hoffman, Judy and Wang, Dequan and Saenko, Kate , journal=. Visda:

  155. [163]

    Proceedings of the AAAI Conference on Artificial Intelligence , volume=

    Adversarial-learned loss for domain adaptation , author=. Proceedings of the AAAI Conference on Artificial Intelligence , volume=

  156. [164]

    Advances in Neural Information Processing Systems , pages=

    Conditional adversarial domain adaptation , author=. Advances in Neural Information Processing Systems , pages=

  157. [165]

    AISTATS , year=

    Probabilistic Multilevel Clustering via Composite Transportation Distance , author=. AISTATS , year=

  158. [166]

    arXiv preprint arXiv:1906.09691 , year=

    Adversarial computation of optimal transport maps , author=. arXiv preprint arXiv:1906.09691 , year=

    1906 arXiv

  159. [167]

    How well do

    Mallasto, Anton and Mont. How well do. arXiv preprint arXiv:1910.03875 , year=

    1910 arXiv

  160. [168]

    arXiv preprint arXiv:2103.01678 , year=

    Stanczuk, Jan and Etmann, Christian and Kreusser, Lisa Maria and Sch. arXiv preprint arXiv:2103.01678 , year=

    arXiv

  161. [169]

    International Conference on Machine Learning , pages=

    Optimal transport mapping via input convex neural networks , author=. International Conference on Machine Learning , pages=. 2020 , organization=

    2020

  162. [170]

    Continuous

    Korotin, Alexander and Li, Lingxiao and Solomon, Justin and Burnaev, Evgeny , journal=. Continuous

  163. [171]

    On unbalanced optimal transport: An analysis of

    Pham, Khiem and Le, Khang and Ho, Nhat and Pham, Tung and Bui, Hung , booktitle=. On unbalanced optimal transport: An analysis of. 2020 , organization=

    2020

  164. [172]

    Decoupling:

    De la Pena, Victor and Gin. Decoupling:. 2012 , publisher=

    2012

  165. [173]

    Proceedings of the European Conference on Computer Vision (ECCV) , pages=

    Partial adversarial domain adaptation , author=. Proceedings of the European Conference on Computer Vision (ECCV) , pages=

  166. [174]

    Computer Vision--ECCV 2020: 16th European Conference, Glasgow, UK, August 23--28, 2020, Proceedings, Part XI 16 , pages=

    A balanced and uncertainty-aware approach for partial domain adaptation , author=. Computer Vision--ECCV 2020: 16th European Conference, Glasgow, UK, August 23--28, 2020, Proceedings, Part XI 16 , pages=. 2020 , organization=

    2020

  167. [175]

    Advances in Neural Information Processing Systems , volume=

    Robust optimal transport with applications in generative modeling and domain adaptation , author=. Advances in Neural Information Processing Systems , volume=

  168. [176]

    Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages=

    Learning to transfer examples for partial domain adaptation , author=. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages=

  169. [177]

    Run-Sort-ReRun: Escaping Batch Size Limitations in Sliced

    Lezama, Jose and Chen, Wei and Qiu, Qiang , booktitle=. Run-Sort-ReRun: Escaping Batch Size Limitations in Sliced. 2021 , organization=

    2021

  170. [178]

    arXiv preprint arXiv:1312.6114 , year=

    Auto-encoding variational bayes , author=. arXiv preprint arXiv:1312.6114 , year=

    arXiv

  171. [179]

    Advances in Neural Information Processing Systems , volume=

    Denoising diffusion probabilistic models , author=. Advances in Neural Information Processing Systems , volume=

  172. [180]

    Advances in Neural Information Processing Systems , volume=

    Generative modeling by estimating gradients of the data distribution , author=. Advances in Neural Information Processing Systems , volume=

  173. [181]

    Advances in Neural Information Processing Systems , volume=

    f-gan: Training generative neural samplers using variational divergence minimization , author=. Advances in Neural Information Processing Systems , volume=

  174. [182]

    Orthogonal estimation of

    Rowland, Mark and Hron, Jiri and Tang, Yunhao and Choromanski, Krzysztof and Sarlos, Tamas and Weller, Adrian , booktitle=. Orthogonal estimation of. 2019 , organization=

    2019

  175. [183]

    and Ho, N

    Lin, T. and Ho, N. and Jordan, M. I. , Journal =. On the efficiency of the

  176. [184]

    and Ho, N

    Lin, T. and Ho, N. and Chen, X. and Cuturi, M. and Jordan, M. I. , Booktitle =. Fixed-support

  177. [185]

    arXiv preprint arXiv:2202.00665 , year=

    Tutorial on amortized optimization for learning to optimize over continuous domains , author=. arXiv preprint arXiv:2202.00665 , year=

  178. [186]

    Fast Approximation of the Sliced-

    Nadjahi, Kimia and Durmus, Alain and Jacob, Pierre E and Badeau, Roland and Simsekli, Umut , journal=. Fast Approximation of the Sliced-

  179. [187]

    Projection robust

    Lin, Tianyi and Fan, Chenyou and Ho, Nhat and Cuturi, Marco and Jordan, Michael , journal=. Projection robust

  180. [188]

    Huang, Minhui and Ma, Shiqian and Lai, Lifeng , booktitle=. A. 2021 , organization=

    2021

  181. [189]

    International Conference on Machine Learning , pages=

    Stochastic backpropagation and approximate inference in deep generative models , author=. International Conference on Machine Learning , pages=. 2014 , organization=

    2014

  182. [190]

    Proceedings of the AAAI Conference on Artificial Intelligence , volume=

    Meta-amortized variational inference and learning , author=. Proceedings of the AAAI Conference on Artificial Intelligence , volume=

  183. [191]

    International Conference on Machine Learning , pages=

    Iterative amortized inference , author=. International Conference on Machine Learning , pages=. 2018 , organization=

    2018

  184. [192]

    Advances in Neural Information Processing Systems , volume=

    Amortized inference regularization , author=. Advances in Neural Information Processing Systems , volume=

  185. [193]

    Proceedings of the annual meeting of the cognitive science society , volume=

    Amortized inference in probabilistic reasoning , author=. Proceedings of the annual meeting of the cognitive science society , volume=

  186. [194]

    arXiv preprint arXiv:1610.05735 , year=

    Deep amortized inference for probabilistic programs , author=. arXiv preprint arXiv:1610.05735 , year=

    arXiv

  187. [195]

    Twenty-Ninth AAAI Conference on Artificial Intelligence , year=

    Structural learning with amortized inference , author=. Twenty-Ninth AAAI Conference on Artificial Intelligence , year=

  188. [196]

    arXiv preprint arXiv:1802.05957 , year=

    Spectral normalization for generative adversarial networks , author=. arXiv preprint arXiv:1802.05957 , year=

    arXiv

  189. [197]

    Proceedings of the fourteenth international Conference on Artificial Intelligence and Statistics , pages=

    An analysis of single-layer networks in unsupervised feature learning , author=. Proceedings of the fourteenth international Conference on Artificial Intelligence and Statistics , pages=. 2011 , organization=

    2011

  190. [198]

    Improved techniques for training

    Salimans, Tim and Goodfellow, Ian and Zaremba, Wojciech and Cheung, Vicki and Radford, Alec and Chen, Xi , journal=. Improved techniques for training

  191. [199]

    arXiv preprint arXiv:1412.6980 , year=

    Adam: A method for stochastic optimization , author=. arXiv preprint arXiv:1412.6980 , year=

    arXiv

  192. [200]

    Vocabulary Learning via Optimal Transport for Neural Machine Translation , author=. Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers) , pages=

  193. [201]

    PLoS computational biology , volume=

    Predicting cell lineages using autoencoders and optimal transport , author=. PLoS computational biology , volume=. 2020 , publisher=

    2020

  194. [202]

    Lee, Chen-Yu and Batra, Tanmay and Baig, Mohammad Haris and Ulbricht, Daniel , booktitle=. Sliced

  195. [203]

    Kolouri, Soheil and Rohde, Gustavo K and Hoffmann, Heiko , booktitle=. Sliced

  196. [204]

    Competition and cooperation in neural nets , pages=

    Neocognitron: A self-organizing neural network model for a mechanism of visual pattern recognition , author=. Competition and cooperation in neural nets , pages=. 1982 , publisher=

    1982

  197. [205]

    2016 , publisher=

    Deep learning , author=. 2016 , publisher=

    2016

  198. [206]

    Advances in Neural Information Processing Systems , volume=

    Imagenet classification with deep convolutional neural networks , author=. Advances in Neural Information Processing Systems , volume=

  199. [207]

    Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , pages=

    Deep residual learning for image recognition , author=. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition , pages=

  200. [208]

    Radon, Johann , journal=. 1.1. 2005 , publisher=

    2005

  201. [209]

    Pooling by Sliced-

    Naderializadeh, Navid and Comer, Joseph and Andrews, Reed and Hoffmann, Heiko and Kolouri, Soheil , journal=. Pooling by Sliced-

  202. [210]

    Bonet, Cl. Sliced-. arXiv preprint arXiv:2110.10972 , year=

    arXiv

  203. [211]

    Efficient Gradient Flows in Sliced-

    Cl. Efficient Gradient Flows in Sliced-. Transactions on Machine Learning Research , year=

  204. [212]

    Yi, Mingxuan and Liu, Song , booktitle=. Sliced

  205. [213]

    International Conference on Machine Learning , pages=

    Sliced Iterative Normalizing Flows , author=. International Conference on Machine Learning , pages=. 2021 , organization=

    2021

  206. [214]

    Differentially private sliced

    Rakotomamonjy, Alain and Liva, Ralaivola , booktitle=. Differentially private sliced. 2021 , organization=

    2021

  207. [215]

    Titouan, Vayer and Flamary, R. Sliced. Advances in Neural Information Processing Systems , volume=

  208. [216]

    Advances in Neural Information Processing Systems , volume=

    Sliced Mutual Information: A Scalable Measure of Statistical Dependence , author=. Advances in Neural Information Processing Systems , volume=

  209. [217]

    Helgason, Sigurdur , booktitle=. The. 2011 , publisher=

    2011

  210. [218]

    Proceedings of the 39th International Conference on Machine Learning , year=

    On Transportation of Mini-batches: A Hierarchical Approach , author=. Proceedings of the 39th International Conference on Machine Learning , year=

  211. [219]

    Proceedings of the 39th International Conference on Machine Learning , year=

    Improving Mini-batch Optimal Transport via Partial Transportation , author=. Proceedings of the 39th International Conference on Machine Learning , year=

  212. [220]

    Liang, Zhi-Pei and Munson, David C , journal=. Partial. 1997 , publisher=

    1997

  213. [221]

    The inversion problem and applications of the generalized

    Beylkin, Gregory , journal=. The inversion problem and applications of the generalized. 1984 , publisher=

    1984

  214. [222]

    International Conference on Learning Representations , year=

    Generative Modeling with Optimal Transport Maps , author=. International Conference on Learning Representations , year=

  215. [223]

    CS 231N , volume=

    Tiny imagenet visual recognition challenge , author=. CS 231N , volume=

  216. [224]

    Spherical Sliced-

    Bonet, Cl. Spherical Sliced-. International Conference on Learning Representations , year=

  217. [225]

    Amortized Projection Optimization for Sliced

    Nguyen, Khai and Ho, Nhat , journal=. Amortized Projection Optimization for Sliced

  218. [226]

    Revisiting Sliced

    Nguyen, Khai and Ho, Nhat , journal=. Revisiting Sliced

  219. [227]

    SIAM Journal on Imaging Sciences , volume=

    Schmitz, Morgan A and Heitz, Matthieu and Bonneel, Nicolas and Ngole, Fred and Coeurjolly, David and Cuturi, Marco and Peyr. SIAM Journal on Imaging Sciences , volume=. 2018 , publisher=

    2018

  220. [228]

    2005 , publisher=

    N-distances and their applications , author=. 2005 , publisher=

    2005

  221. [229]

    Maximum likelihood estimators for the matrix von

    Jupp, Peter E and Mardia, Kanti V , journal=. Maximum likelihood estimators for the matrix von. 1979 , publisher=

    1979

  222. [230]

    arXiv preprint arXiv:2006.04437 , year=

    The power spherical distribution , author=. arXiv preprint arXiv:2006.04437 , year=

    2006 arXiv

  223. [231]

    Advances in Neural Information Processing Systems , volume=

    Statistical, robustness, and computational guarantees for sliced wasserstein distances , author=. Advances in Neural Information Processing Systems , volume=

  224. [232]

    Advances in Neural Information Processing Systems , volume=

    Statistical and topological properties of sliced probability divergences , author=. Advances in Neural Information Processing Systems , volume=

  225. [233]

    2007 , publisher=

    Measure theory , author=. 2007 , publisher=

    2007

  226. [234]

    1997 , publisher=

    Foundations of modern probability , author=. 1997 , publisher=

    1997

  227. [235]

    2012 , publisher=

    Machine learning: a probabilistic perspective , author=. 2012 , publisher=

    2012

  228. [236]

    Optimal transport for applied mathematicians , author=. Birk. 2015 , publisher=

    2015

  229. [237]

    Entropic approximation of

    Peyr\'. Entropic approximation of. SIAM Journal on Imaging Sciences , volume =

  230. [238]

    2011 , publisher=

    Special functions: An introduction to the classical functions of mathematical physics , author=. 2011 , publisher=

    2011

  231. [239]

    arXiv preprint arXiv:1605.00316 , year=

    Directional Statistics in Machine Learning: a Brief Review , author=. arXiv preprint arXiv:1605.00316 , year=

    arXiv

  232. [240]

    34th Conference on Uncertainty in Artificial Intelligence 2018, UAI 2018 , pages=

    Hyperspherical variational auto-encoders , author=. 34th Conference on Uncertainty in Artificial Intelligence 2018, UAI 2018 , pages=. 2018 , organization=

    2018

  233. [241]

    Inference for empirical

    Sommerfeld, Max and Munk, Axel , journal=. Inference for empirical. 2018 , publisher=

    2018

  234. [242]

    arXiv preprint arXiv:2212.08049 , year=

    Sliced Optimal Partial Transport , author=. arXiv preprint arXiv:2212.08049 , year=

    arXiv

  235. [243]

    Self-Attention Amortized Distributional Projection Optimization for Sliced

    Nguyen, Khai and Nguyen, Dang and Ho, Nhat , journal=. Self-Attention Amortized Distributional Projection Optimization for Sliced

  236. [244]

    Lidar Upsampling With Sliced

    Savkin, Artem and Wang, Yida and Wirkert, Sebastian and Navab, Nassir and Tombari, Federico , journal=. Lidar Upsampling With Sliced. 2022 , publisher=

    2022

  237. [245]

    Kevin P. Murphy. Probabilistic Machine Learning: Advanced Topics

  238. [246]

    Dowson, DC and Landau, BV666017 , journal=. The Fr. 1982 , publisher=

    1982

  239. [247]

    Novel approach to nonlinear/non-

    Gordon, Neil J and Salmond, David J and Smith, Adrian FM , booktitle=. Novel approach to nonlinear/non-. 1993 , organization=

    1993

  240. [248]

    Econometrica: Journal of the Econometric Society , pages=

    Bayesian estimates of equation system parameters: an application of integration by Monte Carlo , author=. Econometrica: Journal of the Econometric Society , pages=. 1978 , publisher=

    1978

  241. [249]

    Neural computation , volume=

    Training products of experts by minimizing contrastive divergence , author=. Neural computation , volume=. 2002 , publisher=

    2002

  242. [250]

    Hierarchical Sliced

    Nguyen, Khai and Ren, Tongzheng and Nguyen, Huy and Rout, Litu and Nguyen, Tan and Ho, Nhat , journal=. Hierarchical Sliced

  243. [251]

    Markovian Sliced

    Nguyen, Khai and Ren, Tongzheng and Ho, Nhat , journal=. Markovian Sliced

  244. [252]

    Uncertainty in Artificial Intelligence , pages=

    Sliced score matching: A scalable approach to density and score estimation , author=. Uncertainty in Artificial Intelligence , pages=. 2020 , organization=

    2020

  245. [253]

    arXiv preprint arXiv:1512.03012 , year=

    Shapenet: An information-rich 3d model repository , author=. arXiv preprint arXiv:1512.03012 , year=

    arXiv

  246. [254]

    Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV) , year=

    Point-set Distances for Learning Representations of 3D Point Clouds , author=. Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV) , year=

  247. [255]

    Pointnet:

    Qi, Charles R and Su, Hao and Mo, Kaichun and Guibas, Leonidas J , booktitle=. Pointnet:

  248. [256]

    3d shapenets:

    Wu, Zhirong and Song, Shuran and Khosla, Aditya and Yu, Fisher and Zhang, Linguang and Tang, Xiaoou and Xiao, Jianxiong , booktitle=. 3d shapenets:

  249. [257]

    2023 , url=

    Guangyi Chen and Weiran Yao and Xiangchen Song and Xinyue Li and Yongming Rao and Kun Zhang , booktitle=. 2023 , url=

    2023

  250. [258]

    International conference on machine learning , pages=

    Learning representations and generative models for 3d point clouds , author=. International conference on machine learning , pages=. 2018 , organization=

    2018

  251. [259]

    Advances in Neural Information Processing Systems , volume=

    Accurate point cloud registration with robust optimal transport , author=. Advances in Neural Information Processing Systems , volume=

  252. [260]

    Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages=

    Learning To Measure the Point Cloud Reconstruction Loss in a Representation Space , author=. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages=

  253. [261]

    Advances in Neural Information Processing Systems , volume=

    Softflow: Probabilistic framework for normalizing flow on manifolds , author=. Advances in Neural Information Processing Systems , volume=

  254. [262]

    Optimal transport for diffeomorphic registration , author=. Medical Image Computing and Computer Assisted Intervention- MICCAI 2017: 20th International Conference, Quebec City, QC, Canada, September 11-13, 2017, Proceedings, Part I 20 , pages=. 2017 , organization=

    2017

  255. [263]

    International Conference on Machine Learning , year=

    Meta optimal transport , author=. International Conference on Machine Learning , year=

  256. [264]

    International Conference on Learning Representations , year=

    Diffeomorphic Mesh Deformation via Efficient Optimal Transport for Cortical Surface Reconstruction , author=. International Conference on Learning Representations , year=

  257. [265]

    arXiv preprint arXiv:2205.15059 , year=

    Hilbert curve projection distance for distribution comparison , author=. arXiv preprint arXiv:2205.15059 , year=

    arXiv

  258. [266]

    Multiscale Nonrigid Point Cloud Registration Using Rotation-Invariant Sliced-

    Lai, Rongjie and Zhao, Hongkai , journal=. Multiscale Nonrigid Point Cloud Registration Using Rotation-Invariant Sliced-. 2017 , publisher=

    2017

  259. [267]

    A sliced

    Heitz, Eric and Vanhoey, Kenneth and Chambon, Thomas and Belcour, Laurent , booktitle=. A sliced

  260. [268]

    2013 , publisher=

    Monte Carlo theory, methods and examples , author=. 2013 , publisher=

    2013

  261. [269]

    Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing: Proceedings of a conference at the University of Nevada, Las Vegas, Nevada, USA, June 23--25, 1994 , pages=

    A quasi-Monte Carlo algorithm for the global illumination problem in the radiosity setting , author=. Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing: Proceedings of a conference at the University of Nevada, Las Vegas, Nevada, USA, June 23--25, 1994 , pages=....

    1994

  262. [270]

    The distribution of points in a cube and the accurate evaluation of integrals (in Russian) Zh , author=. Vychisl. Mat. i Mater. Phys , volume=

  263. [271]

    Mathematica B (Zutphen) , volume=

    Een algemeene stelling uit de theorie der gelijkmatige verdeeling modulo 1 , author=. Mathematica B (Zutphen) , volume=

  264. [272]

    Funktionen von beschr

    Hlawka, Edmund , journal=. Funktionen von beschr. 1961 , publisher=

    1961

  265. [273]

    1992 , publisher=

    Random number generation and quasi-Monte Carlo methods , author=. 1992 , publisher=

    1992

  266. [274]

    Radical inverse quasi-random point sequence, algorithm 247 , author=. Commun. ACM , volume=

  267. [275]

    2013 , publisher=

    Monte carlo methods , author=. 2013 , publisher=

    2013

  268. [276]

    Faure, Henri , journal=. Discr

  269. [277]

    Discrete & Computational Geometry , volume=

    Point sets on the sphere with small spherical cap discrepancy , author=. Discrete & Computational Geometry , volume=. 2012 , publisher=

    2012

  270. [278]

    Numerische Mathematik , volume=

    Quasi--Monte Carlo rules for numerical integration over the unit sphere , author=. Numerische Mathematik , volume=. 2012 , publisher=

    2012

  271. [279]

    Mathematics of computation , volume=

    QMC designs: optimal order quasi Monte Carlo integration schemes on the sphere , author=. Mathematics of computation , volume=

  272. [280]

    2016 , publisher=

    Quasi-Monte Carlo Methods in Non-Cubical Spaces , author=. 2016 , publisher=

    2016

  273. [281]

    Mathematical Research Letters , volume=

    Minimal discrete energy on the sphere , author=. Mathematical Research Letters , volume=. 1994 , publisher=

    1994

  274. [282]

    A Comparison of Popular Point Configurations on

    Hardin, Doug P and Michaels, TJ and Saff, Edward B , journal=. A Comparison of Popular Point Configurations on

  275. [283]

    Mathematika , volume=

    On the distribution of Fekete points , author=. Mathematika , volume=. 1968 , publisher=

    1968

  276. [284]

    Journal of Computational and Applied Mathematics , volume=

    An enumerative formula for the spherical cap discrepancy , author=. Journal of Computational and Applied Mathematics , volume=. 2021 , publisher=

    2021

  277. [285]

    , author=

    Sliced optimal transport sampling. , author=. ACM Trans. Graph. , volume=

  278. [286]

    Advances in Neural Information Processing Systems , volume=

    Demystifying orthogonal Monte Carlo and beyond , author=. Advances in Neural Information Processing Systems , volume=

  279. [287]

    Convergence of SGD for Training Neural Networks with Sliced

    Tanguy, Eloi , journal=. Convergence of SGD for Training Neural Networks with Sliced

  280. [288]

    SIAM Journal on Numerical Analysis , volume=

    Randomization of number theoretic methods for multiple integration , author=. SIAM Journal on Numerical Analysis , volume=. 1976 , publisher=

    1976

  281. [289]

    Remark on algorithm 659: Implementing

    Joe, Stephen and Kuo, Frances Y , journal=. Remark on algorithm 659: Implementing. 2003 , publisher=

    2003

  282. [290]

    Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing: Proceedings of a conference at the University of Nevada, Las Vegas, Nevada, USA, June 23--25, 1994 , pages=

    Randomly permuted (t, m, s)-nets and (t, s)-sequences , author=. Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing: Proceedings of a conference at the University of Nevada, Las Vegas, Nevada, USA, June 23--25, 1994 , pages=. 1995 , organization=

    1994

  283. [291]

    2009 , publisher=

    Aspects of multivariate statistical theory , author=. 2009 , publisher=

    2009

  284. [292]

    Potential Analysis , volume=

    On the distribution of weighted extremal points on a surface in , author=. Potential Analysis , volume=. 2000 , publisher=

    2000

  285. [293]

    1999 , publisher=

    Geometry of sets and measures in Euclidean spaces: fractals and rectifiability , author=. 1999 , publisher=

    1999

  286. [294]

    Energy-Based Sliced

    Nguyen, Khai and Ho, Nhat , journal=. Energy-Based Sliced

  287. [295]

    Artificial

    Handling sparsity via the horseshoe , author=. Artificial. 2009 , organization=

    2009

  288. [296]

    arXiv preprint arXiv:2502.02275 , year=

    A User Guide to Sampling Strategies for Sliced Optimal Transport , author=. arXiv preprint arXiv:2502.02275 , year=

    arXiv

  289. [297]

    Nguyen, Khai and Ho, Nhat , journal=. Sliced

  290. [298]

    Advances in Neural Information Processing Systems , volume=

    Geometric dataset distances via optimal transport , author=. Advances in Neural Information Processing Systems , volume=

  291. [299]

    Generalized transforms of

    Kuchment, Peter , booktitle=. Generalized transforms of

  292. [300]

    Nonlinear

    Rouviere, Francois , year=. Nonlinear

Pith tools

Reviewed August 1, 2026 · model on record in the stance chip above.