Graph Learning as a Tensor Factorization Problem - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2017

Graph Learning as a Tensor Factorization Problem


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.
Fichier principal
Vignette du fichier
main.pdf (271.15 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01519851 , version 1 (09-05-2017)


  • HAL Id : hal-01519851 , version 1


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


Gmail Facebook X LinkedIn More