A fast iterative algorithm for high-dimensional differential network
From MaRDI portal
Publication:2184396
Abstract: Differential network is an important tool to capture the changes of conditional correlations under two sample cases. In this paper, we introduce a fast iterative algorithm to recover the differential network for high-dimensional data. The computation complexity of our algorithm is linear in the sample size and the number of parameters, which is optimal in the sense that it is of the same order as computing two sample covariance matrices. The proposed method is appealing for high-dimensional data with a small sample size. The experiments on simulated and real data sets show that the proposed algorithm outperforms other existing methods.
Recommendations
- Efficient computation for differential network analysis with applications to quadratic discriminant analysis
- Differential network inference via the fused D-trace loss with cross variables
- Direct estimation of differential networks under high-dimensional nonparanormal graphical models
- Direct estimation of differential networks
- The reduced PC-algorithm: improved causal structure learning in large random networks
Cites work
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 1964693 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A constrained \(\ell _{1}\) minimization approach to sparse precision matrix estimation
- A direct approach for sparse quadratic discriminant analysis
- Adaptive thresholding for sparse covariance matrix estimation
- An overview of the estimation of large covariance and precision matrices
- Differential network analysis via lasso penalized D-trace loss
- Direct estimation of differential networks
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Generalized thresholding of large covariance matrices
- High-dimensional graphs and variable selection with the Lasso
- Inferring multiple graphical structures
- Joint estimation of multiple graphical models
- Multiple Matrix Gaussian Graphs Estimation
- One-step sparse estimates in nonconcave penalized likelihood models
- Regularized estimation of large covariance matrices
- Regularized rank-based estimation of high-dimensional nonparanormal graphical models
- Sparse Quadratic Discriminant Analysis For High Dimensional Data
- Sparse inverse covariance estimation with the graphical lasso
- Sparse precision matrix estimation via lasso penalized D-trace loss
- The nonparanormal: semiparametric estimation of high dimensional undirected graphs
Cited in
(3)
This page was built for publication: A fast iterative algorithm for high-dimensional differential network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2184396)
