Multivariate Gaussian network structure learning

@article{Du2019MultivariateGN,
  title={Multivariate Gaussian network structure learning},
  author={Xingqi Du and Subhashis Ghosal},
  journal={Journal of Statistical Planning and Inference},
  year={2019}
}
  • Xingqi Du, S. Ghosal
  • Published 16 September 2017
  • Computer Science
  • Journal of Statistical Planning and Inference

Figures and Tables from this paper

Sparse-Group Lasso for Graph Learning From Multi-Attribute Data

TLDR
The main objective of this paper is to explore the use of sparse-group lasso for multi-attribute graph estimation and an alternating direction method of multipliers (ADMM) algorithm is presented to optimize the objective function to estimate the inverse covariance matrix.

Deviance Tests for Graph Estimation From Multi-Attribute Gaussian Data

  • Jitendra Tugnait
  • Computer Science, Mathematics
    IEEE Transactions on Signal Processing
  • 2020
TLDR
This paper proposes and analyzes a deviance test based on generalized likelihood ratio, for edge exclusion in multi-attribute Gaussian graphical models, and presents numerical results based on synthetic as well as real data.

Bayesian Discriminant Analysis Using Many Predictors

TLDR
This work considers the problem of Bayesian discriminant analysis using a high dimensional predictor and obtains the contraction rate of the posterior distribution for the mean and the precision matrix respectively using the Euclidean and the Frobenius distance.

Bayesian Discriminant Analysis Using a High Dimensional Predictor

TLDR
This work considers the problem of Bayesian discriminant analysis using a high dimensional predictor and obtains the contraction rate of the posterior distribution for the mean and the precision matrix respectively using the Euclidean and the Frobenius distance.

A Vehicle-Environment Cooperative Control Based Velocity Profile Prediction Method and Case Study in Energy Management of Plug-in Hybrid Electric Vehicles

TLDR
A novel method is proposed to predict the velocity profile; meanwhile, the potential of the proposed method is exploited to improve energy management performance of plug-in hybrid electric vehicles (PHEVs).

References

SHOWING 1-10 OF 11 REFERENCES

Graph estimation from multi-attribute data

TLDR
A new principled framework for estimating the structure of undirected graphical models from such multivariate (or multi-attribute) nodal data is proposed and a method that efficiently maximizes this objective is developed.

High-dimensional graphs and variable selection with the Lasso

TLDR
It is shown that neighborhood selection with the Lasso is a computationally attractive alternative to standard covariance selection for sparse high-dimensional graphs and is hence equivalent to variable selection for Gaussian linear models.

Sparse inverse covariance estimation with the graphical lasso.

TLDR
Using a coordinate descent procedure for the lasso, a simple algorithm is developed that solves a 1000-node problem in at most a minute and is 30-4000 times faster than competing methods.

Partial Correlation Estimation by Joint Sparse Regression Models

TLDR
It is shown that space performs well in both nonzero partial correlation selection and the identification of hub variables, and also outperforms two existing methods.

Model selection and estimation in the Gaussian graphical model

TLDR
The implementation of the penalized likelihood methods for estimating the concentration matrix in the Gaussian graphical model is nontrivial, but it is shown that the computation can be done effectively by taking advantage of the efficient maxdet algorithm developed in convex optimization.

Model Selection Through Sparse Maximum Likelihood Estimation

TLDR
Two new algorithms for solving problems with at least a thousand nodes in the Gaussian case are presented, based on Nesterov's first order method, which yields a complexity estimate with a better dependence on problem size than existing interior point methods.

A convex pseudolikelihood framework for high dimensional partial correlation estimation with convergence guarantees

TLDR
This work proposes a new pseudolikelihood‐based graphical model selection method that aims to overcome some of the shortcomings of current methods, but at the same time retain all their respective strengths, and introduces a novel framework that leads to a convex formulation of the partial covariance regression graph problem, resulting in an objective function comprised of quadratic forms.

Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization

We study the convergence properties of a (block) coordinate descent method applied to minimize a nondifferentiable (nonconvex) function f(x1, . . . , xN) with certain separability and regularity

Weak Convergence and Empirical Processes: With Applications to Statistics

TLDR
This chapter discusses Convergence: Weak, Almost Uniform, and in Probability, which focuses on the part of Convergence of the Donsker Property which is concerned with Uniformity and Metrization.

Weak convergence and empirical processes

1 Review of metric topology 3 1.1 Metric spaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2 Open and closed sets . . . . . . . . . . . . . . . . . . . . . . . . . . . .