Putting MRFs on a tensor train

31st International Conference on Machine Learning, ICML 2014

Volumn 3, Issue , 2014, Pages 2388-2399

  Novikov, Alexander ^a   Rodomanov, Anton ^a   Osokin, Anton ^a   Vetrov, Dmitry ^a,b  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

^b NATIONAL RESEARCH UNIVERSITY HIGHER SCHOOL OF ECONOMICS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; LEARNING SYSTEMS; OBJECT ORIENTED PROGRAMMING; STRUCTURAL FRAMES; TENSORS;

LINEAR ALGEBRA OPERATIONS; MAP INFERENCES; MARKOV RANDOM FIELDS; PARTITION FUNCTIONS; PROBABILISTIC GRAPHICAL MODELS; TENSOR TRAINS; THEORETICAL GUARANTEES;

MARKOV PROCESSES;

EID: 84919948678     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. Caroll, J. D. and Chang, J. J. Analysis of individual differences in multidimensional scaling via n-way generalization of Eckart-Young decomposition. Psychometrika, 35:283-319, 1970.
2. Dolgov, S. V. and Savostyanov, D. V. Alternating minimal energy methods for linear systems in higher dimensions. Part II: Faster algorithm and application to non symmetric systems. arXiv preprint 1304.1222, 2013.
3. Ermon, S., Gomes, C., Sabharwal, A., and Selman, B. Taming the curse of dimensionality: Discrete integration by hashing and optimization. In International Conference on Machine Learning (ICML), 2013.
4. Grasedyck, L. Hierarchical singular value decomposition of tensors. SIAM J. Matrix Anal. Appl., 31:2029-2054, 2010.
5. Grosse, R., Maddison, C., and Salakhutdinov, R. Annealing between distributions by averaging moments. In Advances in Neural Information Processing Systems 26 (NIPS), pp. 2769-2777. 2013.
6. Hackbusch, W. and KUhn, S. A new scheme for the tensor representation. J. Fourier Anal. Appl., 15:706-722, 2009.
7. Hazan, T., Maji, S., and Jaakkola, T. On sampling from the Gibbs distribution with random maximum a posteriori perturbations. In Advances in Neural Information Processing Systems 26 (NIPS), pp. 1268-1276. 2013.
8. Ishteva, M., Park, H.,, and Song, L. Unfolding latent tree structures using 4th order tensors. In International Conference on Machine Learning (ICML), 2013.
9. Jernite, Y., Halpern, Y., and Sontag, D. Discovering hidden variables in noisy-or networks using quartet tests. In Advances in Neural Information Processing Systems 26 (NIPS), pp. 2355-2363. 2013.
10. Kappes, J., Andres, B., Hamprecht, E, Schnorr, C., Nowozin, S., Batra, D., Kim, S., Kausler, B., Lellmann, J., Komodakis, N., and Rother, C. A comparative study of modern inference techniques for discrete energy minimization problems. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1328-1335, 2013.
11. Khoromskij, B. N. and Oseledets, I. V. DMRG+QTT approach to computation of the ground state for the molecular Schrddinger operator. Preprint 69, MPI MIS, Leipzig, 2010.
12. Kolmogorov, V. Convergent tree-reweighted message passing for energy minimization. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), 28(10): 1568-1583, 2006.
13. Kschischang, F. R., Frey, B. J., and Loeliger, H.-A. Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory, 47(2):498-519, 2001.
14. Minka, T. and Qi, Y. Tree-structured approximations by expectation propagation. In Advances in Neural Information Processing Systems 16 (NIPS), pp. 193-200. 2004.
15. Mooij, J. M. libDAI: A free and open source C++ library for discrete approximate inference in graphical models. Journal of Machine Learning Research, 11:2169-2173, August 2010.
16. Neal, R. Annealed importance sampling. Statistics and Computing, 11:125-139, 2001.
17. Nowozin, S. and Lampert, C. Structured learning and prediction in computer vision. Foundations and Trends in Computer Graphics and Vision, 6(3-4):185-365, 2010.
18. Oseledets, I. V. Tensor-Train decomposition. SIAM J. Scientific Computing, 33(5):2295-2317, 2011.
19. Oseledets, I. V. and Tyrtyshnikov, E. E. TT-cross approximation for multidimensional arrays. Linear Algebra Appl., 432(1):70-88, 2010.
20. Song, L., Ishteva, M., Parikh, A., Xing, E., and Park, H. Hierarchical tensor decomposition of latent tree graphical models. In International Conference on Machine Learning (ICML), 2013.
21. Taskar, B., Guestrin, C., and Koller, D. Max-Margin Markov networks. In Advances in Neural Information Processing Systems 16 (NIPS), pp. 25-32. 2004.
22. Tsochantaridis, I., Joachims, T., Hofmann, T., and Altun, Y. Large margin methods for structured and interdependent output variables. Journal of Machine Learning Research (JMLR), 6:1453-1484, 2005.
23. Tucker, L. R. Some mathematical notes on three-mode factor analysis. Psychometrika, 31 (3):279-311, 1966.
24. Wainwright, M. J. and Jordan, M. I. Graphical models, exponential families, and variational inference. Foundations and Trends in Machine Learning, 1(1-2): 1-305, 2008.
25. Wainwright, M. J., Jaakkola, T., and Willsky, A. S. A new class of upper bounds on the log partition function. IEEE Transactions on Information Theory, 51(7):2313-2335, 2005.