Fetching the paper…
Reading the bibliography…
In this paper, we formulate the problem of inferring a Finite Mixture Model from discrete data as an optimal transport problem with entropic regularization of parameter $\lambda\geq 0$.
Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the em algorithm. J. of the royal statistical soc. series B 39
1977
Earlier work this paper cites.
Lloyd, S.P.: Least square quantization in PCM. IEEE Trans. on Information Theory 28
1982
Earlier work this paper cites.
Eguchi, S.: Second order efficiency of minimum contrast estimators in a curved exponential family. The Annals of Statistics 11
1983
Earlier work this paper cites.
Kearns, M., Mansour, Y., Ng, A.Y.: An information-theoretic analysis of hard and soft assignment methods for clustering. In: Conf. on Uncertainty in Artificial Intelligence. pp. 282–293 (1997)
1997
Earlier work this paper cites.
Scheirer, E., Slaney, M.: Construction and evaluation of a robust multifeature speech/music discriminator. In: IEEE Int. Conf. on Acoustics, Speech, and Signal Proces. vol. 2, pp. 1331–1334 (1997)
1997
Earlier work this paper cites.
Basu, A., Harris, I.R., Hjort, N.L., Jones, M.C.: Robust and efficient estimation by minimising a density power divergence. Biometrika 85
1998
Earlier work this paper cites.
Grippo, L., Sciandrone, M.: On the convergence of the block nonlinear gauss–seidel method under convex constraints. Operations res. let. 26
2000
Earlier work this paper cites.
Rubner, Y., Tomasi, C., Guibas, L.J.: The earth mover’s distance as a metric for image retrieval. Int. Journal of Computer Vision 40
2000
Earlier work this paper cites.
Eguchi, S., Kano, Y.: Robustifying maximum likelihood estimation. Tech. rep., The Institute of Statistical Mathematics (2001)
2001
Earlier work this paper cites.
Tseng, P.: Convergence of a block coordinate descent method for nondifferentiable minimization. Journal of optimization theory and applications 109
2001
Earlier work this paper cites.
Carson, C., Belongie, S., Greenspan, H., Malik, J.: Blobworld: Image segmentation using expectation-maximization and its application to image querying. IEEE Trans. Pat. Analys. and Mach. Intel. 24
2002
Earlier work this paper cites.
Mihoko, M., Eguchi, S.: Robust blind source separation by beta divergence. Neural Computation 14
2002
Earlier work this paper cites.
Tzanetakis, G., Cook, P.: Musical genre classification of audio signals. IEEE Trans. on Speech and Audio Processing 10
2002
Earlier work this paper cites.
Greenspan, H., Goldberger, J., Mayer, A.: Probabilistic space-time video modeling via piecewise gmm. IEEE Trans. Pat. Analys. and Mach. Intel. 26
2004
Earlier work this paper cites.
Banerjee, A., Merugu, S., Dhillon, I.S., Ghosh, J.: Clustering with Bregman divergences. Journal of Machine Learning Res. 6
2005
Earlier work this paper cites.
Bassetti, F., Bodini, A., Regazzini, E.: On minimum kantorovich distance estimators. Statistics & Probability Letters 76
2006
Earlier work this paper cites.
Benaroya, L., Bimbot, F., Gribonval, R.: Audio source separation with a single sensor. IEEE Trans. on Audio, Speech, and Language Proces. 14
2006
Earlier work this paper cites.
Irpino, A., Verde, R.: A new wasserstein based distance for the hierarchical clustering of histogram symbolic data. Data science and classification pp. 185–192 (2006)
2006
Earlier work this paper cites.
Nock, R., Nielsen, F.: On weighting clustering. IEEE Trans. Pat. Analys. and Mach. Intel. 28
2006
Earlier work this paper cites.
Pardo, L.: Statistical Inference Based on Divergence Measures. Statistics: A Series of Textbooks and Monographs, Chapman & Hall/CRC (2006)
2006
Cited alongside, same era.
Arthur, D., Vassilvitskii, S.: k-means++: The advantages of careful seeding. In: CM-SIAM Symposium on Discrete Algorithms. pp. 1027–1035 (2007)
2007
Cited alongside, same era.
Eguchi, S.: Information divergence geometry and the application to statistical machine learning. In: Inform. Theory and Stat. Learn., chap. 13, pp. 309–332 (2009)
2009
Cited alongside, same era.
Jordan, M.: Exponential families : basics. Berkeley course notes (2009)
2009
Cited alongside, same era.
Zhang, J., Song, Y., Chen, G., Zhang, C.: On-line evolutionary exponential family mixture. In: Int. Joint Conf. on Artifical Intelligence. pp. 1610–1615 (2009)
2009
Cited alongside, same era.
2017
Closest in time.
Staib, M., Jegelka, S.: Wasserstein k-means++ for cloud regime histogram clustering. In: Climate Informatics (2017)
2017
Closest in time.
Wang, Y., Kucukelbir, A., Blei, D.M.: Robust probabilistic modeling with bayesian data reweighting. In: Int. Conf. on Machine Learning. pp. 3646–3655. PMLR (2017)
2017
Closest in time.
Ye, J., Wu, P., Wang, J.Z., Li, J.: Fast discrete distribution clustering using Wasserstein barycenter with sparse support. IEEE Trans. Signal Proces. 65
2017
Closest in time.
Adler, J., Lunz, S.: Banach wasserstein gan. Adv. in Neur. Inf. Proces. Syst. 31
2018
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Agueh, M., Carlier, G.: Barycenters in the wasserstein space. SIAM Journal on Mathematical Analysis 43
2011
Cited alongside, same era.
Basu, A., Shioya, H., Park, C.: Statistical Inference: The Minimum Distance Approach, Monographs on Statistics and Applied Probability, vol. 120 (2011)
2011
Cited alongside, same era.
Zoran, D., Weiss, Y.: From learning models of natural image patches to whole image restoration. In: IEEE Int. Conf. on Computer Vision. pp. 479–486 (2011)
2011
Cited alongside, same era.
Liu, M., Vemuri, B.C., Amari, S.i., Nielsen, F.: Shape retrieval using hierarchical total Bregman soft clustering. IEEE Trans. Pat. Analys. and Mach. Intel. 34
2012
Cited alongside, same era.
Nielsen, F.: K-MLE: A fast algorithm for learning statistical mixture models. In: IEEE Int. Conf. on Acoustics, Speech and Signal Proces. pp. 869–872 (2012)
2012
Cited alongside, same era.
Cuturi, M.: Sinkhorn distances: Lightspeed computation of optimal transport. Adv. in Neural inf. proces. syst. 26
2013
Cited alongside, same era.
Cuturi, M., Avis, D.: Ground metric learning. Journal of Machine Learning Res. 15
2014
Cited alongside, same era.
Chen, Y., Georgiou, T.T., Tannenbaum, A.: Optimal transport for gaussian mixture models. IEEE Access 7
2018
Closest in time.
Dessein, A., Papadakis, N., Rouas, J.L.: Regularized optimal transport and the rot mover’s distance. Journal of Machine Learning Res. 19
2018
Closest in time.
Genevay, A., Peyré, G., Cuturi, M.: Learning generative models with sinkhorn divergences. In: Int. Conf. Artif. Intel. and Stat. pp. 1608–1617. PMLR (2018)
2018
Closest in time.
Bernton, E., Jacob, P.E., Gerber, M., Robert, C.P.: On parameter estimation with the wasserstein distance. Information and Inference: A Journal of the IMA 8
2019
Closest in time.
Peyré, G., Cuturi, M., et al.: Computational optimal transport: With applications to data science. Foundations and Trends® in Machine Learning 11
2019
Closest in time.
Delon, J., Desolneux, A.: A wasserstein-type distance in the space of gaussian mixture models. SIAM Journal on Imaging Sciences 13
2020
Closest in time.
Frogner, C., Poggio, T.: Approximate inference with wasserstein gradient flows. In: Int. Conf. Artif. Intel. and Stat. pp. 2581–2590. PMLR (2020)
2020
Closest in time.
2020
Closest in time.
Blanchet, J., Kang, Y.: Sample out-of-sample inference based on wasserstein distance. Operations Research 69
2021
Closest in time.
Houdard, A., Leclaire, A., Papadakis, N., Rabin, J.: On the gradient formula for learning generative models with regularized optimal transport costs. Transactions on Machine Learning Research (2022)
2022
Closest in time.
Lambert, M., Chewi, S., Bach, F., Bonnabel, S., Rigollet, P.: Variational inference via wasserstein gradient flows. Adv. in Neur. Inf. Proces. Syst. 35
2022
Closest in time.
Zhuang, Y., Chen, X., Yang, Y.: Wasserstein k k -means for clustering probability distributions. Adv. in Neur. Inf. Proces. Syst. 35
2022
Closest in time.
Yi, M., Liu, S.: Sliced wasserstein variational inference. In: Asian Conference on Machine Learning. pp. 1213–1228. PMLR (2023)
2023
Closest in time.