LightGBM: A Highly Efficient Gradient Boosting Decision Tree

1 code implementation • NeurIPS 2017 • Guolin Ke, Qi Meng, Thomas Finley, Taifeng Wang, Wei Chen, Weidong Ma, Qiwei Ye, Tie-Yan Liu

We prove that, since the data instances with larger gradients play a more important role in the computation of information gain, GOSS can obtain quite accurate estimation of the information gain with a much smaller data size.

Randomized Mechanisms for Selling Reserved Instances in Cloud

no code implementations • 22 Nov 2016 • Jia Zhang, Weidong Ma, Tao Qin, Xiaoming Sun, Tie-Yan Liu

We then extend our mechanism to the general case and achieve a competitive ratio $\frac{1}{42\log k\log T}$ for both social welfare and revenue, where $T$ is the ratio of the maximum request length to the minimum request length and $k$ is the ratio of the maximum request value density to the minimum request value density.

Cloud Computing