← Search

Andrew Bagnell

4 accepted papers

2017

Gradient Boosting on Stochastic Data Streams

AISTATS 2017poster

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 ea…

Cited by 22SourcePDFScholar
2015

Autonomy Infused Teleoperation with Application to BCI Manipulation

RSS 2015poster

Robot teleoperation systems face a common set of challenges including latency, low-dimensional user commands, and asymmetric control inputs. User control with Brain-Computer Interfaces (BCIs) exacerbates these problems through especially noisy and erratic low-dimensional motion commands due to the d…

Cited by 81SourcePDFScholar
2015

Theoretical Limits of Speed and Resolution for Kinodynamic Planning in a Poisson Forest

RSS 2015poster

The performance of a state lattice motion planning algorithm depends critically on the resolution of the lattice to ensure a balance between solution quality and computation time. There is currently no theoretical basis for selecting the resolution because of its dependence on the robot dynamics and…

Cited by 8SourcePDFScholar