1 Introduction
Precision matrix plays a fundamental role in many statistical inference problems. For example, in discriminant analysis, the precision matrix needs to be estimated to compute the classification rules[1]. In graphical models, the structure exploration of gaussian graphical model is equivalent to recover the support of the precision matrix[2]. Moreover, the precision matrix is useful for a wide range of applications including portfolio optimization, genomics and single processing, among many others. Therefore, it is of great importance to estimate the precision matrix.
Given a data matrix , a sample of realizations from a
dimensional Gaussian distribution with zero mean and covariance matrix
. A natural way to estimate precision matrix is via maximum likelihood approach. Under the Gaussian setting, the negative loglikelihood takes the form(1.1) 
where is the sample covariance matrix and denotes the trace of the matrix. Then minimizing (1.1) with respect to yields the maximum likelihood estimate of the precision matrix. Due to the maximum likelihood estimate performs poorly and beyond compute in highdimensional setting, the penalized loglikelihood functions and other constrained optimization techniques are used to gain better estimates of the matrix. These alternative methods can be coarsely sorted into two types. One is to seek the sparsity in the precision matrix to explore the structure of the Gaussian graphical model. The graphical lasso [3, 4, 5] is a popular technique among sparse approaches, which penalizes (1.1) with the norm to induce sparsity and minimizes the penalized loglikelihood
(1.2) 
over all positive definite matrices . Here denotes the sum of the absolute values of the entries, and is a nonnegative tuning parameter. Other sparse approaches can be seen in Cai et al. [6], Yuan and Wang [7] and Liu and Luo [8], among others. Another approach is to construct shrinkage estimates of the matrix, which might be useful when the true matrix is nonsparse. Many results on this topic were developed to estimate the covariance matrix, which includes Ledoit and Wolf [9], Warton [10] and Deng and Tsui [11]. Recently, van Wieringen and Peeters [12] and Kuismin et al. [13] proposed a ridgetype estimation for the precision matrix, which penalizes (1.1) with the squared Frobenius norm and minimizes the penalized loglikelihood
(1.3) 
over all positive definite matrices . Here is a nonnegative tuning parameter, and denotes the square root of the sum of the squares of the entries. The advantage of (1.3) is that there is an analytical expression for the precision matrix estimation.
All of the aforementioned approaches do not make any distinction between sensitive data and non sensitive data. However in realworld data, a large number of datasets contain personal sensitive information. For example, datasets related to portfolio optimization may contain personal financial information, and datasets related to gene expression may contain personal health information. The availability of large datasets containing sensitive information from individuals has motivated the study of learning algorithms that guarantee the privacy of individuals who contribute to the database. A strict and widely used privacy guarantee is via the concept of differential privacy [14]. It requires that datasets differing in only one entry induce similar distribution on the output of a algorithm, which will provides strong provable protection to individuals and prevents them from being recognized by an arbitrarily powerful adversary. Thus, it is significant to study the estimation of the precision matrix under the differential privacy framework.
Recently, Wang et al.[15] studied the differentially private sparse precision matrix estimation problem from the model perspective. In this paper, we study the differentially private precision matrix estimation problem from the algorithm perspective. Specifically, we design differentially private algorithms for the ridgetype estimation model (1.3) and the graphical lasso problem (1.2). We first develop a differentially private algorithm for the ridgetype estimation of the precision matrix. Note that when the tuning parameter is fixed, the solution of model (1.3
) is determined by the eigenvalues and eigenvectors of
. Thus we provide the differential privacy by perturbing . We then develop a differentially private algorithm for the graphical lasso. Inspired by the postprocessing nature of the differential privacy, if an algorithm can been decomposed into stable and unstable parts, and only at the stable parts the algorithm access the raw data. Then, satisfying the differential privacy in stable parts will make the whole algorithm satisfy the differential privacy. Note that the ADMM algorithm for the graphical lasso [16] consists of three steps, but only step 2 accesses the raw dataset. Moreover, this step corresponds to a ridgetype penalty loglikelihood estimation problem similar to model (1.3). Thus, we might perform a differentially private algorithm in this step and then treat other steps as a postprocessing step, which will not increase the privacy risk. The theoretical guarantees on the performance of our privacy preserving precision matrix estimation algorithms are also established. Numerical studies show the utility of our privacy preserving algorithms.The remainder of this paper is organized as follows. We introduce the differential privacy and the ADMM algorithm in Section 2. In Section 3, we develop differentially private algorithms in the context of precision matrix estimation. The theoretical guarantees on the performance of our differentially private algorithms was provided in Section 4. We then test our algorithms under simulation and real data in Section 5, and conclude in Section 6.
2 Preliminaries
In this section, we introduce the background of the differential privacy, some related privacy notions, and the ADMM algorithm for the graphical lasso.
2.1 Differentially privacy
Differential privacy (DP) is a rigorous and common definition of the privacy protection of data analysis algorithm [14, 17]. Let the space of data be and datasets . We use the Hamming distance, denoted by , to measure the distance between datasets and , that is, the number of data points on which they differ. If , we call they are neighboring, meaning that we can get by changing one of the data points in .
[[17]] A randomized algorithm is differentially private if for all neighboring datasets and and for all measurable set the following holds
(2.1) 
If , we say that is differentially private.
We observe that if algorithm that provides differential privacy also provides differential privacy. As a result, the differential privacy is much stronger. Here are privacy budget parameters, the smaller they are, the stronger the privacy guarantee. From this definition, it is clear that if we arbitrarily change any individual data point in a dataset, the output of the algorithm does not shift too much.
Dwork et al. [14] also provide a framework for developing privacy preserving algorithms by adding noise with a designed distribution to the output of the algorithm, which is called sensitivity method. The sensitivity of a function is defined as follows. [[17]] The sensitivity of a function is
(2.2) 
The Gaussian mechanism is a typical sensitivity method that preserves differential privacy.
[[17]] Given any function , the Gaussian mechanism is defined as
(2.3) 
where are random variables drawn from Gaussian distribution , where .
The sensitivity of an algorithm measures the maximum difference in the output of the algorithm under neighboring datasets, which is similar to the stability of the algorithm. An algorithm is stable means that the output of the algorithm will vary little when given two very similar date sets, and it also means that the sensitivity of the algorithm is low. When the privacy parameters are fixed, the low sensitivity makes the differentially private algorithm add small noise at high probability, which means high utility. Thus, a stable nonprivate algorithm is suitable for development into a differentially private algorithm.
Moreover, differential privacy is closed under postprocessing.
[[17]] Let is an differentially private algorithm. Let is an arbitrary dataindependent mapping. Then is differentially private. That is, a data analyst, without additional knowledge about the private dataset, cannot compute a function of the output of a differentially private algorithm and make it less differentially private.
2.2 Alternating direction method of multipliers algorithm for the graphical lasso
The ADMM is an algorithm that is well suited to distributed convex optimization[18, 16]. The algorithm solves optimization problems by decomposing them into smaller parts, and each part is easier to handle. We might implement differential privacy by handling some of these parts. Now we take the ADMM algorithm to solve the graphical lasso.
The graphical lasso problem (1.2) can be rewritten as
(2.4) 
where and are positive definite matrices.
Then we form the augmented Lagrangian function
(2.5) 
where is the dual variable or Lagrange multiplier, and is a preselected penalty coefficient. Then the ADMM algorithm alternately updates variables by minimizing the augmented Lagrangian function.
Let be the scaled dual variable. Using the scaled dual variable, the ADMM algorithm for the graphical lasso is
(2.6)  
(2.7)  
(2.8) 
3 Methods
In this section, we first propose a differentially private ridge estimation for the precision matrix. Then notice that the ADMM algorithm for the graphical lasso contains a ridgetype estimate step. A differentially private algorithm for the graphical lasso problem is proposed.
3.1 Differentially private ridge estimation for the precision matrix
For the ridge estimation of the precision matrix, Kuismin et al.[13] showed that the maximizing solution of (1.3) has the following closed form
(3.1) 
where is a diagonal matrix whose diagonal elements are sorted in ascending order beginning from the upper left corner , that is, , . Here ’s are the eigenvalue of the sample covariance matrix . is an orthogonal matrix whose columns correspond to the eigenvectors of , which are ordered in the same order in which the sample covariance matrix eigenvalues appear in the matrix . Similarly, van Wieringen and Peeters [12] given a different form of analytical solution to model (1.3). Both results showed that the ridge estimation of the precision matrix has high stability, in other words, has low sensitivity. It is clear that the estimator (3.1) is determined by the eigenvalues and eigenvectors of when is fixed. Thus, the estimator will preserve differential privacy as long as the orthogonal eigenvalue decomposition of preserves differential privacy.
Without loss of generality, the columns of the data matrix are assumed to be normalized to have norm at most one, that is, , . We are interested in the sensitivity of function ,
(3.2) 
where the function may be viewed as an
dimensional real vector. We use the Analyze Gauss algorithm
[19] to perturb , which provides differential privacy. Then we perform equation (3.1) on the perturbed , which will yield a ridge estimate of the precision matrix that is differentially private. See Algorithm 1 for details.3.2 Differentially private algorithm for the graphical lasso
One algorithm for solving the graphical lasso problem is the ADMM algorithm in Section 2. The ADMM algorithm for the graphical lasso consists of a minimization step, a minimization step and a scaled dual variable update. Obviously, the minimization step accesses the original dataset directly, while the other steps only use the previous update results. Moreover, the minimization step is a ridgetype penalty loglikelihood estimation similar to model (1.3).
Differential privacy is closed under postprocessing, then solving the minimization step in the th iteration by Algorithm 1 will make the th iteration provides differential privacy. Note that when Algorithm 1 is used here, the analytical solution used in step 4 may be different from (3.1) (see [12, 13, 16]). If the algorithm converges after iterations, then the algorithm provides differential privacy follows from simple composition.
However, if the same privacy parameter of Algorithm 1 is used in each iteration, it is actually equivalent to perturbing with the same noise level in each iteration. Therefore, we can perturb directly before running the ADMM algorithm, which will avoid the accumulation of privacy loss, that is, reduces privacy cost. We have the following differentially private ADMM algorithm for the graphical lasso.
Proof By the definition of the Gaussian mechanism, we know that step 3 keeps the matrix differentially private. Thus, due to the postprocessing property of differential privacy, Algorithm 1 is differentially private, and Algorithm 2 is also.
It should be noted that the noise addition mechanism in Algorithm 2 is the same as [15], but we derived it from the perspective of the algorithm. The differential privacy of Algorithm 2 is achieved by the differential privacy of minimization step, so the different privacy mechanism of this step will determine the different noise addition mechanism in Algorithm 2. Moreover, this method of developing the differential privacy algorithm can be extended to the development of the differential privacy algorithm for the regularized empirical risk minimization problem.
4 Theoretical analysis
In this section, we provide theoretical guarantees on the performance of privacypreserving precision matrix estimation algorithms in Section 3.
4.1 Differentially private ridge estimation for the precision matrix
We first provide performance theorem on Algorithm 1. We will show that the differentially private ridge estimator for the precision matrix estimation is consistent under fixeddimension asymptotic. Let be the output of Algorithm 1. Let be the true precision matrix. Then, if tuning parameter converges almost surely to zero as , with high probability, we have
(4.1) 
In this proof, we will need the following lemmas. The first had been proved in [20].
[[20]] Let , be positive definite matrices. For any , we have
(4.2) 
where , . Here and represent the maximum eigenvalue and the minimum eigenvalue, respectively.
The second comes from van Wieringen and Peeters [12], which shows the consistency of the ridge estimator (3.1) under fixeddimension asymptotic.
[[12]] Let be the optimal solution of problem (1.3) and be the true precision matrix. Then, if tuning parameter converges almost surely to zero as , we have
(4.3) 
We now prove the Theorem 4.1.
Proof By the triangular inequality,
(4.4) 
here is the optimal solution of problem (1.3), which is (3.1).
First, we bound the first term on the righthand side of (4.4). Let and denote the proximity operator of . Then for any ,
(4.5)  
The inequality uses the nonexpansive property of the proximity operator [21]. By Lemma 4.1 and take , we have
(4.6) 
Note that the entries in are drawn from . Then, with high probability, we have
(4.7) 
Take expectations on both sides of (4.7),
(4.8) 
Note that and are always achieved, and thus is finite.
4.2 Differentially private algorithm for the graphical lasso
We now establish performance guarantees for Algorithm 2, by providing a rate of decay of its error in Frobenius norm. Generally, let be the optimal solution of problem (1.2) based on . Let set , with the cardinality , denotes nonzero offdiagonal entries in the precision matrix and be its complement. We provide the result as the following theorem.
Let be the optimal solution of problem (1.2) based on with tuning parameter . Let be the true precision matrix. Then, if the smallest and largest eigenvalues of the covariance matrix satisfy , with high probability, we have
(4.9) 
In this proof, we will need a lemma of Bickel and Levina [22].
We now prove the Theorem 4.2.
Proof Let
(4.11)  
The estimate minimizes ), or equivalently minimizes .
Consider the set
(4.12) 
Note that is a convex function, and . Then, if we can show that
(4.13) 
the minimizer must be inside the sphere defined by , and hence
(4.14) 
By the Taylor expansion of , we rewrite (4.11) as,
(4.15)  
where is the Kronecker product and is vectorized to match the dimensions of the Kronecker product.
Rothman et al. [23] had show that term with high probability.
To bound term II, we write
(4.16) 
Note that the union sum inequality and Lemma 4.2 imply that, with high probability,
(4.17) 
and hence term II is bounded by
(4.18) 
here are positive constants.
Note that and . Then by triangular inequality, the third part
(4.19) 
Therefore, we have
(4.20) 
Now, take
(4.21) 
where belongs to . Then
(4.22)  
Since that the second term on the righthand side of (4.22) is always negative and , we then have
(4.23)  
here .
Consequently, for sufficiently large. This establishes the theorem.
5 Experiments
5.1 Simulation
In this subsection, we conduct a simulation study to evaluate the performance of our proposed differentially private algorithms. We consider four models as follows:

. , where is a matrix with and each is drawn from . This precision matrix is unstructured and nonsparse.

. Full model with if and otherwise. This precision matrix is structured and nonsparse.

. An AR(2) model with and . This precision matrix is structured and sparse.

. The last model comes from Cai et al. [6]. Let , where each offdiagonal entry in is generated independently and equals 0.5 with probability 0.1 or 0 with probability 0.9. is chosen such that the condition number (the ratio of the largest and the smallest eigenvalues of a matrix) of the matrix is equal to . Finally, the matrix is standardized to have unit diagonal. This precision matrix is unstructured and sparse.
Firstly, we measure the difference between and , where denotes the output of our differentially private Algorithm 1 and Algorithm 2, the corresponding denotes the solution of the problem (1.3) solved by equation (3.1) and the solution of the problem (1.2) solved by the ADMM algorithm. For each model, we generate an independent sample of size from a multivariate Gaussian distribution with mean zero and covariance matrix , and preprocess the data matrix by normalizing the data matrix with the maximum norm to enforce the condition . A fivefold crossvalidation described by Bien and Tibshirani [24] is used to choose the parameter such that the optimal value of minimizes the negative loglikelihood (1.1), and we compute the differentially private estimations on the same tuning parameter as the nonprivate algorithm. We fixed and consider different values of
Model1  Model2  Model3  

2033.43  992.43  1952.80  2023.17  982.35  1937.40  2799.51  1397.73  2732.86  
(214.65)  (119.61)  (217.19)  (203.78)  (105.55)  (193.82)  (187.39)  (77.52)  (157.59)  
676.69  329.80  90.76  673.34  326.44  89.84  932.06  464.65  128.87  
(71.54)  (39.83)  (11.44)  (67.87)  (35.14)  (10.15)  (62.48)  (25.81)  (7.55)  
405.34  197.28  54.35  403.36  195.27  53.80  558.56  278.04  77.20  
(42.92)  (23.87)  (6.86)  (40.69)  (21.06)  (6.08)  (37.50)  (15.47)  (4.53)  
252.70  122.74  33.88  251.50  121.48  33.53  348.46  173.07  48.14  
(26.82)  (14.89)  (4.28)  (25.40)  (13.14)  (3.80)  (23.45)  (9.65)  (2.83)  
118.22  57.08  15.84  117.71  56.49  15.68  163.35  80.61  22.53  
(12.64)  (6.98)  (2.01)  (11.94)  (6.16)  (1.79)  (11.10)  (4.53)  (1.33)  
70.25  33.67  9.40  69.98  33.33  9.31  97.30  47.65  13.40  
(7.58)  (4.16)  (1.20)  (7.13)  (3.67)  (1.07)  (6.70)  (2.70)  (0.80)  
1640.76  773.12  1397.26  1639.64  782.21  1326.40  2634.83  1315.41  2277.36  
(102.37)  (39.26)  (76.36)  (95.85)  (38.54)  (69.81)  (171.50)  (82.98)  (156.16)  
545.36  256.42  70.62  544.96  259.44  71.45  876.13  436.65  121.23  
(34.07)  (13.07)  (4.00)  (31.92)  (12.84)  (3.85)  (57.08)  (27.64)  (8.52)  
326.27  153.08  42.24  326.02  154.89  42.74  524.37  260.90  72.56  
(20.41)  (7.84)  (2.40)  (19.14)  (7.69)  (2.31)  (34.21)  (16.57)  (5.11)  
203.03  94.97  26.28  202.85  96.09  26.59  326.49  162.05  45.18  
(12.73)  (4.89)  (1.50)  (11.96)  (4.80)  (1.44)  (21.36)  (10.35)  (3.19)  
94.44  43.78  12.22  94.34  44.31  12.37  152.20  74.99  21.06  
(5.96)  (2.29)  (0.70)  (5.63)  (2.25)  (0.68)  (10.12)  (4.86)  (1.50)  
55.70  25.55  7.20  55.63  25.86  7.29  90.01  43.97  12.46  
(3.56)  (1.37)  (0.42)  (3.37)  (1.34)  (0.41)  (6.08)  (2.90)  (0.90)  
1328.60  578.15  1040.17  1347.95  592.49  859.38  2589.53  1208.54  1934.99  
(73.95)  (31.23)  (59.22)  (75.70)  (31.00)  (45.65)  (105.15)  (39.34)  (62.87)  
440.65  191.07  52.75  447.01  195.82  54.04  859.69  400.10  111.19  
(24.63)  (10.39)  (3.14)  (25.17)  (10.31)  (3.03)  (35.10)  (13.00)  (4.11)  
263.04  113.67  31.49  266.81  116.50  32.26  513.76  238.43  66.43  
(14.76)  (6.22)  (1.88)  (15.07)  (6.18)  (1.82)  (21.15)  (7.73)  (2.46)  
163.13  70.14  19.53  165.43  71.89  20.00  319.19  147.51  41.25  
(9.21)  (3.88)  (1.17)  (9.39)  (3.85)  (1.13)  (13.34)  (4.77)  (1.53)  
75.09  31.83  9.00  76.12  32.63  9.21  147.72  67.46  19.08  
(4.32)  (1.81)  (0.55)  (4.37)  (1.80)  (0.53)  (6.45)  (2.17)  (0.72)  
43.70  18.21  5.24  44.27  18.67  5.37  86.54  38.97  11.18  
(2.60)  (1.07)  (0.33)  (2.57)  (1.06)  (0.32)  (3.94)  (1.24)  (0.42) 
in Model 13. Average (standard error) matrix losses over 50 replications.
Model2  Model3  Model4  

82.90  9.45  26.23  80.19  9.45  26.09  67.15  9.42  26.02  
(2.78)  (0.17)  (0.83)  (2.72)  (0.16)  (0.83)  (3.38)  (0.16)  (0.83)  
27.27  2.98  0.83  26.45  2.99  0.83  22.18  2.98  0.83  
(0.94)  (0.05)  (0.03)  (0.92)  (0.05)  (0.03)  (1.14)  (0.05)  (0.03)  
16.31  1.75  0.48  15.87  1.75  0.48  13.32  1.75  0.48  
(0.57)  (0.03)  (0.02)  (0.56)  (0.03)  (0.02)  (0.69)  (0.03)  (0.02)  
10.22  1.08  0.28  9.98  1.09  0.29  8.39  1.09  0.29  
(0.36)  (0.02)  (0.01)  (0.35)  (0.02)  (0.01)  (0.43)  (0.02)  (0.01)  
4.85  0.52  0.12  4.80  0.52  0.12  4.05  0.53  0.12  
(0.17)  (0.01)  (0.00)  (0.17)  (0.01)  (0.00)  (0.20)  (0.01)  (0.00)  
2.88  0.31  0.07  2.89  0.32  0.07  2.46  0.32  0.07  
(0.10)  (0.00)  (0.00)  (0.10)  (0.00)  (0.00)  (0.12)  (0.00)  (0.00)  
44.10  4.91  13.68  42.76  4.91  13.61  36.09  4.90  13.59  
(1.49)  (0.09)  (0.44)  (1.40)  (0.09)  (0.44)  (1.67)  (0.09)  (0.44)  
14.61  1.55  0.42  14.23  1.56  0.42  12.03  1.56  0.42  
(0.51)  (0.03)  (0.01)  (0.48)  (0.03)  (0.01)  (0.57)  (0.03)  (0.01)  
8.83  0.93  0.24  8.63  0.94  0.24  7.31  0.94  0.24  
(0.31)  (0.01)  (0.01)  (0.29)  (0.01)  (0.01)  (0.35)  (0.01)  (0.01)  
5.57  0.59  0.14  5.48  0.59  0.14  4.65  0.59  0.14  
(0.20)  (0.01)  (0.00)  (0.18)  (0.01)  (0.00)  (0.22)  (0.01)  (0.00)  
2.61  0.28  0.06  2.62  0.29  0.06  2.23  0.29  0.06  
(0.09)  (0.00)  (0.00)  (0.08)  (0.00)  (0.00)  (0.10)  (0.00)  (0.00)  
1.52  0.16  0.03  1.56  0.17  0.04  1.34  0.17  0.04  
(0.05)  (0.00)  (0.00)  (0.05)  (0.00)  (0.00)  (0.06)  (0.00)  (0.00)  
23.31  2.52  6.98  22.74  2.52  6.95  19.29  2.52  6.94  
(0.80)  (0.04)  (0.23)  (0.79)  (0.04)  (0.23)  (0.79)  (0.04)  (0.23)  
7.87  0.83  0.21  7.72  0.83  0.21  6.57  0.83  0.21  
(0.28)  (0.01)  (0.01)  (0.27)  (0.01)  (0.01)  (0.27)  (0.01)  (0.01)  
4.79  0.50  0.12  4.72  0.51  0.12  4.02  0.51  0.12  
(0.16)  (0.01)  (0.00)  (0.16)  (0.01)  (0.00)  (0.16)  (0.01)  (0.00)  
3.00  0.32  0.07  2.98  0.32  0.07  2.55  0.32  0.07  
(0.10)  (0.00)  (0.00)  (0.10)  (0.00)  (0.00)  (0.10)  (0.00)  (0.00)  
1.37  0.15  0.03  1.40  0.15  0.03  1.21  0.15  0.03  
(0.05)  (0.00)  (0.00)  (0.05)  (0.00)  (0.00)  (0.05)  (0.00)  (0.00)  
0.79  0.09  0.02  0.83  0.09  0.02  0.72  0.09  0.02  
(0.03)  (0.00)  (0.00)  (0.03)  (0.00)  (0.00)  (0.03)  (0.00)  (0.00) 
and change . For each experiments, we set and replicate 50 times. In addition, the preselected penalty coefficient is set to , We measure the estimation quality by the following matrix norms: the matrix norm , the Frobenius norm , and the spectral norm . Tabel 1 and Tabel 2 report the averages and standard errors of these losses.
As shown in Tabel 1 and Tabel 2, the high sample size and high privacy budget setting will have smaller matrix norm losses. First, we study how the loss of our differentially private algorithms is affected by . As increase, these losses are reduced in both structured or unstructured, sparse or nonsparse models. This is in line with our additivenoise algorithm, where noise level is inversely proportional to privacy parameter, that is, larger means less noise and more utility. Next, we investigate the performance of our differentially private algorithms when the sample size varies. As the sample size increases while being fixed, all three losses show increasing estimation performance.
Secondly, focus on the structural learning of the Gaussian graphical model, we test the ability of our differentially private Algorithm 2 to recover the support of the precision matrix by ROC curves. ROC curves reflect the overall selection performance of each method as the tuning parameter varies, in which the true positive rate (TPR) is plotted against the false positive rate (FPR). For Model 3 and Model 4, we generate a sample of size and preprocess the data matrix. We fixed and let vary in . For each setting, we replicate 50 times. Smoothed average ROC curves are shown in Figure 1. From Figure 1, we see that the model selection ability of our differentially private Algorithm 2 is almost comparable to the nonprivate algorithm with proper parameters setting.
5.2 Application to real data
5.2.1 Classification of Ionosphere Data
The first example deals with the Ionosphere data from UCI repository [25]. This radar data was collected by a system in Goose Bay, Labrador. This system consists of a phased array of 16 highfrequency antennas. The targets were free electrons in the ionosphere. “Good” radar returns are those showing evidence of some type of structure in the ionosphere. “Bad” returns are those that do not, their signals pass through the ionosphere. The data contains 351 observations with 34 variables. The response is labelled as 1 for “Good” and for “Bad”. As a classification problem, we apply linear discriminant analysis (LDA) with an differentially private precision matrix estimate. The purpose here is to illustrate how the ridge estimation of the precision matrix under different privacy parameters can affect the classification performance of LDA. We randomly divide the data into a training set, a validation set and a test set. The training set is used to estimate the precision matrix. The validation set is used to choose the tuning parameter for the method. The misclassification error is computed based on the test set. The sizes of the training set and the validation set are chosen to be n = 40. We set and repeat this procedure 50 times. The misclassification errors are present Figure 2. Figure 2 shows that there is a large gap between the result of the differentially private algorithm and the result of the nonprivate algorithm when is small, but the gap becomes smaller as increases.
5.2.2 Cell signalling data
In this subsection, we apply our differentially private Algorithm 2 to the cell signalling data [26] to evaluate its performance. The dataset containing 7466 cells, with flow cytometry measurements of 11 phosphorylated proteins and phospholipids, i.e., and . They also provided a causal proteinsignaling network, shown in Figure 3a. Friedman et al. [5] used to apply graphical lasso to this data.
We compare the performance of our differentially private Algorithm 2 and nonprivate algorithm in reconstructing network edges by the ROC curve. To remove the randomness of the additive noise, we replicate 50 times. We fixed preselected penalty coefficient and privacy parameter . The resulting ROC curve is shown in Figure 3b, where the network in Figure 3a was used as a benchmark (here we regard it as an undirected graph). The ROC curve shows that our differential privacy Algorithm 2 has high utility. We randomly show reconstructed networks with different tuning parameter in Figure 4.
6 Conclusion
In this paper, we have focused on developing differentially private algorithms for solving the ridge estimation of the precision matrix and the graphical lasso problem. We first present a differentially private ridge estimation for the precision matrix. Then based on this algorithm and ADMM algorithm, a differentially private algorithm for the graphical lasso problem has been proposed. We compare our differentially private algorithms with the nonprivate algorithms through different privacy budget and sample size under simulation and real data, which show that our developed differentially private algorithms provide fine utility.
References

[1]
Martin, N., Maes, H.: Multivariate analysis, Academic press London, 1979
 [2] Lauritzen, S. L.: Graphical models, Clarendon Press, 1996

[3]
Banerjee, O., Ghaoui, L., d’Aaspremont, A.: Model selection through sparse maximum likelihood estimation for multivariate gaussian or binary data.
Journal of Machine Learning Research
, 9, 485–516 (2008)  [4] Yuan, M., Lin, Y.: Model selection and estimation in the gaussian graphical model. Biometrika, 94(1), 19–35 (2007)
 [5] Friedman, J., Hastie, T., Tibshirani, R.: Sparse inverse covariance estimation with the graphical lasso. Biostatistics, 9(3), 432–441 (2008)
 [6] Cai, T., Liu, W. D., Luo, X.: A constrained minimization approach to sparse precision matrix estimation. Journal of the American Statistical Association, 106(494), 594–607 (2011)
 [7] Yuan, T., Wang, J. H.: A coordinate descent algorithm for sparse positive definite matrix estimation. Statistical Analysis and Data Mining, 6(5), 431–442 (2013)
 [8] Liu, W. D., Luo, X.: Fast and adaptive sparse precision matrix estimation in high dimensions. Journal of Multivariate Analysis, 135, 153–162 (2015)
 [9] Ledoit, O., Wolf, M.: A wellconditioned estimator for largedimensional covariance matrices. Journal of Multivariate Analysis, 88(2), 365–411 (2004)
 [10] Warton, D. I.: Penalized normal likelihood and ridge regularization of correlation and covariance matrices. Journal of the American Statistical Association, 103(481), 340–349 (2008)
 [11] Deng, X. W., Tsui, K.: Penalized covariance matrix estimation using a matrixlogarithm transformation. Journal of Computational Graphical Statistics, 22(2), 494–512 (2013)

[12]
van Wieringen, W. N., Peeters, C. F. W.: Ridge estimation of inverse covariance matrices from highdimensional data.
Computational Statistics Data Analysis, 103, 284–303 (2016)  [13] Kuismin, M. O., Kemppainen, J. T., Sillanpää, M. J.: Precision matrix estimation with ROPE. Journal of Computational Graphical Statistics, 26(3), 682694 (2017)
 [14] Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. Theory of Cryptography Conference, Springer, Berlin, Heidelberg, 2006
 [15] Wang, D., Huai, M. D., Xu, J. H.: Differentially private sparse inverse covariance estimation, 2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP), IEEE, 2018
 [16] Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine learning, 3(1), 1–122 (2011)
 [17] Dwork, C., Roth, A.: The algorithmic foundations of differential privacy. Foundations and Trends in Theoretical Computer Science, 9(34), 211–407 (2014)
 [18] Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Computers Mathematics with Applications, 2, 17–40 (1976)

[19]
Dwork, C., Talwar, K., Thakurta, A., Zhang, L.: Analyze gauss: optimal bounds for privacypreserving principal component analysis. Proceedings of the fortysixth annual ACM symposium on Theory of computing, ACM, 2014
 [20] Rolfs, B., Rajaratnam, B., Guillot, D., Wong, I., Maleki, A.: Iterative thresholding algorithm for sparse inverse covariance estimation, Advances in Neural Information Processing Systems, 2012
 [21] Combettes, P.L., Wajs, V.R.: Signal recovery by proximal forwardbackward splitting. Multiscale Modeling Simulation, 4(4), 1168–1200 (2005)
 [22] Bickel, P. J., Levina, E.: Regularized estimation of large covariance matrices. The Annals of Statistics, 36(1), 199–227 (2008)
 [23] Rothman, A. J., Bickel, P. J., Levina, E., Zhu, J.: Sparse permutation invariant covariance estimation. Electronic Journal of Statistics, 2, 494–515 (2008)
 [24] Bien, J., Tibshirani, R.: Sparse estimation of a covariance matrix. Biometrika, 98(4), 807–820 (2011)
 [25] Dua, D., Gra, C.: UCI machine learning repository, 2017
 [26] Sachs, K., Perez, O., Pe’er, D., Lauenburger, D., and Nolan, G.: Causal proteinsignaling networks derived from multiparameter singlecell data. Science, 308(5721), 523–529 (2005)