arXiv Analytics

Sign in

arXiv:1703.00377 [cs.LG]AbstractReferencesReviewsResources

Gradient Boosting on Stochastic Data Streams

Hanzhang Hu, Wen Sun, Arun Venkatraman, Martial Hebert, J. Andrew Bagnell

Published 2017-03-01Version 1

Boosting is a popular ensemble algorithm that generates more powerful learners by linearly combining base models from a simpler hypothesis class. In this work, we investigate the problem of adapting batch gradient boosting for minimizing convex loss functions to online setting where the loss at each iteration is i.i.d sampled from an unknown distribution. To generalize from batch to online, we first introduce the definition of online weak learning edge with which for strongly convex and smooth loss functions, we present an algorithm, Streaming Gradient Boosting (SGB) with exponential shrinkage guarantees in the number of weak learners. We further present an adaptation of SGB to optimize non-smooth loss functions, for which we derive a O(ln N/N) convergence rate. We also show that our analysis can extend to adversarial online learning setting under a stronger assumption that the online weak learning edge will hold in adversarial setting. We finally demonstrate experimental results showing that in practice our algorithms can achieve competitive results as classic gradient boosting while using less computation.

Related articles:
arXiv:1707.04199 [cs.LG] (Published 2017-07-13)
Be Careful What You Backpropagate: A Case For Linear Output Activations & Gradient Boosting
arXiv:1802.05640 [cs.LG] (Published 2018-02-15)
Gradient Boosting With Piece-Wise Linear Regression Trees
arXiv:1105.2054 [cs.LG] (Published 2011-05-10, updated 2012-02-14)
Generalized Boosting Algorithms for Convex Optimization