Inferring large graphs using l1 -penalized likelihood - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Statistics and Computing Année : 2017

Inferring large graphs using l1 -penalized likelihood

Résumé

We address the issue of recovering the structure of large sparse directed acyclic graphs from noisy observations of the system. We propose a novel procedure based on a specific formulation of the 1-norm regularized maximumlikelihood, which decomposes the graph estimation into two optimization sub-problems: topological structure and node order learning. We provide convergence inequalities for the graph estimator, as well as an algorithm to solve the induced optimization problem, in the form of a convex program embedded in a genetic algorithm.We apply our method to various data sets (including data from the DREAM4 challenge) and show that it compares favorably to state-of-the-art methods. This algorithm is available onCRANas theRpackage GADAG.
Fichier principal
Vignette du fichier
Inferring large graphs using l1-penalized likelihood_1.pdf (636.82 Ko) Télécharger le fichier
correction to Champion_2.pdf (190.21 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01602560 , version 1 (26-05-2020)

Licence

Paternité

Identifiants

Citer

Magali Champion, Victor Picheny, Matthieu Vignes. Inferring large graphs using l1 -penalized likelihood. Statistics and Computing, 2017, ⟨10.1007/s11222-017-9769-z⟩. ⟨hal-01602560⟩

Relations

49 Consultations
80 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More