You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Is it a deliberate decision to not compare this algorithm to popular implementations such as xgboost and lightgbm? If this is fundamental research I can imagine it is (not) yet at the same level. Giving some numbers for comparison will give a clearer view of the purpose of the paper to the reader :)
The text was updated successfully, but these errors were encountered:
Hi Simon,
right now we present this as a research, not a production-ready tool.
Comparison with other libraries would be nice, but to understand the effect of proposed boosting scheme,
it should be done on the same basis: in comparison with xgboost/lightgbm we should use the same trees. Currently I see no way to use trees separately, so one needs to modify libraries' c++ code. We have this in future plans.
Is it a deliberate decision to not compare this algorithm to popular implementations such as xgboost and lightgbm? If this is fundamental research I can imagine it is (not) yet at the same level. Giving some numbers for comparison will give a clearer view of the purpose of the paper to the reader :)
The text was updated successfully, but these errors were encountered: