Inferring large graphs using l1-penalized likelihood
arXiv:1507.02018 · doi:10.1198/jasa.2011.ap10346
Abstract
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 l1-norm regularized maximum likelihood, which decomposes the graph estimation into two optimization sub-problems: topological structure and node order learning. We provide oracle 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.
References in corpus (30)
- The structure and function of complex networks
- Rejoinder to "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Discussion of "Least angle regression" by Efron et al
- Least Angle Regression
- Global Optimization by Basin-Hopping and the Lowest Energy Structures of Lennard-Jones Clusters Containing up to 110 Atoms
- An efficient, multiple range random walk algorithm to calculate the density of states
- Simultaneous analysis of Lasso and Dantzig selector
- A simple approach for finding the globally optimal Bayesian network structure
- On the ergodicity properties of some adaptive MCMC algorithms
- Characterization and Greedy Learning of Interventional Markov Equivalence Classes of Directed Acyclic Graphs
- SIRENE: Supervised Inference of Regulatory Networks
- Causal Discovery from a Mixture of Experimental and Observational Data
- Causal Discovery with Continuous Additive Noise Models
- Directed Cyclic Graphical Representations of Feedback Models
- Projected Subgradient Methods for Learning Sparse Gaussians
- Taking Advantage of Sparsity in Multi-Task Learning
- A convex pseudo-likelihood framework for high dimensional partial correlation estimation with convergence guarantees
- Jointly interventional and observational data: estimation of interventional Markov equivalence classes of directed acyclic graphs
- Identifiability of Causal Graphs using Functional Models
- Inferring Regulatory Networks by Combining Perturbation Screens and Steady State Gene Expression Profiles
- Inferring large graphs using l1-penalized likelihood
- Learning Directed Acyclic Graphs with Penalized Neighbourhood Regression
- Random Walk over Basins of Attraction to Construct Ising Energy Landscapes
Cited by in corpus (8)
- Concave Penalized Estimation of Sparse Gaussian Bayesian Networks
- Learning Large-Scale Bayesian Networks with the sparsebn Package
- Inferring large graphs using l1-penalized likelihood
- Optimizing regularized Cholesky score for order-based learning of Bayesian networks
- Mode jumping MCMC for Bayesian variable selection in GLMM
- Penalized Estimation of Directed Acyclic Graphs From Discrete Data
- Mapping Energy Landscapes of Non-Convex Learning Problems
- Estimation of Gaussian directed acyclic graphs using partial ordering information with an application to dairy cattle data