Imperial College London
Portrait Picture

DrAntoineCully

Faculty of Engineering, Department of Computing

Reader in Machine Learning and Robotics
 
 
 
//

Contact

 

+44 (0)20 7594 8204a.cully Website

 
 
//

Location

 

354ACE ExtensionSouth Kensington Campus

//

Summary

 

Publications

Citation

BibTex format

@misc{Cully:2018,
author = {Cully, A and Chatzilygeroudis, K and Allocati, F and Mouret, J-B and Rama, R and Papaspyros, V},
title = {Limbo: A Flexible High-performance Library for Gaussian Processes modeling and Data-Efficient Optimization},
type = {Software},
year = {2018}
}
Download

RIS format (EndNote, RefMan)

TY  - GEN
AB  - Limbo (LIbrary for Model-Based Optimization) is an open-source C++11 library for Gaussian Processes and data-efficient optimization (e.g., Bayesian optimization) that is designed to be both highly flexible and very fast. It can be used as a state-of-the-art optimization library or to experiment with novel algorithms with “plugin” components. Limbo is currently mostly used for data-efficient policy search in robot learning and online adaptation because computation time matters when using the low-power embedded computers of robots. For example, Limbo was the key library to develop a new algorithm that allows a legged robot to learn a new gait after a mechanical damage in about 10-15 trials (2 minutes), and a 4-DOF manipulator to learn neural networks policies for goal reaching in about 5 trials.The implementation of Limbo follows a policy-based design that leverages C++ templates: this allows it to be highly flexible without the cost induced by classic object-oriented designs (cost of virtual functions). The regression benchmarks show that the query time of Limbo’s Gaussian processes is several orders of magnitude better than the one of GPy (a state-of-the-art Python library for Gaussian processes) for a similar accuracy (the learning time highly depends on the optimization algorithm chosen to optimize the hyper-parameters). The black-box optimization benchmarks demonstrate that Limbo is about 2 times faster than BayesOpt (a C++ library for data-efficient optimization) for a similar accuracy and data-efficiency. In practice, changing one of the components of the algorithms in Limbo (e.g., changing the acquisition function) usually requires changing only a template definition in the source code. This design allows users to rapidly experiment and test new ideas while keeping the software as fast as specialized code.Limbo takes advantage of multi-core architectures to parallelize the internal optimization processes (optimization of the acquisition funct
AU  - Cully,A
AU  - Chatzilygeroudis,K
AU  - Allocati,F
AU  - Mouret,J-B
AU  - Rama,R
AU  - Papaspyros,V
PY  - 2018///
TI  - Limbo: A Flexible High-performance Library for Gaussian Processes modeling and Data-Efficient Optimization
ER  -
Download