Learning Sparse Causal Gaussian Networks With Experimental Intervention: Regularization and Coordinate Descent
From MaRDI portal
Publication:4916947
DOI10.1080/01621459.2012.754359OpenAlexW2081225729MaRDI QIDQ4916947
Publication date: 26 April 2013
Published in: Journal of the American Statistical Association (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01621459.2012.754359
Related Items (18)
Tests for differential Gaussian Bayesian networks based on quadratic inference functions ⋮ Causal network learning with non-invertible functional relationships ⋮ Gaussian Bayesian network comparisons with graph ordering unknown ⋮ Partitioned hybrid learning of Bayesian network structures ⋮ Estimation of joint directed acyclic graphs with lasso family for gene networks ⋮ Structure learning of sparse directed acyclic graphs incorporating the scale-free property ⋮ Structural factor equation models for causal network construction via directed acyclic mixed graphs ⋮ Inferring large graphs using \(\ell_1\)-penalized likelihood ⋮ Likelihood Ratio Tests for a Large Directed Acyclic Graph ⋮ Sparse directed acyclic graphs incorporating the covariates ⋮ Reconstruction of a directed acyclic graph with intervention ⋮ Solution path clustering with adaptive concave penalty ⋮ Model selection and local geometry ⋮ Bayesian nonlinear model selection for gene regulatory networks ⋮ Penalized Estimation of Directed Acyclic Graphs From Discrete Data ⋮ Estimation of sparse directed acyclic graphs for multivariate counts data ⋮ Unnamed Item ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs
- Sparse inverse covariance estimation with the graphical lasso
- The Adaptive Lasso and Its Oracle Properties
- Sparsistency and rates of convergence in large covariance matrix estimation
- Causation, prediction, and search
- Being Bayesian about network structure. A Bayesian approach to structure discovery in Bayesian networks
- Least angle regression. (With discussion)
- Network exploration via the adaptive LASSO and SCAD penalties
- Pathwise coordinate optimization
- High-dimensional graphs and variable selection with the Lasso
- Multi-Domain Sampling With Applications to Structural Inference of Bayesian Networks
- Model selection and estimation in the Gaussian graphical model
- Learning Causal Bayesian Network Structures From Experimental Data
- Determinant Maximization with Linear Matrix Inequality Constraints
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Bayesian Graphical Models for Discrete Data
- Convergence of a block coordinate descent method for nondifferentiable minimization
This page was built for publication: Learning Sparse Causal Gaussian Networks With Experimental Intervention: Regularization and Coordinate Descent