Hendrik/xgboost
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
5,620 Commits 32 Branches 59 Tags
bb56bb9a13d184f6e6720fd529e0960fee002422
Commit Graph
8 Commits
Author SHA1 Message Date
Jiaming Yuan 9ab73f737e Extract Sketch Entry from hist maker. (#7503) 
* Extract Sketch Entry from hist maker.

* Add a new sketch container for sorted inputs.
* Optimize bin search.
 2021-12-18 05:36:56 +08:00
Jiaming Yuan bf7bb575b4 Test CPU histogram with cat data. (#7465) 2021-11-27 00:43:28 +08:00
Jiaming Yuan 176110a22d Support external memory in CPU histogram building. (#7372) 2021-11-23 01:13:33 +08:00
Jiaming Yuan d7d1b6e3a6 CPU evaluation for cat data. (#7393) 
* Implementation for one hot based.
* Implementation for partition based. (LightGBM)
 2021-11-06 14:41:35 +08:00
Jiaming Yuan 8d7c6366d7 Accept histogram cut instead gradient index in evaluation. (#7336) 2021-10-20 18:04:46 +08:00
Jiaming Yuan 8e619010d0 Extract CPUExpandEntry and HistParam. (#7321) 
* Remove kRootNid.
* Check for empty hessian.
 2021-10-17 14:22:25 +08:00
Jiaming Yuan 149f209af6 Extract histogram builder from CPU Hist. (#7152) 
* Extract the CPU histogram builder.
* Fix tests.
* Reduce number of histograms being built.
 2021-08-09 21:15:21 +08:00
Jiaming Yuan 615ab2b03e Extract evaluate splits from CPU hist. (#7079) 
Other than modularizing the split evaluation function, this PR also removes some more functions including `InitNewNodes` and `BuildNodeStats` among some other unused variables.  Also, scattered code like setting leaf weights is grouped into the split evaluator and `NodeEntry` is simplified and made private.  Another subtle difference with the original implementation is that the modified code doesn't call `tree[nidx].Parent()` to traversal upward.
 2021-07-07 15:16:25 +08:00