Fast empirical Bayesian LASSO for multiple quantitative trait locus mapping
Authors
Open AccessArticle
 First Online:
 Received:
 Accepted:
DOI: 10.1186/1471210512211
Abstract
Background
The Bayesian shrinkage technique has been applied to multiple quantitative trait loci (QTLs) mapping to estimate the genetic effects of QTLs on quantitative traits from a very large set of possible effects including the main and epistatic effects of QTLs. Although the recently developed empirical Bayes (EB) method significantly reduced computation comparing with the fully Bayesian approach, its speed and accuracy are limited by the fact that numerical optimization is required to estimate the variance components in the QTL model.
Results
We developed a fast empirical Bayesian LASSO (EBLASSO) method for multiple QTL mapping. The fact that the EBLASSO can estimate the variance components in a closed form along with other algorithmic techniques render the EBLASSO method more efficient and accurate. Comparing with the EB method, our simulation study demonstrated that the EBLASSO method could substantially improve the computational speed and detect more QTL effects without increasing the false positive rate. Particularly, the EBLASSO algorithm running on a personal computer could easily handle a linear QTL model with more than 100,000 variables in our simulation study. Real data analysis also demonstrated that the EBLASSO method detected more reasonable effects than the EB method. Comparing with the LASSO, our simulation showed that the current version of the EBLASSO implemented in Matlab had similar speed as the LASSO implemented in Fortran, and that the EBLASSO detected the same number of true effects as the LASSO but a much smaller number of false positive effects.
Conclusions
The EBLASSO method can handle a large number of effects possibly including both the main and epistatic QTL effects, environmental effects and the effects of geneenvironment interactions. It will be a very useful tool for multiple QTL mapping.
Background
Quantitative traits are usually controlled by multiple quantitative trait loci (QTLs) and environmental factors. Interactions among QTLs or between genes and environmental factors make a substantial contribution to variation in complex traits [1]. The goal of QTL mapping is to infer genomic loci that are associated with the trait and to estimate the genetic effects of these loci including their main effects and genegene (epistasis) and geneenvironment (G × E) interactions. Due to the physical linkage of and/or epistatic interactions among multiple QTLs, it is highly desirable to analyze a large number of loci simultaneously. Since hundreds or thousands of genomic loci or markers are usually genotyped and involved in QTL mapping studies, including all these markers and their possible interactions in a model leads to a huge number of model variables, typically much larger than the sample size. Two general techniques often employed to handle such oversaturated models are variable selection and shrinkage.
Variable selection attempts to identify a subset of all possible genetic effects that best explain the phenotypic variation, typically using a stepwise search procedure in conjunction with a selection criterion such as the Bayesian information criterion (BIC) [2]. On the other hand, a shrinkage method includes all variables in the model but uses a penalty function of the variables or appropriate prior distributions on the variables to shrink most noneffect variables toward zero. Early shrinkage methods include ridge regression [3] and the least absolute shrinkage and selection operator (LASSO) [4]. More recently, Bayesian shrinkage method [5] has received considerable attention and been applied to multiple QTL mapping [6–10]. All these works employ Markov chain Monte Carlo (MCMC) simulation to fit the Bayesian model and provide comprehensive information about the model drawing from the posterior distribution of the model variables. Despite the advances in the development of the MCMC simulation algorithms [11], MCMC simulations are computationally intensive and time consuming.
In order to reduce the computational burden of the fully Bayesian approach relying on MCMC simulation, one of the authors of this paper developed an empirical Bayes (EB) method [12] that uses a properly chosen prior distribution for the model variables to shrink variables toward zero. It was demonstrated that the EB method can handle a large number of model variables simultaneously. More recently, the EB method has been extended to handle classification predictor variables [13]. Although the EB method [12] requires much less computation comparing to the fully Bayesian approach, its efficiency is limited by the fact that a numerical optimization algorithm such as the simplex algorithm [14] is needed to estimate the variance components. On the other hand, a very efficient EB method, named relevance vector machine (RVM), for learning a linear model was developed in the machine learning community [15, 16]. The RVM can estimate the variance components in a closed form, which along with other algorithmic techniques make it a very fast algorithm. The RVM assumes a uniform prior distribution for the variance components. Although this choice of the prior distribution gets rid of any hyperparameters to be prespecified, it lacks the flexibility of adjusting the degree of shrinkage needed for analyzing a specific data set. Particularly, its uniform prior distribution may not provide enough shrinkage in multiple QTL mapping that includes a very large number of possible effects, often resulting in a large number of false effects [13].
In this paper, capitalizing on the idea of RVM, we developed a fast empirical Bayesian LASSO (EBLASSO) algorithm based on the Bayesian LASSO model [10, 17] with an exponential prior distribution for the variance components in contrast to the inverse chisquare distribution for the variance components used by the EB method [12]. Simulation studies demonstrate that our EBLASSO method can provide a speed up to orders of magnitude faster than the EB method and can detect more true QTL effects without increasing the false positive rate. Real data analysis also show that the EBLASSO method is able to detect some effects when the EB method fails.
Methods
Linear model of multiple QTLs
where μ is the population mean, vectors β_{ E } and β_{ G } represent the environmental effects and the main effects of all markers, respectively, vectors β_{ GG } and β_{ GE } capture the epistatic effects and the G × E interactions, respectively, X E, X G, X_{ GG } and X_{ GE } are the corresponding design matrices of different effects, and e is the residual error that follows a normal distribution with zeromean and covariance . Throughout the paper we use I to denote an identity matrix whose size can be clearly identified from the context.
The design matrix X_{ G } depends on a specific genetic model. We adopt the widely used Cockerham genetic model as also used by [18] in their generalized linear model for multiple QTL mapping. For a backcross design, the Cockerham model defines the values of the main effect of a marker as 0.5 and 0.5 for two genotypes at the marker. For an intercross (F_{2}) design, there are two possible main effects named additive and dominance effects. The Cockerham model defines the values of the additive effect as 1, 0 and 1 for the three genotypes and the values of the dominance effect as 0.5 and 0.5 for homozygotes and heterozygotes, respectively. The columns of the design matrix X_{ GG } are obtained as the elementwise product of any two different columns of X _{ G }, and similarly the columns of X_{ GE } are constructed as the elementwise product of any pair of columns from X_{ E } and X _{ G }.
Suppose that there are p environmental covariates and q markers whose main effects are additive, then the size of matrix X is n × k where k = p + q(q + 1)/2 + pq. Typically, we have k ≫ n. If dominance effects of the markers are considered, k is even larger. Our goal is to estimate all possible environmental and genetical effects on y manifested in the regression coefficients β, which is a challenging problem because k ≫ n. However, we would expect that most elements of β are zeros and thus we have a sparse linear model. Taking into account this sparsity, we will adopt the Bayesian LASSO model [10] where appropriate prior distributions are assigned to the elements of β as described in the next section.
Prior and posterior distributions
The unknown parameters in model (2) are, μ and β. While our main concern is β, parameters μ and need to be estimated so that we can infer β. To this end, we assign a noninformative uniform prior μ to and , i.e., p(μ) ∝ 1 and p( ) ∝ 1. Following the Bayesian LASSO model [10], we assume a threelevel hierarchical model for β. Let us denote the elements of β as β_{ i } , i = 1, 2, ⋯, k. At the first level, β_{ i } , i = 1, 2, ⋯, k follow independent normal distributions with mean zero and unknown variance . At the second level, , follow independent exponential distribution with a common parameter . For a given λ, the distribution of β_{ i } is found to be the Laplace distribution: , which is known to encourage the shrinkage of β_{ i } toward zero [4]. However, the degree of shrinkage strongly depends on the value of λ. To alleviate the problem of choosing an inappropriate value for λ, we add another level to the hierarchical model at which we assign a conjugate Gamma prior Gamma(a, b) with a shape parameter a > 0 and an inverse scale parameter b > 0 to the parameter λ. As discussed in [10], we can prespecify appropriate values for a and b so that the Gamma prior for λ is essentially noninformative.
Let us define vector . The joint posterior distribution of all the parameters (μ, , β, σ^{2}, λ) can be easily found [10]. In principle, MCMC simulation can be employed to draw samples from the posterior distribution for each parameter. However, since the number of parameters 2k + 3 in our model can be very large, the fully Bayesian approach based on MCMC sampling requires a prohibitive computational cost. To avoid this problem, Xu developed an empirical Bayes method for inferring β[12]. Our goal here is to develop a much faster and more accurate empirical Bayes method that can easily handle tens of thousands of variables.
Maximum a posteriori estimation of variance components
where is the covariance matrix of y with a given α.
Note that α* in (8) and (9) depends on other unknown parameters through s_{ i } and q_{ i } , and thus, α_{ i } will be estimated iteratively as detailed in the EBLASSO algorithm described in the next section. Comparing with the EB method [12], our method finds each α_{ i } (and equivalently ) in a closed form, whereas the EB method generally needs to employ a numerical optimization algorithm to find each . Therefore, our method not only saves much computation but also gives more accurate estimate of each α_{ i } . Moreover, exploiting the similar techniques used in the RVM [16], we can further increase computational efficiency as described in the ensuing section.
Fast Empirical Bayesian LASSO algorithm
where the number of columns of , k_{ r } , is typically much less than the number of rows, n. This property will be used to reduce computation.
After we get estimates of μ, and α, we finalize the model (10), where the prior distribution of is now . For those x _{ i } s not in the model, we can declare that they do not affect the quantitative trait because their regression coefficient is zero. For those x _{ i } s in the matrix , the posterior distribution of their regression coefficients is Gaussian with covariance ∑ in (13) and mean u in (17) [15]. We can then use the zscore or more conservative tstatistics to test if at certain significance level. In this paper, the posterior mean u_{ j } of the j th effect is reported as the empirical Bayes estimate of β_{ j } , denoted by , and the posterior standard deviation, , is used as the standard error of .
We now summarize our fast EBLASSO algorithm as follows.
Algorithm 1 (EBLASSO algorithm)
1. Initialize parameters: choose a > 1.5 and b > 0, calculate μ = 1^{ T }y/n, and set to be a small number, e.g., .
2. Initialize the model: Find , and calculate α_{ j } from (9), set all other α_{ i }s to be ∞ and .
3. Calculate ∑ from (13), S_{ i } and Q_{ i } , ∀i, from (14).
4. Update the model
while the local convergence criterion is not satisfied
Calculate q_{ i } and s_{ i } from (11), ∀i.
Calculate from (8), ∀i.
Find .
if
if x_{ j } is in the model, delete it and update ∑ , S_{ i } and Q_{ i } , ∀i.
else
if x_{ j } is in the model, set and update ∑ , S_{ i } and Q_{ i } , ∀i.
if x _{ j } is not in the model, add it, set and update ∑ , S _{ i }
and Q_{ i } , ∀i.
end if
end while
5. Update the residual variance using (16).
6. Calculate ∑ from (13) and C^{1}from (12).
7. Update the fixed effects μ using (15) and update .
8. Calculate S_{ i } and Q_{ i } from (14).
9. If the global convergence criterion is not satisfied, go to step 4.
10. Find the posterior mean of from (17) and the posterior variance ∑_{ ii } from (13).
11. Use tstatistics to test if .
The parameters a and b can be set to be a small number (e.g., a = b = 0.01) so that the Gamma prior distribution is essentially noninformative [10]. Alternatively, we can use the predicted error (PE) obtained from crossvalidation [4] to choose the values of a and b. As done in [16], the initial value of is chosen in step 1 to be a small number and the initial model is selected in step 2 to have a single effect that corresponds to the maximum L(α_{ i } ) with a = 1. The outer iteration loop consists of steps 49, while the inner iteration loop is step 4, where we use the greedy method described earlier to update the model. In step 4, we use the method given in the Appendix of [16] to efficiently update ∑, S_{ i } and Q_{ i } after a x_{ j } is added to or deleted from the model or after α_{ j } is updated. The local convergence criterion can be defined as the simultaneous satisfaction of the following three conditions: 1) no effect can be added to or deleted from the model, 2) the change of L(θ) between two consecutive inner iterations is smaller than a prespecified small value, and 3) the change of between two consecutive inner iterations is less than a prespecified value. The global convergence criterion can be defined as the simultaneous satisfaction of the following two conditions: the change of L(θ) between two consecutive outer iterations is smaller than a prespecified small value, and 2) the total change in μ, and between two consecutive outer iterations is less than a prespecified value. A Matlab program has been developed to implement the algorithm; and a more efficient C++ program is under development.
Results
Simulation study
True and estimated QTL effects for the simulated data with main and epistatic effects.
Markers^{ a } 
Position 
True^{ b } 
EBLASSO^{ c } 
EB^{ c } 

( i, j ) 
(cM, cM) 
β ( h ^{ 2 } )  
(11,11) 
(50,50) 
4.47(0.0975) 
4.5801(0.1612) 
4.8593(0.2075) 
(26,26) 
(125,125) 
3.16(0.0524) 
3.0768(0.1576) 
3.3221(0.2035) 
(42,42) 
(205,205) 
2.24(0.0250) 
2.3169(0.1796) 
2.2769(0.2262) 
(48,48) 
(235,235) 
1.58(0.0128) 
1.3171(0.1720) 
1.3634(0.2205) 
(72,72) 
(355,355) 
2.24(0.0247) 
 
1.6537(0.4277) 
(73,73) 
(360,360) 
3.16(0.0506) 
5.1247(0.1555) 
3.8771(0.4219) 
(123,123) 
(610,610) 
1.10(0.0062) 
 
1.5168(0.2432) 
(127,127) 
(630,630) 
1.10(0.0063) 
 
1.1834(0.2460) 
(161,161) 
(800,800) 
0.77(0.0030) 
 
 
(181,181) 
(900,900) 
1.73(0.0152) 
 
 
(182,182) 
(905,905) 
3.81(0.0725) 
5.6744(0.2400) 
5.5127(0.2894) 
(185,185) 
(920,920) 
2.25(0.0263) 
1.7123(0.2327) 
1.7070(0.2858) 
(221,221) 
(1100,1100) 
1.30(0.0088) 
1.4276(0.1506) 
1.0867(0.1956)^{ d } 
(243,243) 
(1210,1210) 
1.00(0.0051) 
0.8603(0.1486) 
 
(262,262) 
(1305,1305) 
2.24(0.0245) 
2.2539(0.1826) 
1.6078(0.2417) 
(268,268) 
(1335,1335) 
1.58(0.0120) 
2.4264(0.2040) 
2.1736(0.2509) 
(270,270) 
(1345,1345) 
1.00(0.0049) 
 
 
(274,274) 
(1365,1365) 
1.73(0.0147) 
1.4114(0.1800) 
1.4935(0.2254) 
(361,361) 
(1800,1800) 
0.71(0.0026) 
0.7856(0.1457) 
0.6520(0.1859)^{ d } 
(461,461) 
(2300,2300) 
0.89(0.0040) 
 
 
(5,6) 
(20,25) 
2.24(0.0230) 
1.7839(0.1654) 
1.5752(0.2886) 
(6,39) 
(25,190) 
2.25(0.0128) 
1.9691(0.2168) 
 
(42,220) 
(205,1095) 
4.47(0.0511) 
4.3836(0.2198) 
4.6414(0.3394) 
(75,431) 
(370,2150) 
0.77(0.0014) 
1.1360(0.2124)^{ d } 
 
(81,200) 
(400,995) 
2.24(0.0128) 
2.4190(0.2460) 
 
(82,193) 
(405,960) 
1.58(0.0063) 
1.6345(0.2442) 
 
(87,164) 
(430,815) 
3.16(0.0235) 
2.9263(0.2254) 
1.7059(0.3319)^{ d } 
(87,322) 
(430,1605) 
3.81(0.0342) 
4.1019(0.2274) 
3.7040(0.3632) 
(92,395) 
(455,1970) 
1.73(0.0081) 
1.5714(0.2065)^{ d } 
 
(104,328) 
(515,1635) 
1.00(0.0024) 
0.8081(0.1979)^{ d } 
 
(118,278) 
(585,1385) 
2.24(0.0120) 
2.0796(0.2221) 
2.2590(0.3460) 
(150,269) 
(745,1340) 
1.10(0.0028) 
1.0740(0.2142) 
 
(237,313) 
(1180,1560) 
0.71(0.0014) 
 
 
(246,470) 
(1225,2345) 
1.10(0.0032) 
1.2381(0.2114)^{ d } 
 
(323,464) 
(1610,2315) 
0.89(0.0020) 
 
 
(328,404) 
(1635,2015) 
1.73(0.0079) 
2.3036(0.2123) 
1.9428(0.3330) 
(342,420) 
(1705,2095) 
1.30(0.0041) 
1.3886(0.2121)^{ d } 
 
(344,407) 
(1715,2030) 
1.00(0.0025) 
 
 
(373,400) 
(1860,1995) 
1.58(0.0070) 
1.4732(0.2028) 
 
(431,439) 
(2150,2190) 
3.16(0.0278) 
2.6700(0.2121) 
2.2454(0.3366)^{ d } 
μ 
100 
100.70 
100.59  

10 
11.76 
0.25  
CPU time 
3.4 mins 
249 hrs 
where var(x_{ j } ) is the variance of X_{ j } . In the simulated data, the proportion of contribution from an individual QTL varied from 0.30% to 9.75%, whereas the proportion of contribution from a pair of QTLs ranged from 0.26% to 7.25%, as shown in Table 1. Some of the markers had only main or epistatic effect, while the others had both main and epistatic effects. The QTL model contained a total of possible effects, a number about 115 times of the sample size.
The data were analyzed in Matlab on a personal computer (PC) using the EBLASSO algorithm, the EB method, the RVM and the LASSO. The Matlab program SPARSEBAYES for the RVM was downloaded from http://www.miketipping.com. We translated the original SAS program for the EB method [12] into Matlab, and slightly modified the program to avoid possible memory overflow due to the large number of possible effects. We also got the program glmnet [19] that is a very efficient program implementing the LASSO and other related algorithms. The PC version of glmnet uses Matlab to initialize and call the core LASSO algorithm that is implemented efficiently with Fortran code.
Summary of results for the simulated data with main and epistatic effects
Algorithm 
Parameters^{◇} 
PE ± STE* 
Number of effects^{†‡} 

CPU time (mins) 

(0.001, 0.001) 
16.49 ± 0.8908 
25/0 
13.5 
3.4  
(0.01, 0.01) 
15.95 ± 0.7477 
28/0 
12.46 
3.4  
(0.05, 0.05) 
15.89 ± 0.7498 
30/0 
11.72 
3.4  
(0.1, 0.1) 
15.81 ± 0.8359 
30/0 
11.72 
3.4  
EBLASSO 
(0.5, 0.5) 
15.86 ± 0.7717 
31/0 
11.57 
3.4 
(1, 1) 
16.07 ± 0.7203 
29/0 
12.31 
3.4  
(0.5, 0.1) 
16.14 ± 0.8557 
28/0 
12.5 
3.4  
(0.01, 0.1) 
15.92 ± 1.0161 
32/1 
11.31 
3.4  
(1, 0.0001) 
 
14/1 
21.22 
2,760.0  
EB 
(1, 0.0005) 
 
13/1 
12.15 
4,140.0 
(1, 0.001) 
 
22/1 
0.25 
14,940.0  
(1, 0.01) 
 
8/0 
0.01 
2,760.0 
The EBLASSO took about 3.4 minutes of CPU time for each set of values of a and b listed in Table 2, whereas the EB took 249 hours of CPU time for τ = 1 and ω = 0.001 and about 46, 69, 46 hours for τ = 1 and ω = 0.0001, 0.0005, 0.01, respectively. This simulation study showed that the EBLASSO method not only can detect more effects, but also offers a huge advantage in terms of computational time. Note that all simulations were done in Matlab. It is expected that the EBLASSO algorithm will be even faster, after its implementation in C++ is completed.
where λ is a positive constant that can be determined with crossvalidation [4]. We tried to run the program glmnet [19] with the simulated data. However, glmnet could not handle the big design matrix X of 1, 000 × 115, 922 in our QTL model, and we did not get any results from glmnet.
Summary of results for the simulated data with only main effects
Algorithm 
Parameters^{◇} 
PE ± STE* 
Number of effects^{†‡} 

CPU time (sec) 

(0.001, 0.001) 
11.52 ± 0.5677 
14/0 
11.1 
1.2  
(0.01, 0.01) 
11.52 ± 0.578 
16/0 
10.53 
1.3  
(0.05, 0.05) 
11.36 ± 0.6088 
17/0 
10.32 
1.1  
(0.1, 0.1) 
11.23 ± 0.5571 
17/0 
10.32 
1.1  
(0.5, 0.5) 
11.32 ± 0.5937 
17/0 
10.34 
1.1  
EBLASSO 
(1, 1) 
11.4 ± 0.5929 
16/0 
10.64 
1.1 
(0.5, 0.1) 
11.57 ± 0.5593 
15/0 
10.83 
1.3  
(0.5, 0.1) 
10.87 ± 0.5599 
17/0 
10.31 
1.6  
(0.75, 0.1) 
10.78 ± 0.5646 
20/5 
9.52 
1.5  
(0.95, 0.1) 
11.09 ± 0.5045 
22/20 
8.71 
1.4  
(1, 0.0001) 
17.73 ± 2.0244 
9/0 
16.07 
1491.9  
(1, 0.0005) 
15.81 ± 2.5732 
16/0 
11.66 
1676.0  
EB 
(1, 0.001) 
12.21 ± 1.7635 
17/2 
10.65 
1657.9 
(1, 0.01) 
10.69 ± 0.9903 
19/4 
9.05 
1954.9  
(1, 0.1) 
11.63 ± 0.5743 
20/20 
7.29 
2222.7  
RVM 
 
 
20/42 
7.81 
268.7 
0.1347 
10.77 ± 0.4583 
16/27 
9.47 
0.7  
0.0850 
10.52 ± 0.4442 
20/49 
8.89 
0.7  
LASSO 
0.0675 
10.50 ± 0.5248 
20/48 
8.63 
0.7 
0.0536 
10.52 ± 0.4382 
19/35 
8.28 
0.7  
0.0338 
10.59 ± 0.4434 
17/2 
7.35 
0.7 
The optimal values for the parameters of the EB method were τ = 1 and ω = 0.01, since they gave the smallest PE in crossvalidation as listed in Table 3. With τ = 1 and ω = 0.01, the EB method detected 19 true effects and 4 false positive effects. The RVM detected all 20 true effects as the EBLASSO did, but it also output a large number of 42 false positive effects. This result is consistent the observation [13] that the uniform prior distribution used in the RVM usually yields many false positive effects. To choose the optimal value of λ for the LASSO, we ran tenfold cross validation starting from λ = 4.9725 (which gave only one nonzero effect) and then decreasing λ to 0.0025 with a step size of 0.0768 on the logarithmic scale (Δ ln(λ) = 0.0768). The smallest PE was achieved at λ = 0.0675. We then used this value to run glmnet on the whole data set, which yielded 97 nonzero effects. For each of these nonzero effects, we calculated their standard error using equation (7) in [4], and then calculated the pvalue of each nonzero effect. This gave 20 true effects and 48 false positive effects with a pvalue less than 0.05. Comparing the number of effects detected by the EBLASSO, EB, RVM and LASSO, the EBLASSO offered the best performance because it detected all true effects and a very small number of false positive effects.
It is seen from Table 3 that the EBLASSO and the LASSO took much less time than the EB method and the RVM on analyzing this data set. It is expected that the EBLASSO is much faster than the EB method because as we discussed earlier the EB needs a numerical optimization procedure. The RVM and EBLASSO generally should have similar speed because two algorithms use the similar technique to estimate effects. However, when applying to the same data set, the RVM often yields a model with much more nonzero effects than the EBLASSO as is the case here, because the RVM does not provide sufficient degree of shrinkage. Due to this reason, the RVM algorithm requires more time than the EBLASSO. The LASSO took slightly less CPU time than the EBLASSO in this example. However, we would emphasize that the LASSO was implemented with Fortran but our EBLASSO was implemented with Matlab. The speed of EBLASSO is expected to increase significantly once it is implemented in C/C++.
Real data analysis
This dataset was obtained from [20]. This dataset consists of n = 150 double haploids (DH) derived from the cross of two spring barley varieties Morex and Steptoe. The total number of markers was q = 495 distributed along seven pairs of chromosomes of the barley genome, covering 206 cM of the barley genome. The phenotype was the spot blotch resistance measured as the lesion size on the leaves of barley seedlings. Note that spot blotch is a fungus named Cochliobolus sativus. This dataset was used as an example for the application of the EBLASSO method. Genotype of the markers were encoded as +1 for genotype A (the Morex parent), 1 for genotype B (the Steptoe parent), and 0 for missing genotype. Ideally, the missing genotypes should be imputed from known genotypes of neighboring markers. For simplicity, we replaced the missing genotypes with 0 in order to use the phenotypes of the individuals with missing genotypes. The total missing genotypes only account for about 4.2% of all the genotypes. Including the population mean, the main and the pairwise epistatic effects, the total number of model effects was , about 818 times as large as the sample size.
Summary of the results of the EBLASSO algorithm for the real data
a= b 
PE ± STE* 
Number of effects^{†‡} 


0.001 
0.70 ± 0.21 
1/1/1 
0.6706 
0.01 
0.79 ± 0.31 
2/2/2 
0.5996 
0.05 
0.70 ± 0.21 
11/11/11 
0.2699 
0.07 
0.96 ± 0.30 
10/15/15 
0.2104 
0.1 
1.20 ± 0.18 
13/128/132 
2.59E06 
0.5 
1.21 ± 0.09 
9/112/122 
2.59E06 
1 
1.25 ± 0.17 
8/115/132 
2.59E06 
Eight effects estimated with the EBLASSO algorithm for the real data.
Markers 



(446,446) 
1.4173(0.0432) 
0.7639 
(187,187) 
0.2624(0.0421) 
0.0262 
(77,77) 
0.1881(0.0413) 
0.0132 
(238,238) 
0.1742(0.0427) 
0.0101 
(197,483) 
0.1748(0.0405) 
0.0117 
(37,130) 
0.1557(0.0422) 
0.0085 
(53,270) 
0.1649(0.0452) 
0.0081 
(149,175) 
0.1697(0.0464) 
0.0078 

5.7037  

0.2699  

0.8495 
Discussion
Xu [12] compared several methods for multiple QTL mapping including the EB [12], LASSO [4], penalized likelihood (PENAL) [21] and stochastic search variable selection (SSVS) [22, 23] methods. The SSVS method is much slower than the EB method; whereas LASSO and PENAL methods are faster than the EB method. Although we did not directly compare the speed of our EBLASSO with that of the PENAL method, based on all comparisons with the EB method in [12], we observed that the EBLASSO method is faster than PENAL methods. Direct comparison between the EBLASSO and LASSO showed that the LASSO is slightly faster than the current version of EBLASSO, however, this may not be the case when the EBLASSO is implemented in C/C++ instead of Matlab. Although EB, LASSO, PENAL and SSVS methods all produced satisfactory results in a simulation study [12], the EB method outperformed the other three methods in terms of the meansquared error. Moreover, when being applied to a real data set, the EB and LASSO detected some effects, whereas the PENAL and SSVS failed to generate any meaningful results [12]. In our simulation studies, we observed that the EBLASSO method detected more true effects than the EB method with almost the same false positive rate, and the same number of true effects as the LASSO but with a much smaller number of false positive effects. When analyzing a real data set, we found that the EBLASSO method detected a reasonable number of effects, but the EB method detected one or zero effect depending on values of the hyperparameters used. These observations in both simulation study and real data analysis demonstrated that the EBLASSO method outperforms the EB method and the LASSO.
The EBLASSO method was built upon the idea of the RVM in machine learning. The EBLASSO and EB methods, as well as the RVM, all are based on a Bayesian hierarchical linear regression model and all estimate the variances of the regression coefficients. The difference of the three methods in the regression model is the different prior distributions for the hyperparameters. The EB method and the RVM employ inverse chisquare and uniform distributions, respectively, for the variances of the regression coefficients, while the EBLASSO assigns exponential distributions to the variance components and uses a Gamma distribution for the parameter of the exponential distribution, which leads to the prior distribution in (3) for the variance components. The uniform prior distribution used by the RVM may not provide enough degree of shrinkage for certain data and thus generate a large number of false positive effects as shown in [13] and as demonstrated in our simulation study.
The prior distributions used by the EBLASSO and RVM methods enable one to estimate the variance components in a closed form, while the EB method generally needs a numerical optimization algorithm to estimate the variance components. This difference has at least two implications: 1) both the EBLASSO and the RVM methods requires much less computation than the EB method to estimate the variance components, and 2) the EBLASSO method and the RVM method can always find the unique optimal estimate of a variance component but the numerical optimization algorithm used by the EB method may not find the optimal value of the variance due to the nonlinearity and nonconvexity of the objective function. Another main factor that makes the EBLASSO method and RVM more efficient is an automatic variable selection procedure resulting from the process of estimating variance components, because the variables whose precision is infinity or equivalently whose variance is zero are excluded from the model. This results in an efficient formula in (12) for calculating the inverse of the covariance matrix of the data. This is especially beneficial when the number of samples is relatively large. On the other hand, the EB method in principle can be applied to a linear regression model with any prior distribution for the variances of regression coefficients. Since the prior distribution may play an important role in estimation of the QTL effects, the EB method has its value when one tries to explore different prior distributions.
To get the best performance, the EBLASSO method needs to properly choose values of hyperparameters a and b. In this paper, we selected the values of a and b that gave the smallest average PE resulting from tenfold cross validation. Ideally, we need to find PEs for a large set of values for a ≥ 1 and b > 0 and then identify the best values for a and b. In our simulation study, we found a twostep cross validation procedure could significantly reduce the number of values to be tested without missing the best values, thereby reducing computational time. In this twostep procedure, we first run crossvalidation for the following set of values: a = b = 0.001, 0.01, 0.05, 0.1, 0.5, 1. We identify the values (denoted as a* and b*) from this set of values that yields the smallest PE. We then fixed b to be b* and run crossvalidation for several other values of a greater or less than a*. The final best values of a and b are the ones that yield the smallest PE.
The EBLASSO algorithm may still be improved. In the analysis of simulated data with both main and epistatic effects, although the EBLASSO method detected 8 more true effects than the EB method without any false positive effects, it missed three effects that the EB method detected. It is unclear how this discrepancy occurred. One possible reason is the different prior distributions used in the two methods. Although it is difficult for the EBLASSO method to use the scaled inverse chisquare distribution that is used by the EB method, other prior distributions may worth investigation. Another possible reason may be the greedy method used to select the variable to include in or to exclude from the model. In the current algorithm, we choose the variable that gives the largest increase in the likelihood to add to or delete from the model. It may be better to simultaneously add or delete more than one variables. The EBLASSO method presented in this paper assumes continuous quantitative traits. It can also be extended to handle binary or polychotomous traits and the algorithm is under development. The algorithm is currently implemented in Matlab. We are developing programs in C++ to implement the algorithm, which is expected to be much faster and to be capable of running in R and SAS environments.
Conclusions
We have developed a fast empirical Bayesian LASSO method for multiple QTL mapping that can deal with a large number of effects possibly including main and epistatic QTL effects, environmental effects and the effects of environment and gene interactions. Our simulation studies demonstrated that the EBLASSO algorithm needed about 3.4 minutes of CPU time, running in Matlab on a PC with 2.4 GHz Intel Core2 CPU and 2 Gb memory running Windows XP, to analyze a QTL model with more than 10^{5} possible effects, whereas the EB method took more than 2,000 minutes to analyze the same model on the same computer. Our simulation studies also showed that the EBLASSO method could detect more true effects with almost the same false positive rate comparing to the EB method. Our real data analysis demonstrated that the EBLASSO method could output more reasonable effects than the EB method. Comparing with the LASSO, our simulation showed that the current version of the EBLASSO implemented in Matlab was slightly slower than the LASSO implemented with glmnet in Fortran, and that the EBLASSO detected the same number of true effects as the LASSO but a much smaller number of false positive effects. In conclusion, the EBLASSO method will be a useful tool in multiple QTL mapping.
Acknowledgements
This work was supported by the National Science Foundation (NSF) under NSF CAREER Award no. 0746882 to XC and by the Agriculture and Food Research Initiative (AFRI) of the USDA National Institute of Food and Agriculture under the Plant Genome, Genetics and Breeding Program 20073530018285 to SX.
Supplementary material
Copyright information
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.