Fetching the paper…
Reading the bibliography…
We study multi-marginal optimal transport problems from a probabilistic graphical model perspective.
W. E. Deming and F. F. Stephan, “On a least squares adjustment of a sampled frequency table when the expected marginal totals are known,” The Annals of Mathematical Statistics , vol. 11, no. 4, pp. 427–444, 1940
1940
Earlier work this paper cites.
L. V. Kantorovich, “On the transfer of masses,” in Dokl. Akad. Nauk. SSSR , vol. 37, no. 7-8, 1942, pp. 227–229
1942
Earlier work this paper cites.
S. Kullback and R. A. Leibler, “On information and sufficiency,” The annals of mathematical statistics , vol. 22, no. 1, pp. 79–86, 1951
1951
Earlier work this paper cites.
R. Sinkhorn, “A relationship between arbitrary positive matrices and doubly stochastic matrices,” The annals of mathematical statistics , vol. 35, no. 2, pp. 876–879, 1964
1964
Earlier work this paper cites.
J. Pearl, “Probabilistic reasoning in intelligent systems: Networks of plausible inference,” Morgan Kaufmann Publishers Inc , 1988
1988
Earlier work this paper cites.
J. Franklin and J. Lorenz, “On the scaling of multidimensional matrices,” Linear Algebra and its applications , vol. 114, pp. 717–735, 1989
1989
Earlier work this paper cites.
P. Tseng, “Dual ascent methods for problems with strictly convex costs and linear constraints: A unified approach,” SIAM Journal on Control and Optimization , vol. 28, no. 1, pp. 214–242, 1990
1990
Earlier work this paper cites.
Z.-Q. Luo and P. Tseng, “On the convergence rate of dual ascent methods for linearly constrained convex minimization,” Mathematics of Operations Research , vol. 18, no. 4, pp. 846–867, 1993
1993
Earlier work this paper cites.
W. Gangbo and A. Świech, “Optimal maps for the multidimensional Monge-Kantorovich problem,” Communications on Pure and Applied Mathematics: A Journal Issued by the Courant Institute of Mathematical Sciences , vol. 51, no. 1, pp. 23–45, 1998
1998
Earlier work this paper cites.
A. S. Asratian, T. M. Denley, and R. Häggkvist, Bipartite graphs and their applications . Cambridge university press, 1998, vol. 131
1998
Earlier work this paper cites.
L. C. Evans and W. Gangbo, Differential equations methods for the Monge-Kantorovich mass transfer problem . American Mathematical Soc., 1999, vol. 653
1999
Earlier work this paper cites.
K. P. Murphy, Y. Weiss, and M. I. Jordan, “Loopy belief propagation for approximate inference: An empirical study,” in Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence . Morgan Kaufmann Publishers Inc., 1999, pp. 467–475
1999
Earlier work this paper cites.
M. I. Jordan, Z. Ghahramani, T. S. Jaakkola, and L. K. Saul, “An introduction to variational methods for graphical models,” Machine learning , vol. 37, no. 2, pp. 183–233, 1999
1999
Earlier work this paper cites.
H. Attias, “A variational Baysian framework for graphical models,” in Advances in neural information processing systems , 2000, pp. 209–215
2000
Earlier work this paper cites.
S. M. Aji and R. J. McEliece, “The generalized distributive law,” IEEE transactions on Information Theory , vol. 46, no. 2, pp. 325–343, 2000
2000
Earlier work this paper cites.
H. H. Bauschke and A. S. Lewis, “Dykstras algorithm with Bregman projections: A convergence proof,” Optimization , vol. 48, no. 4, pp. 409–427, 2000
2000
Earlier work this paper cites.
J. S. Yedidia, W. T. Freeman, and Y. Weiss, “Generalized belief propagation,” in Advances in neural information processing systems , 2001, pp. 689–695
2001
Earlier work this paper cites.
J. Bilmes and G. Zweig, “The graphical models toolkit: An open source software system for speech and time-series processing,” in 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing , vol. 4. IEEE, 2002, pp. IV–3916
2002
Earlier work this paper cites.
Y. W. Teh and M. Welling, “The unified propagation and scaling algorithm,” in Advances in neural information processing systems , 2002, pp. 953–960
2002
Earlier work this paper cites.
C. Villani, Topics in optimal transportation . American Mathematical Soc., 2003, no. 58
2003
Earlier work this paper cites.
G. Carlier, “On a class of multidimensional optimal transportation problems,” Journal of convex analysis , vol. 10, no. 2, pp. 517–530, 2003
2003
Cited alongside, same era.
J. S. Yedidia, W. T. Freeman, and Y. Weiss, “Understanding belief propagation and its generalizations,” Exploring artificial intelligence in the new millennium , vol. 8, pp. 236–239, 2003
2003
Cited alongside, same era.
S. Haker, L. Zhu, A. Tannenbaum, and S. Angenent, “Optimal mass transport for registration and warping,” International Journal of Computer Vision , vol. 60, no. 3, pp. 225–240, 2004
2004
Cited alongside, same era.
J. S. Yedidia, W. T. Freeman, and Y. Weiss, “Constructing free-energy approximations and generalized belief propagation algorithms,” IEEE Transactions on information theory , vol. 51, no. 7, pp. 2282–2312, 2005
2005
Cited alongside, same era.
B. Pass, “Multi-marginal optimal transport: theory and applications,” ESAIM: Mathematical Modelling and Numerical Analysis , vol. 49, no. 6, pp. 1771–1790, 2015
2015
Later among the works it cites.
J.-D. Benamou, G. Carlier, M. Cuturi, L. Nenna, and G. Peyré, “Iterative bregman projections for regularized transportation problems,” SIAM Journal on Scientific Computing , vol. 37, no. 2, pp. A1111–A1138, 2015
2015
Later among the works it cites.
T. Sun, D. Sheldon, and A. Kumar, “Message passing for collective graphical models,” in International Conference on Machine Learning , 2015, pp. 853–861
2015
Later among the works it cites.
S. J. Wright, “Coordinate descent algorithms,” Mathematical Programming , vol. 151, no. 1, pp. 3–34, 2015
2015
Later among the works it cites.
Y. Chen, T. T. Georgiou, and M. Pavon, “On the relation between optimal transport and Schrödinger bridges: A stochastic control viewpoint,” Journal of Optimization Theory and Applications , vol. 169, no. 2, pp. 671–691, 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
P. Larranaga, B. Calvo, R. Santana, C. Bielza, J. Galdiano, I. Inza, J. A. Lozano, R. Armananzas, G. Santafé, A. Pérez, et al. , “Machine learning in bioinformatics,” Briefings in bioinformatics , vol. 7, no. 1, pp. 86–112, 2006
2006
Cited alongside, same era.
Y. Weiss, C. Yanover, and T. Meltzer, “MAP estimation, linear programming and belief propagation with convex free energies,” in Proceedings of the Twenty-Third Conference on Uncertainty in Artificial Intelligence , 2007, pp. 416–425
2007
Cited alongside, same era.
M. J. Wainwright and M. I. Jordan, “Graphical models, exponential families, and variational inference,” Foundations and Trends® in Machine Learning , vol. 1, no. 1–2, pp. 1–305, 2008
2008
Cited alongside, same era.
D. Koller and N. Friedman, Probabilistic graphical models: principles and techniques . MIT press, 2009
2009
Cited alongside, same era.
O. Meshi, A. Jaimovich, A. Globerson, and N. Friedman, “Convexifying the Bethe free energy,” in Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence . AUAI Press, 2009, pp. 402–410
2009
Cited alongside, same era.
T. Hazan and A. Shashua, “Norm-product belief propagation: Primal-dual message-passing for approximate inference,” IEEE Transactions on Information Theory , vol. 56, no. 12, pp. 6294–6316, 2010
2010
Cited alongside, same era.
P. Atkins, The laws of thermodynamics: A very short introduction . OUP Oxford, 2010
2010
Cited alongside, same era.
D. R. Sheldon and T. G. Dietterich, “Collective graphical models,” in Advances in Neural Information Processing Systems , 2011, pp. 1161–1169
2011
Cited alongside, same era.
2016
Later among the works it cites.
A. Galichon, Optimal Transport Methods in Economics . Princeton University Press, 2016
2016
Later among the works it cites.
Y. Chen, “Modeling and control of collective dynamics: From Schrödinger bridges to optimal mass transport,” Ph.D. dissertation, University of Minnesota, 2016
2016
Later among the works it cites.
L. Nenna, “Numerical methods for multi-marginal optimal transportation,” Ph.D. dissertation, 2016
2016
Later among the works it cites.
Y. Chen, T. T. Georgiou, and M. Pavon, “Optimal transport over a linear dynamical system,” IEEE Transactions on Automatic Control , vol. 62, no. 5, pp. 2137–2152, 2017
2017
Later among the works it cites.
M. Arjovsky, S. Chintala, and L. Bottou, “Wasserstein generative adversarial networks,” in International conference on machine learning , 2017, pp. 214–223
2017
Later among the works it cites.
Y. Chen, G. Conforti, and T. T. Georgiou, “Measure-valued spline curves: An optimal transport viewpoint,” SIAM Journal on Mathematical Analysis , vol. 50, no. 6, pp. 5947–5968, 2018
2018
Later among the works it cites.
Y. Chen and J. Karlsson, “State tracking of linear ensembles via optimal mass transport,” IEEE Control Systems Letters , vol. 2, no. 2, pp. 260–265, 2018
2018
Later among the works it cites.
J.-D. Benamou, G. Carlier, and L. Nenna, “Generalized incompressible flows, multi-marginal transport and Sinkhorn algorithm,” Numerische Mathematik , vol. 142, no. 1, pp. 33–54, 2019
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
I. Haasler, A. Ringh, Y. Chen, and J. Karlsson, “Estimating ensemble flows on a Hidden Markov Chain,” IEEE 58th Conference on Decision and Control , 2019
2019
Later among the works it cites.
F. Elvander, I. Haasler, A. Jakobsson, and J. Karlsson, “Multi-marginal optimal transport using partial information with applications in robust localization and sensor fusion,” Signal Processing , p. 107474, 2020
2020
Closest in time.
2020
Closest in time.