Inferring large graphs using \(\ell_1\)-penalized likelihood
From MaRDI portal
Publication:1704026
DOI10.1007/s11222-017-9769-zzbMath1384.62177arXiv1507.02018OpenAlexW2962886693WikidataQ59603750 ScholiaQ59603750MaRDI QIDQ1704026
Victor Picheny, Magali Champion, Matthieu Vignes
Publication date: 8 March 2018
Published in: Statistics and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.02018
Estimation in multivariate analysis (62H12) Ridge regression; shrinkage estimators (Lasso) (62J07) Linear regression; mixed models (62J05) Applications of mathematical programming (90C90) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improving the structure MCMC sampler for Bayesian networks by introducing a new edge reversal move
- Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs
- Sparse inverse covariance estimation with the graphical lasso
- \(\ell_{0}\)-penalized maximum likelihood for sparse directed acyclic graphs
- Statistics for high-dimensional data. Methods, theory and applications.
- The max-min hill-climbing Bayesian network structure learning algorithm
- Regularization in statistics
- Spectrum estimation for large dimensional covariance matrices using random matrix theory
- Causation, prediction, and search
- Estimating the dimension of a model
- Lipschitzian optimization without the Lipschitz constant
- Handbook of global optimization
- Being Bayesian about network structure. A Bayesian approach to structure discovery in Bayesian networks
- A characterization of Markov equivalence for directed cyclic graphs
- Least angle regression. (With discussion)
- Non-homogeneous dynamic Bayesian networks with Bayesian regularization for inferring gene regulatory networks with gradually time-varying structure
- Minimax risks for sparse regressions: ultra-high dimensional phenomenons
- Spectrum estimation: a unified framework for covariance matrix estimation and PCA in large dimensions
- Simultaneous analysis of Lasso and Dantzig selector
- Causal statistical inference in high dimensions
- High-dimensional graphs and variable selection with the Lasso
- Extended Bayesian information criteria for model selection with large model spaces
- Multi-Domain Sampling With Applications to Structural Inference of Bayesian Networks
- Topological sorting of large networks
- Model selection and estimation in the Gaussian graphical model
- Operational Reasoning for Concurrent Caml Programs and Weak Memory Models
- Improved Estimation of Eigenvalues and Eigenvectors of Covariance Matrices Using Their Sample Estimates
- Learning Causal Bayesian Network Structures From Experimental Data
- A taxonomy of problems with fast parallel algorithms
- Asymptotic convergence of genetic algorithms
- The Structure and Function of Complex Networks
- 10.1162/153244303321897717
- An Information Global Optimization Algorithm with Local Tuning
- Learning Sparse Causal Gaussian Networks With Experimental Intervention: Regularization and Coordinate Descent
- Information-Theoretic Limits on Sparsity Recovery in the High-Dimensional and Noisy Setting
- Metaheuristics for Hard Optimization
- A Convex Pseudolikelihood 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
- Characterization and Greedy Learning of Interventional Markov Equivalence Classes of Directed Acyclic Graphs
- Reconstructing Gene Regulatory Networks with Bayesian Networks by Combining Expression Data with Multiple Sources of Prior Knowledge
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Equivalence and Synthesis of Causal Models
- Random forests
This page was built for publication: Inferring large graphs using \(\ell_1\)-penalized likelihood
