Learning Sparse Causal Gaussian Networks With Experimental Intervention: Regularization and Coordinate Descent
From MaRDI portal
Publication:4916947
Cites work
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 1493045 (Why is no real title available?)
- Bayesian Graphical Models for Discrete Data
- Being Bayesian about network structure. A Bayesian approach to structure discovery in Bayesian networks
- Causation, prediction, and search
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Determinant Maximization with Linear Matrix Inequality Constraints
- High-dimensional graphs and variable selection with the Lasso
- Learning Causal Bayesian Network Structures From Experimental Data
- Least angle regression. (With discussion)
- Model selection and estimation in the Gaussian graphical model
- Multi-domain sampling with applications to structural inference of Bayesian networks
- Network exploration via the adaptive LASSO and SCAD penalties
- Pathwise coordinate optimization
- Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs
- Sparse inverse covariance estimation with the graphical lasso
- Sparsistency and rates of convergence in large covariance matrix estimation
- The Adaptive Lasso and Its Oracle Properties
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(19)- Bayesian network learning via topological order
- Bayesian nonlinear model selection for gene regulatory networks
- Causal network learning with non-invertible functional relationships
- Tests for differential Gaussian Bayesian networks based on quadratic inference functions
- Structural factor equation models for causal network construction via directed acyclic mixed graphs
- Inferring large graphs using \(\ell_1\)-penalized likelihood
- Sparse directed acyclic graphs incorporating the covariates
- Partitioned hybrid learning of Bayesian network structures
- Likelihood ratio tests for a large directed acyclic graph
- Corrected score methods for estimating Bayesian networks with error-prone nodes
- scientific article; zbMATH DE number 7307465 (Why is no real title available?)
- Penalized estimation of directed acyclic graphs from discrete data
- Gaussian Bayesian network comparisons with graph ordering unknown
- Structure learning of sparse directed acyclic graphs incorporating the scale-free property
- Estimation of sparse directed acyclic graphs for multivariate counts data
- Model selection and local geometry
- Reconstruction of a directed acyclic graph with intervention
- Estimation of joint directed acyclic graphs with Lasso family for gene networks
- Solution path clustering with adaptive concave penalty
This page was built for publication: Learning Sparse Causal Gaussian Networks With Experimental Intervention: Regularization and Coordinate Descent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4916947)
