Kean Ming Tan

Graphical Nonconvex Optimization via an Adaptive Convex Relaxation

We consider the problem of learning high-dimensional Gaussian graphical models. The graphical lasso is one of the most popular methods for estimating Gaussian graphical models. However, it does not achieve the oracle rate of convergence. In this paper, we propose the graphical nonconvex optimization…