Fetching the paper…
Reading the bibliography…
Recently, Optimal Transport has been proposed as a probabilistic framework in Machine Learning for comparing and manipulating probability distributions.
L. Kantorovich, “On the transfer of masses (in russian),” in Doklady Akademii Nauk , vol. 37, no. 2, 1942, pp. 227–229
1942
Earlier work this paper cites.
R. Bellman, “On the theory of dynamic programming,” Proceedings of the National Academy of Sciences of the United States of America , vol. 38, no. 8, p. 716, 1952
1952
Earlier work this paper cites.
C. Laclau, I. Redko, B. Matei, Y. Bennani, and V. Brault, “Co-clustering through optimal transport,” in Proceedings of the 34th International Conference on Machine Learning , ser. Proceedings of Machine Learning Research, D. Precup and Y. W. Teh, Eds., vol. 70. PMLR, 06–11 Aug 2017, pp. 1955–1964
1964
Earlier work this paper cites.
I. Csiszár, “Information-type measures of difference of probability distributions and indirect observation,” studia scientiarum Mathematicarum Hungarica , vol. 2, pp. 229–318, 1967
1967
Earlier work this paper cites.
R. M. Dudley, “The speed of mean glivenko-cantelli convergence,” The Annals of Mathematical Statistics , vol. 40, no. 1, pp. 40–50, 1969
1969
Earlier work this paper cites.
R. Turrisi, R. Flamary, A. Rakotomamonjy, and M. Pontil, “Multi-source domain adaptation via weighted joint distributions optimal transport,” in Uncertainty in Artificial Intelligence . PMLR, 2022, pp. 1970–1980
1980
Earlier work this paper cites.
D. Pollard, “Quantization and the method of k-means,” IEEE Transactions on Information theory , vol. 28, no. 2, pp. 199–205, 1982
1982
Earlier work this paper cites.
G. B. Dantzig, “Reminiscences about the origins of linear programming,” in Mathematical programming the state of the art . Springer, 1983, pp. 78–86
1983
Earlier work this paper cites.
L. Lovász, “Mathematical programming–the state of the art,” 1983
1983
Earlier work this paper cites.
D. White, “Mean, variance, and probabilistic criteria in finite markov decision processes: A review,” Journal of Optimization Theory and Applications , vol. 56, no. 1, pp. 1–29, 1988
1988
Earlier work this paper cites.
Y. Brenier, “Polar factorization and monotone rearrangement of vector-valued functions,” Communications on pure and applied mathematics , vol. 44, no. 4, pp. 375–417, 1991
1991
Earlier work this paper cites.
C. J. Watkins and P. Dayan, “Q-learning,” Machine learning , vol. 8, no. 3-4, pp. 279–292, 1992
1992
Earlier work this paper cites.
J. E. Cohen and U. G. Rothblum, “Nonnegative ranks, decompositions, and factorizations of nonnegative matrices,” Linear Algebra and its Applications , vol. 190, pp. 149–168, 1993
1993
Earlier work this paper cites.
P. Paatero and U. Tapper, “Positive matrix factorization: A non-negative factor model with optimal utilization of error estimates of data values,” Environmetrics , vol. 5, no. 2, pp. 111–126, 1994
1994
Earlier work this paper cites.
R. J. McCann, “A convexity principle for interacting gases,” Advances in mathematics , vol. 128, no. 1, pp. 153–179, 1997
1997
Earlier work this paper cites.
A. Müller, “Integral probability metrics and their generating classes of functions,” Advances in Applied Probability , vol. 29, no. 2, pp. 429–443, 1997
1997
Earlier work this paper cites.
B. A. Olshausen and D. J. Field, “Sparse coding with an overcomplete basis set: A strategy employed by v1?” Vision research , vol. 37, no. 23, pp. 3311–3325, 1997
1997
Earlier work this paper cites.
D. Bertsekas, Network optimization: continuous and discrete models . Athena Scientific, 1998, vol. 8
1998
Earlier work this paper cites.
R. Jordan, D. Kinderlehrer, and F. Otto, “The variational formulation of the fokker–planck equation,” SIAM journal on mathematical analysis , vol. 29, no. 1, pp. 1–17, 1998
1998
Earlier work this paper cites.
R. S. Sutton, D. McAllester, S. Singh, and Y. Mansour, “Policy gradient methods for reinforcement learning with function approximation,” Advances in neural information processing systems , vol. 12, 1999
1999
Earlier work this paper cites.
Y. Rubner, C. Tomasi, and L. J. Guibas, “The earth mover’s distance as a metric for image retrieval,” International journal of computer vision , vol. 40, no. 2, pp. 99–121, 2000
2000
Earlier work this paper cites.
U. Frisch, S. Matarrese, R. Mohayaee, and A. Sobolevski, “A reconstruction of the initial conditions of the universe by optimal mass transportation,” Nature , vol. 417, no. 6886, pp. 260–262, 2002
2002
Earlier work this paper cites.
D. M. Blei, A. Y. Ng, and M. I. Jordan, “Latent dirichlet allocation,” Journal of machine Learning research , vol. 3, no. Jan, pp. 993–1022, 2003
2003
Earlier work this paper cites.
Z. Wang, A. C. Bovik, H. R. Sheikh, and E. P. Simoncelli, “Image quality assessment: from error visibility to structural similarity,” IEEE transactions on image processing , vol. 13, no. 4, pp. 600–612, 2004
2004
Earlier work this paper cites.
P. M. Gruber, “Optimum quantization and its applications,” Advances in Mathematics , vol. 186, no. 2, pp. 456–497, 2004
2004
Earlier work this paper cites.
R. T. Rockafellar, “Integral functionals, normal integrands and measurable selections,” in Nonlinear Operators and the Calculus of Variations: Summer School Held in Bruxelles 8–19 September 1975 . Springer, 2006, pp. 157–207
2006
Earlier work this paper cites.
C. M. Bishop and N. M. Nasrabadi, Pattern recognition and machine learning . Springer, 2006, vol. 4, no. 4
2006
Earlier work this paper cites.
F. Bassetti, A. Bodini, and E. Regazzini, “On minimum kantorovich distance estimators,” Statistics & probability letters , vol. 76, no. 12, pp. 1298–1302, 2006
2006
Earlier work this paper cites.
C. M. Bishop, Pattern Recognition and Machine Learning (Information Science and Statistics) . Berlin, Heidelberg: Springer-Verlag, 2006
2006
Earlier work this paper cites.
A. Gretton, K. M. Borgwardt, M. Rasch, B. Schölkopf, and A. J. Smola, “A kernel approach to comparing distributions,” in Proceedings of the National Conference on Artificial Intelligence , vol. 22, no. 2. Menlo Park, CA; Cambridge, MA; London; AAAI Press; MIT Press; 1999, 2007, p. 1637
2007
Earlier work this paper cites.
E. M. Loiola, N. M. M. De Abreu, P. O. Boaventura-Netto, P. Hahn, and T. Querido, “A survey for the quadratic assignment problem,” European journal of operational research , vol. 176, no. 2, pp. 657–690, 2007
2007
Earlier work this paper cites.
S. Graf and H. Luschgy, Foundations of quantization for probability distributions . Springer, 2007
2007
Earlier work this paper cites.
L. Ambrosio, N. Gigli, and G. Savaré, Gradient flows: in metric spaces and in the space of probability measures . Springer Science & Business Media, 2008
2008
Earlier work this paper cites.
C. Dwork, “Differential privacy: A survey of results,” in International conference on theory and applications of models of computation . Springer, 2008, pp. 1–19
2008
Earlier work this paper cites.
C. Villani, Optimal transport: old and new . Springer, 2009, vol. 338
2009
Earlier work this paper cites.
A. Krizhevsky, G. Hinton et al. , “Learning multiple layers of features from tiny images,” University of Toronto, Tech. Rep., 2009
2009
Earlier work this paper cites.
R. Sandler and M. Lindenbaum, “Nonnegative matrix factorization with earth mover’s distance metric,” in 2009 IEEE Conference on Computer Vision and Pattern Recognition . IEEE, 2009, pp. 1873–1880
2009
Earlier work this paper cites.
S. J. Pan and Q. Yang, “A survey on transfer learning,” IEEE Transactions on knowledge and data engineering , vol. 22, no. 10, pp. 1345–1359, 2009
2009
Earlier work this paper cites.
S. Ben-David, J. Blitzer, K. Crammer, A. Kulesza, F. Pereira, and J. W. Vaughan, “A theory of learning from different domains,” Machine learning , vol. 79, no. 1, pp. 151–175, 2010
2010
Earlier work this paper cites.
T. Morimura, M. Sugiyama, H. Kashima, H. Hachiya, and T. Tanaka, “Parametric return density estimation for reinforcement learning,” in Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence , 2010, pp. 368–375
2010
Earlier work this paper cites.
M. Agueh and G. Carlier, “Barycenters in the wasserstein space,” SIAM Journal on Mathematical Analysis , vol. 43, no. 2, pp. 904–924, 2011
2011
Earlier work this paper cites.
J. Rabin, G. Peyré, J. Delon, and M. Bernot, “Wasserstein barycenter and its application to texture mixing,” in International Conference on Scale Space and Variational Methods in Computer Vision . Springer, 2011, pp. 435–446
2011
Earlier work this paper cites.
F. Mémoli, “Gromov–wasserstein distances and the metric approach to object matching,” Foundations of computational mathematics , vol. 11, no. 4, pp. 417–487, 2011
2011
Earlier work this paper cites.
B. K. Sriperumbudur, K. Fukumizu, A. Gretton, B. Schölkopf, and G. R. Lanckriet, “On the empirical estimation of integral probability metrics,” Electronic Journal of Statistics , vol. 6, pp. 1550–1599, 2012
2012
Earlier work this paper cites.
C. Dwork, M. Hardt, T. Pitassi, O. Reingold, and R. Zemel, “Fairness through awareness,” in Proceedings of the 3rd innovations in theoretical computer science conference , 2012, pp. 214–226
2012
Earlier work this paper cites.
G. Canas and L. Rosasco, “Learning probability measures with respect to optimal transport metrics,” Advances in Neural Information Processing Systems , vol. 25, 2012
2012
Earlier work this paper cites.
B. Matei and S. Meignen, “Nonlinear cell-average multiscale signal representations: Application to signal denoising,” Signal processing , vol. 92, no. 11, pp. 2738–2746, 2012
2012
Earlier work this paper cites.
M. G. Azar, R. Munos, and B. Kappen, “On the sample complexity of reinforcement learning with a generative model,” in ICML , 2012
2012
Earlier work this paper cites.
L. Ambrosio and N. Gigli, “A user’s guide to optimal transport,” in Modelling and optimisation of flows on networks . Springer, 2013, pp. 1–155
2013
Earlier work this paper cites.
M. Cuturi, “Sinkhorn distances: Lightspeed computation of optimal transport,” Advances in neural information processing systems , vol. 26, pp. 2292–2300, 2013
2013
Earlier work this paper cites.
V. Vapnik, The nature of statistical learning theory . Springer science & business media, 2013
2013
Earlier work this paper cites.
T. Mikolov, I. Sutskever, K. Chen, G. S. Corrado, and J. Dean, “Distributed representations of words and phrases and their compositionality,” in Advances in neural information processing systems , 2013, pp. 3111–3119
2013
Earlier work this paper cites.
S. Ferradans, N. Papadakis, G. Peyré, and J.-F. Aujol, “Regularized discrete optimal transport,” SIAM Journal on Imaging Sciences , vol. 7, no. 3, pp. 1853–1882, 2014
2014
Earlier work this paper cites.
I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio, “Generative adversarial nets,” Advances in neural information processing systems , vol. 27, 2014
2014
Earlier work this paper cites.
M. Cuturi and A. Doucet, “Fast computation of wasserstein barycenters,” in International conference on machine learning . PMLR, 2014, pp. 685–693
2014
Earlier work this paper cites.
M. Ghifary, W. B. Kleijn, and M. Zhang, “Domain adaptive neural networks for object recognition,” in Pacific Rim international conference on artificial intelligence . Springer, 2014, pp. 898–904
2014
Earlier work this paper cites.
F. Santambrogio, “Optimal transport for applied mathematicians,” Birkäuser, NY , vol. 55, no. 58-63, p. 94, 2015
2015
Earlier work this paper cites.
N. Bonneel, J. Rabin, G. Peyré, and H. Pfister, “Sliced and radon wasserstein barycenters of measures,” Journal of Mathematical Imaging and Vision , vol. 51, no. 1, pp. 22–45, 2015
2015
Earlier work this paper cites.
S. Kolouri, S. R. Park, and G. K. Rohde, “The radon cumulative distribution transform and its application to image classification,” IEEE transactions on image processing , vol. 25, no. 2, pp. 920–934, 2015
2015
Cited alongside, same era.
C. Frogner, C. Zhang, H. Mobahi, M. Araya, and T. A. Poggio, “Learning with a wasserstein loss,” Advances in Neural Information Processing Systems , vol. 28, pp. 2053–2061, 2015
2015
Cited alongside, same era.
2015
Cited alongside, same era.
M. Kusner, Y. Sun, N. Kolkin, and K. Weinberger, “From word embeddings to document distances,” in International conference on machine learning . PMLR, 2015, pp. 957–966
2015
Cited alongside, same era.
S. Shafieezadeh-Abadeh, D. Kuhn, and P. M. Esfahani, “Regularization via mass transportation,” Journal of Machine Learning Research , vol. 20, no. 103, pp. 1–68, 2019
2019
Later among the works it cites.
P. Gordaliza, E. Del Barrio, G. Fabrice, and J.-M. Loubes, “Obtaining fairness using optimal transport theory,” in International Conference on Machine Learning . PMLR, 2019, pp. 2357–2365
2019
Later among the works it cites.
N. Lei, K. Su, L. Cui, S.-T. Yau, and X. D. Gu, “A geometric view of optimal transportation and generative model,” Computer Aided Geometric Design , vol. 68, pp. 1–21, 2019
2019
Later among the works it cites.
T. Pinetz, D. Soukup, and T. Pock, “On the estimation of the wasserstein distance in generative models,” in German Conference on Pattern Recognition . Springer, 2019, pp. 156–170
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Ghavamzadeh, S. Mannor, J. Pineau, and A. Tamar, “Bayesian reinforcement learning: A survey,” Foundations and Trends® in Machine Learning , vol. 8, no. 5-6, pp. 359–483, 2015
2015
Cited alongside, same era.
G. Montavon, K.-R. Müller, and M. Cuturi, “Wasserstein training of restricted boltzmann machines.” in NIPS , 2016, pp. 3711–3719
2016
Cited alongside, same era.
G. Peyré, M. Cuturi, and J. Solomon, “Gromov-wasserstein averaging of kernel and distance matrices,” in International Conference on Machine Learning . PMLR, 2016, pp. 2664–2672
2016
Cited alongside, same era.
J. Solomon, G. Peyré, V. G. Kim, and S. Sra, “Entropic metric alignment for correspondence problems,” ACM Transactions on Graphics (ToG) , vol. 35, no. 4, pp. 1–13, 2016
2016
Cited alongside, same era.
K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in Proceedings of the IEEE conference on computer vision and pattern recognition , 2016, pp. 770–778
2016
Cited alongside, same era.
A. Rolet, M. Cuturi, and G. Peyré, “Fast dictionary learning with a smoothed wasserstein loss,” in Artificial Intelligence and Statistics . PMLR, 2016, pp. 630–638
2016
Cited alongside, same era.
M. Perrot, N. Courty, R. Flamary, and A. Habrard, “Mapping estimation for discrete optimal transport,” Advances in Neural Information Processing Systems , vol. 29, pp. 4197–4205, 2016
2016
Cited alongside, same era.
Y. Ganin, E. Ustinova, H. Ajakan, P. Germain, H. Larochelle, F. Laviolette, M. Marchand, and V. Lempitsky, “Domain-adversarial training of neural networks,” The journal of machine learning research , vol. 17, no. 1, pp. 2096–2030, 2016
2016
Cited alongside, same era.
2019
Later among the works it cites.
J. Feydy, T. Séjourné, F.-X. Vialard, S.-i. Amari, A. Trouvé, and G. Peyré, “Interpolating between optimal transport and mmd using sinkhorn divergences,” in The 22nd International Conference on Artificial Intelligence and Statistics . PMLR, 2019, pp. 2681–2690
2019
Later among the works it cites.
J. Wu, Z. Huang, D. Acharya, W. Li, J. Thoma, D. P. Paudel, and L. V. Gool, “Sliced wasserstein generative models,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , 2019, pp. 3713–3722
2019
Later among the works it cites.
K. Nadjahi, A. Durmus, U. Simsekli, and R. Badeau, “Asymptotic guarantees for learning generative models with the sliced-wasserstein distance,” Advances in Neural Information Processing Systems , vol. 32, 2019
2019
Later among the works it cites.
M. Yurochkin, S. Claici, E. Chien, F. Mirzazadeh, and J. M. Solomon, “Hierarchical optimal transport for document representation,” Advances in neural information processing systems , vol. 32, 2019
2019
Later among the works it cites.
E. Del Barrio, J. A. Cuesta-Albertos, C. Matrán, and A. Mayo-Íscar, “Robust clustering tools based on optimal transportation,” Statistics and Computing , vol. 29, no. 1, pp. 139–160, 2019
2019
Later among the works it cites.
I. Redko, E. Morvant, A. Habrard, M. Sebban, and Y. Bennani, Advances in domain adaptation theory . Elsevier, 2019
2019
Later among the works it cites.
I. Redko, N. Courty, R. Flamary, and D. Tuia, “Optimal transport for multi-source domain adaptation under target shift,” in The 22nd International Conference on Artificial Intelligence and Statistics . PMLR, 2019, pp. 849–858
2019
Later among the works it cites.
A. M. Metelli, A. Likmeta, and M. Restelli, “Propagating uncertainty in reinforcement learning via wasserstein barycenters,” in 33rd Conference on Neural Information Processing Systems, NeurIPS 2019 . Curran Associates, Inc., 2019, pp. 4335–4347
2019
Later among the works it cites.
J. Weed and F. Bach, “Sharp asymptotic and finite-sample rates of convergence of empirical measures in wasserstein distance,” Bernoulli , vol. 25, no. 4A, pp. 2620–2648, 2019
2019
Later among the works it cites.
2019
Later among the works it cites.
N. Lê Tien, A. Habrard, and M. Sebban, “Differentially private optimal transport: Application to domain adaptation.” in IJCAI , 2019, pp. 2852–2858
2019
Later among the works it cites.
2019
Later among the works it cites.
T. Lin, C. Fan, N. Ho, M. Cuturi, and M. Jordan, “Projection robust wasserstein distance and riemannian optimization,” Advances in neural information processing systems , vol. 33, pp. 9383–9397, 2020
2020
Later among the works it cites.
A. Makkuva, A. Taghvaei, S. Oh, and J. Lee, “Optimal transport mapping via input convex neural networks,” in International Conference on Machine Learning . PMLR, 2020, pp. 6672–6681
2020
Later among the works it cites.
K. Fatras, Y. Zine, R. Flamary, R. Gribonval, and N. Courty, “Learning with minibatch wasserstein: asymptotic and gradient properties,” in AISTATS , 2020
2020
Later among the works it cites.
L. Chapel, M. Z. Alaya, and G. Gasso, “Partial optimal tranport with applications on positive-unlabeled learning,” Advances in Neural Information Processing Systems , vol. 33, pp. 2903–2913, 2020
2020
Later among the works it cites.
X. Liu, Y. Han, S. Bai, Y. Ge, T. Wang, X. Han, S. Li, J. You, and J. Lu, “Importance-aware semantic segmentation in self-driving with discrete wasserstein training,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 34, no. 07, 2020, pp. 11 629–11 636
2020
Later among the works it cites.
X. Liu, W. Ji, J. You, G. E. Fakhri, and J. Woo, “Severity-aware semantic segmentation with reinforced wasserstein training,” in Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , 2020, pp. 12 566–12 575
2020
Later among the works it cites.
S. Caton and C. Haas, “Fairness in machine learning: A survey,” ACM Computing Surveys , 2020
2020
Later among the works it cites.
L. Oneto, M. Donini, G. Luise, C. Ciliberto, A. Maurer, and M. Pontil, “Exploiting mmd and sinkhorn divergences for fair and transferable representation learning.” in NeurIPS , 2020
2020
Later among the works it cites.
S. Chiappa, R. Jiang, T. Stepleton, A. Pacchiano, H. Jiang, and J. Aslanides, “A general approach to fairness with optimal transport.” in AAAI , 2020, pp. 3633–3640
2020
Later among the works it cites.
Y. Xie, X. Wang, R. Wang, and H. Zha, “A fast proximal point method for computing exact wasserstein distance,” in Uncertainty in artificial intelligence . PMLR, 2020, pp. 433–453
2020
Later among the works it cites.
K. Nadjahi, A. Durmus, L. Chizat, S. Kolouri, S. Shahrampour, and U. Simsekli, “Statistical and topological properties of sliced probability divergences,” Advances in Neural Information Processing Systems , vol. 33, pp. 20 802–20 812, 2020
2020
Later among the works it cites.
D. P. Kingma and M. Welling, “Autoencoding variational bayes,” in International Conference on Learning Representations , 2020
2020
Later among the works it cites.
G. Patrini, R. van den Berg, P. Forre, M. Carioni, S. Bhargav, M. Welling, T. Genewein, and F. Nielsen, “Sinkhorn autoencoders,” in Uncertainty in Artificial Intelligence . PMLR, 2020, pp. 733–743
2020
Later among the works it cites.
I. Kobyzev, S. Prince, and M. Brubaker, “Normalizing flows: An introduction and review of current methods,” IEEE Transactions on Pattern Analysis and Machine Intelligence , 2020
2020
Later among the works it cites.
C. Finlay, J.-H. Jacobsen, L. Nurbekyan, and A. Oberman, “How to train your neural ode: the world of jacobian and kinetic regularization,” in International Conference on Machine Learning . PMLR, 2020, pp. 3154–3164
2020
Later among the works it cites.
H. Xu, “Gromov-wasserstein factorization models for graph clustering,” in Proceedings of the AAAI conference on artificial intelligence , vol. 34, no. 04, 2020, pp. 6478–6485
2020
Later among the works it cites.
V. Huynh, H. Zhao, and D. Phung, “Otlda: A geometry-aware optimal transport approach for topic modeling,” Advances in Neural Information Processing Systems , vol. 33, pp. 18 573–18 582, 2020
2020
Later among the works it cites.
I. Redko, T. Vayer, R. Flamary, and N. Courty, “Co-optimal transport,” Advances in Neural Information Processing Systems , vol. 33, no. 17559-17570, 2020
2020
Later among the works it cites.
D. Alvarez Melis and N. Fusi, “Geometric dataset distances via optimal transport,” Advances in Neural Information Processing Systems , vol. 33, 2020
2020
Later among the works it cites.
W. Dabney, Z. Kurth-Nelson, N. Uchida, C. K. Starkweather, D. Hassabis, R. Munos, and M. Botvinick, “A distributional code for value in dopamine-based reinforcement learning,” Nature , vol. 577, no. 7792, pp. 671–675, 2020
2020
Later among the works it cites.
C. Villani, Topics in optimal transportation . American Mathematical Soc., 2021, vol. 58
2021
Later among the works it cites.
R. Flamary, N. Courty, A. Gramfort, M. Z. Alaya, A. Boisbunon, S. Chambon, L. Chapel, A. Corenflos, K. Fatras, N. Fournier et al. , “Pot: Python optimal transport,” Journal of Machine Learning Research , vol. 22, no. 78, pp. 1–8, 2021
2021
Later among the works it cites.
T. T. Nguyen, S. Gupta, and S. Venkatesh, “Distributional reinforcement learning via moment matching,” in Proceedings of the AAAI Conference on Artificial Intelligence (AAAI) , 2021
2021
Later among the works it cites.
M. Huang, S. Ma, and L. Lai, “A riemannian block coordinate descent method for computing the projection robust wasserstein distance,” in International Conference on Machine Learning . PMLR, 2021, pp. 4446–4455
2021
Later among the works it cites.
K. Fatras, T. Sejourne, R. Flamary, and N. Courty, “Unbalanced minibatch optimal transport; applications to domain adaptation,” in International Conference on Machine Learning . PMLR, 2021, pp. 3186–3197
2021
Later among the works it cites.
2021
Later among the works it cites.
C. Vincent-Cuaz, T. Vayer, R. Flamary, M. Corneli, and N. Courty, “Online graph dictionary learning,” in International Conference on Machine Learning . PMLR, 2021, pp. 10 564–10 574
2021
Later among the works it cites.
E. F. Montesuma and F. M. N. Mboula, “Wasserstein barycenter transport for acoustic adaptation,” in ICASSP 2021-2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) . IEEE, 2021, pp. 3405–3409
2021
Later among the works it cites.
D. Alvarez-Melis and N. Fusi, “Dataset dynamics via gradient flows in probability space,” in International Conference on Machine Learning . PMLR, 2021, pp. 219–230
2021
Later among the works it cites.
A. Korotin, L. Li, A. Genevay, J. M. Solomon, A. Filippov, and E. Burnaev, “Do neural optimal transport solvers work? a continuous wasserstein-2 benchmark.” in NeurIPS , 2021
2021
Later among the works it cites.
T. Cao, A. Bie, A. Vahdat, S. Fidler, and K. Kreis, “Don’t generate me: Training differentially private generative models with sinkhorn divergence,” Advances in Neural Information Processing Systems , vol. 34, pp. 12 480–12 492, 2021
2021
Later among the works it cites.
2022
Later among the works it cites.
K. Nguyen, D. Nguyen, T. Pham, N. Ho et al. , “Improving mini-batch optimal transport via partial transportation,” in International Conference on Machine Learning . PMLR, 2022, pp. 16 656–16 690
2022
Later among the works it cites.
K. Fatras, B. B. Damodaran, S. Lobry, R. Flamary, D. Tuia, and N. Courty, “Wasserstein adversarial regularization for learning with label noise,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 44, no. 10, pp. 7296–7306, 2022
2022
Later among the works it cites.
K. Nguyen and N. Ho, “Revisiting sliced wasserstein on images: From vectorization to convolution,” Advances in Neural Information Processing Systems , vol. 35, pp. 17 788–17 801, 2022
2022
Later among the works it cites.
C. Bonet, P. Berg, N. Courty, F. Septier, L. Drumetz, and M. T. Pham, “Spherical sliced-wasserstein,” in The Eleventh International Conference on Learning Representations , 2022
2022
Later among the works it cites.
E. F. Montesuma, M. Mulas, F. Corona, and F. M. N. Mboula, “Cross-domain fault diagnosis through optimal transport for a cstr process,” IFAC-PapersOnLine , 2022
2022
Later among the works it cites.
A. Korotin, D. Selikhanovych, and E. Burnaev, “Neural optimal transport,” in The Eleventh International Conference on Learning Representations , 2023
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
E. Fernandes Montesuma, F. N. Mboula, and A. Souloumiac, “Multi-source domain adaptation through dataset dictionary learning in wasserstein space,” in 26th European Conference on Artificial Intelligence , 2023
2023
Closest in time.