Comparing the performance of xgboost, Gradient Boosting and GBLUP models under different genomic prediction scenarios

AbstractThe aim of this study was to study the performance of xgboost algorithm in genomic evaluation of complex traits as an alternative for Gradient Boosting algorithm (GBM). To this end, genotypic matrices containing genotypic information for, respectively, ۵,۰۰۰ (S۱), ۱۰,۰۰۰ (S۲) and ۵۰,۰۰۰ (S۳) single nucleotide polymorphisms (SNP) for ۱۰۰۰ individuals was simulated. Beside xgboost and GBM, the GBLUP which is known as an efficient algorithm in terms of accuracy, computing time and memory requirement was also used to predict genomic breeding values. xgboost, GBM and GBLUP were run in R software using xgboost, gbm and synbreed packages. All the analyses were done using a machine equipped with a Core i۷-۶۸۰۰K CPU which had ۶ physical cores. In addition, ۳۲ gigabyte of memory was installed on the machine. The Person's correlation between predicted and true breeding values (rp,t) and the mean squared error (MSE) of prediction were computed to compare predictive performance of different methods. While GBLUP was the most efficient user of memory, GBM required a considerably high amount of memory to run. By increasing size of data from S۱ to S۳, GBM went out from the competition mainly due to its high demand for memory. Parallel computing with xgboost reduced running time by %۹۹ compared to GBM. The speedup ratios (the ratio of the GBM runtime to the time taken by the parallel computing by xgboost) were ۴۴۴ and ۵۵۴ for the S۱ and S۲ scenarios, respectively. In addition, parallelization efficiency (speed up ratio/number of cores) were, respectively, ۷۴ and ۹۲ for the S۱ and S۲ scenarios, indicating that by increasing the size of data, the efficiency of parallel computing increased. The xgboost was considerably faster than GBLUP in all the scenarios studied. Accuracy of genomic breeding values predicted by xgboost was similar to those predicted by GBM. While the accuracy of prediction in terms of rp,t was higher for GBLUP, the MSE of prediction was lower for xgboost, specially for larger datasets. Our results showed that xgboost could be an efficient alternative for GBM as it had the same accuracy of prediction, was extremely fast and needed significantly lower memory requirement to predict the genomic breeding values.

کلیدواژه ها:

genomic evaluation ، parallel computing ، computing time ، SNP