mlsanityData to 7 Oct 2026

Estimation and inference for the Wasserstein distance between mixing measures in topic models

arXiv 2206.12768 ↗First posted 26 Jun 2022math.ST stat.ML stat.THcited by 4

Not on the map. Why?

Abstract (arXiv)

The Wasserstein distance between mixing measures has come to occupy a central place in the statistical analysis of mixture models. This work proposes a new canonical interpretation of this distance and provides tools to perform inference on the Wasserstein distance between mixing measures in topic models. We consider the general setting of an identifiable mixture model consisting of mixtures of distributions from a set A equipped with an arbitrary metric d, and show that the Wasserstein distance between mixing measures is uniquely characterized as the most discriminative convex extension of the metric d to the set of mixtures of elements of A. The Wasserstein distance between mixing measures has been widely used in the study of such models, but without axiomatic justification. Our results establish this metric to be a canonical choice. Specializing our results to topic models, we consider estimation and inference of this distance. Though upper bounds for its estimation have been recently established elsewhere, we prove the first minimax lower bounds for the estimation of the Wasserstein distance in topic models. We also establish fully data-driven inferential tools for the Wasserstein distance in the topic model context. Our results apply to potentially sparse mixtures of high-dimensional discrete probability distributions. These results allow us to obtain the first asymptotically valid confidence intervals for the Wasserstein distance in topic models.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 10 of its 73 references that are in the map. First posted on arXiv 26 Jun 2022.

Builds on

10 of 73 references.

References · 10

  1. 2021Plugin Estimation of Smooth Optimal Transport Mapscited by 67
  2. 2016Inference for Empirical Wasserstein Distances on Finite Spacescited by 21
  3. 2017Using SVD for Topic Modelingcited by 14
  4. 2020Estimating the Number of Components in Finite Mixture Models via the Group-Sort-Fuse Procedurecited by 8
  5. 2018A fast algorithm with minimax optimal guarantees for topic models with an unknown number of topicscited by 5
  6. 2020Optimal estimation of sparse topic modelscited by 5
  7. 2014A provable SVD-based algorithm for learning topics in dominant admixture corpuscited by 4
  8. 2019On the Minimax Optimality of Estimating the Wasserstein Metriccited by 2
  9. 2021Likelihood estimation of sparse topic distributions in topic models and its applications to Wasserstein document distance calculationscited by 2
  10. 2017Robust estimation of mixing measures in finite mixture modelscited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 0; 2025: 0; 2026: 3.

4 papers.