GMRF Estimation under Topological and Spectral Constraints - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

GMRF Estimation under Topological and Spectral Constraints

Résumé

We investigate the problem of Gaussian Markov random field selection under a non-analytic constraint: the estimated models must be compatible with a fast inference algorithm, namely the Gaussian belief propagation algorithm. To address this question, we introduce the *-IPS framework, based on iterative proportional scaling, which incrementally selects candidate links in a greedy manner. Besides its intrinsic sparsity-inducing ability, this algorithm is flexible enough to incorporate various spectral constraints, like e.g. walk summability, and topological constraints, like short loops avoidance. Experimental tests on various datasets, including traffic data from San Francisco Bay Area, indicate that this approach can deliver, with reasonable computational cost, a broad range of efficient inference models, which are not accessible through penalization with traditional sparsity-inducing norms.
Fichier principal
Vignette du fichier
ECML14_IPS_final.pdf (356.36 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01065607 , version 1 (18-09-2014)

Identifiants

Citer

Victorin Martin, Cyril Furtlehner, Yufei Han, Jean-Marc Lasgouttes. GMRF Estimation under Topological and Spectral Constraints. 7th European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, Sep 2014, Nancy, France. pp.370-385, ⟨10.1007/978-3-662-44851-9_24⟩. ⟨hal-01065607⟩
563 Consultations
270 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More