<?xml version="1.0" encoding="UTF-8"?>
<collection>
<dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><dc:identifier>doi:10.1109/TCYB.2018.2805695</dc:identifier><dc:language>eng</dc:language><dc:creator>Martinez Cantin, Ruben</dc:creator><dc:title>Funneled Bayesian Optimization for Design, Tuning and Control of Autonomous Systems</dc:title><dc:identifier>ART-2019-106896</dc:identifier><dc:description>In this paper, we tackle several problems that appear in robotics and autonomous systems: algorithm tuning, automatic control, and intelligent design. All those problems share in common that they can be mapped to global optimization problems where evaluations are expensive. Bayesian optimization (BO) has become a fundamental global optimization algorithm in many problems where sample efficiency is of paramount importance. BO uses a probabilistic surrogate model to learn the response function and reduce the number of samples required. Gaussian processes (GPs) have become a standard surrogate model for their flexibility to represent a distribution over functions. In a black-box settings, the common assumption is that the underlying function can be modeled with a stationary GP. In this paper, we present a novel kernel function specially designed for BO, that allows nonstationary behavior of the surrogate model in an adaptive local region. This kernel is able to reconstruct nonstationarity even with the irregular sampling distribution that arises from BO. Furthermore, in our experiments, we found that this new kernel results in an improved local search (exploitation), without penalizing the global search (exploration) in many applications. We provide extensive results in well-known optimization benchmarks, machine learning hyperparameter tuning, reinforcement learning, and control problems, and UAV wing optimization. The results show that the new method is able to outperform the state of the art in BO both in stationary and nonstationary problems.</dc:description><dc:date>2019</dc:date><dc:source>http://zaguan.unizar.es/record/131433</dc:source><dc:doi>10.1109/TCYB.2018.2805695</dc:doi><dc:identifier>http://zaguan.unizar.es/record/131433</dc:identifier><dc:identifier>oai:zaguan.unizar.es:131433</dc:identifier><dc:relation>info:eu-repo/grantAgreement/ES/MINECO/DPI2015-65962-R</dc:relation><dc:identifier.citation>IEEE transactions on cybernetics 49, 4 (2019), 1489-1500</dc:identifier.citation><dc:rights>All rights reserved</dc:rights><dc:rights>http://www.europeana.eu/rights/rr-f/</dc:rights><dc:rights>info:eu-repo/semantics/closedAccess</dc:rights></dc:dc>

</collection>