Fetching the paper…
Reading the bibliography…
We consider the problem of online boosting for regression tasks, when only limited information is available to the learner.
An algorithm for quadratic programming
Marguerite Frank and Philip Wolfe · 1956
Earlier work this paper cites.
Beating the hold-out: Bounds for k-fold and progressive cross-validation
Avrim Blum, Adam Kalai, and John Langford · 1999
Earlier work this paper cites.
Boosting algorithms as gradient descent
Llew Mason, Jonathan Baxter, Peter L Bartlett, and Marcus R Frean · 2000
Earlier work this paper cites.
Greedy function approximation: a gradient boosting machine
Jerome H Friedman · 2001
Earlier work this paper cites.
Online convex programming and generalized infinitesimal gradient ascent
Martin Zinkevich · 2003
Earlier work this paper cites.
Online convex optimization in the bandit setting: gradient descent without a gradient
Abraham D Flaxman, Adam Tauman Kalai, and H Brendan McMahan · 2005
Earlier work this paper cites.
Efficient algorithms for online decision problems
Adam Kalai and Santosh Vempala · 2005
Earlier work this paper cites.
Prediction, learning, and games
Nicolo Cesa-Bianchi and Gábor Lugosi · 2006
Earlier work this paper cites.
On robustness of on-line boosting-a competitive study
Christian Leistner, Amir Saffari, Peter M Roth, and Horst Bischof · 2009
Earlier work this paper cites.
Optimal algorithms for online convex optimization with multi-point bandit feedback
Alekh Agarwal, Ofer Dekel, and Lin Xiao · 2010
Earlier work this paper cites.
An online boosting algorithm with theoretical justifications, 2012
Shang-Tse Chen, Hsuan-Tien Lin, and Chi-Jen Lu · 2012
Earlier work this paper cites.
Projection-free online learning
Elad Hazan and Satyen Kale · 2012
Earlier work this paper cites.
Boosting: Foundations and Algorithms
Robert E. Schapire and Yoav Freund · 2012
Cited alongside, same era.
Boosting with online binary learners for the multiclass bandit problem
Shang-Tse Chen, Hsuan-Tien Lin, and Chi-Jen Lu · 2014
Cited alongside, same era.
Online gradient boosting
Alina Beygelzimer, Elad Hazan, Satyen Kale, and Haipeng Luo · 2015
Cited alongside, same era.
Optimal and adaptive algorithms for online boosting
Alina Beygelzimer, Satyen Kale, and Haipeng Luo · 2015
Cited alongside, same era.
Optimal rates for zero-order convex optimization: The power of two function evaluations
John C Duchi, Michael I Jordan, Martin J Wainwright, and Andre Wibisono · 2015
Cited alongside, same era.
Functional frank-wolfe boosting for general loss functions
Chu Wang, Yingfei Wang, Robert Schapire, et al · 2015
Online improper learning with an approximation oracle
Elad Hazan, Wei Hu, Yuanzhi Li, and Zhiyuan Li · 2018
Later among the works it cites.
Online boosting algorithms for multi-label ranking
Young Hun Jung and Ambuj Tewari · 2018
Later among the works it cites.
Stochastic conditional gradient methods: From convex minimization to submodular maximization
Aryan Mokhtari, Hamed Hassani, and Amin Karbasi · 2018
Later among the works it cites.
Online multiclass boosting with bandit feedback
Daniel T Zhang, Young Hun Jung, and Ambuj Tewari · 2018
Later among the works it cites.
Boosting for dynamical systems
Naman Agarwal, Nataly Brukhim, Elad Hazan, and Zhou Lu · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Introduction to online convex optimization
Elad Hazan · 2016
Cited alongside, same era.
Importance weighting without importance weights: An efficient algorithm for combinatorial semi-bandits
Gergely Neu and Gábor Bartók · 2016
Cited alongside, same era.
Efficient online linear optimization with approximation algorithms
Dan Garber · 2017
Cited alongside, same era.
Online multiclass boosting
Young Hun Jung, Jack Goetz, and Ambuj Tewari · 2017
Cited alongside, same era.
An optimal algorithm for bandit and zero-order convex optimization with two-point feedback
Ohad Shamir · 2017
Cited alongside, same era.
Projection-free online optimization with stochastic gradient: From convexity to submodularity
Lin Chen, Christopher Harshaw, Hamed Hassani, and Amin Karbasi · 2018
Cited alongside, same era.
Projection-free bandit convex optimization
Lin Chen, Mingrui Zhang, and Amin Karbasi · 2019
Later among the works it cites.
Improved regret bounds for projection-free bandit convex optimization
Dan Garber and Ben Kretzu · 2019
Later among the works it cites.
Learning adversarial mdps with bandit feedback and unknown transition
Tiancheng Jin and Haipeng Luo · 2019
Later among the works it cites.
Online stochastic shortest path with bandit feedback and unknown transition function
Aviv Rosenberg and Yishay Mansour · 2019
Later among the works it cites.
Stochastic recursive gradient-based methods for projection-free online learning
Jiahao Xie, Zebang Shen, Chao Zhang, Hui Qian, and Boyu Wang · 2019
Later among the works it cites.
Online agnostic boosting via regret minimization
Nataly Brukhim, Xinyi Chen, Elad Hazan, and Shay Moran · 2020
Closest in time.