Graph Learning as a Tensor Factorization Problem

Abstract : Graphical models (CRFs, Markov Random Fields, Bayesian networks ...) are probabilistic models fairly widely used in machine learning and other areas (e.g. Ising model in statistical physics). For such models, computing a joint probability for a set of random variables relies on a Markov assumption on the dependencies between the variables. Even so, the calculation may be intractable in the general case, forcing one to consider approximation methods (MCMC, loopy belief propagation , etc.). Hence the maximum likelihood estimator is, except in very particular cases, impossible to compute. We propose a very general probabilistic model, for which parameter estimation can be obtained by tensor factorization techniques (similarly to spectral methods or methods of moments), bypassing the calculation of a joint probability thanks to algebraic results.
Document type :
Preprints, Working Papers, ...
Liste complète des métadonnées

Cited literature [8 references]  Display  Hide  Download
Contributor : Raphael Bailly <>
Submitted on : Tuesday, May 9, 2017 - 1:59:58 PM
Last modification on : Monday, March 4, 2019 - 2:04:23 PM
Document(s) archivé(s) le : Thursday, August 10, 2017 - 1:13:10 PM


Files produced by the author(s)


  • HAL Id : hal-01519851, version 1



Raphaël Bailly, Guillaume Rabusseau. Graph Learning as a Tensor Factorization Problem. 2017. ⟨hal-01519851⟩



Record views


Files downloads