Inferring large graphs using _1-penalized likelihood
From MaRDI portal
Publication:1704026
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.
Recommendations
- Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs
- \(\ell_{0}\)-penalized maximum likelihood for sparse directed acyclic graphs
- Constrained likelihood for reconstructing a directed acyclic Gaussian graph
- Penalized estimation of directed acyclic graphs from discrete data
- Sparse inverse covariance estimation with the graphical lasso
Cites work
- scientific article; zbMATH DE number 6378135 (Why is no real title available?)
- scientific article; zbMATH DE number 6388313 (Why is no real title available?)
- scientific article; zbMATH DE number 3872359 (Why is no real title available?)
- scientific article; zbMATH DE number 4104744 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 702365 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 3409391 (Why is no real title available?)
- 10.1162/153244303321897717
- A characterization of Markov equivalence for directed cyclic graphs
- A convex pseudolikelihood framework for high dimensional partial correlation estimation with convergence guarantees
- A taxonomy of problems with fast parallel algorithms
- An Information Global Optimization Algorithm with Local Tuning
- Asymptotic convergence of genetic algorithms
- Being Bayesian about network structure. A Bayesian approach to structure discovery in Bayesian networks
- Causal statistical inference in high dimensions
- Causality. Models, reasoning, and inference
- Causation, prediction, and search
- Characterization and greedy learning of interventional Markov equivalence classes of directed acyclic graphs
- Equivalence and Synthesis of Causal Models
- Estimating high-dimensional directed acyclic graphs with the PC-algorithm
- Estimating the dimension of a model
- Exact Bayesian structure discovery in Bayesian networks
- Extended Bayesian information criteria for model selection with large model spaces
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Handbook of global optimization
- Heterogeneous economic networks
- High-dimensional graphs and variable selection with the Lasso
- Improved Estimation of Eigenvalues and Eigenvectors of Covariance Matrices Using Their Sample Estimates
- Improving the structure MCMC sampler for Bayesian networks by introducing a new edge reversal move
- Information-Theoretic Limits on Sparsity Recovery in the High-Dimensional and Noisy Setting
- Introduction to algorithms
- Jointly interventional and observational data: estimation of interventional Markov equivalence classes of directed acyclic graphs
- Learning Causal Bayesian Network Structures From Experimental Data
- Learning Sparse Causal Gaussian Networks With Experimental Intervention: Regularization and Coordinate Descent
- Least angle regression. (With discussion)
- Lipschitzian optimization without the Lipschitz constant
- Metaheuristics for Hard Optimization
- Minimax risks for sparse regressions: ultra-high dimensional phenomenons
- Model selection and estimation in the Gaussian graphical model
- Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
- Multi-domain sampling with applications to structural inference of Bayesian networks
- Non-homogeneous dynamic Bayesian networks with Bayesian regularization for inferring gene regulatory networks with gradually time-varying structure
- Operational Reasoning for Concurrent Caml Programs and Weak Memory Models
- Parallel global optimization of functions of several variables
- Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs
- Random forests
- Reconstructing Gene Regulatory Networks with Bayesian Networks by Combining Expression Data with Multiple Sources of Prior Knowledge
- Regularization in statistics
- Simultaneous analysis of Lasso and Dantzig selector
- Sparse inverse covariance estimation with the graphical lasso
- Spectrum estimation for large dimensional covariance matrices using random matrix theory
- Spectrum estimation: a unified framework for covariance matrix estimation and PCA in large dimensions
- Statistics for high-dimensional data. Methods, theory and applications.
- The Structure and Function of Complex Networks
- The max-min hill-climbing Bayesian network structure learning algorithm
- Topological sorting of large networks
- \(\ell_{0}\)-penalized maximum likelihood for sparse directed acyclic graphs
Cited in
(15)- Inferring dynamic genetic networks with low order independencies
- Statistical inference on graphs
- Estimation of sparse directed acyclic graphs for multivariate counts data
- Innovated scalable efficient inference for ultra-large graphical models
- GADAG
- Intrinsic graph structure estimation using graph Laplacian
- On estimation and inference in latent structure random graphs
- Structure estimation of binary graphical models on stratified data: application to the description of injury tables for victims of road accidents
- Penalized estimation of directed acyclic graphs from discrete data
- The huge Package for High-dimensional Undirected Graph Estimation in R
- Likelihood ratio tests for a large directed acyclic graph
- Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs
- \(\ell_{0}\)-penalized maximum likelihood for sparse directed acyclic graphs
- Nonparametric Bayesian label prediction on a large graph using truncated Laplacian regularization
- Structure learning of sparse directed acyclic graphs incorporating the scale-free property
Describes a project that uses
Uses Software
This page was built for publication: Inferring large graphs using \(\ell_1\)-penalized likelihood
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1704026)
