130 citations · 317 across the 27 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
stat.ML2015★ 14 cited
An Explicit Rate Bound for the Over-Relaxed ADMM
Guilherme França, José Bento
The framework of Integral Quadratic Constraints of Lessard et al. (2014) reduces the computation of upper bounds on the convergence rate of several optimization algorithms to semi-…
cs.LG2015★ 8 cited
The Boundary Forest Algorithm for Online Supervised and Unsupervised Learning
Charles Mathy, Nate Derbinsky, José Bento +2
We describe a new instance-based learning algorithm called the Boundary Forest (BF) algorithm, that can be used for supervised and unsupervised learning. The algorithm builds a for…
cs.RO2015
Proximal operators for multi-agent path planning
José Bento, Nate Derbinsky, Charles Mathy +1
We address the problem of planning collision-free paths for multiple agents using optimization methods known as proximal algorithms. Recently this approach was explored in Bento et…