Gradient Boosted Feature Selection - Alice Zheng

alicezheng.org

to existing nonlinear FS algorithms, its time and memory complexity scales as O(dn), where ddenotes the number of features dimensionality and nthe number of data points1, and is very fast in practice.

  Feature, Selection, Boosted, Derating, Gradient boosted feature selection